Marginal Determinism in Structured Decomposable Circuits

Published on ● Video Link: https://www.youtube.com/watch?v=0ho1RZyIkdM



Duration: 43:23
242 views
5


Benjie Wang (University of Oxford)
https://simons.berkeley.edu/talks/benjie-wang-university-oxford-2023-10-20
Probabilistic Circuits and Logic

Probabilistic circuits (PCs) are a class of tractable probabilistic models, which admit efficient inference routines depending on their properties. In this talk, I will discuss the property of marginal determinism, and introduce md-vtrees, a novel structural formulation of (marginal) determinism in structured decomposable PCs, which generalizes previously proposed classes such as probabilistic sentential decision diagrams. I will further show how md-vtrees can be used to derive tractability conditions and efficient algorithms for compositional inference queries, in a sound and generalizable manner. In particular, this enables us to derive the first polytime algorithms for causal inference queries such as backdoor adjustment on PCs.




Other Videos By Simons Institute for the Theory of Computing


2023-10-27Strict Core Stability and Strategy-Proofness for Hedonic Games with Friend-Oriented Preferences
2023-10-27Market Design for Priority-Based Assignment with Distributional Objectives
2023-10-27Estimating Separable Matching Models
2023-10-27The Intractability of Hylland-Zeckhauser and its Aftermath
2023-10-27Endogenous Market Formation: Theory and Evidence from Chilean College Admissions
2023-10-26Algorithmic Mechanism Design with Investment
2023-10-20Utilizing Structure in Combinatorial Solving and Reasoning
2023-10-20Approximating the TV Distance Between Two Product Distributions
2023-10-20Tractable Control for Autoregressive Language Generation
2023-10-20On Finding Modes of Gaussian Sum-Product Networks
2023-10-20Marginal Determinism in Structured Decomposable Circuits
2023-10-19Weighted Model Integration
2023-10-19An Approximate Skolem Function Counter
2023-10-19Subtractive Mixture Models: Representation and Learning
2023-10-19The Rise of Tractable Circuits: From Cryptography to Continuous Generative Models
2023-10-19Decision Diagrams for Efficient Inference and Optimization in Expressive Discrete+Continuous Domains
2023-10-18Solving Marginal MAP Exactly by Probabilistic Circuit Transformations
2023-10-18Direct Access for Conjunctive Queries with Negation
2023-10-18Factorized Databases
2023-10-18Leveraging tree automata approximation results for efficient sampling and counting...
2023-10-18Efficient Enumeration Algorithms via Circuits



Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Probabilistic Circuits and Logic
Benjie Wang