atlas

Research map / Probabilistic and scientific modeling / Causal discovery

Disentangled Representation Learning in Non-Markovian Causal Systems

NeurIPS 2024 · Probabilistic and scientific modeling › Causal discovery · approach: Causal representation identifiability · 1 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes graphical criteria and an algorithm (CRID) that determine which latent causal variables can be disentangled from non-Markovian, multi-domain, arbitrary-intervention data, producing a causal disentanglement map.

Problem

Causal disentangled representation learning when latent causal variables are generated by a non-Markovian (confounded) system and data come from heterogeneous domains and arbitrary interventions, where full disentanglement is often impossible.

Approach

Introduces latent selection diagrams and graphical criteria (∆Q sets, invariant factors) that determine disentangleability of target variables from entangled ones without requiring Markovianity or one intervention per node, plus an algorithm (CRID) that outputs a causal disentanglement map.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use observational and two intervention distributions targeting V3Causal representation learning on the chain graph · Synthetic chain graphMCCHelped
Use observational distributions from two domainsCausal representation learning on the chain graph · Synthetic chain graphMCCHelped
Use observational distributions from four domains with changes on V1 and V3Causal representation learning on the collider graph · Synthetic collider graphMCCHelped
Use two interventions targeting V3Causal representation learning on the non-Markovian graph · Synthetic non-Markovian graphMCCHelped

Surprising findings

Limitations

Experimental setup

Datasets: synthetic data from latent selection diagrams MNIST

Benchmarks: synthetic latent selection diagram simulations (chain, collider, non-Markovian graphs) MNIST image editing

Metrics: mean correlation coefficient (MCC)

Baselines: Lachapelle et al. 2023 (sparsity-based functional dependency) Jiang & Aragam 2023 Yao et al. 2022

Builds on: nonlinear ICA selection diagrams causal representation learning identifiability

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy