Gauged Mini-Bucket Elimination for Approximate Inference
Abstract
Computing the partition function $Z$ of a discrete graphical model is a fundamental inference challenge. Since this is computationally intractable, variational approximations are often used in practice. Recently, so-called gauge transformations were used to improve variational lower bounds on $Z$. In this paper, we propose a new gauge-variational approach, termed WMBE-G, which combines gauge transformations with the weighted mini-bucket elimination (WMBE) method. WMBE-G can provide both upper and lower bounds on $Z$, and is easier to optimize than the prior gauge-variational algorithm. We show that WMBE-G strictly improves the earlier WMBE approximation for symmetric models including Ising models with no magnetic field. Our experimental results demonstrate the effectiveness of WMBE-G even for generic, nonsymmetric models.
Cite
Text
Ahn et al. "Gauged Mini-Bucket Elimination for Approximate Inference." International Conference on Artificial Intelligence and Statistics, 2018.Markdown
[Ahn et al. "Gauged Mini-Bucket Elimination for Approximate Inference." International Conference on Artificial Intelligence and Statistics, 2018.](https://mlanthology.org/aistats/2018/ahn2018aistats-gauged/)BibTeX
@inproceedings{ahn2018aistats-gauged,
title = {{Gauged Mini-Bucket Elimination for Approximate Inference}},
author = {Ahn, Sungsoo and Chertkov, Michael and Shin, Jinwoo and Weller, Adrian},
booktitle = {International Conference on Artificial Intelligence and Statistics},
year = {2018},
pages = {10-19},
url = {https://mlanthology.org/aistats/2018/ahn2018aistats-gauged/}
}