atlas

Research map / Optimization / Nonconvex and smooth optimization

Fast Stochastic Bregman Gradient Methods: Sharp Analysis and Variance Reduction

ICML 2021 · Optimization › Nonconvex and smooth optimization · approach: Stochastic variance reduction · 5 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
Bregman SGD with constant step size, interpolation setting (zero gradient noise at optimum)BSGD · Poisson inverse problem (interpolation)suboptimalityHelped
Variance reduction (Bregman SAGA) vs plain BSGDBSAGA · Tomographic reconstructionsuboptimalityHelped
Variance reduction (Bregman SAGA) vs plain BSGDBSAGA · Distributed optimization (RCV1)suboptimalityHelped
Stochastic updates (BSGD) instead of full Bregman gradient (BGD)BSGD · Tomographic reconstructionsuboptimalityHelped
Bregman SGD constant step size on Poisson problem with noise-free dataBSGD · Poisson inverse problemsuboptimalityHelped

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