Barrier Frank-Wolfe for Marginal Inference - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Barrier Frank-Wolfe for Marginal Inference

Abstract

We introduce a globally-convergent algorithm for optimizing the tree-reweighted (TRW) variational objective over the marginal polytope. The algorithm is based on the conditional gradient method (Frank-Wolfe) and moves pseudomarginals within the marginal polytope through repeated maximum a posteriori (MAP) calls. This modular structure enables us to leverage black-box MAP solvers (both exact and approximate) for variational inference, and obtains more accurate results than tree-reweighted algorithms that optimize over the local consistency relaxation. Theoretically, we bound the sub-optimality for the proposed algorithm despite the TRW objective having unbounded gradients at the boundary of the marginal polytope. Empirically, we demonstrate the increased quality of results found by tightening the relaxation over the marginal polytope as well as the spanning tree polytope on synthetic and real-world instances.

Dates and versions

hal-01248674 , version 1 (28-12-2015)

Identifiers

Cite

Rahul G. Krishnan, Simon Lacoste-Julien, David Sontag. Barrier Frank-Wolfe for Marginal Inference. NIPS 2015 - Advances in Neural Information Processing Systems 28, Dec 2015, Montreal, Canada. ⟨hal-01248674⟩
111 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More