mlsanityData to 7 Oct 2026

Identifiable Causal Representation Learning: Unsupervised, Multi-View, and Multi-Environment

arXiv 2406.13371 ↗First posted 19 Jun 2024cs.LG cs.AI stat.MLcited by 12

Not on the map. Why?

Abstract (arXiv)

Causal models provide rich descriptions of complex systems as sets of mechanisms by which each variable is influenced by its direct causes. They support reasoning about manipulating parts of the system and thus hold promise for addressing some of the open challenges of artificial intelligence (AI), such as planning, transferring knowledge in changing environments, or robustness to distribution shifts. However, a key obstacle to more widespread use of causal models in AI is the requirement that the relevant variables be specified a priori, which is typically not the case for the high-dimensional, unstructured data processed by modern AI systems. At the same time, machine learning (ML) has proven quite successful at automatically extracting useful and compact representations of such complex data. Causal representation learning (CRL) aims to combine the core strengths of ML and causality by learning representations in the form of latent variables endowed with causal model semantics. In this thesis, we study and present new results for different CRL settings. A central theme is the question of identifiability: Given infinite data, when are representations satisfying the same learning objective guaranteed to be equivalent? This is an important prerequisite for CRL, as it formally characterises if and when a learning task is, at least in principle, feasible. Since learning causal models, even without a representation learning component, is notoriously difficult, we require additional assumptions on the model class or rich data beyond the classical i.i.d. setting. By partially characterising identifiability for different settings, this thesis investigates what is possible for CRL without direct supervision, and thus contributes to its theoretical foundations. Ideally, the developed insights can help inform data collection practices or inspire the design of new practical estimation methods.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 135 of its 378 references that are in the map. First posted on arXiv 19 Jun 2024.

Builds on

135 of 378 references.

References · 135

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2020Language Models are Few-Shot Learnerscited by 32,199
  3. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  4. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  5. 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
  6. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
  7. 2016Density estimation using Real NVPcited by 2,029
  8. 2019Invariant Risk Minimizationcited by 1,832
  9. 2021Barlow Twins: Self-Supervised Learning via Redundancy Reductioncited by 1,818
  10. 2017Improved Regularization of Convolutional Neural Networks with Cutoutcited by 1,623
  11. 2018ImageNet-trained CNNs are biased towards texture; increasing shape bias improves accuracy and robustnesscited by 1,430
  12. 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,393
38 more
  1. 2018Relational inductive biases, deep learning, and graph networkscited by 1,341
  2. 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,315
  3. 2018Learning deep representations by mutual information estimation and maximizationcited by 1,265
  4. 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,232
  5. 2014NICE: Non-linear Independent Components Estimationcited by 1,052
  6. 2020In Search of Lost Domain Generalizationcited by 1,042
  7. 2019Adversarial Examples Are Not Bugs, They Are Featurescited by 950
  8. 2018Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representationscited by 929
  9. 2018Robustness May Be at Odds with Accuracycited by 873
  10. 2020Object-Centric Learning with Slot Attentioncited by 865
  11. 2018DAGs with NO TEARS: Continuous Optimization for Structure Learningcited by 745
  12. 2020Out-of-Distribution Generalization via Risk Extrapolation (REx)cited by 737
  13. 2019Learning Representations by Maximizing Mutual Information Across Viewscited by 733
  14. 2019Data-Efficient Image Recognition with Contrastive Predictive Codingcited by 672
  15. 2013Domain Generalization via Invariant Feature Representationcited by 622
  16. 2019On Variational Bounds of Mutual Informationcited by 550
  17. 2019A Theoretical Analysis of Contrastive Unsupervised Representation Learningcited by 530
  18. 2019Variational Autoencoders and Nonlinear ICA: A Unifying Frameworkcited by 494
  19. 2017CheXNet: Radiologist-Level Pneumonia Detection on Chest X-Rays with Deep Learningcited by 459
  20. 2019vq-wav2vec: Self-Supervised Learning of Discrete Speech Representationscited by 335
  21. 2019On Mutual Information Maximization for Representation Learningcited by 315
  22. 2021Self-Supervised Learning with Data Augmentations Provably Isolates Content from Stylecited by 308
  23. 2020Gradient Starvation: A Learning Proclivity in Neural Networkscited by 262
  24. 2021Understanding self-supervised Learning Dynamics without Contrastive Pairscited by 254
  25. 2020Weakly-Supervised Disentanglement Without Compromisescited by 237
  26. 2020On the Binding Problem in Artificial Neural Networkscited by 230
  27. 2021Contrastive Learning Inverts the Data Generating Processcited by 220
  28. 2020Differentiable Causal Discovery from Interventional Datacited by 218
  29. 2018Neural Autoregressive Flowscited by 207
  30. 2019Learning Sparse Nonparametric DAGscited by 207
  31. 2018An efficient framework for learning sentence representationscited by 197
  32. 2020Representation Learning via Invariant Causal Mechanismscited by 197
  33. 2021Disentanglement via Mechanism Sparsity Regularization: A New Principle for Nonlinear ICAcited by 158
  34. 2022Bayesian Structure Learning with Generative Flow Networkscited by 153
  35. 2020Predicting What You Already Know Helps: Provable Self-Supervised Learningcited by 152
  36. 2020Understanding the Failure Modes of Out-of-Distribution Generalizationcited by 146
  37. 2022Weakly supervised causal representation learningcited by 140
  38. 2022Interventional Causal Representation Learningcited by 140

50 most cited of 135 All 135 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 7; 2026: 4.

12 papers.