Fetching the paper…
Reading the bibliography…
Applying standard Markov chain Monte Carlo (MCMC) algorithms to large data sets is computationally expensive.
Continuous markov processes and stochastic equations
Gisiro Maruyama · 1955
Earlier work this paper cites.
Martingale limit theory and its application
Peter Hall and Christopher C Heyde · 1980
Earlier work this paper cites.
Markov processes
Stewart N. Ethier and Thomas G. Kurtz · 1986
Earlier work this paper cites.
Real and complex analysis (3rd)
Walter Rudin · 1986
Earlier work this paper cites.
Hybrid monte carlo
Simon Duane, Anthony D Kennedy, Brian J Pendleton, and Duncan Roweth · 1987
Earlier work this paper cites.
Probability and Measure
Patrick Billingsley · 1995
Earlier work this paper cites.
Exponential convergence of langevin distributions and their discrete approximations
Gareth O Roberts and Richard L Tweedie · 1996
Earlier work this paper cites.
Probability
Albert N Shiryaev · 1996
Earlier work this paper cites.
Optimal Scaling of Discrete Approximations to Langevin Diffusions
G. O. Roberts and J. S. Rosenthal · 1998
Earlier work this paper cites.
Online model selection based on the variational bayes
Masa-Aki Sato · 2001
Earlier work this paper cites.
Recursive computation of the invariant distribution of a diffusion
Damien Lamberton and Gilles Pages · 2002
Earlier work this paper cites.
Ergodicity for sdes and approximations: locally lipschitz vector fields and degenerate noise
Jonathan C Mattingly, Andrew M Stuart, and Desmond J Higham · 2002
Earlier work this paper cites.
Langevin diffusions and Metropolis-Hastings algorithms
Gareth O Roberts and Osnat Stramer · 2002
Earlier work this paper cites.
Recursive computation of the invariant distribution of a diffusion: the case of a weakly mean reverting drift
Damien Lamberton and Gilles Pages · 2003
Earlier work this paper cites.
Genome-wide association studies for common diseases and complex traits
Joel N Hirschhorn and Mark J Daly · 2005
Earlier work this paper cites.
Genome-wide association studies: theoretical and practical concerns
William YS Wang, Bryan J Barratt, David G Clayton, and John A Todd · 2005
Earlier work this paper cites.
Methods of information geometry , volume 191
Shun-ichi Amari and Hiroshi Nagaoka · 2007
Earlier work this paper cites.
Convergence of heavy-tailed monte carlo markov chain algorithms
Søren F Jarner and Gareth O Roberts · 2007
Cited alongside, same era.
An adaptive scheme for the approximation of dissipative systems
Vincent Lemaire · 2007
Cited alongside, same era.
MCMC methods for diffusion bridges
Alexandros Beskos, Gareth Roberts, Andrew Stuart, and Jochen Voss · 2008
Cited alongside, same era.
Genome-wide association studies for complex traits: consensus, uncertainty and challenges
Mark I McCarthy, Gonçalo R Abecasis, Lon R Cardon, David B Goldstein, Julian Little, John PA Ioannidis, and Joel N Hirschhorn · 2008
Cited alongside, same era.
Recursive computation of the invariant measure of a stochastic differential equation driven by a lévy process
Fabien Panloup · 2008
Cited alongside, same era.
Large-scale machine learning with stochastic gradient descent
Léon Bottou · 2010
Ergodic approximation of the distribution of a stationary diffusion: rate of convergence
Gilles Pages and Fabien Panloup · 2012
Later among the works it cites.
Optimal scaling and diffusion limits for the Langevin algorithm in high dimensions
Natesh S Pillai, Andrew M Stuart, and Alexandre H Thiéry · 2012
Later among the works it cites.
Bayesian posterior sampling via stochastic gradient fisher scoring
A. Koratticara S. Ahn and M. Welling · 2012
Later among the works it cites.
MCMC methods for functions: modifying old algorithms to make them faster
SL Cotter, GO Roberts, AM Stuart, and David White · 2013
Later among the works it cites.
Stochastic variational inference
Matthew D. Hoffman, David M. Blei, Chong Wang, and John Paisley · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Online learning for latent dirichlet allocation
Matthew D Hoffman, David M Blei, and Francis R Bach · 2010
Cited alongside, same era.
MCMC using hamiltonian dynamics
Radford. M. Neal · 2010
Cited alongside, same era.
Stochastic optimization for machine learning
Nathan Srebro and Ambuj Tewari · 2010
Cited alongside, same era.
Toward robotic cars
Sebastian Thrun · 2010
Cited alongside, same era.
Riemann manifold Langevin and Hamiltonian Monte Carlo methods
Mark Girolami and Ben Calderhead · 2011
Cited alongside, same era.
Bayesian learning via Stochastic Gradient Langevin Dynamics
Max Welling and Yee Whye Teh · 2011
Cited alongside, same era.
Willie Neiswanger, Chong Wang, and Eric Xing · 2013
Later among the works it cites.
Distributed stochastic gradient MCMC
Sungjin Ahn, Babak Shahbaba, and Max Welling · 2014
Closest in time.
Towards scaling up MCMC: an adaptive subsampling approach
Rémi Bardenet, Arnaud Doucet, and Chris C. Holmes · 2014
Closest in time.
Stochastic gradient hamiltonian monte carlo
Tianqi Chen, Emily B Fox, and Carlos Guestrin · 2014
Closest in time.
Emerging systems for large-scale machine learning
Joseph Gonzalez · 2014
Closest in time.
Spectral gaps for a metropolis-hastings algorithm in infinite dimensions
Martin Hairer, Andrew Stuart, and Sebastian Vollmer · 2014
Closest in time.
Frank-Wolfe and greedy optimization for learning with big data
Zaid Harchaoui and Martin Jaggi · 2014
Closest in time.
Kengo Kamatani · 2014
Closest in time.
Austerity in MCMC land: Cutting the Metropolis-Hastings budget
Anoop Korattikara, Yutian Chen, and Max Welling · 2014
Closest in time.
Information-geometric markov chain monte carlo methods using diffusions
Samuel Livingstone and mark Girolami · 2014
Closest in time.
Robust and scalable bayes via a median of subset posterior measures
Stanislav Minsker, Sanvesh Srivastava, Lizhen Lin, and David B Dunson · 2014
Closest in time.