AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

SDNA: Stochastic Dual Newton Ascent for Empirical Risk Minimization

ICML 2016 · Optimization › Nonconvex and smooth optimization · approach: Stochastic gradient last-iterate analysis · 53 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 the full curvature in each sampled subspace rather than only diagonal curvatureSDNA versus SDCA-like methods · ERM; convergence rateconvergence rate: 10,000 times betterHelped
Increase minibatch sizeSDNA · mushrooms and synthetic datasetspasses over data to convergenceHelped
Increase minibatch sizeMinibatch SDCA · mushrooms and synthetic datasetspasses over data to convergenceHurt
Increase minibatch sizeSDNA · mushrooms and synthetic datasetsruntimeMixed
Use quadratic loss and quadratic regularizerSDNA · ERM; expected duality gap convergenceconvergence rateHelped
Use SDNA rather than minibatch SDCAERM with uniform sampling · ERM; expected duality gap convergenceconvergence rateHelped

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