YoVDO

Revisiting Bayesian Network Learning with Small Vertex Cover

Offered By: Uncertainty in Artificial Intelligence via YouTube

Tags

Bayesian Networks Courses Computational Complexity Courses Polynomial Time Algorithm Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a conference talk from the Uncertainty in Artificial Intelligence (UAI) 2023 conference that delves into the complexities of Bayesian network structure learning. Investigate the potential for improving polynomial algorithms in DAGs with bounded vertex cover numbers and examine the challenges of Bayesian learning through sampling and weighted counting of DAGs. Learn about the #P-hardness proof for the general counting problem and the #W[1]-hardness of counting under vertex-cover constraints. Gain insights from the research of Juha Harviainen and Mikko Koivisto as they revisit and expand upon previous work in this field, offering new perspectives on the computational complexity of Bayesian network learning.

Syllabus

UAI 2023 Oral Session 5: Revisiting Bayesian Network Learning with Small Vertex Cover


Taught by

Uncertainty in Artificial Intelligence

Related Courses

Probabilistic Graphical Models 1: Representation
Stanford University via Coursera
Probabilistic Graphical Models 3: Learning
Stanford University via Coursera
Graphical Models Certification Training
Edureka
Probabilistic Machine Learning
Eberhard Karls University of Tübingen via YouTube
An Introduction to Artificial Intelligence
NPTEL via YouTube