mlsanityData to 7 Oct 2026

Evaluating Disentanglement in Generative Models Without Knowledge of Latent Factors

arXiv 2210.01760 ↗First posted 4 Oct 2022cs.LG stat.MLcited by 2

Not on the map. Why?

Abstract (arXiv)

Probabilistic generative models provide a flexible and systematic framework for learning the underlying geometry of data. However, model selection in this setting is challenging, particularly when selecting for ill-defined qualities such as disentanglement or interpretability. In this work, we address this gap by introducing a method for ranking generative models based on the training dynamics exhibited during learning. Inspired by recent theoretical characterizations of disentanglement, our method does not require supervision of the underlying latent factors. We evaluate our approach by demonstrating the need for disentanglement metrics which do not require labelstextemdash the underlying generative factors. We additionally demonstrate that our approach correlates with baseline supervised methods for evaluating disentanglement. Finally, we show that our method can be used as an unsupervised indicator for downstream performance on reinforcement learning and fairness-classification problems.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 22 of its 30 references that are in the map. First posted on arXiv 4 Oct 2022.

Builds on

22 of 30 references.

References · 22

  1. 2022Generative Adversarial Networkscited by 5,603
  2. 2018Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representationscited by 929
  3. 2018Disentangling by Factorisingcited by 614
  4. 2015Generating Sentences from a Continuous Spacecited by 607
  5. 2014Semi-Supervised Learning with Deep Generative Modelscited by 494
  6. 2015Generative Moment Matching Networkscited by 252
  7. 2019Cyclical Annealing Schedule: A Simple Approach to Mitigating KL Vanishingcited by 191
  8. 2019On the Fairness of Disentangled Representationscited by 144
  9. 2019Lagging Inference Networks and Posterior Collapse in Variational Autoencoderscited by 124
  10. 2019Don't Blame the ELBO! A Linear VAE Perspective on Posterior Collapsecited by 120
  11. 2018Learning Deep Disentangled Embeddings with the F-Statistic Losscited by 101
  12. 2018Variational Autoencoders Pursue PCA Directions (by Accident)cited by 84
10 more
  1. 2018Geometry Score: A Method For Comparing Generative Adversarial Networkscited by 56
  2. 2019COBRA: Data-Efficient Model-Based RL through Unsupervised Object Discovery and Curiosity-Driven Explorationcited by 55
  3. 2019Unsupervised Model Selection for Variational Disentangled Representation Learningcited by 46
  4. 2019Loss Landscapes of Regularized Linear Autoencoderscited by 45
  5. 2020On Implicit Regularization in β-VAEscited by 34
  6. 2021Where and What? Examining Interpretable Disentangled Representationscited by 27
  7. 2015A Test of Relative Similarity For Model Selection in Generative Modelscited by 25
  8. 2020Evaluating the Disentanglement of Deep Generative Models through Manifold Topologycited by 20
  9. 2019Visualizing the PHATE of Neural Networkscited by 18
  10. 2022Unsupervised Disentanglement with Tensor Product Representations on the Toruscited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 0; 2026: 1.

2 papers.