atlas

Research map / Optimization / Nonconvex and smooth optimization

Efficient Smooth Non-Convex Stochastic Compositional Optimization via Stochastic Recursive Gradient Descent

NeurIPS 2019 · Optimization › Nonconvex and smooth optimization · approach: Stochastic convex optimization complexity · 10 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 SVRG-style variance reduction with SARAH recursive estimators for inner function, Jacobian and gradientVRSC-PG · finite-sum non-convex compositional optimizationIFO complexity bound: (n + m)2/3ε−2 -> (n + m)1/2ε−2Helped
replace SCVR recursive estimators with SARAH recursion in the online caseSCVR / SC-SCSG · online non-convex compositional optimizationIFO complexity bound: ε−3.6 -> ε−3Helped
use SARAH-Compositional instead of SCGD, ASC-PG and VRSC-PGrisk-averse portfolio management · six 25-portfolio datasets, N=25, T=7240objective gap vs IFO callsHelped
use plain SCGD with small mini-batches instead of variance-reduced methodsSCGD · portfolio managementobjective gap vs IFO callsHurt

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