mlsanityData to 7 Oct 2026

C-Disentanglement: Discovering Causally-Independent Generative Factors under an Inductive Bias of Confounder

arXiv 2310.17325 ↗First posted 26 Oct 2023cs.LG cs.AI cs.CVcited by 7

Not on the map. Why?

Abstract (arXiv)

Representation learning assumes that real-world data is generated by a few semantically meaningful generative factors (i.e., sources of variation) and aims to discover them in the latent space. These factors are expected to be causally disentangled, meaning that distinct factors are encoded into separate latent variables, and changes in one factor will not affect the values of the others. Compared to statistical independence, causal disentanglement allows more controllable data generation, improved robustness, and better generalization. However, most existing work assumes unconfoundedness in the discovery process, that there are no common causes to the generative factors and thus obtain only statistical independence. In this paper, we recognize the importance of modeling confounders in discovering causal generative factors. Unfortunately, such factors are not identifiable without proper inductive bias. We fill the gap by introducing a framework entitled Confounded-Disentanglement (C-Disentanglement), the first framework that explicitly introduces the inductive bias of confounder via labels from domain expertise. In addition, we accordingly propose an approach to sufficiently identify the causally disentangled factors under any inductive bias of the confounder. We conduct extensive experiments on both synthetic and real-world datasets. Our method demonstrates competitive results compared to various SOTA baselines in obtaining causally disentangled features and downstream tasks under domain shifts.

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

Builds on

16 of 27 references.

References · 16

  1. 2014Deep Learning Face Attributes in the Wildcited by 3,679
  2. 2018Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representationscited by 929
  3. 2016InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Netscited by 858
  4. 2018Disentangling by Factorisingcited by 614
  5. 2020Weakly-Supervised Disentanglement Without Compromisescited by 237
  6. 2016Deep Unsupervised Clustering with Gaussian Mixture Variational Autoencoderscited by 219
  7. 2022Weakly supervised causal representation learningcited by 140
  8. 2018Robustly Disentangled Causal Mechanisms: Validating Deep Representations for Interventional Robustnesscited by 108
  9. 2021Desiderata for Representation Learning: A Causal Perspectivecited by 76
  10. 2022Weakly Supervised Representation Learning with Sparse Perturbationscited by 64
  11. 2013Equitability, mutual information, and the maximal information coefficientcited by 45
  12. 2019Weakly Supervised Disentanglement by Pairwise Similaritiescited by 22
4 more
  1. 2021Understanding the Generalization Benefit of Model Invariance from a Data Perspectivecited by 22
  2. 2021On Causally Disentangled Representationscited by 22
  3. 2023CAT: Causal Audio Transformer for Audio Classificationcited by 10
  4. 2022PatchMix Augmentation to Identify Causal Features in Few-shot Learningcited by 4

Built on by

Cited by year (2026 to 7 Oct)

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

7 papers.