paper-with-me

Papers

Scalable Causal Discovery with Score Matching

2023-04-06 · Francesco Montagna, Nicoletta Noceti, Lorenzo Rosasco, Kun Zhang, Francesco Locatello

This paper demonstrates how to discover the whole causal graph from the second derivative of the log-likelihood in observational non-linear additive Gaussian noise models. Leveraging scalable machine learning approaches to approximate the score function $\nabla \log p(\mathbf{X})$, we extend the work of Rolland et al. (2022) that only recovers the topological order from the score and requires an expensive pruning step removing spurious edges among those admitted by the ordering. Our analysis leads to DAS (acronym for Discovery At Scale), a practical algorithm that reduces the complexity of the pruning by a factor proportional to the graph size. In practice, DAS achieves competitive accuracy with current state-of-the-art while being over an order of magnitude faster. Overall, our approach enables principled and scalable causal discovery, significantly lowering the compute bar.

📄 PDF Abstract BibTeX arXiv:2304.03382

Code (0)

등록된 구현이 없습니다.

Tasks

Causal Discovery

Methods 이 논문이 사용한 방법론

Pruning 설명 없음

Similar Papers 제목 키워드 기반

Score matching enables causal discovery of nonlinear additive noise models

2022-03-08 · Paul Rolland, Volkan Cevher, Matthäus Kleindessner, Chris Russel 외

This paper demonstrates how to recover causal graphs from the score of the data distribution in non-linear additive (Gaussian) noise models. Using score matching algorithms as a building block, we show how to design a ne…

Causal Discovery

Sample Complexity Bounds for Score-Matching: Causal Discovery and Generative Modeling

2023-10-27 · NeurIPS 2023 11

This paper provides statistical sample complexity bounds for score-matching and its applications in causal discovery. We demonstrate that accurate estimation of the score function is achievable by training a standard dee…

Causal Discovery

Score-informed Neural Operator for Enhancing Ordering-based Causal Discovery

2025-08-18 · Jiyeon Kang, Songseong Kim, Chanhui Lee, Doyeong Hwang 외 arxiv

Ordering-based approaches to causal discovery identify topological orders of causal graphs, providing scalable alternatives to combinatorial search methods. Under the Additive Noise Model (ANM) assumption, recent causal …

Prompt Engineering

Ordering-based Causal Discovery via Generalized Score Matching

2026-01-22 · Vy Vo, He Zhao, Trung Le, Edwin V. Bonilla 외 arxiv

Learning DAG structures from purely observational data remains a long-standing challenge across scientific domains. An emerging line of research leverages the score of the data distribution to initially identify a topolo…

Shortcuts for causal discovery of nonlinear models by score matching

2023-10-22 · Francesco Montagna, Nicoletta Noceti, Lorenzo Rosasco, Francesco Locatello

The use of simulated data in the field of causal discovery is ubiquitous due to the scarcity of annotated real data. Recently, Reisach et al., 2021 highlighted the emergence of patterns in simulated linear data, which di…

Causal DiscoveryDiversity