atlas

Research map / Optimization / Nonconvex and smooth optimization

On Matching Pursuit and Coordinate Descent

ICML 2018 · Optimization › Nonconvex and smooth optimization · approach: Adaptive first-order convex methods · 4 citations (OpenAlex)

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
Measure smoothness and level-set radius with the atomic normMatching Pursuit and steepest coordinate descent · Convex smooth objectivesfunction suboptimality: \frac{2L_{\mathcal{A}}R_{\mathcal{A}}^2}{t+2} versus \frac{2L_2nR_2^2}{t+2}Helped
Use an exact steepest direction instead of a random directionMatching Pursuit versus Random Pursuit · Convex smooth objectivesconvergence speedHelped
Accelerate the pursuit updatesMatching Pursuit and Random Pursuit · Synthetic sparse signal and Urban HDI hyperspectral datalossHelped
Use steepest rather than random updatesMatching Pursuit and Random Pursuit · Urban HDI hyperspectral datalossMixed
Use greedy updates for x and random atom updates for vAccelerated Matching Pursuit · Convex objectivesexpected function suboptimality: \mathcal{O}(1/t^2)Helped
Use steepest coordinate updates instead of randomized coordinate updatesAccelerated coordinate descent · Convex objectivesconvergence rateHelped

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