Research map / Optimization / Nonconvex and smooth optimization
Bounding the Error of Discretized Langevin Algorithms for Non-Strongly Log-Concave Targets
Arnak S. Dalalyan, Avetik Karagulyan, Lionel Riou-Durand
Read the paperCheck your idea against 137,217 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
- 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.93)
- Analysis of Langevin Monte Carlo via Convex Optimization (JMLR 2019 · similarity 0.92)
- Langevin Monte Carlo for strongly log-concave distributions: Randomized midpoint revisited (ICLR 2024 · similarity 0.92)
- Log-concave sampling: Metropolis-Hastings algorithms are fast (JMLR 2019 · similarity 0.92)
- Provable Benefit of Annealed Langevin Monte Carlo for Non-log-concave Sampling (ICLR 2025 · similarity 0.90)
- Fast Non-Log-Concave Sampling under Nonconvex Equality and Inequality Constraints with Landing (NeurIPS 2025 · 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.
