DEFT: Distilling Entangled Factors by Preventing Information Diffusion
Not on the map. Why?
Abstract (arXiv)
Disentanglement is a highly desirable property of representation owing to its similarity to human understanding and reasoning. Many works achieve disentanglement upon information bottlenecks (IB). Despite their elegant mathematical foundations, the IB branch usually exhibits lower performance. In order to provide an insight into the problem, we develop an annealing test to calculate the information freezing point (IFP), which is a transition state to freeze information into the latent variables. We also explore these clues or inductive biases for separating the entangled factors according to the differences in the IFP distributions. We found the existing approaches suffer from the information diffusion problem, according to which the increased information diffuses in all latent variables. Based on this insight, we propose a novel disentanglement framework, termed the distilling entangled factor (DEFT), to address the information diffusion problem by scaling backward information. DEFT applies a multistage training strategy, including multigroup encoders with different learning rates and piecewise disentanglement pressure, to disentangle the factors stage by stage. We evaluate DEFT on three variants of dSprite and SmallNORB, which show low-variance and high-level disentanglement scores. Furthermore, the experiment under the correlative factors shows incapable of TC-based approaches. DEFT also exhibits a competitive performance in the unsupervised setting.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 17 of its 40 references that are in the map. First posted on arXiv 8 Feb 2021.
Builds on
17 of 40 references.
References · 17
- 2013Auto-Encoding Variational Bayescited by 3,980
- 2018Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representationscited by 929
- 2016InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Netscited by 858
- 2018Disentangling by Factorisingcited by 614
- 2018Understanding disentangling in β-VAEcited by 332
- 2018Towards a Definition of Disentangled Representationscited by 294
- 2017Variational Inference of Disentangled Latent Concepts from Unlabeled Observationscited by 240
- 2017DARLA: Improving Zero-Shot Transfer in Reinforcement Learningcited by 147
- 2017Fader Networks: Manipulating Images by Sliding Attributescited by 118
- 2018Robustly Disentangled Causal Mechanisms: Validating Deep Representations for Interventional Robustnesscited by 108
- 2018Learning Deep Disentangled Embeddings with the F-Statistic Losscited by 101
- 2020On Disentangled Representations Learned From Correlated Datacited by 94
5 more
- 2020Disentanglement by Nonlinear ICA with General Incompressible-flow Networks (GIN)cited by 91
- 2018Learning Disentangled Joint Continuous and Discrete Representationscited by 83
- 2019Theory and Evaluation Metrics for Learning Disentangled Representationscited by 57
- 2019Learning Feature-to-Feature Translator by Alternating Back-Propagation for Generative Zero-Shot Learningcited by 38
- 2019Learning Discrete and Continuous Factors of Data via Alternating Disentanglementcited by 23
Built on by
Citing papers per year: 2023: 1.
1 paper.