AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Penalized Langevin dynamics with vanishing penalty for smooth and log-concave targets

Avetik Karagulyan, Arnak Dalalyan

NeurIPS 2020 · Optimization › Nonconvex and smooth optimization · approach: Langevin sampling for nonconvex problems · 2 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 changedWhereMeasuredEffect
Add a decreasing linear penalty that vanishes over timeLangevin diffusion for log-concave targets · Log-concave targetsWasserstein-2 distanceImproved
Use α(t) = 1/({2t + 121μ_2(π)})Langevin's Adjusted Process (LAP) · Log-concave targets, m = 0Wasserstein-2 distanceImproved
Estimate the drift integral at a randomized intermediate point instead of using only the starting pointOverdamped Langevin · Strongly log-concave targets satisfying (m-M-CL)Wasserstein-2 distanceImproved
Average R randomized intermediate-point drift estimatesRandomized mid-point method · Strongly log-concave targets satisfying (m-M-CL)Wasserstein-2 distanceImproved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy