English
Related papers

Related papers: A note on identifiability conditions in confirmato…

200 papers

Identifying latent variables and causal structures from observational data is essential to many real-world applications involving biological data, medical data, and unstructured data such as images and languages. However, this task can be…

Machine Learning · Computer Science 2023-11-01 Lingjing Kong , Biwei Huang , Feng Xie , Eric Xing , Yuejie Chi , Kun Zhang

The techniques suggested in Fr\"uhwirth-Schnatter et al. (2024) concern sparsity and factor selection and have enormous potential beyond standard factor analysis applications. We show how these techniques can be applied to Latent Space (LS)…

Methodology · Statistics 2024-11-15 Roberto Casarin , Antonio Peruzzi

Factor analysis models are widely utilized in social and behavioral sciences, such as psychology, education, and marketing, to measure unobservable latent traits. In this article, we introduce a nonlinear structured latent factor analysis…

Methodology · Statistics 2025-01-07 Yimang Zhang , Xiaorui Wang , Jian Qing Shi

Disentangled representations seek to recover latent factors of variation underlying observed data, yet their identifiability is still not fully understood. We introduce a unified framework in which disentanglement is achieved through…

Machine Learning · Computer Science 2026-05-12 Stefan Matthes , Zhiwei Han , Hao Shen

An old problem in multivariate statistics is that linear Gaussian models are often unidentifiable, i.e. some parameters cannot be uniquely estimated. In factor (component) analysis, an orthogonal rotation of the factors is unidentifiable,…

Machine Learning · Statistics 2023-05-04 Aapo Hyvärinen , Ilyes Khemakhem , Ricardo Monti

Latent class models with covariates are widely used for psychological, social, and educational research. Yet the fundamental identifiability issue of these models has not been fully addressed. Among the previous research on the…

Methodology · Statistics 2025-01-08 Jing Ouyang , Gongjun Xu

Two asymptotic configurations on a full $\mathbb{Z}^d$-shift are indistinguishable if for every finite pattern the associated sets of occurrences in each configuration coincide up to a finitely supported permutation of $\mathbb{Z}^d$. We…

Dynamical Systems · Mathematics 2025-01-27 Sebastián Barbieri , Sébastien Labbé

Causal representation learning seeks to recover latent factors that generate observational data through a mixing function. Needing assumptions on latent structures or relationships to achieve identifiability in general, prior works often…

Artificial Intelligence · Computer Science 2025-09-24 Kwonho Kim , Heejeong Nam , Inwoo Hwang , Sanghack Lee

While hidden class models of various types arise in many statistical applications, it is often difficult to establish the identifiability of their parameters. Focusing on models in which there is some structure of independence of some of…

Statistics Theory · Mathematics 2009-09-01 Elizabeth S. Allman , Catherine Matias , John A. Rhodes

Statistical latent class models are widely used in social and psychological researches, yet it is often difficult to establish the identifiability of the model parameters. In this paper we consider the identifiability issue of a family of…

Methodology · Statistics 2016-03-15 Gongjun Xu

We propose a combined model, which integrates the latent factor model and the logistic regression model, for the citation network. It is noticed that neither a latent factor model nor a logistic regression model alone is sufficient to…

Machine Learning · Statistics 2019-12-03 Namjoon Suh , Xiaoming Huo , Eric Heim , Lee Seversky

Model-based approaches to recommendation can recommend items with a very high level of accuracy. Unfortunately, even when the model embeds content-based information, if we move to a latent space we miss references to the actual semantics of…

Information Retrieval · Computer Science 2019-09-12 Vito Walter Anelli , Tommaso Di Noia , Eugenio Di Sciascio , Azzurra Ragone , Joseph Trotta

The condition of parameter identifiability is essential for the consistency of all estimators and is often challenging to prove. As a consequence, this condition is often assumed for simplicity although this may not be straightforward to…

Statistics Theory · Mathematics 2016-07-21 Stéphane Guerrier , Roberto Molinari

Given a set of experiments in which varying subsets of observed variables are subject to intervention, we consider the problem of identifiability of causal models exhibiting latent confounding. While identifiability is trivial when each…

Machine Learning · Computer Science 2012-02-20 Antti Hyttinen , Frederick Eberhardt , Patrik O. Hoyer

We establish conditions under which latent causal graphs are nonparametrically identifiable and can be reconstructed from unknown interventions in the latent space. Our primary focus is the identification of the latent structure in…

Machine Learning · Statistics 2023-11-06 Yibo Jiang , Bryon Aragam

We present a set of conditions which, if satisfied, provide for a complete asymptotic analysis of random matrices with source term containing two distinct eigenvalues. These conditions are shown to be equivalent to the existence of a…

Mathematical Physics · Physics 2009-11-11 K. D. T-R McLaughlin

Latent or unobserved phenomena pose a significant difficulty in data analysis as they induce complicated and confounding dependencies among a collection of observed variables. Factor analysis is a prominent multivariate statistical modeling…

Methodology · Statistics 2020-06-22 Armeen Taeb , Venkat Chandrasekaran

Behavioral evaluation is the dominant paradigm for assessing alignment in large language models (LLMs). In current practice, observed compliance under finite evaluation protocols is treated as evidence of latent alignment. However, the…

Machine Learning · Computer Science 2026-02-10 Igor Santos-Grueiro

Model theoretic results such as Characterization and Definability give important information about different logics. It is well known that the proofs of those results for several modal logics have, somehow, the same 'taste'. A general proof…

Logic in Computer Science · Computer Science 2010-11-23 Facundo Carreiro

We propose a new unsupervised learning method for clustering a large number of time series based on a latent factor structure. Each cluster is characterized by its own cluster-specific factors in addition to some common factors which impact…

Statistics Theory · Mathematics 2022-09-09 Bo Zhang , Guangming Pan , Qiwei Yao , Wang Zhou