Web: http://arxiv.org/abs/2205.02654

May 6, 2022, 1:10 a.m. | Marcel Wienöbst, Max Bannach, Maciej Liśkiewicz

stat.ML updates on arXiv.org arxiv.org

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-standing open
problem in this area. Our algorithms are effective and easily implementable. As
we show in experiments, these breakthroughs make thought-to-be-infeasible
strategies in active learning of causal structures and causal effect
identification with regard to a Markov equivalence class practically
applicable.

algorithms applications arxiv markov polynomial sampling time

More from arxiv.org / stat.ML updates on arXiv.org

Data Analyst, Patagonia Action Works

@ Patagonia | Remote

Data & Insights Strategy & Innovation General Manager

@ Chevron Services Company, a division of Chevron U.S.A Inc. | Houston, TX

Faculty members in Research areas such as Bayesian and Spatial Statistics; Data Privacy and Security; AI/ML; NLP; Image and Video Data Analysis

@ Ahmedabad University | Ahmedabad, India

Director, Applied Mathematics & Computational Research Division

@ Lawrence Berkeley National Lab | Berkeley, Ca

Business Data Analyst

@ MainStreet Family Care | Birmingham, AL

Assistant/Associate Professor of the Practice in Business Analytics

@ Georgetown University McDonough School of Business | Washington DC