Chen Jin
Alok Choudhary
ABSTRACT
Several important combinatorial optimization problems can be formulated as maximum a posteriori (MAP) inference in discrete graphical models. We adopt the recently proposed parallel MAP inference algorithm Bethe-ADMM and implement it using message passing interface (MPI) to fully utilize the computing power provided by the modern supercomputers with thousands of cores. The empirical results show that our parallel implementation scales almost linearly even with thousands of cores.
- http://cucis.ece.northwestern.edu/projects/PnetCDF.Google Scholar
- http://giraph.apache.org.Google Scholar
- http://www.nersc.gov/users/computational-systems/hopper.Google Scholar
- 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. Google ScholarDigital Library
- Y. Censor and S. Zenios. Parallel Optimization: Theory, Algorithms, and Applications. Oxford University Press, 1998. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- Q. Fu, H. Wang, and A. Banerjee. Bethe-ADMM for tree based parallel MAP inference. In Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence, 2013.Google ScholarDigital Library
- 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. Google ScholarDigital Library
- V. Kolmogorov. Convergent tree-reweighted message passing for energy minimization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(10):1568--1583, oct. 2006. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: a system for large-scale graph processing. In Proceedings of the 2010 ACM International Conference on Management of Data, 2010. Google ScholarDigital Library
- 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.Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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.Google Scholar
- P. Raghavan and C. D. Thompson. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7(4):365--374, 1987. Google ScholarDigital Library
- P. Ravikumar, A. Agarwal, and M. J. Wainwright. Message-passing for graph-structured linear programs: Proximal methods and rounding schemes. Journal of Machine Learning Research, 11:1043--1080, 2010. Google ScholarDigital Library
- 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.Google Scholar
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- J. Yang and Y. Zhang. Alternating direction algorithms for l1-problems in compressive sensing. SIAM Journal on Scientific Computing, 33(1):250--278, 2011. Google ScholarDigital Library
Recommendations
Running MAP inference on million node graphical models: a high performance computing perspective
CCGRID '15: Proceedings of the 15th IEEE/ACM International Symposium on Cluster, Cloud, and Grid ComputingAn important problem in discrete graphical models is the maximum a posteriori (MAP) inference problem. Recent research has been focusing on the development of parallel MAP inference algorithm, which scales to graphical models of millions of nodes. In ...
On linear programming relaxations for solving polynomial programming problems
Highlights- Theoretically compared the tightness of the J-set relaxation with the recursive McCormick relaxations.
AbstractThis paper studies linear programming (LP) relaxations for solving polynomial programming problems. A polynomial programming problem can be equivalently formulated as a quadratically constrained quadratic program (QCQP) by introducing ...
Quadratic Combinatorial Optimization Using Separable Underestimators
Binary programs with a quadratic objective function are NP-hard in general, even if the linear optimization problem over the same feasible set is tractable. In this paper, we address such problems by computing quadratic global underestimators of the ...
Comments