Introduction to Dual Decomposition for Inference

Introduction to Dual Decomposition for Inference

Cached

Download Links

by David Sontag , Amir Globerson , Tommi Jaakola

Citations:

BibTeX

@MISC{Sontag_introductionto,
    author = {David Sontag and Amir Globerson and Tommi Jaakola},
    title = { Introduction to Dual Decomposition for Inference},
    year = {}
}

Bookmark

OpenURL

Abstract

Citations

554	Nonlinear programming, Athena Scientific - Bertsekas - 1995
192	Minimization Methods for Non-differentiable Functions - Shor - 1985
182	The Lagrangian relaxation method for solving integer programming problems - Fisher - 1981
177	2005b. Non-projective dependency parsing using spanning tree algorithms - McDonald, Pereira, et al.
117	Probabilistic Graphical Models: Principles and Techniques - Koller, Friedman - 2009
96	Lagrangean relaxation for integer programming - Geoffrion - 1974
76	MAP estimation via agreement on trees: messagepassing and linear programming. Information Theory - Wainwright, Jaakkola, et al. - 2005
73	Tree-based reparameterization framework for analysis of sum-product and related algorithms - Wainwright, Jaakkola, et al. - 2003
57	Auction algorithms for network flow problems: A tutorial introduction - Bertsekas - 1992
45	Fixing maxproduct: Convergent message passing algorithms for MAP LP-relaxations - Globerson, Jaakkola - 2007
41	On the optimality of treereweighted max-product message passing - Kolmogorov, Wainwright - 2005
38	Tightening LP relaxations for MAP using message passing - Sontag, Meltzer, et al. - 2008
33	Linear programming relaxations and belief propagation - an empirical study - Yanover, Meltzer, et al. - 1907
32	MAP estimation, linear programming and belief propagation with convex free energies - Weiss, Yanover, et al.
31	Dual decomposition for parsing with non-projective head automata - Koo, Rush, et al. - 2010
30	Word alignment via quadratic assignment - Lacoste-Julien, Taskar, et al. - 2006
25	Using Combinatorial Optimization within Max-Product Belief Propagation - Duchi, Tarlow, et al. - 2006
23	Syntactic analysis of two-dimensional visual signals in noisy conditions - Schlesinger - 1976
22	On the complexity of non-projective data-driven dependency parsing - McDonald, Satta - 2007
22	High-arity interactions, polyhedral relaxations, and cutting plane algorithm for soft constraint optimisation (MAP-MRF - Werner - 2008
18	Minimizing sparse higher order energy functions of discrete variables - Rother, Kohli, et al. - 2009
16	Tree block coordinate descent for MAP in graphical models - Sontag, Jaakkola - 2009
15	Efficient inference with cardinality-based clique potentials - Gupta, Diwan, et al. - 2007
13	Minimizing and learning energy functions for side-chain prediction - Yanover, Schueler-Furman, et al. - 2007
10	Lagrangian Relaxation - Lemaréchal - 2001
10	Approximate primal solutions and rate analysis for dual subgradient methods - Nedić, Ozdaglar - 2009
10	HOP-MAP: Efficient message passing with high order potentials - Tarlow, Givoni, et al. - 2010
8	MRF energy minimization and beyond via dual decomposition - Komodakis, Paragios, et al. - 2011
7	Norm-product belief propagation: primal-dual message-passing for approximate inference - Hazan, Shashua - 2010
6	Two well-known properties of subgradient optimization - Anstreicher, Wolsey - 2009
6	Convex Relaxation Methods for Graphical Models: Lagrangian and Maximum Entropy Approaches - Johnson - 2008
6	A diffusion algorithm for decreasing energy of max-sum labeling problem - Kovalevsky, Koval - 1975
1	Lagrangean relaxation. TOP: An Official Journal of the Spanish Society of Statistics and - Guignard - 1987
1	An application-oriented guide for designing lagrangean dual ascent algorithms - Guignard, Rosenwein - 1989