atlas

Research map / Optimization / Nonconvex and smooth optimization

Tighter Analysis for ProxSkip

ICML 2023 · Optimization › Nonconvex and smooth optimization · approach: Adaptive first-order convex methods

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.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
replace original Lyapunov function with inner-product variant (new analysis)ProxSkip · proximal-operator-bottleneck regime (γ > γcrit)decreasing speed of Lyapunov function: O(p^2) to O(p)Helped
use a large step size instead of the algorithm-selected step size (ablation)ProxSkip · Nesterov worst function, p=0.1 and p=0.01convergence rate: about twofold gap (p=0.1), around 20-fold gap (p=0.01)Hurt
replace SProxSkip original analysis with new Lyapunov analysisSProxSkip · stochastic gradient settingproximal operator complexity: O(sqrt(1/(εµ^2)) log(1/ε)) to O(√κ log(1/ε))Helped
apply new Lyapunov function to ProxSkip-VR and GradSkip+ variantsProxSkip-VR, GradSkip+ · theoretical convergencedecreasing speed of Lyapunov functionNo clear effect

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