Counting and Sampling from Markov Equivalent DAGs Using Clique Trees

v1v2 (latest)

Counting and Sampling from Markov Equivalent DAGs Using Clique Trees

5 February 2018

AmirEmad Ghassami

Saber Salehkaleybar

ArXiv (abs)PDF HTML

Papers citing "Counting and Sampling from Markov Equivalent DAGs Using Clique Trees"

8 / 8 papers shown

Title
Counting Markov Equivalent Directed Acyclic Graphs Consistent with Background Knowledge Vidya Sagar Sharma 60 1 0 14 Jun 2022
Causal Structure Learning: a Combinatorial Perspective C. Squires Caroline Uhler CML 120 47 0 02 Jun 2022
A Unified Experiment Design Approach for Cyclic and Acyclic Causal Models Ehsan Mokhtarian Saber Salehkaleybar AmirEmad Ghassami Negar Kiyavash 91 3 0 20 May 2022
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications Marcel Wienöbst Max Bannach Maciej Liskiewicz 49 10 0 05 May 2022
Active Structure Learning of Causal DAGs via Directed Clique Tree C. Squires Sara Magliacane Kristjan Greenewald Dmitriy A. Katz Murat Kocaoglu Karthikeyan Shanmugam CML 118 34 0 01 Nov 2020
Active Learning of Causal Structures with Deep Reinforcement Learning Amir Amirinezhad Saber Salehkaleybar Matin Hashemi CML 74 12 0 07 Sep 2020
LazyIter: A Fast Algorithm for Counting Markov Equivalent DAGs and Designing Experiments Ali AhmadiTeshnizi Saber Salehkaleybar Negar Kiyavash CML 62 10 0 17 Jun 2020
Interventional Experiment Design for Causal Structure Learning AmirEmad Ghassami Saber Salehkaleybar Negar Kiyavash CML 50 10 0 12 Oct 2019