2022
Almost Optimal Universal Lower Bound for Learning Causal DAGs with Atomic Interventions
AISTATS 2022poster
A well-studied challenge that arises in the structure learning problem of causal directed acyclic graphs (DAG) is that using observational data, one can only learn the graph up to a "Markov equivalence class" (MEC). The remaining undirected edges have to be oriented using interventions, which can be…