AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Non-Ergodic Convergence Analysis of Heavy-Ball Algorithms

Tao Sun, Penghang Yin, Dongsheng Li, Chun Huang, Lei Guan, Hao Jiang

AAAI 2019 · Optimization › Nonconvex and smooth optimization · approach: Adaptive first-order convex methods · 44 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
Use restricted strong convexity rather than strong convexityHeavy-ball · Restricted strongly convex objectivesobjective-gap convergence rate: linear convergenceImproved
Use stochastic uniform block selectionHeavy-ball · Smooth convex multi-block objectivesgradient norm: o(1/√k)Improved
Increase the inertial parameter β from 0 to values up to 0.4Heavy-ball and cyclic coordinate descent Heavy-ball · Linear regression and logistic regression with Gaussian and Bernoulli dataconvergence speedImproved
Add inertia to stochastic block coordinate descentStochastic coordinate descent Heavy-ball · Linear regression and logistic regressionconvergence speedNo 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