And/or search for marginal map

R Marinescu, J Lee, R Dechter, A Ihler - Journal of Artificial Intelligence …, 2018 - jair.org
Mixed inference such as the marginal MAP query (some variables marginalized by
summation and others by maximization) is key to many prediction and decision models. It is …

[PDF][PDF] Finite-sample Bounds for Marginal MAP.

Q Lou, R Dechter, A Ihler - UAI, 2018 - academia.edu
Marginal MAP is a key task in Bayesian inference and decision-making, and known to be
very challenging in general. In this paper, we present an algorithm that blends heuristic …

Anytime recursive best-first search for bounding marginal map

R Marinescu, A Kishimoto, A Botea, R Dechter… - Proceedings of the AAAI …, 2019 - aaai.org
Marginal MAP is a difficult mixed inference task for graphical models. Existing state-of-the-art
solvers for this task are based on a hybrid best-first and depth-first search scheme that …

Anytime anyspace AND/OR best-first search for bounding marginal MAP

Q Lou, R Dechter, A Ihler - Proceedings of the AAAI Conference on …, 2018 - ojs.aaai.org
Marginal MAP is a key task in Bayesian inference and decision-making. It is known to be
very difficult in general, particularly because the evaluation of each MAP assignment …

Solving marginal map problems with np oracles and parity constraints

Y Xue, Z Li, S Ermon, CP Gomes… - Advances in Neural …, 2016 - proceedings.neurips.cc
Arising from many applications at the intersection of decision-making and machine learning,
Marginal Maximum A Posteriori (Marginal MAP) problems unify the two main classes of …

[PDF][PDF] Stochastic Anytime Search for Bounding Marginal MAP.

R Marinescu, R Dechter, A Ihler - IJCAI, 2018 - ics.uci.edu
The Marginal MAP inference task is known to be extremely hard particularly because the
evaluation of each complete MAP assignment involves an exact likelihood computation (a …

Parallel AND/OR search for marginal MAP

R Marinescu, A Kishimoto, A Botea - … of the AAAI Conference on Artificial …, 2020 - ojs.aaai.org
Marginal MAP is a difficult mixed inference task for graphical models. Existing state-of-the-art
algorithms for solving exactly this task are based on either depth-first or best-first sequential …

From exact to anytime solutions for marginal MAP

J Lee, R Marinescu, R Dechter, A Ihler - Proceedings of the AAAI …, 2016 - ojs.aaai.org
This paper explores the anytime performance of search-based algorithms for solving the
Marginal MAP task over graphical models. The current state of the art for solving this …

Decomposition bounds for marginal MAP

W Ping, Q Liu, AT Ihler - Advances in neural information …, 2015 - proceedings.neurips.cc
Marginal MAP inference involves making MAP predictions in systems defined with latent
variables or missing information. It is significantly more difficult than pure marginalization …

Anytime best+ depth-first search for bounding marginal MAP

R Marinescu, J Lee, A Ihler, R Dechter - Proceedings of the AAAI …, 2017 - ojs.aaai.org
We introduce new anytime search algorithms that combine best-first with depth-first search
into hybrid schemes for Marginal MAP inference in graphical models. The main goal is to …