Research map / Optimization / Nonconvex and smooth optimization
Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Suffices
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.
Closest papers by meaning
- Double-Loop Unadjusted Langevin Algorithm (ICML 2020 · similarity 0.91)
- From stability of Langevin diffusion to convergence of proximal MCMC for non-log-concave sampling (NeurIPS 2025 · similarity 0.90)
- Dimension-Independent Convergence of Underdamped Langevin Monte Carlo in KL Divergence (ICML 2026 · similarity 0.90)
- Non-asymptotic Error Bounds in $\mathcal{W}_2$-Distance with Sqrt(d) Dimension Dependence and First Order Convergence for Langevin Monte Carlo beyond Log-Concavity (ICML 2025 · similarity 0.88)
- Generalization of noisy SGD in unbounded non-convex settings (ICML 2025 · similarity 0.88)
- Fast Non-Log-Concave Sampling under Nonconvex Equality and Inequality Constraints with Landing (NeurIPS 2025 · similarity 0.87)
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.