Fetching the paper…
Reading the bibliography…
We revisit the problem of sampling from a target distribution that has a smooth strongly log-concave density everywhere in $\mathbb R^p$.
Über die von der molekularkinetischen theorie der wärme geforderte bewegung von in ruhenden flüssigkeiten suspendierten teilchen
Einstein, A. (1905) · 1905
Earlier work this paper cites.
Zur kinetischen theorie der brownschen molekularbewegung und der suspensionen
Von Smoluchowski, M. (1906) · 1906
Earlier work this paper cites.
Sur la théorie du mouvement brownien
Langevin, P. (1908) · 1908
Earlier work this paper cites.
A topological property of real analytic subsets
Łojasiewicz, S. (1963) · 1963
Earlier work this paper cites.
Gradient methods for the minimisation of functionals
Polyak, B. T. (1963) · 1963
Earlier work this paper cites.
Dynamical Theories of Brownian Motion
Nelson, E. (1967) · 1967
Earlier work this paper cites.
Criteria for recurrence and existence of invariant measures for multidimensional diffusions
Bhattacharya, R. N. (1978) · 1978
Earlier work this paper cites.
On sampling from a log-concave density using kinetic Langevin diffusions
Dalalyan, A. S. and Riou-Durand, L. (2020) · 1988
Earlier work this paper cites.
Is there an analog of Nesterov acceleration for gradient-based MCMC?
Ma, Y.-A., Chatterji, N. S., Cheng, X., Flammarion, N., Bartlett, P. L., and Jordan, M. I. (2021) · 1992
Earlier work this paper cites.
Exponential convergence of Langevin distributions and their discrete approximations
Roberts, G. O. and Tweedie, R. L. (1996) · 1996
Earlier work this paper cites.
Monte Carlo statistical methods
Robert, C. P., Casella, G., and Casella, G. (1999) · 1999
Earlier work this paper cites.
Diffusions, Markov processes, and martingales: Volume 1, foundations
Rogers, L. C. and Williams, D. (2000) · 2000
Earlier work this paper cites.
An introduction to mcmc for machine learning
Andrieu, C., De Freitas, N., Doucet, A., and Jordan, M. I. (2003) · 2003
Earlier work this paper cites.
Statistical mechanics: algorithms and computations
Krauth, W. (2006) · 2006
Earlier work this paper cites.
Particle markov chain monte carlo methods
Andrieu, C., Doucet, A., and Holenstein, R. (2010) · 2010
Earlier work this paper cites.
Couplings and quantitative contraction rates for Langevin dynamics
Eberle, A., Guillin, A., and Zimmer, R. (2019) · 2010
Earlier work this paper cites.
Stochastic differential equations: an introduction with applications
Oksendal, B. (2013) · 2013
Cited alongside, same era.
Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learning
Gal, Y. and Ghahramani, Z. (2016) · 2016
Cited alongside, same era.
Sampling from a log-concave distribution with compact support with proximal Langevin Monte Carlo
Brosse, N., Durmus, A., Moulines, É., and Pereyra, M. (2017) · 2017
Cited alongside, same era.
Theoretical guarantees for approximate sampling from a smooth and log-concave density
Dalalyan, A. S. (2017) · 2017
Cited alongside, same era.
Nonasymptotic convergence analysis for the unadjusted Langevin algorithm
Durmus, A. and Moulines, E. (2017) · 2017
Cited alongside, same era.
Non-convex learning via stochastic gradient langevin dynamics: a nonasymptotic analysis
Langevin monte carlo without smoothness
Chatterji, N., Diakonikolas, J., Jordan, M. I., and Bartlett, P. (2020) · 2020
Later among the works it cites.
Exponential ergodicity of mirror-Langevin diffusions
Chewi, S., Gouic, T. L., Lu, C., Maunu, T., Rigollet, P., and Stromme, A. J. (2020) · 2020
Later among the works it cites.
On the ergodicity, bias and asymptotic normality of randomized midpoint sampling method
He, Y., Balasubramanian, K., and Erdogdu, M. A. (2020) · 2020
Later among the works it cites.
Subspace inference for Bayesian deep learning
Izmailov, P., Maddox, W. J., Kirichenko, P., Garipov, T., Vetrov, D., and Wilson, A. G. (2020) · 2020
Later among the works it cites.
On the convergence of langevin monte carlo: The interplay between tail growth and smoothness
Erdogdu, M. A. and Hosseinzadeh, R. (2021) · 2021
Later among the works it cites.
What are Bayesian neural network posteriors really like?
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Raginsky, M., Rakhlin, A., and Telgarsky, M. (2017) · 2017
Cited alongside, same era.
Underdamped Langevin MCMC: A non-asymptotic analysis
Cheng, X., Chatterji, N. S., Bartlett, P. L., and Jordan, M. I. (2018b) · 2018
Cited alongside, same era.
Efficient Bayesian Computation by Proximal Markov Chain Monte Carlo: When Langevin Meets Moreau
Durmus, A., Moulines, É., and Pereyra, M. (2018) · 2018
Cited alongside, same era.
Log-concave sampling: Metropolis-Hastings algorithms are fast!
Dwivedi, R., Chen, Y., Wainwright, M. J., and Yu, B. (2018) · 2018
Cited alongside, same era.
Global non-convex optimization with discretized diffusions
Erdogdu, M. A., Mackey, L., and Shamir, O. (2018) · 2018
Cited alongside, same era.
User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient
Dalalyan, A. S. and Karagulyan, A. (2019) · 2019
Cited alongside, same era.
Analysis of Langevin Monte Carlo via convex optimization
Durmus, A., Majewski, S., and Miasojedow, B. (2019) · 2019
Cited alongside, same era.
Izmailov, P., Vikram, S., Hoffman, M. D., and Wilson, A. G. G. (2021) · 2021
Later among the works it cites.
High-dimensional MCMC with a standard splitting scheme for the underdamped Langevin diffusion
Monmarché, P. (2021) · 2021
Later among the works it cites.
High-Order Langevin Diffusion Yields an Accelerated MCMC Algorithm
Mou, W., Ma, Y.-A., Wainwright, M. J., Bartlett, P. L., and Jordan, M. I. (2021) · 2021
Later among the works it cites.
Towards a theory of non-log-concave sampling: first-order stationarity guarantees for Langevin monte Carlo
Balasubramanian, K., Chewi, S., Erdogdu, M. A., Salim, A., and Zhang, S. (2022) · 2022
Later among the works it cites.
Analysis of Langevin Monte Carlo from Poincare to Log-Sobolev
Chewi, S., Erdogdu, M. A., Li, M., Shen, R., and Zhang, S. (2022) · 2022
Later among the works it cites.
Bounding the error of discretized Langevin algorithms for non-strongly log-concave targets
Dalalyan, A. S., Karagulyan, A., and Riou-Durand, L. (2022) · 2022
Later among the works it cites.
Convergence of langevin monte carlo in chi-squared and rényi divergence
Erdogdu, M. A., Hosseinzadeh, R., and Zhang, S. (2022) · 2022
Later among the works it cites.
Improved bounds for discretization of Langevin diffusions: Near-optimal rates without convexity
Mou, W., Flammarion, N., Wainwright, M. J., and Bartlett, P. L. (2022) · 2022
Later among the works it cites.
Almost sure contraction for diffusions on ℝ d \mathbb{R}^{d} . Application to generalized Langevin diffusions
Monmarché, P. (2023) · 2023
Closest in time.
Towards a Complete Analysis of Langevin Monte Carlo: Beyond Poincaré Inequality
Mousavi-Hosseini, A., Farghly, T., He, Y., Balasubramanian, K., and Erdogdu, M. A. (2023) · 2023
Closest in time.
Improved Discretization Analysis for Underdamped Langevin Monte Carlo
Zhang, M., Chewi, S., Li, M. B., Balasubramanian, K., and Erdogdu, M. A. (2023) · 2023
Closest in time.