mlsanityData to 7 Oct 2026

The Unreasonable Effectiveness Of Early Discarding After One Epoch In Neural Network Hyperparameter Optimization

arXiv 2404.04111 ↗First posted 5 Apr 2024cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

To reach high performance with deep learning, hyperparameter optimization (HPO) is essential. This process is usually time-consuming due to costly evaluations of neural networks. Early discarding techniques limit the resources granted to unpromising candidates by observing the empirical learning curves and canceling neural network training as soon as the lack of competitiveness of a candidate becomes evident. Despite two decades of research, little is understood about the trade-off between the aggressiveness of discarding and the loss of predictive performance. Our paper studies this trade-off for several commonly used discarding techniques such as successive halving and learning curve extrapolation. Our surprising finding is that these commonly used techniques offer minimal to no added value compared to the simple strategy of discarding after a constant number of epochs of training. The chosen number of epochs depends mostly on the available compute budget. We call this approach i-Epoch (i being the constant number of epochs with which neural networks are trained) and suggest to assess the quality of early discarding techniques by comparing how their Pareto-Front (in consumed training epochs and predictive performance) complement the Pareto-Front of i-Epoch.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 20 of its 30 references that are in the map. First posted on arXiv 5 Apr 2024.

Builds on

20 of 30 references.

References · 20

  1. 2016Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimizationcited by 688
  2. 2022TabPFN: A Transformer That Solves Small Tabular Classification Problems in a Secondcited by 643
  3. 2018BOHB: Robust and Efficient Hyperparameter Optimization at Scalecited by 466
  4. 2021Transformers Can Do Bayesian Inferencecited by 338
  5. 2015Non-stochastic Best Arm Identification and Hyperparameter Optimizationcited by 219
  6. 2018A System for Massively Parallel Hyperparameter Tuningcited by 201
  7. 2016Fast Bayesian Optimization of Machine Learning Hyperparameters on Large Datasetscited by 131
  8. 2020Hyper-Parameter Optimization: A Review of Algorithms and Applicationscited by 114
  9. 2021HPOBench: A Collection of Reproducible Multi-Fidelity Benchmark Problems for HPOcited by 111
  10. 2019Practical Multi-fidelity Bayesian Optimization for Hyperparameter Tuningcited by 91
  11. 2018Understanding Short-Horizon Bias in Stochastic Meta-Optimizationcited by 68
  12. 2021The Shape of Learning Curves: a Reviewcited by 67
8 more
  1. 2021YAHPO Gym -- An Efficient Multi-Objective Multi-Fidelity Benchmark for Hyperparameter Optimizationcited by 61
  2. 2019Tabular Benchmarks for Joint Architecture and Hyperparameter Optimizationcited by 57
  3. 2023Efficient Bayesian Learning Curve Extrapolation using Prior-Data Fitted Networkscited by 37
  4. 2022Learning Curves for Decision Making in Supervised Machine Learning: A Surveycited by 27
  5. 2021Fast and Informative Model Selection using Learning Curve Cross-Validationcited by 15
  6. 2022PASHA: Efficient HPO and NAS with Progressive Resource Allocationcited by 13
  7. 2023Is One Epoch All You Need For Multi-Fidelity Hyperparameter Optimization?cited by 6
  8. 2017The Prediction Advantage: A Universally Meaningful Performance Measure for Classification and Regressioncited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 2; 2026: 2.

5 papers.