Globally convergent dual MAP LP relaxation solvers using Fenchel-Young margins

Advances in Neural Information Processing Systems

Volumn 3, Issue , 2012, Pages 2384-2392

  Schwing, Alexander G ^a   Hazan, Tamir ^b   Urtasun, Raquel ^a   Pollefeys, Marc ^b  

^a ETH ZURICH   (Switzerland)

^b TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK COORDINATE DESCENTS; DESCENT DIRECTIONS; DUALITY THEOREMS; GLOBALLY CONVERGENT; PRIMAL OPTIMAL SOLUTIONS; PROTEIN INTERACTION; SPIN-GLASS MODELS; SUBDIFFERENTIALS;

OPTIMIZATION;

EID: 84877748576     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. A. Auslender and M. Teboulle. Interior gradient and epsilon-subgradient descent methods for constrained convex minimization. Mathematics of Operations Research, 2004.
2. D. P. Bertsekas, A. Nedí and A. E. Ozdaglar. Convex Analysis and Optimization. Athena Scientific, 2003.
3. A. Globerson and T. S. Jaakkola. Fixing max-product: convergent message passing algorithms for MAP relaxations. In Proc. NIPS, 2007.
4. S. Gould, O. Russakovsky, I. Goodfellow, P. Baumstarck, A. Y. Ng, and D. Koller. The STAIR Vision Library (v2.4), 2011. http://ai.stanford.edu/ sgould/svl.
5. T. Hazan, J. Peng, and A. Shashua. Tightening fractional covering upper bounds on the partition function for high-order region graphs. In Proc. UAI, 2012.
6. T. Hazan and A. Shashua. Norm-product belief propagation: Primal-dual message-passing for approximate inference. Trans. on Information Theory, 2010.
7. J. K. Johnson. Convex relaxation methods for graphical models: Lagrangian and maximum entropy approaches. PhD thesis, Massachusetts Institute of Technology, 2008.
8. V. Jojic, S. Gould, and D. Koller. Accelerated dual decomposition for MAP inference. In Proc. ICML, 2010.
9. J. H. Kappes, B. Savchynskyy, and C. Schnörr. A Bundle Approach To Efficient MAP-Inference by Lagrangian Relaxation. In Proc. CVPR, 2012.
10. D. Koller and N. Friedman. Probabilistic graphical models. MIT Press, 2009.
11. V. Kolmogorov. Convergent tree-reweighted message passing for energy minimization. PAMI, 2006.
12. N. Komodakis, N. Paragios, and G. Tziritas. MRF Energy Minimization & Beyond via Dual Decomposition. PAMI, 2010.
13. T. Koo, A.M. Rush, M. Collins, T. Jaakkola, and D. Sontag. Dual decomposition for parsing with nonprojective head automata. In Proc. EMNLP, 2010.
14. A.M.C.A. Koster, S.P.M. van Hoesel, and A.W.J. Kolen. The partial constraint satisfaction problem: Facets and lifting theorems. Operations Research Letters, 1998.
15. C. Lemaréchal. An algorithm for minimizing convex functions. Information processing, 1974.
16. A.F.T. Martins, M.A.T. Figueiredo, P.M.Q. Aguiar, N.A. Smith, and E.P. Xing. An Augmented Lagrangian Approach to Constrained MAP Inference. In Proc. ICML, 2011.
17. T. Meltzer, A. Globerson, and Y. Weiss. Convergent Message Passing Algorithms - A Unifying View. In Proc. UAI, 2009.
18. O. Meshi and A. Globerson. An Alternating Direction Method for Dual MAP LP Relaxation. In Proc. ECML PKDD, 2011.
19. P. Ravikumar, A. Agarwal, and M. J.Wainwright. Message-passing for graph-structured linear programs: Proximal methods and rounding schemes. JMLR, 2010.
20. M. Schlesinger. Syntactic analysis of two-dimensional visual signals in noisy conditions. Kibernetika,76.
21. A. G. Schwing, T. Hazan, M. Pollefeys, and R. Urtasun. Distributed message passing for large scale graphical models. In Proc. CVPR, 2011.]
22. D. Sontag and T. S. Jaakkola. Tree block coordinate descent for MAP in graphical models. In Proc. AISTATS, 2009.
23. D. Sontag, T. Meltzer, A. Globerson, T. Jaakkola, and Y.Weiss. Tightening LP relaxations for MAP using message passing. In Proc. UAI, 2008.
24. D. Tarlow, D. Batra, P. Kohli, and V. Kolmogorov. Dynamic tree block coordinate ascent. In Proc. ICML, 2011.
25. M. J. Wainwright, T. S. Jaakkola, and A. S. Willsky. MAP estimation via agreement on trees: messagepassing and linear programming. Trans. on Information Theory, 2005.
26. Y.Weiss, C. Yanover, and T. Meltzer. MAP Estimation, Linear Programming and Belief Propagation with Convex Free Energies. In Proc. UAI, 2007.
27. T. Werner. Revisiting the linear programming relaxation approach to gibbs energy minimization and weighted constraint satisfaction. PAMI, 2010.
28. P. Wolfe. A method of conjugate subgradients for minimizing nondifferentiable functions. Nondifferentiable Optimization, 1975.
29. J. S. Yedidia, W. T. Freeman, and Y. Weiss. Constructing free-energy approximations and generalized belief propagation algorithms. Trans. on Information Theory, 2005.