paper-with-me

Papers

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 Markov equivalence. However, it is known that when cycles are allowed in the causal structure, conditional independence may not be a suitable notion for equivalence of two structures, as it does not reflect all the information in the distribution that is useful for identification of the underlying structure. In this paper, we present a general, unified notion of equivalence for linear Gaussian causal directed graphical models, whether they are cyclic or acyclic. In our proposed definition of equivalence, two structures are equivalent if they can generate the same set of data distributions. We also propose a weaker notion of equivalence called quasi-equivalence, which we show is the extent of identifiability from observational data. We propose analytic as well as graphical methods for characterizing the equivalence of two structures. Additionally, we propose a score-based method for learning the structure from observational data, which successfully deals with both acyclic and cyclic structures.

📄 PDF Abstract BibTeX arXiv:1910.12993

Code (1)

syanga/dglearn 공식 구현

Similar Papers 제목 키워드 기반

Characterizing bearing equivalence in directed graphs

2023-03-09 · Zhiyong Sun, Shiyu Zhao, Daniel Zelazo

In this paper, we study bearing equivalence in directed graphs. We first give a strengthened definition of bearing equivalence based on the \textit{kernel equivalence} relationship between bearing rigidity matrix and bea…

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 me…

A Transformational Characterization of Unconditionally Equivalent Bayesian Networks

2022-03-01 · Alex Markham, Danai Deligeorgaki, Pratik Misra, Liam Solus

We consider the problem of characterizing Bayesian networks up to unconditional equivalence, i.e., when directed acyclic graphs (DAGs) have the same set of unconditional $d$-separation statements. Each unconditional equi…

Causal structure learning with momentum: Sampling distributions over Markov Equivalence Classes of DAGs

2023-10-09 · Moritz Schauer, Marcel Wienöbst

In the context of inferring a Bayesian network structure (directed acyclic graph, DAG for short), we devise a non-reversible continuous time Markov chain, the ``Causal Zig-Zag sampler'', that targets a probability distri…

Causal DiscoveryGraph Sampling

Lower Bounds on the Size of Markov Equivalence Classes

2025-06-26 · Erik Jahn, Frederick Eberhardt, Leonard J. Schulman

Causal discovery algorithms typically recover causal graphs only up to their Markov equivalence classes unless additional parametric assumptions are made. The sizes of these equivalence classes reflect the limits of what…

Causal Discovery