Pith. sign in

REVIEW 3 cited by

HyperbolicLR: Epoch insensitive learning rate scheduler

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 2407.15200 v3 pith:N2GAMCOT submitted 2024-07-21 cs.LG cs.AI

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

This study proposes two novel learning rate schedulers -- Hyperbolic Learning Rate Scheduler (HyperbolicLR) and Exponential Hyperbolic Learning Rate Scheduler (ExpHyperbolicLR) -- to address the epoch sensitivity problem that often causes inconsistent learning curves in conventional methods. By leveraging the asymptotic behavior of hyperbolic curves, the proposed schedulers maintain more stable learning curves across varying epoch settings. Specifically, HyperbolicLR applies this property directly in the epoch-learning rate space, while ExpHyperbolicLR extends it to an exponential space. We first determine optimal hyperparameters for each scheduler on a small number of epochs, fix these hyperparameters, and then evaluate performance as the number of epochs increases. Experimental results on various deep learning tasks (e.g., image classification, time series forecasting, and operator learning) demonstrate that both HyperbolicLR and ExpHyperbolicLR achieve more consistent performance improvements than conventional schedulers as training duration grows. These findings suggest that our hyperbolic-based schedulers offer a more robust and efficient approach to deep network optimization, particularly in scenarios constrained by computational resources or time.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. FedA2L: Adaptive layer-wise learning rate adjustment in decentralized federated learning

    cs.LG 2026-08 conditional novelty 6.0 of 10

    FedA2L adapts per-layer learning rates from local weight-divergence and aggregation-stability signals, accelerating convergence in decentralized federated learning without extra communication.

  2. CIKAN: Constraint Informed Kolmogorov-Arnold Networks for Autonomous Spacecraft Rendezvous using Time Shift Governor

    eess.SY 2024-12 conditional novelty 5.0 of 10

    CIKAN, a KAN-based constraint-informed network, approximates the Time Shift Governor for spacecraft rendezvous and, in simulation, enforces constraints while reducing average computation time and fuel use relative to ...

  3. Learning Hamiltonian Dynamics with Bayesian Data Assimilation

    cs.LG 2025-01 conditional novelty 4.0 of 10

    An autoregressive Hamiltonian neural network coupled with an unscented Kalman filter improves long-term trajectory prediction and uncertainty quantification for unknown Hamiltonian systems.

Pith tools