mlsanityData to 14 Oct 2026

Hybrid Top-Down Global Causal Discovery with Local Search for Linear and Nonlinear Additive Noise Models

arXiv 2405.14496 ↗First posted 23 May 2024cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

Learning the unique directed acyclic graph corresponding to an unknown causal model is a challenging task. Methods based on functional causal models can identify a unique graph, but either suffer from the curse of dimensionality or impose strong parametric assumptions. To address these challenges, we propose a novel hybrid approach for global causal discovery in observational data that leverages local causal substructures. We first present a topological sorting algorithm that leverages ancestral relationships in linear structural causal models to establish a compact top-down hierarchical ordering, encoding more causal information than linear orderings produced by existing methods. We demonstrate that this approach generalizes to nonlinear settings with arbitrary noise. We then introduce a nonparametric constraint-based algorithm that prunes spurious edges by searching for local conditioning sets, achieving greater accuracy than current methods. We provide theoretical guarantees for correctness and worst-case polynomial time complexities, with empirical validation on synthetic data.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 19 of its 58 references that are in the map. First posted on arXiv 23 May 2024.

Builds on

19 of 58 references.

References · 19

  1. 2013Causal Discovery with Continuous Additive Noise Modelscited by 255
  2. 2013CAM: Causal additive models, high-dimensional order search and penalized regressioncited by 178
  3. 2021Beware of the Simulated DAG! Causal Discovery Benchmarks May Be Easy To Gamecited by 161
  4. 2022Score matching enables causal discovery of nonlinear additive noise modelscited by 111
  5. 2023Causal-learn: Causal Discovery in Pythoncited by 109
  6. 2013Learning Equivalence Classes of Bayesian Networks Structurescited by 77
  7. 2022Diffusion Models for Causal Discovery via Topological Orderingcited by 66
  8. 2022Greedy Relaxations of the Sparsest Permutation Algorithmcited by 64
  9. 2023Scalable Causal Discovery with Score Matchingcited by 45
  10. 2023Causal Discovery with Score Matching on Additive Models with Arbitrary Noisecited by 43
  11. 2023A Scale-Invariant Sorting Criterion to Find a Causal Order in Additive Noise Modelscited by 28
  12. 2023Assumption violations in causal discovery and the robustness of score matchingcited by 28
7 more
  1. 2023Sample Complexity Bounds for Score-Matching: Causal Discovery and Generative Modelingcited by 16
  2. 2021Finding Valid Adjustments under Non-ignorability with Minimal DAG Knowledgecited by 10
  3. 2023Local Causal Discovery for Estimating Causal Effectscited by 10
  4. 2023Local Discovery by Partitioning: Polynomial-Time Causal Discovery Around Exposure-Outcome Pairscited by 9
  5. 2013Learning directed acyclic graphs based on sparsest permutationscited by 6
  6. 2021Greedy Approximation Algorithms for Active Sequential Hypothesis Testingcited by 5
  7. 2023Front-door Adjustment Beyond Markov Equivalence with Limited Graph Knowledgecited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 2; 2025: 1; 2026: 2.

5 papers.