mlsanityData to 7 Oct 2026

Scalable Hyperparameter-Divergent Ensemble Training with Automatic Learning Rate Exploration for Large Models

arXiv 2604.24708 ↗First posted 27 Apr 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Training large neural networks with data-parallel stochastic gradient descent allocates N GPU replicas to compute effectively identical updates -- a practice that leaves the rich space of learning rate configurations entirely unexplored during training. We propose Hyperparameter-Divergent Ensemble Training (HDET), a method that repurposes these replicas for simultaneous learning rate exploration at negligible communication overhead. HDET operates in alternating phases: a fan-out stage in which replicas train independently under a structured, symmetric spread of learning rates, and a converge stage in which parameters are averaged across all replicas via AllReduce every T steps. Building on this ensemble substrate, we further propose an automatic learning rate (auto-LR) controller that treats the relative training loss across replicas as a performance signal, updating the shared base schedule toward higher-performing configurations via a momentum-based gradient-free meta-update. The combined method produces a self-adapting learning rate schedule that improves both optimization quality and generalization without additional hyperparameter sweeps or training budget. Crucially, the framework generalizes beyond learning rate: any scalar hyperparameter that does not alter model architecture -- such as dropout rate, attention scale temperature, or weight-decay coefficient -- can be explored across replicas using the same fan-out/converge protocol, with inter-replica loss differences serving as zero-order hypergradients that guide the search direction. HDET is implemented as a drop-in replacement for PyTorch's OneCycleLR scheduler, requiring no changes to model architecture, optimizer, or data pipeline.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 23 of its 28 references that are in the map. First posted on arXiv 27 Apr 2026.

Builds on

23 of 28 references.

References · 23

  1. 2017Attention Is All You Needcited by 59,932
  2. 2020Denoising Diffusion Probabilistic Modelscited by 20,851
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  4. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
  5. 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
  6. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
  7. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,194
  8. 2015Cyclical Learning Rates for Training Neural Networkscited by 627
  9. 2017Evolution Strategies as a Scalable Alternative to Reinforcement Learningcited by 555
  10. 2019Deep Ensembles: A Loss Landscape Perspectivecited by 438
  11. 2017Population Based Training of Neural Networkscited by 351
  12. 2024The Road Less Scheduledcited by 158
11 more
  1. 2017Online Learning Rate Adaptation with Hypergradient Descentcited by 117
  2. 2023DiLoCo: Distributed Low-Communication Training of Language Modelscited by 115
  3. 2023Learning-Rate-Free Learning by D-Adaptationcited by 113
  4. 2019Local SGD with Periodic Averaging: Tighter Analysis and Adaptive Synchronizationcited by 106
  5. 2014Deep learning with Elastic Averaging SGDcited by 90
  6. 2023DoG is SGD's Best Friend: A Parameter-Free Dynamic Step Size Schedulecited by 85
  7. 2020Stochastic Weight Averaging in Parallel: Large-Batch Training that Generalizes Wellcited by 57
  8. 2018L4: Practical loss-based stepsize adaptation for deep learningcited by 26
  9. 2018Learning with Random Learning Ratescited by 5
  10. 2024GRAWA: Gradient-based Weighted Averaging for Distributed Training of Deep Learning Modelscited by 4
  11. 2026Beyond Interleaving: Causal Attention Reformulations for Generative Recommender Systemscited by 2

Built on by

Not cited yet.