atlas

Research map / Optimization / Nonconvex and smooth optimization

An Accelerated DFO Algorithm for Finite-sum Convex Functions

ICML 2020 · Optimization › Nonconvex and smooth optimization · approach: Proximal finite-sum 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
use ZO-Varag with variance-reduced stochastic updates and accelerated momentumfinite-sum DFO on diabete and ijcnn1 regression tasks · diabete and ijcnn1; logistic regression and ridge regressionconvergence rateHelped
use simplified ZO-Katyusha rather than ZO-Varagfinite-sum DFO regression tasks · diabete and ijcnn1; logistic regression and ridge regressionconvergence rateHelped
use bar{x}^{s-1} as the pivot instead of tilde{x}^{s-1} (ablation)ZO-Varag · logistic regressionconvergence rateHelped
use bar{x}^{s-1} as the pivot instead of tilde{x}^{s-1} (ablation)ZO-Varag · ridge regressionconvergence rateHelped
increase regularizer strength lambda (ablation)ZO-Varag · logistic regression and ridge regressionearly convergence rateHelped
increase regularizer strength lambda (ablation)ZO-Varag · logistic regression and ridge regressionfinal optimization errorHurt

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