atlas

Research map / Optimization / Nonconvex and smooth optimization

Faster Gradient-Free Proximal Stochastic Methods for Nonconvex Nonsmooth Optimization

AAAI 2019 · Optimization › Nonconvex and smooth optimization · approach: Complexity of nonconvex first-order methods · 21 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 coordinate smoothing gradient estimation instead of Gaussian smoothing (ablation)ZO-ProxSVRG and ZO-ProxSAGA · Black-box binary classification and black-box DNN adversarial attacksobjective value and attack lossHelped
Add SVRG or SAGA variance reduction to ZO-ProxSGD (ablation)Black-box DNN adversarial attacks · Black-box DNN adversarial attacksobjective value and attack lossHelped
Use SAGA instead of SVRG (ablation)CooSGE methods · Black-box binary classificationobjective value and test lossHelped
Use CooSGE instead of GauSGE (ablation)ZO-ProxSVRG and ZO-ProxSAGA · Nonconvex nonsmooth composite optimizationconvergence rate: O(\frac{d}{T}) vs O(\frac{d}{T} + d\sigma^2)Helped
Add SVRG or SAGA variance reduction to the stochastic proximal gradient-free methodRSPGF · Nonconvex nonsmooth composite optimizationconvergence rate: O(\frac{1}{\sqrt{T}}) to O(\frac{1}{T})Helped

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