Fetching the paper…
Reading the bibliography…
Discretizations of Langevin diffusions provide a powerful method for sampling and Bayesian inference.
Stochastic estimation of the maximum of a regression function
Jack Kiefer and Jacob Wolfowitz · 1952
Earlier work this paper cites.
Multidimensional stochastic approximation methods
Julius R Blum · 1954
Earlier work this paper cites.
A bound for the error in the normal approximation to the distribution of a sum of dependent random variables
Charles Stein · 1972
Earlier work this paper cites.
The extragradient method for finding saddle points and other problems
GM Korpelevich · 1976
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
A. S. Nemirovski and D. Yudin · 1983
Earlier work this paper cites.
The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume
László Lovász and Miklós Simonovits · 1990
Earlier work this paper cites.
Symplectic integrators for hamiltonian problems: an overview
Jesus M Sanz-Serna · 1992
Earlier work this paper cites.
Hit-and-run algorithms for generating multivariate distributions
Claude JP Bélisle, H Edwin Romeijn, and Robert L Smith · 1993
Earlier work this paper cites.
Isoperimetric problems for convex bodies and a localization lemma
Ravi Kannan, László Lovász, and Miklós Simonovits · 1995
Earlier work this paper cites.
Rates of convergence of the Hastings and Metropolis algorithms
Kerrie L Mengersen and Richard L Tweedie · 1996
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.
Optimal scaling of discrete approximations to Langevin diffusions
Gareth O Roberts and Jeffrey S Rosenthal · 1998
Earlier work this paper cites.
Langevin-type models I: Diffusions with given stationary distributions and their discretizations
O Stramer and RL Tweedie · 1999
Earlier work this paper cites.
Langevin-type models II: Self-targeting candidates for MCMC algorithms
O Stramer and RL Tweedie · 1999
Earlier work this paper cites.
Estimation of population growth or decline in genetically monitored populations
Mark A Beaumont · 2003
Earlier work this paper cites.
Accelerated randomized stochastic optimization
Jürgen Dippon · 2003
Earlier work this paper cites.
Introduction to stochastic search and optimization: Estimation, simulation, and control
James Spall · 2005
Earlier work this paper cites.
The geometry of logconcave functions and sampling algorithms
László Lovász and Santosh Vempala · 2007
Earlier work this paper cites.
A companion for the kiefer–wolfowitz–blum stochastic approximation algorithm
Abdelkader Mokkadem and Mariane Pelletier · 2007
Earlier work this paper cites.
Evaluating derivatives: Principles and techniques of algorithmic differentiation
Andreas Griewank and Andrea Walther · 2008
Earlier work this paper cites.
The pseudo-marginal approach for efficient Monte Carlo computations
Christophe Andrieu and Gareth O Roberts · 2009
Earlier work this paper cites.
Introduction to derivative-free optimization
Andrew Conn, Katya Scheinberg, and Luis Vicente · 2009
Earlier work this paper cites.
Hypocoercivity
Cedric Villani · 2009
Earlier work this paper cites.
Optimal algorithms for online convex optimization with multi-point bandit feedback
Alekh Agarwal, Ofer Dekel, and Lin Xiao · 2010
Earlier work this paper cites.
Riemann manifold Langevin and Hamiltonian Monte Carlo methods
Mark Girolami and Ben Calderhead · 2011
Cited alongside, same era.
Bayesian parameter inference for stochastic biochemical network models using particle Markov chain Monte Carlo
Andrew Golightly and Darren J Wilkinson · 2011
Cited alongside, same era.
MCMC using Hamiltonian dynamics
Radford M Neal · 2011
Cited alongside, same era.
Query complexity of derivative-free optimization
Kevin G Jamieson, Robert Nowak, and Ben Recht · 2012
Cited alongside, same era.
Fitting complex population models by combining particle filters with Markov chain Monte Carlo
Jonas Knape and Perry De Valpine · 2012
Cited alongside, same era.
Analysis and geometry of Markov diffusion operators
Dominique Bakry, Ivan Gentil, and Michel Ledoux · 2013
Cited alongside, same era.
Random gradient-free minimization of convex functions
Yurii Nesterov and Vladimir Spokoiny · 2017
Later among the works it cites.
Geometry and dynamics for Markov chain Monte Carlo
Alessandro Barp, François-Xavier Briol, Anthony D Kennedy, and Mark Girolami · 2018
Later among the works it cites.
Sampling from a log-concave distribution with Projected Langevin Monte Carlo
Sébastien Bubeck, Ronen Eldan, and Joseph Lehec · 2018
Later among the works it cites.
Tensor methods for additive index models under discordance and heterogeneity
Krishnakumar Balasubramanian, Jianqing Fan, and Zhuoran Yang · 2018
Later among the works it cites.
Variable selection with Hamming loss
Cristina Butucea, Mohamed Ndaoud, Natalia A Stepanova, and Alexandre B Tsybakov · 2018
Later among the works it cites.
Sharp Convergence Rates for Langevin Dynamics in the Nonconvex Setting
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Stochastic first-and zeroth-order methods for nonconvex stochastic programming
Saeed Ghadimi and Guanghui Lan · 2013
Cited alongside, same era.
On the complexity of bandit and derivative-free stochastic convex optimization
Ohad Shamir · 2013
Cited alongside, same era.
Geometry of isotropic convex bodies
Silouanos Brazitikos, Apostolos Giannopoulos, Petros Valettas, and Beatrice-Helen Vritsiou · 2014
Cited alongside, same era.
Black box variational inference
Rajesh Ranganath, Sean Gerrish, and David Blei · 2014
Cited alongside, same era.
Escaping the local minima via simulated annealing: Optimization of approximately convex functions
Alexandre Belloni, Tengyuan Liang, Hariharan Narayanan, and Alexander Rakhlin · 2015
Cited alongside, same era.
Optimal rates for zero-order convex optimization: The power of two function evaluations
John Duchi, Michael Jordan, Martin Wainwright, and Andre Wibisono · 2015
Cited alongside, same era.
Xiang Cheng, Niladri S Chatterji, Yasin Abbasi-Yadkori, Peter L Bartlett, and Michael I Jordan · 2018
Later among the works it cites.
Underdamped langevin mcmc: A non-asymptotic analysis
Xiang Cheng, Niladri S Chatterji, Peter L Bartlett, and Michael I Jordan · 2018
Later among the works it cites.
High-dimensional probability: An introduction with applications in data science
Roman Vershynin · 2018
Later among the works it cites.
Krishnakumar Balasubramanian and Saeed Ghadimi · 2019
Closest in time.
Log-concave sampling: Metropolis-hastings algorithms are fast
Raaz Dwivedi, Yuansi Chen, Martin J Wainwright, and Bin Yu · 2019
Closest in time.
User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient
Arnak S Dalalyan and Avetik Karagulyan · 2019
Closest in time.
High-dimensional Bayesian inference via the unadjusted Langevin algorithm
Alain Durmus, Eric Moulines, et al · 2019
Closest in time.
Couplings and quantitative contraction rates for langevin dynamics
Andreas Eberle, Arnaud Guillin, Raphael Zimmer, et al · 2019
Closest in time.
Derivative-free optimization methods
Jeffrey Larson, Matt Menickelly, and Stefan M Wild · 2019
Closest in time.
The randomized midpoint method for log-concave sampling
Ruoqi Shen and Yin Tat Lee · 2019
Closest in time.
Rapid convergence of the unadjusted langevin algorithm: Isoperimetry suffices
Santosh Vempala and Andre Wibisono · 2019
Closest in time.
Exploiting higher order smoothness in derivative-free optimization and continuous bandits
Arya Akhavan, Massimiliano Pontil, and Alexandre Tsybakov · 2020
Closest in time.
Complexity of randomized algorithms for underdamped Langevin dynamics
Yu Cao, Jianfeng Lu, and Lihan Wang · 2020
Closest in time.
The hastings algorithm at fifty
David B Dunson and JE Johndrow · 2020
Closest in time.
On sampling from a log-concave density using kinetic langevin diffusions
Arnak S Dalalyan, Lionel Riou-Durand, et al · 2020
Closest in time.
On the ergodicity, bias and asymptotic normality of randomized midpoint sampling method
Ye He, Krishnakumar Balasubramanian, and Murat A Erdogdu · 2020
Closest in time.
Improved regret for zeroth-order adversarial bandit convex optimisation
Tor Lattimore · 2020
Closest in time.
Zeroth-order optimization on riemannian manifolds
Jiaxiang Li, Krishnakumar Balasubramanian, and Shiqian Ma · 2020
Closest in time.
Computing bayes: Bayesian computation from 1763 to the 21st century
Gael M Martin, David T Frazier, and Christian P Robert · 2020
Closest in time.