Pith. sign in

REVIEW 1 cited by

Convergence diagnostics for stochastic gradient descent with constant step size

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1710.06382 v2 pith:QZGMWGKD submitted 2017-10-17 stat.ML cs.LGmath.STstat.COstat.TH

classification stat.MLcs.LGmath.STstat.COstat.TH
keywords phaseregionstochasticdescentgradientconvergenceconstantdiagnostic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Many iterative procedures in stochastic optimization exhibit a transient phase followed by a stationary phase. During the transient phase the procedure converges towards a region of interest, and during the stationary phase the procedure oscillates in that region, commonly around a single point. In this paper, we develop a statistical diagnostic test to detect such phase transition in the context of stochastic gradient descent with constant learning rate. We present theory and experiments suggesting that the region where the proposed diagnostic is activated coincides with the convergence region. For a class of loss functions, we derive a closed-form solution describing such region. Finally, we suggest an application to speed up convergence of stochastic gradient descent by halving the learning rate each time stationarity is detected. This leads to a new variant of stochastic gradient descent, which in many settings is comparable to state-of-art.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. AutoSGD: Automatic Learning Rate Selection for Stochastic Gradient Descent

    cs.LG 2025-05 conditional novelty 6.0 of 10

    AutoSGD runs three parallel SGD streams at nearby learning rates, uses paired noisy objective estimates to pick the winner, and is claimed to converge with little user tuning.

Pith tools