Research map / Optimization / Nonconvex and smooth optimization
Improved Convergence Rate of Stochastic Gradient Langevin Dynamics with Variance Reduction and its Application to Optimization
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use finite μ in the annealing schedule rather than keeping η and γ constant (μ→∞) | SVRG-LD / SARAH-LD · General non-convex optimization | gradient complexity | Mixed |
Closest papers by meaning
- Variance Reduction in Stochastic Gradient Langevin Dynamics (NeurIPS 2016 · similarity 0.93)
- Global Convergence of Langevin Dynamics Based Algorithms for Nonconvex Optimization (NeurIPS 2018 · similarity 0.93)
- Stochastic Gradient and Langevin Processes (ICML 2020 · similarity 0.91)
- On the Theory of Variance Reduction for Stochastic Gradient Monte Carlo (ICML 2018 · similarity 0.91)
- Generalization of noisy SGD in unbounded non-convex settings (ICML 2025 · similarity 0.90)
- Faster Sampling via Stochastic Gradient Proximal Sampler (ICML 2024 · similarity 0.89)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.