An Adaptive Learning Rate for Stochastic Variational Inference
Abstract
Stochastic variational inference finds good posterior approximations of probabilistic models with very large data sets. It optimizes the variational objective with stochastic optimization, following noisy estimates of the natural gradient. Operationally, stochastic inference iteratively subsamples from the data, analyzes the subsample, and updates parameters with a decreasing learning rate. However, the algorithm is sensitive to that rate, which usually requires hand-tuning to each application. We solve this problem by developing an adaptive learning rate for stochastic inference. Our method requires no tuning and is easily implemented with computations already made in the algorithm. We demonstrate our approach with latent Dirichlet allocation applied to three large text corpora. Inference with the adaptive learning rate converges faster and to a better approximation than the best settings of hand-tuned rates.
Cite
Text
Ranganath et al. "An Adaptive Learning Rate for Stochastic Variational Inference." International Conference on Machine Learning, 2013.Markdown
[Ranganath et al. "An Adaptive Learning Rate for Stochastic Variational Inference." International Conference on Machine Learning, 2013.](https://mlanthology.org/icml/2013/ranganath2013icml-adaptive/)BibTeX
@inproceedings{ranganath2013icml-adaptive,
title = {{An Adaptive Learning Rate for Stochastic Variational Inference}},
author = {Ranganath, Rajesh and Wang, Chong and David, Blei and Xing, Eric},
booktitle = {International Conference on Machine Learning},
year = {2013},
pages = {298-306},
volume = {28},
url = {https://mlanthology.org/icml/2013/ranganath2013icml-adaptive/}
}