Probing the Robustness of Independent Mechanism Analysis for Representation Learning
Not on the map. Why?
Abstract (arXiv)
One aim of representation learning is to recover the original latent code that generated the data, a task which requires additional information or inductive biases. A recently proposed approach termed Independent Mechanism Analysis (IMA) postulates that each latent source should influence the observed mixtures independently, complementing standard nonlinear independent component analysis, and taking inspiration from the principle of independent causal mechanisms. While it was shown in theory and experiments that IMA helps recovering the true latents, the method's performance was so far only characterized when the modeling assumptions are exactly satisfied. Here, we test the method's robustness to violations of the underlying assumptions. We find that the benefits of IMA-based regularization for recovering the true sources extend to mixing functions with various degrees of violation of the IMA principle, while standard regularizers do not provide the same merits. Moreover, we show that unregularized maximum likelihood recovers mixing functions which systematically deviate from the IMA principle, and provide an argument elucidating the benefits of IMA-based regularization.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 12 of its 26 references that are in the map. First posted on arXiv 13 Jul 2022.
Builds on
12 of 26 references.
References · 12
- 2018Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representationscited by 941
- 2019Variational Autoencoders and Nonlinear ICA: A Unifying Frameworkcited by 503
- 2018Nonlinear ICA Using Auxiliary Variables and Generalized Contrastive Learningcited by 282
- 2016Unsupervised Feature Extraction by Time-Contrastive Learning and Nonlinear ICAcited by 273
- 2019Residual Flows for Invertible Generative Modelingcited by 257
- 2021Independent mechanism analysis, a new concept?cited by 97
- 2019The Incomplete Rosetta Stone Problem: Identifiability Results for Multi-View Nonlinear ICAcited by 86
- 2020Hidden Markov Nonlinear ICA: Unsupervised Learning from Nonstationary Time Seriescited by 77
- 2021Orthogonal Jacobian Regularization for Unsupervised Disentanglement in Image Generationcited by 35
- 2017Group invariance principles for causal generative modelscited by 20
- 2020Relative gradient optimization of the Jacobian term in unsupervised deep learningcited by 16
- 2022Principal Manifold Flowscited by 4
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 1; 2025: 2.
5 papers.
- 2022Function Classes for Identifiable Nonlinear Independent Component Analysiscited by 53
- 2024Identifiable Causal Representation Learning: Unsupervised, Multi-View, and Multi-Environmentcited by 12
- 2023Independent Mechanism Analysis and the Manifold Hypothesiscited by 7
- 2025Escaping Plato's Cave: Towards the Alignment of 3D and Text Latent Spacescited by 6
- 2025When Does Closeness in Distribution Imply Representational Similarity? An Identifiability Perspectivecited by 4
- 2025When Does Closeness in Distribution Imply Representational Similarity? An Identifiability Perspective4 Jun 2025
- 2025Escaping Plato's Cave: Towards the Alignment of 3D and Text Latent Spaces7 Mar 2025
- 2024Identifiable Causal Representation Learning: Unsupervised, Multi-View, and Multi-Environment19 Jun 2024
- 2023Independent Mechanism Analysis and the Manifold Hypothesis20 Dec 2023
- 2022Function Classes for Identifiable Nonlinear Independent Component Analysis12 Aug 2022