paper-with-me

Papers

Distributional Equivalence and Structure Learning for Bow-free Acyclic Path Diagrams

2015-08-07 · Christopher Nowzohour, Marloes H. Maathuis, Robin J. Evans, Peter Bühlmann

We consider the problem of structure learning for bow-free acyclic path diagrams (BAPs). BAPs can be viewed as a generalization of linear Gaussian DAG models that allow for certain hidden variables. We present a first method for this problem using a greedy score-based search algorithm. We also prove some necessary and some sufficient conditions for distributional equivalence of BAPs which are used in an algorithmic ap- proach to compute (nearly) equivalent model structures. This allows us to infer lower bounds of causal effects. We also present applications to real and simulated datasets using our publicly available R-package.

📄 PDF Abstract BibTeX arXiv:1508.01717

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Structure Learning for Cyclic Linear Causal Models

2020-06-10 · Carlos Améndola, Philipp Dettling, Mathias Drton, Federica Onori 외

We consider the problem of structure learning for linear causal models based on observational data. We treat models given by possibly cyclic mixed graphs, which allow for feedback loops and effects of latent confounders.…

Characterizing Distribution Equivalence and Structure Learning for Cyclic and Acyclic Directed Graphs

2019-10-28 · ICML 2020 1 · AmirEmad Ghassami, Alan Yang, Negar Kiyavash, Kun Zhang

The main approach to defining equivalence among acyclic directed causal graphical models is based on the conditional independence relationships in the distributions that the causal models can generate, in terms of the Ma…

A Topological Sorting Criterion for Random Causal Directed Acyclic Graphs

2026-05-07 · Alexander G. Reisach, Antoine Chambaz, Gilles Blanchard, Sebastian Weichwald arxiv

Random directed acyclic graphs (DAGs) based on imposing an order on Erdős-Rényi and scale free random graphs are widely used for evaluating causal discovery algorithms. We show that in such DAGs, the set of nodes reachab…

Efficiently Deciding Algebraic Equivalence of Bow-Free Acyclic Path Diagrams

2024-06-10 · Thijs van Ommen

For causal discovery in the presence of latent confounders, constraints beyond conditional independences exist that can enable causal discovery algorithms to distinguish more pairs of graphs. Such constraints are not wel…

Causal Discovery

Distributional Equivalence in Linear Non-Gaussian Latent-Variable Cyclic Causal Models: Characterization and Learning

2026-03-05 · Haoyue Dai, Immanuel Albrecht, Peter Spirtes, Kun Zhang arxiv

Causal discovery with latent variables is a fundamental task. Yet most existing methods rely on strong structural assumptions, such as enforcing specific indicator patterns for latents or restricting how they can interac…