Cutting Plane Algorithms for Variational Inference in Graphical Models

Abstract In this thesis, we give a new class of outer bounds on the marginal polytope, and propose a cutting-plane algorithm for eciently,optimizing over these constraints. When combined with a concave upper bound on the entropy, this gives a new vari- ational inference algorithm for probabilistic inference in discrete Markov Random