Research map / Optimization / Nonconvex and smooth optimization
Analysis of Langevin Monte Carlo via Convex Optimization
Alain Durmus, Szymon Majewski, Błażej Miasojedow
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
- Bounding the Error of Discretized Langevin Algorithms for Non-Strongly Log-Concave Targets (JMLR 2022 · similarity 0.92)
- Penalized Overdamped and Underdamped Langevin Monte Carlo Algorithms for Constrained Sampling (JMLR 2024 · similarity 0.92)
- Consistency and Fluctuations For Stochastic Gradient Langevin Dynamics (JMLR 2016 · similarity 0.92)
- Stochastic Proximal Langevin Algorithm: Potential Splitting and Nonasymptotic Rates (NeurIPS 2019 · similarity 0.91)
- Langevin Monte Carlo for strongly log-concave distributions: Randomized midpoint revisited (ICLR 2024 · similarity 0.91)
- Constrained Sampling with Primal-Dual Langevin Monte Carlo (NeurIPS 2024 · similarity 0.90)
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.
