3 citations · 4 across the 6 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2020
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs
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 thes…
cs.LG2020★ 3 cited
Recovering Causal Structures from Low-Order Conditional Independencies
Marcel Wienöbst, Maciej Liśkiewicz
One of the common obstacles for learning causal models from data is that high-order conditional independence (CI) relationships between random variables are difficult to estimate.…