Diverse Influence Component Analysis: A Geometric Approach to Nonlinear Mixture Identifiability
Not on the map. Why?
Abstract (arXiv)
Latent component identification from unknown nonlinear mixtures is a foundational challenge in machine learning, with applications in tasks such as disentangled representation learning and causal inference. Prior work in nonlinear independent component analysis (nICA) has shown that auxiliary signals -- such as weak supervision -- can support identifiability of conditionally independent latent components. More recent approaches explore structural assumptions, e.g., sparsity in the Jacobian of the mixing function, to relax such requirements. In this work, we introduce Diverse Influence Component Analysis (DICA), a framework that exploits the convex geometry of the mixing function's Jacobian. We propose a Jacobian Volume Maximization (J-VolMax) criterion, which enables latent component identification by encouraging diversity in their influence on the observed variables. Under reasonable conditions, this approach achieves identifiability without relying on auxiliary information, latent component independence, or Jacobian sparsity assumptions. These results extend the scope of identifiability analysis and offer a complementary perspective to existing methods.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 39 of its 77 references that are in the map. First posted on arXiv 19 Oct 2025.
Builds on
39 of 77 references.
References · 39
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
- 2021Convex optimizationcited by 2,515
- 2018Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representationscited by 941
- 2019Variational Autoencoders and Nonlinear ICA: A Unifying Frameworkcited by 503
- 2021Self-Supervised Learning with Data Augmentations Provably Isolates Content from Stylecited by 312
- 2018Nonlinear ICA Using Auxiliary Variables and Generalized Contrastive Learningcited by 282
- 2016Unsupervised Feature Extraction by Time-Contrastive Learning and Nonlinear ICAcited by 273
- 2021Disentanglement via Mechanism Sparsity Regularization: A New Principle for Nonlinear ICAcited by 160
- 2020Towards Nonlinear Disentanglement in Natural Data with Temporal Sparse Codingcited by 122
- 2021Independent mechanism analysis, a new concept?cited by 97
- 2020The Hessian Penalty: A Weak Prior for Unsupervised Disentanglementcited by 92
27 more
- 2019The Incomplete Rosetta Stone Problem: Identifiability Results for Multi-View Nonlinear ICAcited by 86
- 2022On the Identifiability of Nonlinear ICA: Sparsity and Beyondcited by 85
- 2022Identifiability of deep generative models without auxiliary informationcited by 70
- 2023Additive Decoders for Latent Variables Identification and Cartesian-Product Extrapolationcited by 58
- 2018Nonnegative Matrix Factorization for Signal and Data Analytics: Identifiability, Algorithms, and Applicationscited by 55
- 2021Identifiable Deep Generative Models via Sparse Decodingcited by 54
- 2022Function Classes for Identifiable Nonlinear Independent Component Analysiscited by 53
- 2023Provably Learning Object-Centric Representationscited by 45
- 2024Nonparametric Partial Disentanglement via Mechanism Sparsity: Sparse Actions, Interventions and Sparse Temporal Dependenciescited by 41
- 2021Understanding Latent Correlation-Based Multiview Learning and Self-Supervision: An Identifiability Perspectivecited by 37
- 2021Orthogonal Jacobian Regularization for Unsupervised Disentanglement in Image Generationcited by 35
- 2017On Identifiability of Nonnegative Matrix Factorizationcited by 34
- 2023Generalizing Nonlinear ICA Beyond Structural Sparsitycited by 34
- 2023Causal Representation Learning Made Identifiable by Grouping of Observational Variablescited by 32
- 2016Robust Volume Minimization-Based Matrix Factorization for Remote Sensing and Document Clusteringcited by 28
- 2019Crowdsourcing via Pairwise Co-occurrences: Identifiability and Algorithmscited by 23
- 2024Interaction Asymmetry: A General Principle for Learning Composable Abstractionscited by 20
- 2017Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimizationcited by 18
- 2021Local Disentanglement in Variational Auto-Encoders Using Jacobian L1 Regularizationcited by 17
- 2020Relative gradient optimization of the Jacobian term in unsupervised deep learningcited by 16
- 2022Polytopic Matrix Factorization: Determinant Maximization Based Criterion and Identifiabilitycited by 14
- 2024Identifiable Causal Representation Learning: Unsupervised, Multi-View, and Multi-Environmentcited by 12
- 2024Identifiable Object-Centric Representation Learning via Probabilistic Slot Attentioncited by 9
- 2021Identifiability-Guaranteed Simplex-Structured Post-Nonlinear Mixture Learning via Autoencodercited by 7
- 2023Independent Mechanism Analysis and the Manifold Hypothesiscited by 7
- 2024Towards Identifiable Unsupervised Domain Translation: A Diversified Distribution Matching Approachcited by 5
- 2022Provable Subspace Identification Under Post-Nonlinear Mixturescited by 2
Built on by
Citing papers per year: 2025: 1; 2026: 3.
4 papers.
- 2025Alternating Direction Method of Multipliers for Nonlinear Matrix Decompositionscited by 3
- 2026Content-Style Identification via Differential Independencecited by 2
- 2026Domain Transfer Becomes Identifiable via a Single Alignmentcited by 0
- 2026Kinks vs. Smoothness: Identifiability of Real Analytic nICA for Laplace-like Sourcescited by 0
- 2026Kinks vs. Smoothness: Identifiability of Real Analytic nICA for Laplace-like Sources18 Sep 2026
- 2026Domain Transfer Becomes Identifiable via a Single Alignment18 May 2026
- 2026Content-Style Identification via Differential Independence18 May 2026
- 2025Alternating Direction Method of Multipliers for Nonlinear Matrix Decompositions19 Dec 2025