Solving Marginal MAP Exactly by Probabilistic Circuit Transformations
Explore a novel approach to solving marginal MAP queries in probabilistic circuits (PCs) through iterative circuit transformations. Learn about a groundbreaking marginal MAP solver that relaxes structural constraints and employs a pruning algorithm to remove irrelevant parts of the PC. Discover how this technique enables the tightening of lower and upper bounds for marginal MAP queries, ultimately leading to exact solutions without search. Gain insights into the application of this method to decision-making problems and its potential to enhance the efficiency of probabilistic inference in PCs. Delve into the work presented by YooJung Choi from Arizona State University as part of the Probabilistic Circuits and Logic series at the Simons Institute.