资源分类
》 资源 》论文》An Augmented Lagrangian Approach to Constrained MAP Inference

An Augmented Lagrangian Approach to Constrained MAP Inference

2020-02-27 | |  55 |   40 |   0

Abstract

We propose a new algorithm for approximate MAP inference on factor graphs, by combining augmented Lagrangian optimization with the dual decomposition method. Each slave subproblem is given a quadratic penalty, which pushes toward faster consensus than in previous subgradient approaches. Our algorithm is provably convergent, parallelizable, and suitable for fine decompositions of the graph. We show how it can efficiently handle problems with (possibly global) structural constraints via simple sort operations. Experiments on synthetic and real-world data show that our approach compares favorably with the state-of-the-art.

上一篇：Tree-Structured Infinite Sparse Factor Model

下一篇：GoDec: Randomized Low-rank & Sparse Matrix Decomposition in Noisy Case

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...