REVISITING LARS FOR LARGE BATCH TRAINING GENERALIZATION OF NEURAL NETWORKS
Khoi Hoang Do, Duong Minh Nguyen, Hoa Tien Nguyen, Long Tran-Thanh, Viet Quoc Pham
OpenReview ground truth
TL;DR — Analysis on LARS, LAMB and new optimizers for general applications and large-batch training
Abstract
LARS and LAMB have emerged as prominent techniques in Large Batch Learn- ing (LBL), ensuring the stability of AI training. One of the primary challenges in LBL is convergence stability, where the AI agent usually gets trapped into the sharp minimizer. Addressing this challenge, a relatively recent technique, known as warm-up, has been employed. However, warm-up lacks a strong theoretical foundation, leaving the door open for further exploration of more efficacious al- gorithms. In light of this situation, we conduct empirical experiments to analyze the behaviors of the two most popular optimizers in the LARS family: LARS and LAMB, with and without a warm-up strategy. Our analyses give a compre- hensive insight into the behavior of LARS, LAMB, and the necessity of a warm- up technique in LBL, including an explanation of their failure in many cases. Building upon these insights, we propose a novel algorithm called Time Varying LARS (TVLARS), which facilitates robust training in the initial phase without the need for warm-up. We run extensive experimental evaluations to demonstrate that TVLARS achieves competitive results with LARS and LAMB when warm-up is utilized while surpassing their performance without the warm-up technique.
Author context
Most prolific author: 2 submissions (credibility 1.00).
No mass-submission penalty for this paper (authors within normal submission volume).
Aggregate statistics only — no individual author rankings.
Ranking trajectory
Percentile by tournament round — convergence indicates rating stability.
Battle history — 34 comparisons
Ranked above opponent in 34% of matchups.
- ▲ beat NDIM: Neuronal Diversity Inspired Model fo… ×10
- ▼ lost to RayE-Sub: Countering Subgraph Degradation … ×4
- ▼ lost to Stochastic Subnetwork Annealing: A Regular… ×4
- ▼ lost to Closing the gap on tabular data with Fouri… ×4
- ▲ beat Detecting Language Model Attacks With Perp… ×4
Judge assessments
Mean overall score 0.0 ± 0.0 (n = 34)