Research map / Probabilistic and scientific modeling / Causal discovery
Structural Causal Bottleneck Models
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.
Introduces structural causal bottleneck models, where effects between high-dimensional variables pass through low-dimensional bottleneck summaries, with identifiability results and synthetic identifiability, misspecification, and transfer-learning experiments.
Problem
Causal effect estimation and modeling among high-dimensional variables suffers from the curse of dimensionality, and existing dimension reduction (PCA, sufficient dimension reduction, causal representation learning, causal abstraction) either discards target-relevant information or requires heavy as
Approach
Assume each causal mechanism between high-dimensional vectors depends only on a low-dimensional, target-specific bottleneck of each parent (factored or intrinsic), define the induced SCM and equivalence classes, show bottlenecks are identifiable up to invertible maps under injectivity and additive noise, and estimate them via regression with bottleneck-dimension constraints.</�core_idea>
Key results
- In linear SCBMs, bottleneck recovery R^2 saturates around n=10000 and stays strong as node count grows.
- For misspecified bottleneck dimension, identifiability metric increases until the assumed dimension equals the ground truth and does not degrade with overestimation.
- In low-sample transfer learning, using estimated bottleneck variables as conditioning sets reduces MAE of effect estimation relative to conditioning on the observed high-dimensional confounder.
Surprising findings
- Randomly initialized MLP bottleneck spaces collapse numerically to near one-dimensional subspaces for products of as few as three random factors.
Limitations
- Experiments are limited to synthetic data and small graphs; no real-world application.
- Nonlinear experiments show lower identifiability and error propagation grows with graph size.
- Assumes the causal graph is known; graph discovery is left to future work.
Experimental setup
Datasets: synthetic data from randomly sampled SCBMs
Benchmarks: synthetic SCBMs
Metrics: R^2 of bidirectional regression between true and estimated b mean absolute error of causal effect estimate
Baselines: PCA
Builds on: structural causal models information bottleneck sufficient dimension reduction causal representation learning
Closest papers by meaning
- Learning Structural Causal Models from Ordering: Identifiable Flow Models (AAAI 2025 · similarity 0.90)
- A Practical Approach to Causal Inference over Time (AAAI 2025 · similarity 0.89)
- Identifying Macro Causal Effects in C-DMGs over DMGs (NeurIPS 2025 · similarity 0.88)
- Learning Mixtures of Unknown Causal Interventions (NeurIPS 2024 · similarity 0.88)
- CausalPFN: Amortized Causal Effect Estimation via In-Context Learning (NeurIPS 2025 · similarity 0.88)
- Standardizing Structural Causal Models (ICLR 2025 · similarity 0.87)
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.
