On stochastic gradient Langevin dynamics with dependent data streams: the fully non-convex case
Not on the map. Why?
Abstract (arXiv)
We consider the problem of sampling from a target distribution, which is emph not necessarily logconcave, in the context of empirical risk minimization and stochastic optimization as presented in Raginsky et al. (2017). Non-asymptotic analysis results are established in the L1-Wasserstein distance for the behaviour of Stochastic Gradient Langevin Dynamics (SGLD) algorithms. We allow the estimation of gradients to be performed even in the presence of dependent data streams. Our convergence estimates are sharper and uniform in the number of iterations, in contrast to those in previous studies.
Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). First posted on arXiv 30 May 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 5; 2023: 2; 2024: 0; 2025: 2; 2026: 1.
14 papers.
Sort:
- 2021Polygonal Unadjusted Langevin Algorithms: Creating stable and efficient adaptive algorithms for neural networkscited by 11
- 2021Non-asymptotic estimates for TUSLA algorithm for non-convex learning with applications to neural networks with ReLU activation functioncited by 10
- 2021Convergence Analysis of Schr"odinger-F"ollmer Sampler without Convexitycited by 7
- 2022Constrained Langevin Algorithms with L-mixing External Random Variablescited by 6
- 2023Non-Log-Concave and Nonsmooth Sampling via Langevin Monte Carlo Algorithmscited by 4
- 2021Unadjusted Langevin algorithm for sampling a mixture of weakly smooth potentialscited by 3
- 2022Weak Convergence of Approximate reflection coupling and its Application to Non-convex Optimizationcited by 2
- 2022A Dynamical System View of Langevin-Based Non-Convex Samplingcited by 2
- 2025Regime-Switching Langevin Monte Carlo Algorithmscited by 2
- 2025Anchored Langevin Algorithmscited by 2
- 2023On the strong stability of ergodic iterationscited by 1
- 2022Uniform Generalization Bound on Time and Inverse Temperature for Gradient Descent Algorithm and its Application to Analysis of Simulated Annealingcited by 0
2 more
- 2026Improved Analysis for Hessian-free High-resolution Monte Carlo Sampling25 Aug 2026
- 2025Anchored Langevin Algorithms23 Sep 2025
- 2025Regime-Switching Langevin Monte Carlo Algorithms31 Aug 2025
- 2023Non-Log-Concave and Nonsmooth Sampling via Langevin Monte Carlo Algorithms25 May 2023
- 2023On the strong stability of ergodic iterations10 Apr 2023
- 2022Asynchronous Bayesian Learning over a Network16 Nov 2022
- 2022A Dynamical System View of Langevin-Based Non-Convex Sampling25 Oct 2022
- 2022Constrained Langevin Algorithms with L-mixing External Random Variables27 May 2022
- 2022Uniform Generalization Bound on Time and Inverse Temperature for Gradient Descent Algorithm and its Application to Analysis of Simulated Annealing25 May 2022
- 2022Weak Convergence of Approximate reflection coupling and its Application to Non-convex Optimization24 May 2022
- 2021Unadjusted Langevin algorithm for sampling a mixture of weakly smooth potentials17 Dec 2021
- 2021Non-asymptotic estimates for TUSLA algorithm for non-convex learning with applications to neural networks with ReLU activation function19 Jul 2021
- 2021Polygonal Unadjusted Langevin Algorithms: Creating stable and efficient adaptive algorithms for neural networkscited by 11
- 2021Non-asymptotic estimates for TUSLA algorithm for non-convex learning with applications to neural networks with ReLU activation functioncited by 10
- 2021Convergence Analysis of Schr"odinger-F"ollmer Sampler without Convexitycited by 7
- 2022Constrained Langevin Algorithms with L-mixing External Random Variablescited by 6
- 2023Non-Log-Concave and Nonsmooth Sampling via Langevin Monte Carlo Algorithmscited by 4
- 2021Unadjusted Langevin algorithm for sampling a mixture of weakly smooth potentialscited by 3
- 2022Weak Convergence of Approximate reflection coupling and its Application to Non-convex Optimizationcited by 2
- 2022A Dynamical System View of Langevin-Based Non-Convex Samplingcited by 2
- 2025Regime-Switching Langevin Monte Carlo Algorithmscited by 2
- 2025Anchored Langevin Algorithmscited by 2
- 2023On the strong stability of ergodic iterationscited by 1
- 2022Uniform Generalization Bound on Time and Inverse Temperature for Gradient Descent Algorithm and its Application to Analysis of Simulated Annealingcited by 0
12 most cited of 14 All 14 (JSON)
- 2026Improved Analysis for Hessian-free High-resolution Monte Carlo Sampling25 Aug 2026
- 2025Anchored Langevin Algorithms23 Sep 2025
- 2025Regime-Switching Langevin Monte Carlo Algorithms31 Aug 2025
- 2023Non-Log-Concave and Nonsmooth Sampling via Langevin Monte Carlo Algorithms25 May 2023
- 2023On the strong stability of ergodic iterations10 Apr 2023
- 2022Asynchronous Bayesian Learning over a Network16 Nov 2022
- 2022A Dynamical System View of Langevin-Based Non-Convex Sampling25 Oct 2022
- 2022Constrained Langevin Algorithms with L-mixing External Random Variables27 May 2022
- 2022Uniform Generalization Bound on Time and Inverse Temperature for Gradient Descent Algorithm and its Application to Analysis of Simulated Annealing25 May 2022
- 2022Weak Convergence of Approximate reflection coupling and its Application to Non-convex Optimization24 May 2022
- 2021Unadjusted Langevin algorithm for sampling a mixture of weakly smooth potentials17 Dec 2021
- 2021Non-asymptotic estimates for TUSLA algorithm for non-convex learning with applications to neural networks with ReLU activation function19 Jul 2021
12 newest of 14 All 14 (JSON)