Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs.

Marcel Wienöbst Max Bannach Maciej Liskiewicz

Published in: AAAI (2021)

Keyphrases

worst case
data structure
computational complexity
learning algorithm
machine learning algorithms
orders of magnitude
benchmark datasets
times faster
random sampling
markov chain
computationally efficient
theoretical analysis
directed acyclic graph
sampling algorithm