Winning the PASCAL 2011 MAP Challenge with Enhanced AND / OR Branch-and-Bound

This paper describes our entry for the MAP/MPE track of the PA SC L 2011 Probabilistic Inference Challenge, which placed first in al l three time limit categories, 20 seconds, 20 minutes, and 1 hour. Our baseline is a b ranch-and-bound algorithm that explores the AND/OR context-minimal search graph of a graphical model guided by a mini-bucket heuristic. Augmented with rec ent advances that convert the algorithm into an anytime scheme, that improve t he heuristic power via cost-shifting schemes, and using enhanced variable ord ering schemes, it constitutes one of the most powerful MAP/MPE inference methods t date.

[1]  T. Schiex.  Arc consistency for soft constraints , 2000, Artif. Intell..

[2]  Rina Dechter,et al.  A general scheme for automatic generation of search heuristics from specification dependencies , 2001, Artif. Intell..

[3]  Rina Dechter,et al.  Mini-buckets: A general scheme for bounded inference , 2003, JACM.

[4]  Thomas Stützle,et al.  Efficient Stochastic Local Search for MPE Solving , 2005, IJCAI.

[5]  Javier Larrosa,et al.  Unifying tree decompositions for reasoning in graphical models , 2005, Artif. Intell..

[6]  Martin J. Wainwright,et al.  MAP estimation via agreement on (hyper)trees: Message-passing and linear programming , 2005, ArXiv.

[7]  Rina Dechter,et al.  AND/OR search spaces for graphical models , 2007, Artif. Intell..

[8]  Tommi S. Jaakkola,et al.  Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations , 2007, NIPS.

[9]  Nikos Komodakis,et al.  Beyond Loose LP-Relaxations: Optimizing MRFs by Repairing Cycles , 2008, ECCV.

[10]  Tommi S. Jaakkola,et al.  Tightening LP Relaxations for MAP using Message Passing , 2008, UAI.

[11]  Rina Dechter,et al.  AND/OR Branch-and-Bound search for combinatorial optimization in graphical models , 2009, Artif. Intell..

[12]  Rina Dechter,et al.  Memory intensive AND/OR search for combinatorial optimization in graphical models , 2009, Artif. Intell..

[13]  D. Sontag.  1 Introduction to Dual Decomposition for Inference , 2010 .

[14]  Martin C. Cooper,et al.  Soft arc consistency revisited , 2010, Artif. Intell..

[15]  Andrew Gelfand,et al.  Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models , 2011, AAAI.

[16]  Lars Otten,et al.  Anytime AND/OR depth-first search for combinatorial optimization , 2011, AI Commun..

[17]  Larry S. Davis,et al.  Multi-agent event recognition in structured scenarios , 2011, CVPR 2011.

[18]  Patrice Boizumault,et al.  Guiding VNS with Tree Decomposition , 2011, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence.

[19]  Lars Otten,et al.  Join-graph based cost-shifting schemes , 2012, UAI.

[20]  Larry S. Davis,et al.  Tracking People's Hands and Feet Using Mixed Network AND/OR Search , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.