Spring 2022

Choosing Between Dags Can Be Hard

Friday, Feb. 11, 2022 1:30 pm1:40 pm PST

Add to Calendar


Richard Guo (University of Cambridge)


Calvin Lab Auditorium

Current methods for causal discovery typically report a single directed acyclic graph (DAG). Through an example, I hope to convince you that this might not be the best practice. In fact, depending on how two DAGs intersect and the local geometry at the intersection, the hardness of this problem can vary dramatically.