Establishing Markov Equivalence in Cyclic Directed Graphs - UAI 2023 Oral Session 3
Offered By: Uncertainty in Artificial Intelligence via YouTube
Course Description
Overview
Explore a groundbreaking 25-minute conference talk from the Uncertainty in Artificial Intelligence (UAI) 2023 Oral Session that introduces a novel, efficient procedure for establishing Markov equivalence in cyclic directed graphs. Delve into the work of Tom Claassen and Joris Mooij as they present their research based on the Cyclic Equivalence Theorem (CET) from Thomas Richardson's seminal works on cyclic models. Discover how the authors reframe the CET from an ancestral perspective, leading to a characterization that eliminates the need for explicit d-separation tests and significantly reduces algorithmic complexity. Learn about the potential impact of this conceptually simplified approach on reinvigorating theoretical research in cyclic discovery, particularly in the presence of latent confounders. Access the presentation slides to gain a deeper understanding of this innovative contribution to the field of artificial intelligence and graph theory.
Syllabus
UAI 2023 Oral Session 3: Establishing Markov Equivalence in Cyclic Directed Graphs
Taught by
Uncertainty in Artificial Intelligence
Related Courses
مقدمة في علم الحاسوب والبرمجةMassachusetts Institute of Technology via Edraak Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer Computational Thinking using Python
Massachusetts Institute of Technology via edX Java: Algorithms
Codecademy Technical Interview Practice with Java
Codecademy