AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Alternating Randomized Block Coordinate Descent

Jelena Diakonikolas, Lorenzo Orecchia

ICML 2018 · Optimization › Nonconvex and smooth optimization · approach: Coordinate and Adam convergence analysis · 11 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 exact minimization over the least smooth block (ablation)C-BCD and RCDM · BlogFeedback least squares, block sizes 5-40optimality gap over epochsImproved
use AR-BCD instead of RCDM and C-BCDnon-accelerated block coordinate descent · BlogFeedback least squares, N/n in {5,10,20,40}optimality gap over epochsImproved
RCDM versus AR-BCD early iterationsRCDM · BlogFeedback least squaresoptimality gap early vs lateMixed
use AAR-BCD and NU ACDM instead of APCG and ABCGDaccelerated block coordinate descent · BlogFeedback least squaresoptimality gap over epochsImproved
increase block size N/n from 5 to 40 (ablation)AAR-BCD · BlogFeedback least squaresimprovement over other accelerated methodsImproved
use non-uniform sampling proportional to sqrt(Li) instead of uniformaccelerated methods · BlogFeedback least squaresconvergence speedImproved

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