Bethe-ADMM for tree decomposition based parallel MAP inference

Uncertainty in Artificial Intelligence - Proceedings of the 29th Conference, UAI 2013

Volumn , Issue , 2013, Pages 222-231

  Fu, Qiang ^a   Wang, Huahua ^a   Banerjee, Arindam ^a  

^a University of Minnesota   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATING DIRECTION METHOD OF MULTIPLIERS; GLOBAL CONVER-GENCE; GRAPHICAL MODEL; MAP INFERENCES; MAXIMUM A POSTERIORI; REAL DATA SETS; SUM-PRODUCT ALGORITHM; TREE-DECOMPOSITION;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; FORESTRY; INFERENCE ENGINES;

TREES (MATHEMATICS);

ALGORITHMS; ARTIFICIAL INTELLIGENCE; FORESTRY;

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

References (26)

1. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein. Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning, 3(1): 1-122, 2011.
2. Y. Censor and S. Zenios. Parallel Optimization: Theory, Algorithms, and Applications. Oxford University Press, 1998.
3. N. Cesa-Bianchi and G. Lugosi. Prediction, Learning, and Games. Cambridge University Press, 2006.
4. C. Chekuri, S. Khanna, J. Naor, and L. Zosin. A linear programming formulation and approximation algorithms for the metric labeling problem. SIAM Journal on Discrete Mathematics, 18(3): 608-625, Mar. 2005.
5. Q. Fu, A. Banerjee, S. Liess, and P. K. Snyder. Drought detection of the last century: An MRF-based approach. In Proceedings of the SIAM International Conference on Data Mining, 2012.
6. Q. Fu, H. Wang, A. Banerjee, S. Liess, and P. K. Snyder. MAP inference on million node graphical models: KL-divergence based alternating directions method. Technical report, Computer Science and Engineering Department, University of Minesota, 2012.
7. A. Globerson and T. Jaakkola. Fixing max-product: Convergent message passing algorithms for MAP LP-relaxations. In Proceedings of the Twenty-First Annual Conference on Neural Information Processing Systems, 2007.
8. B. He and X. Yuan. On the O(1/n) convergence rate of the Douglas-Rachford alternating direction method. SIAM Journal on Numerical Analysis, 50(2): 700-709, 2012.
9. V. Jojic, S. Gould, and D. Koller. Fast and smooth: Accelerated dual decomposition for MAP inference. In Proceedings of the twenty-Seventh International Conference on Machine Learning, 2010.
10. S. P. Kasiviswanathan, P. Melville, A. Banerjee, and V. Sindhwani. Emerging topic detection using dictionary learning. In Proceedings of the Twentieth ACM international conference on Information and knowledge management, 2011.
11. N. Komodakis, N. Paragios, and G. Tziritas. MRF energy minimization and beyond via dual decomposition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 33(3): 531-552, march 2011.
12. F. R. Kschischang, B. J. Frey, and H. A. Loeliger. Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory, 47(2): 498-519, 2001.
13. A. F. Martins. The Geometry of Constrained Structured Prediction: Applications to Inference and Learning of Natural Language Syntax. PhD thesis, Carnegie Mellon University, 2012.
14. A. F. Martins, P. M. Aguiar, M. A. Figueiredo, N. A. Smith, and E. P. Xing. An augmented Lagrangian approach to constrained MAP inference. In Proceedings of the Twenty-Eighth International Conference on Machine Learning, 2011.
15. O. Meshi and A. Globerson. An alternating direction method for dual MAP LP relaxation. In Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2011.
16. T. D. Mitchell, T. R. Carter, P. D. Jones, M. Hulme, and M. New. A comprehensive set of high-resolution grids of monthly climate for Europe and the globe: the observed record (1901-2000) and 16 scenarios (2001-2100). Tyndall Centre for Climate Change Research, 2004.
17. P. Raghavan and C. D. Thompson. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7(4): 365-374, 1987.
18. P. Ravikumar, A. Agarwal, and M. J. Wainwright. Messagepassing for graph-structured linear programs: Proximal methods and rounding schemes. Journal of Machine Learning Research, 11: 1043-1080, 2010.
19. D. Sontag, A. Globerson, and T. Jaakkola. Introduction to dual decomposition for inference. In S. Sra, S. Nowozin, and S. J. Wright, editors, Optimization for Machine Learning. MIT Press, 2011.
20. D. Sontag and T. Jaakkola. Tree block coordinate descent for MAP in graphical models. In Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics.
21. D. Tarlow, D. Batra, P. Kohli, and V. Kolmogorov. Dynamic tree block coordinate ascent. In Proceedings of the Twenty-Eighth International Conference on Machine Learning, 2011.
22. M. J. Wainwright, T. S. Jaakkola, and A. S. Willsky. MAP estimation via agreement on (hyper)trees: Message-passing and linear-programming approaches. IEEE Transactions of Information Theory, 51(11): 3697-3717, 2005.
23. M. J. Wainwright and M. I. Jordan. Graphical models, exponential families, and variational inference. Foundations and Trends in Machine Learning, 1(1-2): 1-305, 2008.
24. H. Wang and A. Banerjee. Online alternating direction method. In Proceedings of the Twenty-Ninth International Conference on Machine Learning, 2012.
25. J. Yang and Y. Zhang. Alternating direction algorithms for l1-problems in compressive sensing. SIAM Journal on Scientific Computing, 33(1): 250-278, 2011.
26. C. Yanover, T. Meltzer, and Y. Weiss. Linear programming relaxations and belief propagation: an empirical study. Jourmal of Machine Learning Research, 7: 1887-1907, 2006.