Newton-type Methods for Inference in Higher-Order Markov Random Fields

Abstract : Linear programming relaxations are central to MAP inference in discrete Markov Random Fields. The ability to properly solve the Lagrangian dual is a critical component of such methods. In this paper, we study the benefit of using Newton-type methods to solve the Lagrangian dual of a smooth version of the problem. We investigate their ability to achieve superior convergence behavior and to better handle the ill-conditioned nature of the formulation, as compared to first order methods. We show that it is indeed possible to efficiently apply a trust region Newton method for a broad range of MAP inference problems. In this paper we propose a provably convergent and efficient framework that includes (i) excellent compromise between computational complexity and precision concerning the Hessian matrix construction, (ii) a damping strategy that aids efficient optimization , (iii) a truncation strategy coupled with a generic pre-conditioner for Conjugate Gradients, (iv) efficient sum-product computation for sparse clique potentials. Results for higher-order Markov Random Fields demonstrate the potential of this approach.
Liste complète des métadonnées

Cited literature [38 references]  Display  Hide  Download
Contributor : Hariprasad Kannan <>
Submitted on : Sunday, September 3, 2017 - 8:32:28 AM
Last modification on : Thursday, February 7, 2019 - 5:29:13 PM
Document(s) archivé(s) le : Monday, December 11, 2017 - 6:06:35 PM


Files produced by the author(s)


  • HAL Id : hal-01580862, version 1


Hariprasad Kannan, Nikos Komodakis, Nikos Paragios. Newton-type Methods for Inference in Higher-Order Markov Random Fields. IEEE International Conference on Computer Vision and Pattern Recognition, Jul 2017, Honolulu, United States. pp.7224 - 7233. ⟨hal-01580862⟩



Record views


Files downloads