DeepAI AI Chat
Log In Sign Up

Approximate MMAP by Marginal Search

by   Alessandro Antonucci, et al.

We present a heuristic strategy for marginal MAP (MMAP) queries in graphical models. The algorithm is based on a reduction of the task to a polynomial number of marginal inference computations. Given an input evidence, the marginals mass functions of the variables to be explained are computed. Marginal information gain is used to decide the variables to be explained first, and their most probable marginal states are consequently moved to the evidence. The sequential iteration of this procedure leads to a MMAP explanation and the minimum information gain obtained during the process can be regarded as a confidence measure for the explanation. Preliminary experiments show that the proposed confidence measure is properly detecting instances for which the algorithm is accurate and, for sufficiently high confidence levels, the algorithm gives the exact solution or an approximation whose Hamming distance from the exact one is small.


page 1

page 2

page 3

page 4


MAP Inference for Probabilistic Logic Programming

In Probabilistic Logic Programming (PLP) the most commonly studied infer...

Discrete Bayesian Networks: The Exact Posterior Marginal Distributions

In a Bayesian network, we wish to evaluate the marginal probability of a...

Marginal Inference queries in Hidden Markov Models under context-free grammar constraints

The primary use of any probabilistic model involving a set of random var...

Barrier Frank-Wolfe for Marginal Inference

We introduce a globally-convergent algorithm for optimizing the tree-rew...

Anytime Marginal MAP Inference

This paper presents a new anytime algorithm for the marginal MAP problem...

Cox reduction and confidence sets of models: a theoretical elucidation

For sparse high-dimensional regression problems, Cox and Battey [1, 9] e...

Code Repositories