YoVDO

Leveraging Tree Automata Approximation Results for Efficient Sampling and Counting

Offered By: Simons Institute via YouTube

Tags

Algorithms Courses Computer Science Courses Probabilistic Circuits Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore efficient sampling and counting techniques for Boolean circuits in this 38-minute lecture by Marcelo Arenas from PUC Chile and RelationalAI. Delve into the challenges of counting satisfying assignments and sampling these assignments in Boolean circuits, and discover how recent advancements in tree automata approximation can be applied to develop polynomial-time approximation algorithms for structured DNNF circuits. Learn about the intersection of probabilistic circuits and logic, and gain insights into innovative approaches for tackling fundamental problems in computer science and artificial intelligence.

Syllabus

Leveraging tree automata approximation results for efficient sampling and counting...


Taught by

Simons Institute

Related Courses

Probabilistic Graphical Models 1: Representation
Stanford University via Coursera Computer Security
Stanford University via Coursera Intro to Computer Science
University of Virginia via Udacity Introduction to Logic
Stanford University via Coursera Internet History, Technology, and Security
University of Michigan via Coursera