Disentanglement by Nonlinear ICA with General Incompressible-flow Networks (GIN)
Peter Sorrenson, Carsten Rother, Ullrich Köthe
Abstract
A central question of representation learning asks under which conditions it is possible to reconstruct the true latent variables of an arbitrarily complex generative process. Recent breakthrough work by Khemakhem et al. (2019) on nonlinear ICA has answered this question for a broad class of conditional generative processes. We extend this important result in a direction relevant for application to real-world data. First, we generalize the theory to the case of unknown intrinsic problem dimension and prove that in some special (but not very restrictive) cases, informative latent variables will be automatically separated from noise by an estimating model. Furthermore, the recovered informative latent variables will be in one-to-one correspondence with the true latent variables of the generating process, up to a trivial component-wise transformation. Second, we introduce a modification of the RealNVP invertible neural network architecture (Dinh et al. (2016)) which is particularly suitable for this type of problem: the General Incompressible-flow Network (GIN). Experiments on artificial data and EMNIST demonstrate that theoretical predictions are indeed verified in practice. In particular, we provide a detailed set of exactly 22 informative latent variables extracted from EMNIST.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext e264dabb-eca7-4871-9a93-e1b46ebbbf74Cited by top-tier papers48
- Self-Supervised Learning with Data Augmentations Provably Isolates Content from StyleJulius von Kügelgen, Yash Sharma, Luigi Gresele, Wieland Brendel et al.NeurIPS 2021 · 421 citations
- Weakly-Supervised Disentanglement Without CompromisesFrancesco Locatello, Ben Poole, Gunnar Rätsch, Bernhard Schölkopf et al.ICML 2020 · 361 citations
- Towards Nonlinear Disentanglement in Natural Data with Temporal Sparse CodingDavid A. Klindt, Lukas Schott, Yash Sharma, Ivan Ustyuzhaninov et al.ICLR 2021 · 156 citations
- ICE-BeeM: Identifiable Conditional Energy-Based Deep Models Based on Nonlinear ICAIlyes Khemakhem, Ricardo Pio Monti, Diederik P. Kingma, Aapo HyvärinenNeurIPS 2020 · 141 citations
- CITRIS: Causal Identifiability from Temporal Intervened SequencesPhillip Lippe, Sara Magliacane, Sindy Löwe, Yuki M. Asano et al.ICML 2022 · 136 citations
Related papers
- On Linear Identifiability of Learned RepresentationsGeoffrey Roeder, Luke Metz, Durk KingmaICML 2021 · 107 citations
- Nonlinear ICA Using Volume-Preserving TransformationsXiaojiang Yang, Yi Wang, Jiacheng Sun, Xing Zhang et al.ICLR 2022 · 21 citations
- Causal Component AnalysisWendong Liang, Armin Kekic, Julius von Kügelgen, Simon Buchholz et al.NeurIPS 2023 · 65 citations
- Generalized Independent Noise Condition for Estimating Latent Variable Causal GraphsFeng Xie, Ruichu Cai, Biwei Huang, Clark Glymour et al.NeurIPS 2020 · 119 citations
- Unsupervised Disentanglement Without Compromises : How Functional Orthogonality Enforces IdentifiabilityMathieu Simon, Pascal Frossard, Christophe De VleeschouwerICML 2026
