Complexity Results and Approximation Strategies for MAP Explanations
A. Darwiche, J. D. Park

TL;DR
This paper explores the computational complexity of MAP inference in Bayesian networks, proving its hardness, and introduces approximation frameworks that outperform standard methods in difficult scenarios.
Contribution
It establishes MAP as NP^PP-complete, shows its hardness even in restricted networks, and proposes new approximation algorithms with practical effectiveness.
Findings
MAP is NP^PP-complete and hard to approximate.
Approximation algorithms outperform standard techniques.
Effective MAP estimates are achievable in complex networks.
Abstract
MAP is the problem of finding a most probable instantiation of a set of variables given evidence. MAP has always been perceived to be significantly harder than the related problems of computing the probability of a variable instantiation Pr, or the problem of computing the most probable explanation (MPE). This paper investigates the complexity of MAP in Bayesian networks. Specifically, we show that MAP is complete for NP^PP and provide further negative complexity results for algorithms based on variable elimination. We also show that MAP remains hard even when MPE and Pr become easy. For example, we show that MAP is NP-complete when the networks are restricted to polytrees, and even then can not be effectively approximated. Given the difficulty of computing MAP exactly, and the difficulty of approximating MAP while providing useful guarantees on the resulting approximation, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
