Efficient Stochastic Local Search for MPE Solving

  title={Efficient Stochastic Local Search for MPE Solving},
  author={Frank Hutter and Holger H. Hoos and Thomas St{\"u}tzle},
Finding most probable explanations (MPEs) in graphical models, such as Bayesian belief networks, is a fundamental problem in reasoning under uncertainty, and much effort has been spent on developing effective algorithms for this NP-hard problem. Stochastic local search (SLS) approaches to MPE solving have previously been explored, but were found to be not competitive with state-of-theart branch & bound methods. In this work, we identify the shortcomings of earlier SLS algorithms for the MPE… CONTINUE READING
Highly Cited
This paper has 53 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 39 extracted citations

53 Citations

Citations per Year
Semantic Scholar estimates that this publication has 53 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 14 references

Using Weighted MAX-SAT Engines to Solve MPE

AAAI/IAAI • 2002
View 12 Excerpts
Highly Influenced

Systematic vs

R. Marinescu, K. Kask, R. Dechter
non-systematic algorithms for solving the MPE task. InProc. of UAI-03 • 2003
View 6 Excerpts
Highly Influenced

Fast Approximate Energy Minimization via Graph Cuts

IEEE Trans. Pattern Anal. Mach. Intell. • 2001
View 4 Excerpts
Highly Influenced

Master’s thesis

F. Hutter. Stochastic local search for solving the mo networks
Darmstadt University of Technology, Darmstadt, Germany, September • 2004
View 1 Excerpt

Understanding belief propagation and its generalizations

Yedidiaet al, 2002 J.S Yedidia, W. T. Freeman, Y. Weiss

Similar Papers

Loading similar papers…