Split Variational Inference

Abstract

We propose a deterministic method to evaluate the integral of a positive function based on soft-binning functions that smoothly cut the integral into smaller integrals that are easier to approximate. The use of mean-field approximations for each individual sub-part leads to a tractable algorithm that alternates between the optimization of the bins and the approximation of the local integrals. We introduce suitable choices for the binning functions such that a standard mean field approximation can be extended to a split mean field approximation without the need for extra derivations. The method can be seen as a revival of the ideas underlying the mixture mean field approach. We discuss the relation between the two algorithms.

Cite

Text

Bouchard and Zoeter. "Split Variational Inference." International Conference on Machine Learning, 2009. doi:10.1145/1553374.1553382

Markdown

[Bouchard and Zoeter. "Split Variational Inference." International Conference on Machine Learning, 2009.](https://mlanthology.org/icml/2009/bouchard2009icml-split/) doi:10.1145/1553374.1553382

BibTeX

@inproceedings{bouchard2009icml-split,
  title     = {{Split Variational Inference}},
  author    = {Bouchard, Guillaume and Zoeter, Onno},
  booktitle = {International Conference on Machine Learning},
  year      = {2009},
  pages     = {57-64},
  doi       = {10.1145/1553374.1553382},
  url       = {https://mlanthology.org/icml/2009/bouchard2009icml-split/}
}