Graph partition strategies for generalized mean field inference

Authors:
Eric P. Xing;Michael I. Jordan;Stuart Russell
Affiliations:
University of California, Berkeley, CA;University of California, Berkeley, CA;University of California, Berkeley, CA
Venue:
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Year:
2004

Citing 7
Cited 3

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Semidefinite programming

SIAM Review
Factorial Hidden Markov Models

Machine Learning - Special issue on learning with probabilistic representations
An introduction to variational methods for graphical models

Learning in graphical models
Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION

Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization
Variational Approximations between Mean Field Theory and the Junction Tree Algorithm

UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
A generalized mean field algorithm for variational inference in exponential families

UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence

Cluster Selection Based on Coupling for Gaussian Mean Fields

ISNN '08 Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks
A variational inference procedure allowing internal structure for overlapping clusters and deterministic constraints

Journal of Artificial Intelligence Research
Variational upper bounds for probabilistic phylogenetic models

RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology

Quantified Score

Hi-index	0.00

Visualization

Abstract

An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well as over the choice of tractable families used for the variational approximation. In this paper, we present a novel combination of graph partitioning algorithms with a generalized mean field (GMF) inference algorithm. This combination optimizes over disjoint clustering of variables and performs inference using those clusters. We provide a formal analysis of the relationship between the graph cut and the GMF approximation, and explore several graph partition strategies empirically. Our empirical results provide rather clear support for a weighted version of MinCut as a useful clustering algorithm for GMF inference, which is consistent with the implications from the formal analysis.