Pith. sign in

REVIEW 1 cited by

Exploring loss function topology with cyclical learning rates

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 1702.04283 v1 pith:ODEKBUEG submitted 2017-02-14 cs.LG cs.NE

classification cs.LGcs.NE
keywords traininglearningratesbehaviorscyclicallossnetworksresults
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present observations and discussion of previously unreported phenomena discovered while training residual networks. The goal of this work is to better understand the nature of neural networks through the examination of these new empirical results. These behaviors were identified through the application of Cyclical Learning Rates (CLR) and linear network interpolation. Among these behaviors are counterintuitive increases and decreases in training loss and instances of rapid training. For example, we demonstrate how CLR can produce greater testing accuracy than traditional training despite using large learning rates. Files to replicate these results are available at https://github.com/lnsmith54/exploring-loss

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. Regime-Switching Langevin Monte Carlo Algorithms

    stat.CO 2025-08 conditional novelty 6.0 of 10

    Regime-switching LMC and KLMC variants inherit Gibbs invariance and get W2 convergence bounds; the headline FRS-KLMC O(1/sqrt(epsilon)) complexity is not supported by the given proof.

Pith tools