atlas

Research map / Optimization / Nonconvex and smooth optimization

Variance-based Regularization with Convex Objectives

NeurIPS 2017 · Optimization › Nonconvex and smooth optimization · approach: Stochastic variance reduction · 104 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 variance-based robust regularization instead of ERMclassification problems · classification problems (datasets unspecified)out-of-sample test performanceHelped
use variance-based robust regularization instead of ERMrobustly regularized estimators · harder, higher-variance instancesperformanceHelped
use variance-based robust regularization instead of ERMclassification estimators · rare and common classesclass performanceMixed
choose the robust estimator rather than ERMmedian estimation on {-1, 0, 1} · constructed discrete median problemexcess risk rate: log n / n vs. 1 / sqrt{n}Helped
use robust regularization rather than ERMcorrectly specified linear regression with Gaussian noise · classical linear regressionasymptotic efficiencyNo clear effect
use robust regularization rather than ERMgeneral smooth statistical estimation problems · asymptotic estimator distributionasymptotic bias: sqrt{2 tol}Hurt

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