AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

High-Order Error Bounds for Markovian LSA with Richardson–Romberg Extrapolation

Ilya Levin, Alexey Naumov, Sergey Samsonov

AAAI 2026 · Optimization › Nonconvex and smooth optimization · approach: Langevin sampling for nonconvex problems · 1 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 Richardson-Romberg extrapolation on top of Polyak-Ruppert averagingMarkovian LSA with constant step size · 2-state Markov chain synthetic LSA (a=0.3, 400 trajectories)MSE of averaged iterateImproved
set step size eps = n^(-1/2) instead of larger step sizes (ablation)Richardson-Romberg iterates · 2-state Markov chain synthetic LSAerrorImproved
use eps = n^(-1/2) with plain Polyak-Ruppert averaging (no RR) (ablation)Polyak-Ruppert averaged LSA · 2-state Markov chain synthetic LSAerrorHurt

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