Tune without Validation: Searching for Learning Rate and Weight Decay on Training Sets

Lorenzo Brigato, Stavroula Mougiakakou
3/8/2024
cs.LGcs.CV

No confident code implementation found for this paper.

Abstract

We introduce Tune without Validation (Twin), a pipeline for tuning learning rate and weight decay without validation sets. We leverage a recent theoretical framework concerning learning phases in hypothesis space to devise a heuristic that predicts what hyper-parameter (HP) combinations yield better generalization. Twin performs a grid search of trials according to an early-/non-early-stopping scheduler and then segments the region that provides the best results in terms of training loss. Among these trials, the weight norm strongly correlates with predicting generalization. To assess the effectiveness of Twin, we run extensive experiments on 20 image classification datasets and train several families of deep networks, including convolutional, transformer, and feed-forward models. We demonstrate proper HP selection when training from scratch and fine-tuning, emphasizing small-sample scenarios.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{brigato2024tune,
  title  = {Tune without Validation: Searching for Learning Rate and Weight Decay on Training Sets},
  author = {Lorenzo Brigato and Stavroula Mougiakakou},
  year   = {2024},
  eprint = {2403.05532},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2403.05532v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2403.05532.svg)](https://codeofpaper.com/paper/2403.05532)

Discussion