%0 Journal Article %1 nemeth2019stochastic %A Nemeth, Christopher %A Fearnhead, Paul %D 2019 %K mcmc optimization readings sampling stats %T Stochastic gradient Markov chain Monte Carlo %U http://arxiv.org/abs/1907.06986 %X Markov chain Monte Carlo (MCMC) algorithms are generally regarded as the gold standard technique for Bayesian inference. They are theoretically well-understood and conceptually simple to apply in practice. The drawback of MCMC is that in general performing exact inference requires all of the data to be processed at each iteration of the algorithm. For large data sets, the computational cost of MCMC can be prohibitive, which has led to recent developments in scalable Monte Carlo algorithms that have a significantly lower computational cost than standard MCMC. In this paper, we focus on a particular class of scalable Monte Carlo algorithms, stochastic gradient Markov chain Monte Carlo (SGMCMC) which utilises data subsampling techniques to reduce the per-iteration cost of MCMC. We provide an introduction to some popular SGMCMC algorithms and review the supporting theoretical results, as well as comparing the efficiency of SGMCMC algorithms against MCMC on benchmark examples. The supporting R code is available online.

@article{nemeth2019stochastic, abstract = {Markov chain Monte Carlo (MCMC) algorithms are generally regarded as the gold standard technique for Bayesian inference. They are theoretically well-understood and conceptually simple to apply in practice. The drawback of MCMC is that in general performing exact inference requires all of the data to be processed at each iteration of the algorithm. For large data sets, the computational cost of MCMC can be prohibitive, which has led to recent developments in scalable Monte Carlo algorithms that have a significantly lower computational cost than standard MCMC. In this paper, we focus on a particular class of scalable Monte Carlo algorithms, stochastic gradient Markov chain Monte Carlo (SGMCMC) which utilises data subsampling techniques to reduce the per-iteration cost of MCMC. We provide an introduction to some popular SGMCMC algorithms and review the supporting theoretical results, as well as comparing the efficiency of SGMCMC algorithms against MCMC on benchmark examples. The supporting R code is available online.}, added-at = {2019-10-27T21:14:30.000+0100}, author = {Nemeth, Christopher and Fearnhead, Paul}, biburl = {https://www.bibsonomy.org/bibtex/2ac9181fdef692eead19116281cdddbeb/kirk86}, description = {[1907.06986] Stochastic gradient Markov chain Monte Carlo}, interhash = {754a5c14531de6f4bf146f618192214e}, intrahash = {ac9181fdef692eead19116281cdddbeb}, keywords = {mcmc optimization readings sampling stats}, note = {cite arxiv:1907.06986}, timestamp = {2019-10-27T21:14:30.000+0100}, title = {Stochastic gradient Markov chain Monte Carlo}, url = {http://arxiv.org/abs/1907.06986}, year = 2019 }