atlas

Research map / Optimization / Optimizers

Scaling-Up Robust Gradient Descent Techniques

AAAI 2021 · Optimization › Optimizers · approach: Surrogate losses and robust solvers · 2 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 distance-based merging of independent SGD candidates instead of robustly aggregating gradients at every stepDC-SGD · Strongly convex risks with heavy-tailed losses and gradientsexcess riskHelped
Use distance-based merging of independent SGD candidates instead of robustly aggregating gradients at every stepDC-SGD · Simulated noisy convex minimization, including log-Normal noiseexcess riskMixed
Use two-pass DC-SGD rather than many-pass batch methodsDC-SGD · Simulated noisy convex minimization with d = 1024computation timeHelped
Use DC-SGD rather than well-tuned RGD methodsDC-SGD · Simulated noisy convex minimizationexcess riskMixed

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