AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Asynchronous Proximal Stochastic Gradient Algorithm for Composition Optimization Problems

Pengfei Wang, Risheng Liu, Nenggan Zheng, Zhefeng Gong

AAAI 2019 · Optimization › Nonconvex and smooth optimization · approach: Stochastic variance reduction · 6 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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
increase number of threads to 16Async-ProxSCVR · MDP and mean-variance composition optimization, 16 threadsrunning time speedup: about 12 speedup on 16 threadsImproved
increase number of threads (objective vs time)Async-ProxSCVR · MDPs and mean-variance problemsobjective vs running timeImproved
increase number of threads (objective vs iterations)Async-ProxSCVR · MDPs and mean-variance problemsobjective vs iterationsNo clear effect
use Async-ProxSCVR instead of HOGWILD!, Async-ProxSVRG, ASC-PG, com-SVR-ADMMAsync-ProxSCVR · MDPs (100 states, 3 actions), MDPs (400 states, 10 actions), mean-variance N=2000 and N=5000objective vs running timeImproved
increase threads from 1 to 8 to 16 in comparison with baselinesAsync-ProxSCVR vs baselines · four composition problemsrobustness to thread countImproved

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