English
Related papers

Related papers: When are Overcomplete Topic Models Identifiable? U…

200 papers

We investigate the fundamental conditions on the sampling pattern, i.e., locations of the sampled entries, for finite completability of a low-rank tensor given some components of its Tucker rank. In order to find the deterministic necessary…

Numerical Analysis · Computer Science 2019-05-13 Morteza Ashraphijuo , Vaneet Aggarwal , Xiaodong Wang

We provide explicit, finite-sample guarantees for learning causal representations from data with a sublinear number of environments. Causal representation learning seeks to provide a rigourous foundation for the general representation…

Machine Learning · Statistics 2026-03-30 Inbeom Lee , Tongtong Jin , Bryon Aragam

Compositional representations are thought to enable humans to generalize across combinatorially vast state spaces. Models with learnable object slots, which encode information about objects in separate latent codes, have shown promise for…

Machine Learning · Computer Science 2024-10-08 Tankred Saanum , Luca M. Schulze Buschoff , Peter Dayan , Eric Schulz

In-context learning has become a popular paradigm in natural language processing. However, its performance can be significantly influenced by the order of in-context demonstration examples. In this paper, we found that causal language…

Computation and Language · Computer Science 2024-06-07 Yanzheng Xiang , Hanqi Yan , Lin Gui , Yulan He

We propose a parsimonious topic model for text corpora. In related models such as Latent Dirichlet Allocation (LDA), all words are modeled topic-specifically, even though many words occur with similar frequencies across different topics.…

Machine Learning · Computer Science 2016-05-16 Hossein Soleimani , David J. Miller

This paper examines the characterization and learning of grammars defined with enriched representational models. Model-theoretic approaches to formal language theory traditionally assume that each position in a string belongs to exactly one…

Formal Languages and Automata Theory · Computer Science 2019-06-25 Jane Chandlee , Remi Eyraud , Jeffrey Heinz , Adam Jardine , Jonathan Rawski

For two causal structures with the same set of visible variables, one is said to observationally dominate the other if the set of distributions over the visible variables realizable by the first contains the set of distributions over the…

Machine Learning · Statistics 2025-02-24 Marina Maciel Ansanelli , Elie Wolfe , Robert W. Spekkens

Additive models can be used for interpretable machine learning for their clarity and simplicity. However, In the classical models for high-order data, the vectorization operation disrupts the data structure, which may lead to degenerated…

Machine Learning · Computer Science 2024-06-06 Yang Chen , Ce Zhu , Jiani Liu , Yipeng Liu

We are often interested in decomposing complex, structured data into simple components that explain the data. The linear version of this problem is well-studied as dictionary learning and factor analysis. In this work, we propose a…

Machine Learning · Computer Science 2024-07-29 Avrim Blum , Kavya Ravichandran

This work addresses the problem of learning sparse representations of tensor data using structured dictionary learning. It proposes learning a mixture of separable dictionaries to better capture the structure of tensor data by generalizing…

Machine Learning · Computer Science 2020-06-16 Mohsen Ghassemi , Zahra Shakeri , Anand D. Sarwate , Waheed U. Bajwa

This paper develops a class of potential outcomes models characterized by three main features: (i) Unobserved heterogeneity can be represented by a vector of potential outcomes and a type describing the manner in which an instrument…

Econometrics · Economics 2023-10-10 Manu Navjeevan , Rodrigo Pinto , Andres Santos

State-space models are dynamical systems defined by a latent and an observed process. In ecology, stochastic state-space models in discrete time are most often used to describe the imperfectly observed dynamics of population sizes or animal…

Methodology · Statistics 2025-08-13 Frederic Barraquand , Julien Gibaud

Topic models extract groups of words from documents, whose interpretation as a topic hopefully allows for a better understanding of the data. However, the resulting word groups are often not coherent, making them harder to interpret.…

Computation and Language · Computer Science 2021-06-18 Federico Bianchi , Silvia Terragni , Dirk Hovy

We use a tensor unfolding technique to prove a new identifiability result for discrete bipartite graphical models, which have a bipartite graph between an observed and a latent layer. This model family includes popular models such as…

Statistics Theory · Mathematics 2025-01-22 Yuqi Gu

This paper studies nonparametric local (over-)identification and the semiparametric efficiency in modern causal frameworks. We develop a unified approach that begins by translating structural models with latent variables into their induced…

Econometrics · Economics 2026-03-02 Xiaohong Chen , Haitian Xie

Hyperproperties are properties over sets of traces (or runs) of a system, as opposed to properties of just one trace. They were introduced in 2010 and have been much studied since, in particular via an extension of the temporal logic LTL…

Logic in Computer Science · Computer Science 2024-10-16 Nicolas Waldburger , Chana Weil-Kennedy , Pierre Ganty , César Sánchez

We propose topos causal models (TCMs), a novel class of causal models that exploit the key properties of a topos category: they are (co)complete, meaning all (co)limits exist, they admit a subobject classifier, and allow exponential…

Artificial Intelligence · Computer Science 2025-08-13 Sridhar Mahadevan

Topic models are a popular tool for clustering and analyzing textual data. They allow texts to be classified on the basis of their affiliation to the previously calculated topics. Despite their widespread use in research and application, an…

Artificial Intelligence · Computer Science 2024-03-07 Johannes Hirth , Tom Hanika

An ongoing challenge in the analysis of document collections is how to summarize content in terms of a set of inferred themes that can be interpreted substantively in terms of topics. The current practice of parametrizing the themes in…

Machine Learning · Computer Science 2014-07-29 Edoardo M Airoldi , Jonathan M Bischof

Tensor decomposition methods allow us to learn the parameters of latent variable models through decomposition of low-order moments of data. A significant limitation of these algorithms is that there exists no general method to regularize…

Machine Learning · Statistics 2019-05-28 Omer Gottesman , Weiwei Pan , Finale Doshi-Velez