ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1903.08568
  4. Cited By
Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry
  Suffices

Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Suffices

20 March 2019
Santosh Vempala
Andre Wibisono
ArXivPDFHTML

Papers citing "Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Suffices"

30 / 80 papers shown
Title
Non-asymptotic convergence bounds for modified tamed unadjusted Langevin
  algorithm in non-convex setting
Non-asymptotic convergence bounds for modified tamed unadjusted Langevin algorithm in non-convex setting
Ariel Neufeld
Matthew Ng Cheng En
Ying Zhang
37
11
0
06 Jul 2022
Accelerating Hamiltonian Monte Carlo via Chebyshev Integration Time
Accelerating Hamiltonian Monte Carlo via Chebyshev Integration Time
Jun-Kun Wang
Andre Wibisono
30
9
0
05 Jul 2022
Convergence for score-based generative modeling with polynomial
  complexity
Convergence for score-based generative modeling with polynomial complexity
Holden Lee
Jianfeng Lu
Yixin Tan
DiffM
24
127
0
13 Jun 2022
Utilising the CLT Structure in Stochastic Gradient based Sampling :
  Improved Analysis and Faster Algorithms
Utilising the CLT Structure in Stochastic Gradient based Sampling : Improved Analysis and Faster Algorithms
Aniket Das
Dheeraj M. Nagaraj
Anant Raj
54
6
0
08 Jun 2022
Convergence of Stein Variational Gradient Descent under a Weaker
  Smoothness Condition
Convergence of Stein Variational Gradient Descent under a Weaker Smoothness Condition
Lukang Sun
Avetik G. Karagulyan
Peter Richtárik
26
19
0
01 Jun 2022
Convergence of the Riemannian Langevin Algorithm
Convergence of the Riemannian Langevin Algorithm
Khashayar Gatmiry
Santosh Vempala
27
21
0
22 Apr 2022
Differentially Private Learning Needs Hidden State (Or Much Faster
  Convergence)
Differentially Private Learning Needs Hidden State (Or Much Faster Convergence)
Jiayuan Ye
Reza Shokri
FedML
35
44
0
10 Mar 2022
A Proximal Algorithm for Sampling
A Proximal Algorithm for Sampling
Jiaming Liang
Yongxin Chen
30
17
0
28 Feb 2022
Towards a Theory of Non-Log-Concave Sampling: First-Order Stationarity
  Guarantees for Langevin Monte Carlo
Towards a Theory of Non-Log-Concave Sampling: First-Order Stationarity Guarantees for Langevin Monte Carlo
Krishnakumar Balasubramanian
Sinho Chewi
Murat A. Erdogdu
Adil Salim
Matthew Shunshi Zhang
53
61
0
10 Feb 2022
HMC and underdamped Langevin united in the unadjusted convex smooth case
HMC and underdamped Langevin united in the unadjusted convex smooth case
Nicolai Gouraud
Pierre Le Bris
Adrien Majka
Pierre Monmarché
23
11
0
02 Feb 2022
Convex Analysis of the Mean Field Langevin Dynamics
Convex Analysis of the Mean Field Langevin Dynamics
Atsushi Nitanda
Denny Wu
Taiji Suzuki
MLT
74
64
0
25 Jan 2022
Separation of Scales and a Thermodynamic Description of Feature Learning
  in Some CNNs
Separation of Scales and a Thermodynamic Description of Feature Learning in Some CNNs
Inbar Seroussi
Gadi Naveh
Zohar Ringel
35
51
0
31 Dec 2021
Unadjusted Langevin algorithm for sampling a mixture of weakly smooth potentials
D. Nguyen
17
5
0
17 Dec 2021
Sampling from Log-Concave Distributions with Infinity-Distance
  Guarantees
Sampling from Log-Concave Distributions with Infinity-Distance Guarantees
Oren Mangoubi
Nisheeth K. Vishnoi
33
14
0
07 Nov 2021
Statistical Finite Elements via Langevin Dynamics
Statistical Finite Elements via Langevin Dynamics
Ömer Deniz Akyildiz
Connor Duffin
Sotirios Sabanis
Mark Girolami
36
11
0
21 Oct 2021
Privacy-Aware Rejection Sampling
Privacy-Aware Rejection Sampling
Jordan Awan
Vinayak A. Rao
39
7
0
02 Aug 2021
A Convergence Theory for SVGD in the Population Limit under Talagrand's
  Inequality T1
A Convergence Theory for SVGD in the Population Limit under Talagrand's Inequality T1
Adil Salim
Lukang Sun
Peter Richtárik
26
20
0
06 Jun 2021
Sampling From the Wasserstein Barycenter
Sampling From the Wasserstein Barycenter
Chiheb Daaloul
Thibaut Le Gouic
J. Liandrat
M. I. O. Technology
15
6
0
04 May 2021
Complexity of zigzag sampling algorithm for strongly log-concave
  distributions
Complexity of zigzag sampling algorithm for strongly log-concave distributions
Jianfeng Lu
Lihan Wang
18
6
0
21 Dec 2020
On the Ergodicity, Bias and Asymptotic Normality of Randomized Midpoint
  Sampling Method
On the Ergodicity, Bias and Asymptotic Normality of Randomized Midpoint Sampling Method
Ye He
Krishnakumar Balasubramanian
Murat A. Erdogdu
16
33
0
06 Nov 2020
Convergence of Langevin Monte Carlo in Chi-Squared and Renyi Divergence
Convergence of Langevin Monte Carlo in Chi-Squared and Renyi Divergence
Murat A. Erdogdu
Rasa Hosseinzadeh
Matthew Shunshi Zhang
88
41
0
22 Jul 2020
A Non-Asymptotic Analysis for Stein Variational Gradient Descent
A Non-Asymptotic Analysis for Stein Variational Gradient Descent
Anna Korba
Adil Salim
Michael Arbel
Giulia Luise
Arthur Gretton
17
76
0
17 Jun 2020
Primal Dual Interpretation of the Proximal Stochastic Gradient Langevin
  Algorithm
Primal Dual Interpretation of the Proximal Stochastic Gradient Langevin Algorithm
Adil Salim
Peter Richtárik
19
38
0
16 Jun 2020
SVGD as a kernelized Wasserstein gradient flow of the chi-squared
  divergence
SVGD as a kernelized Wasserstein gradient flow of the chi-squared divergence
Sinho Chewi
Thibaut Le Gouic
Chen Lu
Tyler Maunu
Philippe Rigollet
36
66
0
03 Jun 2020
On the Convergence of Langevin Monte Carlo: The Interplay between Tail
  Growth and Smoothness
On the Convergence of Langevin Monte Carlo: The Interplay between Tail Growth and Smoothness
Murat A. Erdogdu
Rasa Hosseinzadeh
11
75
0
27 May 2020
Nonasymptotic analysis of Stochastic Gradient Hamiltonian Monte Carlo
  under local conditions for nonconvex optimization
Nonasymptotic analysis of Stochastic Gradient Hamiltonian Monte Carlo under local conditions for nonconvex optimization
Ömer Deniz Akyildiz
Sotirios Sabanis
46
17
0
13 Feb 2020
Logsmooth Gradient Concentration and Tighter Runtimes for Metropolized
  Hamiltonian Monte Carlo
Logsmooth Gradient Concentration and Tighter Runtimes for Metropolized Hamiltonian Monte Carlo
Y. Lee
Ruoqi Shen
Kevin Tian
25
37
0
10 Feb 2020
Replica Exchange for Non-Convex Optimization
Replica Exchange for Non-Convex Optimization
Jing-rong Dong
Xin T. Tong
27
21
0
23 Jan 2020
Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly
  Logconcave Distributions
Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions
Zongchen Chen
Santosh Vempala
11
64
0
07 May 2019
Measuring Sample Quality with Kernels
Measuring Sample Quality with Kernels
Jackson Gorham
Lester W. Mackey
86
223
0
06 Mar 2017
Previous
12