Towards scaling up Markov chain Monte Carlo: an adaptive subsampling approach

Rémi Bardenet (1) , Arnaud Doucet (1) , Chris Holmes (1)

1 Department of Statistics [Oxford]

Markov chain Monte Carlo (MCMC) methods are often deemed far too computationally intensive to be of any practical use for large datasets. This paper describes a methodology that aims to scale up the Metropolis-Hastings (MH) algorithm in this context. We propose an approximate implementation of the accept/reject step of MH that only requires evaluating the likelihood of a random subset of the data, yet is guaranteed to coincide with the accept/reject step based on the full dataset with a probability superior to a user-specified tolerance level. This adaptive sub-sampling technique is an alternative to the recent approach developed in (Korattikara et al., 2014), and it allows us to establish rigorously that the resulting approximate MH algorithm samples from a perturbed version of the target distribution of interest, whose total variation distance to this very target is controlled explicitly. We explore the benefits and limitations of this scheme on several examples.

Domaines: Statistiques [math.ST]

Rémi Bardenet, Arnaud Doucet, Chris Holmes. Towards scaling up Markov chain Monte Carlo: an adaptive subsampling approach. International Conference on Machine Learning (ICML), 2014, Beijing, China. pp.405-413. ⟨hal-01254232⟩