Running MAP inference on million node graphical models: A high performance computing perspective

Chen Jin, Qiang Fu, Huahua Wang, William Hendrix, Zhengzhang Chen, Ankit Agrawal, Arindam Banerjee, Alok Choudhary

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

An important problem in discrete graphical models is the maximum a posterior (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 this paper, we introduce a parallel implementation of the recently proposed Bethe-ADMM algorithm using Message Passing Interface (MPI), which allows us to fully utilize the computing power provided by the modern supercomputers with thousands of cores. Experimental results demonstrate that for a broad class of problems, our parallel implementation of Bethe-ADMM scales almost linearly even with thousands of cores.

Original languageEnglish
Title of host publicationProceedings - 2015 IEEE/ACM 15th International Symposium on Cluster, Cloud, and Grid Computing, CCGrid 2015
Pages565-575
Number of pages11
ISBN (Electronic)9781479980062
DOIs
StatePublished - 7 Jul 2015
Event15th IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing, CCGrid 2015 - Shenzhen, China
Duration: 4 May 20157 May 2015

Publication series

NameProceedings - 2015 IEEE/ACM 15th International Symposium on Cluster, Cloud, and Grid Computing, CCGrid 2015

Conference

Conference15th IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing, CCGrid 2015
Country/TerritoryChina
CityShenzhen
Period4/05/157/05/15

Keywords

  • Alternating direction method of multipliers
  • Markov random field
  • Maximum a posteriori inference
  • Message passing interface

Fingerprint

Dive into the research topics of 'Running MAP inference on million node graphical models: A high performance computing perspective'. Together they form a unique fingerprint.

Cite this