Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications

5 May 2022

Papers citing "Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications"

9 / 9 papers shown

Title
Sample Efficient Bayesian Learning of Causal Graphs from Interventions Zihan Zhou Muhammad Qasim Elahi Murat Kocaoglu CML 24 0 0 26 Oct 2024
New metrics and search algorithms for weighted causal DAGs Davin Choo Kirankumar Shiragur CML 19 1 0 08 May 2023
Practical Algorithms for Orientations of Partially Directed Graphical Models Malte Luttermann Marcel Wienöbst Maciej Liskiewicz CML 19 1 0 28 Feb 2023
Counting Markov Equivalent Directed Acyclic Graphs Consistent with Background Knowledge Vidya Sagar Sharma 28 0 0 14 Jun 2022
Fast Causal Orientation Learning in Directed Acyclic Graphs Ramin Safaeian Saber Salehkaleybar M. Tabandeh CML 20 2 0 27 May 2022
A Unified Experiment Design Approach for Cyclic and Acyclic Causal Models Ehsan Mokhtarian Saber Salehkaleybar AmirEmad Ghassami Negar Kiyavash 22 3 0 20 May 2022
Near-Optimal Multi-Perturbation Experimental Design for Causal Structure Learning Scott Sussex Andreas Krause Caroline Uhler CML 14 20 0 28 May 2021
Formulas for Counting the Sizes of Markov Equivalence Classes of Directed Acyclic Graphs Yangbo He Bin Yu 13 14 0 23 Oct 2016
Causal Inference and Causal Explanation with Background Knowledge Christopher Meek CML 216 626 0 20 Feb 2013