atlas

Research map / Optimization / Nonconvex and smooth optimization

A Composite Randomized Incremental Gradient Method

ICML 2019 · Optimization › Nonconvex and smooth optimization · approach: Stochastic variance reduction

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 estimator with SAGA-style reference-point estimator (C-SAGA) for composite problemcomposite finite-sum problem (1) · Theory: nonconvex smooth compositionsample complexity to epsilon-stationarityNo clear effect
Use gradient-dominant/strongly convex condition with C-SAGAcomposite finite-sum problem · Linear convergence regimesample complexity O((n+kappa n^{2/3}) log(1/eps))Helped
C-SAGA vs VRSC-PG on risk-averse portfolioC-SAGA · Risk-averse portfolio optimization, d=500, n=5000sample efficiency (gradient norm / objective gap vs samples)Helped
Use C-SAGA instead of ASC-PG/VRSC-PG/SCGD/ASCGD for MDP policy evaluationC-SAGA · MDP policy evaluation, S=10 and S=100objective gap and gradient norm vs samplesHelped
Single sample set (no double sampling) vs Reddi et al. sharper bound (ablation)C-SAGA reference-point analysis · TheoryLemma 4 bound constantNo clear effect

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