On Finding Modes of Gaussian Sum-Product Networks

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



Duration: 45:08
271 views
13


Denis Maua (University of Sao Paulo)
https://simons.berkeley.edu/talks/denis-maua-university-sao-paulo-2023-10-20
Probabilistic Circuits and Logic

Finding a high probability mode of a probability distribution is an important step in many machine-learning tasks such as structured prediction. In fact, this was exactly the inference used in the seminal paper by Poon and Domingos to show the effectiveness of Sum-Product Networks. Very often, one is also interested in finding many relevant modes, for example, when one is interested in analizying the robustness of the particular mode to perturbations in the model or when one seeks producing a diverse set of representative solutions to the task. There has been very few work and very limited progress in finding and analyzing modes of non-determinstic Probabilistic Circuits. In this talk, I will discuss the motivation, challenges, and tractability of finding modes in Probabilistic Circuits, with focus on Gaussian Sum-Product Networks.




Other Videos By Simons Institute for the Theory of Computing


2023-10-27Revealed Preferences of One-Sided Matching
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...



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