pith. sign in

arxiv: 1610.06848 · v3 · pith:OC3RGQKRnew · submitted 2016-10-19 · 💻 cs.LG · stat.ML

An Efficient Minibatch Acceptance Test for Metropolis-Hastings

classification 💻 cs.LG stat.ML
keywords testmetropolis-hastingsacceptancecostdatamethodnovelprevious
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.