AD3 : Alternating Directions Dual Decomposition for MAP Inference in Graphical Models

Citations Over TimeTop 10% of 2018 papers

Abstract

We present AD3, a new algorithm for approximate maximum a posteriori (MAP) inference on factor graphs, based on the alternating directions method of multipliers. Like other dual decomposition algorithms, AD3 has a modular architecture, where local subproblems are solved independently, and their solutions are gathered to compute a global update. The key characteristic of AD3 is that each local subproblem has a quadratic regularizer, leading to faster convergence, both theoretically and in practice. We provide closed-form solutions for these AD3 subproblems for binary pairwise factors and factors imposing first-order logic constraints. For arbitrary factors (large or combinatorial), we introduce an active set method which requires only an oracle for computing a local MAP configuration, making AD3 applicable to a wide range of problems. Experiments on synthetic and real-world problems show that AD3 compares favorably with the state-of-the-art.

Related Papers

• → Glove: Global Vectors for Word Representation(2014)33,361 cited
• → Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers(2010)13,387 cited
• → Graphical Models, Exponential Families, and Variational Inference(2007)3,158 cited
• Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations(2007)
• → MRF Optimization via Dual Decomposition: Message-Passing Revisited(2007)271 cited