Pith. sign in

Exploring loss function topology with cyclical learning rates

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
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

fields

stat.CO 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Regime-Switching Langevin Monte Carlo Algorithms

stat.CO · 2025-08-31 · conditional · novelty 6.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Regime-Switching Langevin Monte Carlo Algorithms stat.CO · 2025-08-31 · conditional · none · ref 46 · internal anchor

    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.