mlsanityData to 7 Oct 2026

Tripod: Three Complementary Inductive Biases for Disentangled Representation Learning

arXiv 2404.10282 ↗First posted 16 Apr 2024cs.LG cs.CVcited by 13

Not on the map. Why?

Abstract (arXiv)

Inductive biases are crucial in disentangled representation learning for narrowing down an underspecified solution set. In this work, we consider endowing a neural network autoencoder with three select inductive biases from the literature: data compression into a grid-like latent space via quantization, collective independence amongst latents, and minimal functional influence of any latent on how other latents determine data generation. In principle, these inductive biases are deeply complementary: they most directly specify properties of the latent space, encoder, and decoder, respectively. In practice, however, naively combining existing techniques instantiating these inductive biases fails to yield significant benefits. To address this, we propose adaptations to the three techniques that simplify the learning problem, equip key regularization terms with stabilizing invariances, and quash degenerate incentives. The resulting model, Tripod, achieves state-of-the-art results on a suite of four image disentanglement benchmarks. We also verify that Tripod significantly improves upon its naive incarnation and that all three of its "legs" are necessary for best performance.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 26 of its 44 references that are in the map. First posted on arXiv 16 Apr 2024.

Builds on

26 of 44 references.

References · 26

  1. 2021Diffusion Models Beat GANs on Image Synthesiscited by 8,185
  2. 2022Generative Adversarial Networkscited by 5,603
  3. 2017Neural Discrete Representation Learningcited by 4,650
  4. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
  5. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
  6. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,135
  7. 2018Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representationscited by 929
  8. 2018Disentangling by Factorisingcited by 614
  9. 2019Variational Autoencoders and Nonlinear ICA: A Unifying Frameworkcited by 494
  10. 2023Finite Scalar Quantization: VQ-VAE Made Simplecited by 425
  11. 2021Interpretable Machine Learning: Fundamental Principles and 10 Grand Challengescited by 364
  12. 2017Variational Inference of Disentangled Latent Concepts from Unlabeled Observationscited by 240
14 more
  1. 2021Equinox: neural networks in JAX via callable PyTrees and filtered transformationscited by 143
  2. 2019On the Transfer of Inductive Bias from Simulation to the Real World: a New Disentanglement Datasetcited by 100
  3. 2021Independent mechanism analysis, a new concept?cited by 96
  4. 2020Disentanglement by Nonlinear ICA with General Incompressible-flow Networks (GIN)cited by 91
  5. 2020The Hessian Penalty: A Weak Prior for Unsupervised Disentanglementcited by 90
  6. 2013Deep Learning of Representations: Looking Forwardcited by 84
  7. 2022On the Identifiability of Nonlinear ICA: Sparsity and Beyondcited by 84
  8. 2021Identifiable Deep Generative Models via Sparse Decodingcited by 54
  9. 2023Disentanglement via Latent Quantizationcited by 40
  10. 2020Implicit Rank-Minimizing Autoencodercited by 35
  11. 2021Orthogonal Jacobian Regularization for Unsupervised Disentanglement in Image Generationcited by 35
  12. 2021Disentangled Sequence to Sequence Learning for Compositional Generalizationcited by 30
  13. 2022Disentanglement with Biological Constraints: A Theory of Functional Cell Typescited by 30
  14. 2020Structure by Architecture: Structured Representations without Regularizationcited by 10

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 4; 2025: 6; 2026: 3.

13 papers.

Sort:

By area: