mlsanityData to 14 Oct 2026

Hyperparameter Loss Surfaces Are Simple Near their Optima

arXiv 2510.02721 ↗First posted 3 Oct 2025cs.LG cs.CL stat.MLcited by 2

Not on the map. Why?

Abstract (arXiv)

Hyperparameters greatly impact models' capabilities; however, modern models are too large for extensive search. Instead, researchers design recipes that train well across scales based on their understanding of the hyperparameters. Despite this importance, few tools exist for understanding the hyperparameter loss surface. We discover novel structure in it and propose a new theory yielding such tools. The loss surface is complex, but as you approach the optimum simple structure emerges. It becomes characterized by a few basic features, like its effective dimension and the best possible loss. To uncover this asymptotic regime, we develop a novel technique based on random search. Within this regime, the best scores from random search take on a new distribution we discover. Its parameters are exactly the features defining the loss surface in the asymptotic regime. From these features, we derive a new asymptotic law for random search that can explain and extrapolate its convergence. These new tools enable new analyses, such as confidence intervals for the best possible performance or determining the effective number of hyperparameters. We make these tools available at https://github.com/nicholaslourie/opda .

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 17 of its 35 references that are in the map. First posted on arXiv 3 Oct 2025.

Builds on

17 of 35 references.

References · 17

  1. 2017Attention Is All You Needcited by 60,361
  2. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  3. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  4. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
  5. 2020Scaling Laws for Neural Language Modelscited by 6,586
  6. 2022A ConvNet for the 2020scited by 3,579
  7. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,682
  8. 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,181
  9. 2021DeBERTaV3: Improving DeBERTa using ELECTRA-Style Pre-Training with Gradient-Disentangled Embedding Sharingcited by 1,254
  10. 2014One weird trick for parallelizing convolutional neural networkscited by 264
  11. 2019A Constructive Prediction of the Generalization Error Across Scalescited by 210
  12. 2024Scaling Laws for Fine-Grained Mixture of Expertscited by 173
5 more
  1. 2019Show Your Work: Improved Reporting of Experimental Resultscited by 169
  2. 2023Scaling Laws of RoPE-based Extrapolationcited by 125
  3. 2024Scaling Laws for Precisioncited by 95
  4. 2024The boundary of neural network trainability is fractalcited by 13
  5. 2023Show Your Work with Confidence: Confidence Bands for Tuning Curvescited by 6

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.