AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

High Probability Complexity Bounds for Line Search Based on Stochastic Oracles

Billy Jin, Katya Scheinberg, Miaolan Xie

NeurIPS 2021 · Optimization › Nonconvex and smooth optimization · approach: Stochastic convex optimization complexity · 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 stochastic line search with estimated noise tolerance eps_f (ALOE) instead of SLS (eps_f=0, same mini-batch while backtracking)ALOE · PMLB 64 datasetsaverage best training loss: 62 out of 64Improved
use ALOE instead of full gradient line searchALOE · PMLB 64 datasetsaverage best training lossImproved
ALOE vs SLS and full gradient line search on test accuracyALOE · PMLB 80:20 splitstest accuracyNo clear effect
vary the choice of eps_f (ablation)ALOE · PMLBtraining lossNo 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