The Mean-Field Approximation: Information Inequalities, Algorithms, and Complexity
arXiv:1802.06126
Abstract
The mean field approximation to the Ising model is a canonical variational tool that is used for analysis and inference in Ising models. We provide a simple and optimal bound for the KL error of the mean field approximation for Ising models on general graphs, and extend it to higher order Markov random fields. Our bound improves on previous bounds obtained in work in the graph limit literature by Borgs, Chayes, Lovász, Sós, and Vesztergombi and another recent work by Basak and Mukherjee. Our bound is tight up to lower order terms. Building on the methods used to prove the bound, along with techniques from combinatorics and optimization, we study the algorithmic problem of estimating the (variational) free energy for Ising models and general Markov random fields. For a graph on vertices and interaction matrix with Frobenius norm , we provide algorithms that approximate the free energy within an additive error of in time . We also show that approximation within is NP-hard for every . Finally, we provide more efficient approximation algorithms, which find the optimal mean field approximation, for ferromagnetic Ising models and for Ising models satisfying Dobrushin's condition.
arXiv commentUpdated bibliography
References in corpus (6)
- Ising models on locally tree-like graphs
- Sufficient conditions for convergence of the Sum-Product Algorithm
- The computational hardness of counting in two-spin models on d-regular graphs
- How to calculate partition functions using convex programming hierarchies: provable bounds for variational methods
- Approximating Partition Functions in Constant Time
- The Vertex Sample Complexity of Free Energy is Polynomial