mlsanityData to 14 Oct 2026

On the Identifiability of Sparse ICA without Assuming Non-Gaussianity

arXiv 2408.10353 ↗First posted 19 Aug 2024cs.LG stat.MLcited by 5

Not on the map. Why?

Abstract (arXiv)

Independent component analysis (ICA) is a fundamental statistical tool used to reveal hidden generative processes from observed data. However, traditional ICA approaches struggle with the rotational invariance inherent in Gaussian distributions, often necessitating the assumption of non-Gaussianity in the underlying sources. This may limit their applicability in broader contexts. To accommodate Gaussian sources, we develop an identifiability theory that relies on second-order statistics without imposing further preconditions on the distribution of sources, by introducing novel assumptions on the connective structure from sources to observed variables. Different from recent work that focuses on potentially restrictive connective structures, our proposed assumption of structural variability is both considerably less restrictive and provably necessary. Furthermore, we propose two estimation methods based on second-order statistics and sparsity constraint. Experimental results are provided to validate our identifiability theory and estimation methods.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 12 of its 54 references that are in the map. First posted on arXiv 19 Aug 2024.

Builds on

12 of 54 references.

References · 12

  1. 2018DAGs with NO TEARS: Continuous Optimization for Structure Learningcited by 752
  2. 2018Nonlinear ICA Using Auxiliary Variables and Generalized Contrastive Learningcited by 282
  3. 2016Unsupervised Feature Extraction by Time-Contrastive Learning and Nonlinear ICAcited by 273
  4. 2013Causal Inference and Causal Explanation with Background Knowledgecited by 170
  5. 2021Disentanglement via Mechanism Sparsity Regularization: A New Principle for Nonlinear ICAcited by 160
  6. 2022On the Identifiability of Nonlinear ICA: Sparsity and Beyondcited by 85
  7. 2020DAGs with No Fears: A Closer Look at Continuous Optimization for Learning Bayesian Networkscited by 66
  8. 2021Identifiable Deep Generative Models via Sparse Decodingcited by 54
  9. 2023Provably Learning Object-Centric Representationscited by 45
  10. 2022Indeterminacy in Generative Models: Characterization and Strong Identifiabilitycited by 33
  11. 2022Truncated Matrix Power Iteration for Differentiable DAG Learningcited by 23
  12. 2018Sparse Gaussian ICAcited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 3; 2026: 2.

5 papers.