AI Paper Atlas

Research map / Probabilistic and scientific modeling / Causal discovery

Constraint-based structure learning with latents

Recover causal graphs under latent variables and mixed data using recursive, constraint-based algorithms.

90 accepted papers at ICML, NeurIPS, ICLR, CVPR and AAAI (2016–2026) · an approach in Causal discovery, keyword cluster “causal discovery · causal structure · graphs”

State History Tried Checklist Preprints Who Export

Where it stands

Not enough benchmark data Fewer than four papers report the same benchmark, so there is no record to follow.

24 papers in 2023–24 and 40 in 2025–26 (at ICML, NeurIPS, ICLR, CVPR and AAAI); its share of the topic grew, from 10.3% to 12.0%.

How this is decided

A benchmark is tracked when at least four papers of this approach report their own method on the same dataset and metric in at least two different years. Its record is the best number reported up to 2024 compared with the best reported in 2025–26: still improving means at least 1% better, flat means at most 0.2% better with at least two papers from 2025–26 trying. Numbers on a different scale from the rest (a fraction among percentages) and far outliers are left out. Results come from different papers with different setups, so they are signals, not head-to-head comparisons. The share of papers is counted at ICML, NeurIPS, ICLR, CVPR and AAAI.

How it got here

2016: 1162017: 2172018: 2182019: 2192020: 4202021: 8212022: 7222023: 12232024: 12242025: 12252026: 2826

Most cited paper of each year

Earliest papers here

What has been tried

56 papers here report 466 measured changes (a component added, removed or swapped, compared with a baseline): helped 68%, no clear effect 9%, hurt 17%, mixed 6%. Papers mostly publish changes that helped, so "helped" is over-represented.

Ablations in recent papers

What was changedMeasured onResultEffectPaper
Use topological information across nodes instead of same-node history onlyMetropolitan Cellular Network Alarm Data · F10.38 -> 0.54HelpedTNPAR: Topological Neural Poisson Auto-Regressive Model for Learning Granger Causal Structure from Event Sequences (AAAI 2024 · 6 citations)
use ground-truth Markov blankets instead of estimated blanketsSF3 (d=400, n/d=20) · SHD322 { ± 68.83} -> 208 { ± 24.43}HelpedDCILP: A Distributed Approach for Large-Scale Causal Structure Learning (AAAI 2025 · 5 citations)
vary the embedding dimensionRössler-Lorenz, C=1 · causal inference performanceMixedTangent Space Causal Inference: Leveraging Vector Fields for Causal Discovery in Dynamical Systems (NeurIPS 2024 · 4 citations)
Add the input-output Jacobian regularizerVAR100 summary · AUPRC0.667 -> 0.950HelpedJacobian Regularizer-based Neural Granger Causality (ICML 2024 · 2 citations)
add semi-supervised learning warmup rather than regular early stoppingCIFAR-10 IDN-50% · accuracy94.43 ± 0.07 -> 95.88 ± 0.08HelpedLearning the Latent Causal Structure for Modeling Label Noise (NeurIPS 2024 · 1 citation)
use two hidden layers of width 8 rather than one hidden layer of width 430 graphs · Expected SHD between CPDAGs3.63 -> 1.23HelpedSince Faithfulness Fails: The Performance Limits of Neural Causal Discovery (ICML 2025 · 0 citations)
Use positional embedding instead of LTEER synthetic graphs, D=30, 50, 100 · OD16.9 ± 6.12 -> 19.0 ± 6.91; 32.8 ± 6.55 -> 41.4 ± 11.33; 86.6 ± 12.99 -> 100.7 ± 15.62HurtScore-informed Neural Operator for Enhancing Ordering-based Causal Discovery (NeurIPS 2025 · 0 citations)
use ConservativeInsert instead of SafeInsertER graphs, observational data · structural errorHelpedLess Greedy Equivalence Search (NeurIPS 2025 · 0 citations)
add Theorem 1 ordering instead of random topological orderingSachs · SHD17.0±3.50 -> 11.0±0.00HelpedOrdering-Based Causal Discovery for Linear and Nonlinear Relations (NeurIPS 2024 · 0 citations)
Remove the residual-independence term from order estimationSynthetic weakly identifiable MLP problems · F1 ScoreHurtStrong and Weak Identifiability of Optimization-based Causal Discovery in Non-linear Additive Noise Models (ICML 2025)

What reviewers will expect

Datasets and baselines named in the 21 papers of this approach from 2025–2026 that have a full-text summary. Leaving out the common ones is a frequent review question.

Datasets

  • Tübingen cause-effect pairs · 2 of 21 papers
  • Sachs · 2 of 21 papers

Baselines

  • GES · 2 of 21 papers
  • DAGMA · 2 of 21 papers
  • CAM · 2 of 21 papers
  • RESIT · 2 of 21 papers
  • CaPS · 2 of 21 papers
  • DiffAN · 2 of 21 papers
  • SCORE · 2 of 21 papers
  • RCD · 2 of 21 papers

Recent preprints

Loading recent arXiv preprints…

    Who publishes on it

    Institutions on the most papers of this approach since 2023 (of 64 papers; from OpenAlex and the papers' affiliations).

    Use it

    Download BibTeX of 37 key papersOpen the topic in the interactive map

    Get alerts. Describe your idea in scime atlas and save it (free scime account): you get a weekly email when new preprints land close to it.

    Same keyword cluster

    Elsewhere in the topic

    Benchmark numbers, ablations and baseline numbers are extracted by AI from each paper's full text and can be wrong; the paper is the authority. Data: results index of 2026-11-02, citation counts from OpenAlex (2026-10-09).

    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