atlas

Research map / Optimization / Nonconvex and smooth optimization

Stochastic Gradient Methods for Distributionally Robust Optimization with f-divergences

NeurIPS 2016 · Optimization › Nonconvex and smooth optimization · approach: Stochastic gradient last-iterate analysis · 140 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 bandit mirror descent with O(log n) BST-based updates instead of full-gradient updates over all n termsrobust ERM with chi-square f-divergence · Reuters RCV1 large-scaleoptimality of robust objective vs CPU timeHelped
Gradient descent on the robust objective used instead of bandit mirror descentrobust ERM with chi-square f-divergence · Reuters RCV1 large-scaleoptimality of robust objective vs CPU timeMixed
Robust DRO objective (chi-square, rho=chi2_{1,.9}) used instead of plain ERMlogistic/hinge classification · Adult, Reuters RCV1upper confidence bound on test riskNo 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