paper-with-me

Papers

Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs

2020-12-17 · Marcel Wienöbst, Max Bannach, Maciej Liśkiewicz

Counting and uniform sampling of directed acyclic graphs (DAGs) from a Markov equivalence class are fundamental tasks in graphical causal analysis. In this paper, we show that these tasks can be performed in polynomial time, solving a long-standing open problem in this area. Our algorithms are effective and easily implementable. Experimental results show that the algorithms significantly outperform state-of-the-art methods.

📄 PDF Abstract BibTeX arXiv:2012.09679

Code (1)

mwien/CliquePicking 공식 구현

Similar Papers 제목 키워드 기반

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

2022-05-05 · Marcel Wienöbst, Max Bannach, Maciej Liśkiewicz

Counting and sampling directed acyclic graphs from a Markov equivalence class are fundamental tasks in graphical causal analysis. In this paper we show that these tasks can be performed in polynomial time, solving a long…

Active Learning

Counting Markov Equivalent Directed Acyclic Graphs Consistent with Background Knowledge

2022-06-14 · Vidya Sagar Sharma

A polynomial-time exact algorithm for counting the number of directed acyclic graphs in a Markov equivalence class was recently given by Wien\"obst, Bannach, and Li\'skiewicz (AAAI 2021). In this paper, we consider the m…

Inference and Sampling of $K_{33}$-free Ising Models

2018-12-22 · Valerii Likhosherstov, Yury Maximov, Michael Chertkov

We call an Ising model tractable when it is possible to compute its partition function value (statistical inference) in polynomial time. The tractability also implies an ability to sample configurations of this model in …

Counting and Sampling from Markov Equivalent DAGs Using Clique Trees

2018-02-05 · AmirEmad Ghassami, Saber Salehkaleybar, Negar Kiyavash, Kun Zhang

A directed acyclic graph (DAG) is the most common graphical model for representing causal relationships among a set of variables. When restricted to using only observational data, the structure of the ground truth DAG is…

Causal Inference

On Exact Sampling in the Two-Variable Fragment of First-Order Logic

2023-02-06 · Yuanhong Wang, Juhua Pu, Yuyi Wang, Ondřej Kuželka

In this paper, we study the sampling problem for first-order logic proposed recently by Wang et al. -- how to efficiently sample a model of a given first-order sentence on a finite domain? We extend their result for the …

Sentence