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

Sujai Hiremath, Jacqueline R. M. A. Maasch, Mengxiao Gao, Promit Ghosal, Kyra Gan
2/3/2026

No official code found. Best implementation: Sujai1/hybrid-discovery (0 stars, last commit 2025-01-10).

Abstract

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.

View on arXivView PDF

Code Implementations(1)

00PythonOct 30, 20241 years ago

Similar Papers

Cite this paper

@article{hiremath2026hybrid,
  title  = {Hybrid Top-Down Global Causal Discovery with Local Search for Linear and Nonlinear Additive Noise Models},
  author = {Sujai Hiremath and Jacqueline R. M. A. Maasch and Mengxiao Gao and Promit Ghosal and Kyra Gan},
  year   = {2026},
  eprint = {2405.14496},
  archivePrefix = {arXiv},
  doi    = {10.52202/079017-4231},
  url    = {https://arxiv.org/abs/2405.14496},
  journal = {NEURIPS 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2405.14496.svg)](https://codeofpaper.com/paper/2405.14496)

Discussion