Identifiable Recovery of Latent Causal Factors

You are reading version 1 of this direction, frozen 2026-10-04. The latest version is version 2.

Version 1 of 2293 papers326 conceptsfrozen 2026-10-04

In deep learning, we often assume that if a model can reconstruct an image or predict a label, it must have "understood" the underlying data. However, a fundamental theoretical hurdle suggests otherwise: the identifiability problem.

Standard representation learning is prone to recovering "entangled" versions of reality. A model might represent an object's color and shape as a single, inseparable vector, or it might find a mathematically valid but physically meaningless rotation of the true latent factors. Without identifiability—the mathematical guarantee that a model uniquely recovers the true latent variables—AI remains a "black box" that relies on spurious correlations rather than the actual causal structure of the world.

The Rotation Problem

Imagine a dataset of red and blue squares and circles. The true latent factors are color and shape. A standard Variational Autoencoder (VAE) might achieve near-zero reconstruction error by mapping these to two latent dimensions, $z_1$ and $z_2$. However, there is no guarantee that $z_1$ corresponds to color and $z_2$ to shape. Instead, the model might learn a mixture where both dimensions change slightly when the color changes.

As Graziano Mita and colleagues argue in An Identifiable Double VAE For Disentangled Representations, most frameworks lack the constraints to ensure these learned dimensions align with physical reality. This is why models fail when moved to new environments: they haven't learned the "factors," they've learned a specific statistical "view" of the data that only holds true in the training set.

Leveraging the "Geometric Signature" of Change

How do we force a model to find the true factors? The emerging consensus is to look at how data changes. Kartik Ahuja, Yoshua Bengio, and others demonstrate in Interventional Causal Representation Learning that interventions—specific manipulations of latent variables—provide a "geometric signature."

If we see two images where only the object's position changes while the color stays the same, that sparse change acts as a lighthouse. By observing these "sparse perturbations," as explored in Weakly Supervised Representation Learning with Sparse Perturbations, models can provably recover the underlying factors without needing explicit labels.

The Rules of the Game: Mechanisms and Dynamics

Another path to identifiability is through the "rules" that govern how latents evolve. In Properties from Mechanisms: An Equivariance Perspective on Identifiable Representation Learning, Jason Hartford and collaborators suggest that if we know the mechanisms (the physical or logical rules) of a system, we can recover the latent states up to the symmetries of those rules.

This is particularly powerful in time-series data. Weiran Yao and Kun Zhang show in Learning Latent Causal Dynamics that even when the environment is non-stationary (e.g., gravity changing), the way the system shifts actually helps identify the causal variables. The shift isn't noise; it's information that narrows down the possible mathematical representations to the one that is physically true.

Sparsity as a Causal Prior

In the real world, most things don't affect most other things. This is the principle of mechanism sparsity. Sebastien Lachapelle and Simon Lacoste-Julien utilize this in Partial Disentanglement via Mechanism Sparsity to show that we can achieve "partial disentanglement" even in complex systems. By assuming the causal graph is sparse, we can mathematically predict which factors will be isolated and which will remain mixed.

Similarly, Avinash Kori and colleagues introduce COVAE, which uses a "causal ordering prior." Instead of assuming latents are independent, they assume they follow a sequence. By measuring the "curvature" (Hessian) of the latent distribution, the model can discover this order, leading to more robust and interpretable features.

From Theory to Robustness

Identifiability isn't just a theoretical nicety; it is the key to solving practical problems like Out-of-Distribution (OOD) generalization.

By moving from simple statistical matching to identifiable causal recovery, researchers are building models that don't just mimic data, but capture the underlying generative processes of the world.

Papers in this version

Showing 60 of 293 papers.

History & citationVersion 2 · 2026-10-04

Current · Permanent link

  1. Version 2 (latest) · 2026-10-04 · 194 papers
  2. Version 1 · 2026-10-04 · 293 papers
Cite this direction

Latest version (a living page):

@misc{lacuna_latent_factor_identifiability_10ad20ee,
  title = {latent factor identifiability},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/latent-factor-identifiability/rdr_10ad20eedbd948aaba959073fc7e09de},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}

This exact version (version 1, frozen text):

@misc{lacuna_identifiable_recovery_of_latent_causal_f_10ad20ee_v1,
  title = {Identifiable Recovery of Latent Causal Factors},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/identifiable-recovery-of-latent-causal-factors/rdr_10ad20eedbd948aaba959073fc7e09de/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}