Efficiently solving convex relaxations for MAP estimation
Manish Kumar, Philip H. S. Torr · International Conference on Machine Learning · 2008
The problem of obtaining the maximum a posteriori (MAP) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build on the tree reweighted message passing (TRW) framework of (Kolmogorov, 2006; Wainwright et al., 2005). TRW iteratively optimizes the Lagrangian dual of a linear programming relaxation for MAP estimation. We show how the dual formulation of TRW can be extended to include cycle inequalities (Barahona & Mahjoub, 1986) and some recently proposed second order cone (SOC) constraints (Kumar et al., 2007). We propose efficient iterative algorithms for solving the resulting duals. Similar to the method described in (Kolmogorov, 2006), these algorithms are guaranteed to converge. We test our approach on a large set of synthetic data, as well as real data. Our experiments show that the additional constraints (i.e. cycle inequalities and SOC constraints) provide better results in cases where the TRW framework fails (namely MAP estimation for non-submodular energy functions).
Cited by 24 works. doi:10.1145/1390156.1390242
Authors
References
- Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Convergent Tree-Reweighted Message Passing for Energy Minimization
- MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
- A Comparative Study of Energy Minimization Methods for Markov Random Fields
- On the cut polytope
- Globally optimal solutions for energy minimization in stereo vision using reweighted belief propagation
- New Outer Bounds on the Marginal Polytope
- Outward rotations
- Minimum 0-Extensions of Graph Metrics