atlas

Research map / Optimization / Nonconvex and smooth optimization

Non-asymptotic Analysis of Stochastic Methods for Non-Smooth Non-Convex Regularized Problems

NeurIPS 2019 · Optimization › Nonconvex and smooth optimization · approach: Stochastic gradient last-iterate analysis · 7 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 direct stochastic proximal gradient (MB-SPG) instead of Moreau-envelope approximationnon-smooth non-convex regularized minimization, online setting · complexity analysiscomplexity: O(ϵ−5) -> O(ϵ−4)Helped
add SARAH/SPIDER recursive gradient estimator to MB-SPG (SPGR)MB-SPG · complexity analysis, online settingcomplexity: O(ϵ−4) -> O(ϵ−3)Helped
use increasing mini-batch sizes instead of fixed sizeMB-SPG · complexity analysiscomplexityMixed
use SPGR instead of MB-SPGregularized NLLS/TLS minimization · covtype, a9a, E2006, triazinesobjective vs gradient computationsHelped
use SPGR instead of heuristic SGD and other baselines for quantized modelsquantized NLLS model · mnist, news20, rcv1, w8atesting accuracyHelped

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