AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Dimension-Free Iteration Complexity of Finite Sum Optimization Problems

Yossi Arjevani, Ohad Shamir

NeurIPS 2016 · Optimization › Nonconvex and smooth optimization · approach: Proximal finite-sum methods · 2 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 mini-batchesFinite sum optimization methods · Finite sum optimizationiteration complexityNo clear effect
Sample individual functions without replacement instead of with replacementFinite sum optimization methods · Finite sum optimizationiteration complexityNo clear effect
Use non-oblivious rather than oblivious optimization algorithmsSmooth strongly convex optimization · Smooth strongly convex optimizationconvergence rateMixed

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