Hariprasad Kannan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Hariprasad Kannan has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Nikos Paragios
MICS Laboratory, CentraleSupélec, Université Paris-Saclay, Gif-sur-Yvette, France.
2 shared publications - Nikos Komodakis
ParisTech Université Paris-Est École des Ponts
1 shared publication - Nikos Komodakis
Archimedes, Athena Research Center
1 shared publication
Latest Publications
- Open Access
- 23 July 2019
- Published by Elsevier
- p. 351-400
Tighter continuous relaxations for MAP inference in discrete MRFs: A survey
- 23 July 2019
- Published by Elsevier
- p. 351-400
Open AccessTighter continuous relaxations for MAP inference in discrete MRFs: A survey
- Open Access
Newton-type Methods for Inference in Higher-Order Markov Random Fields
Linear programming relaxations are central to {\sc 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 {\sc 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.
Open AccessNewton-type Methods for Inference in Higher-Order Markov Random Fields
Linear programming relaxations are central to {\sc 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 {\sc 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.