Approximation algorithms for max-sum-product problems

Authors:
Denis D. Mauá
Affiliations:
Istituto "Dalle Molle" di Studi sul'Intelligenza Artificiale, Switzerland
Venue:
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Year:
2013

Citing 5
Cited 0

Mini-buckets: A general scheme for bounded inference

Journal of the ACM (JACM)
Solving MAP exactly using systematic search

UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
New complexity results for MAP in Bayesian networks

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Updating credal networks is approximable in polynomial time

International Journal of Approximate Reasoning
Solving limited memory influence diagrams

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many tasks in probabilistic reasoning can be cast as max-sum-product problems, a hard class of combinatorial problems. We describe our results in obtaining a new approximation scheme for the problem, that can be turned into an anytime procedure. For many tasks, this scheme can be shown to be asymptotically the best possible heuristic.