An Efficient Minibatch Acceptance Test for Metropolis-Hastings
Machine Learning
2017-07-11 v3 Machine Learning
Abstract
We present a novel Metropolis-Hastings method for large datasets that uses small expected-size minibatches of data. Previous work on reducing the cost of Metropolis-Hastings tests yield variable data consumed per sample, with only constant factor reductions versus using the full dataset for each sample. Here we present a method that can be tuned to provide arbitrarily small batch sizes, by adjusting either proposal step size or temperature. Our test uses the noise-tolerant Barker acceptance test with a novel additive correction variable. The resulting test has similar cost to a normal SGD update. Our experiments demonstrate several order-of-magnitude speedups over previous work.
Keywords
Cite
@article{arxiv.1610.06848,
title = {An Efficient Minibatch Acceptance Test for Metropolis-Hastings},
author = {Daniel Seita and Xinlei Pan and Haoyu Chen and John Canny},
journal= {arXiv preprint arXiv:1610.06848},
year = {2017}
}
Comments
Final version for UAI 2017