atlas

Research map / Optimization / Nonconvex and smooth optimization

Continuized Acceleration for Quasar Convex Functions in Non-Convex Optimization

ICLR 2023 · Optimization › Nonconvex and smooth optimization · approach: Acceleration and Nesterov dynamics · 1 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
replace binary-search-based AGD with continuized Nesterov acceleration (one gradient per iteration, no function evaluations)quasar convex minimization · theory, L-smooth rho-quasar convexgradient-call complexity: removes log(1/(rho eps)) factorHelped
continuized acceleration vs. AGD with binary search in number of gradient calls and CPU time on GLM experimentsGLM empirical risk (logistic, ReLU, quadratic) · synthetic n=1000, d=50gradient calls and CPU timeHelped
continuized acceleration vs. AGD in iterationsGLM empirical risk · synthetic n=1000, d=50function value vs iterationNo clear effect
accelerated stochastic GLMtron (continuized) vs stochastic GLMtronlearning Leaky-ReLU GLM · synthetic Leaky-ReLUdistance to w*Helped

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