Skip to content
AI.info

Training and optimization

Validation, Early Stopping, and Checkpoint Choice

Design validation cadence, patience, checkpoint metrics, tie-breakers, and final evaluation so model selection remains statistically honest.

By the end you can

Example

The best checkpoint depends on what “best” was allowed to mean

A run may produce hundreds of candidate states. The rule that picks one of them can be written down in advance, and it does not have to be the argmax of a curve.

The 2017 Transformer paper wrote its rule down. Every architecture variation in it was scored on a development set — Table 3 says the metrics are “on the English-to-German translation development set, newstest2013” — and the translation models it reported were not single checkpoints at all. Vaswani and colleagues state the policy in Section 6.1: “For the base models, we used a single model obtained by averaging the last 5 checkpoints, which were written at 10-minute intervals. For the big models, we averaged the last 20 checkpoints.” The cadence is stated. The window is stated. The operation is stated. A reader can reproduce the selection without ever being told which individual checkpoint scored highest, because no individual checkpoint was chosen.

That is one answer among several. Below, the same question asked five other ways.

  • Lowest validation loss: Often useful for probabilistic fit, but not always the deployment metric.
  • Highest recall: Can exceed review capacity or destroy precision.
  • Best composite score: Encodes tradeoffs that need stable weights and units.
  • Earliest acceptable checkpoint: Saves compute and may reduce overfitting.
  • Pareto candidate: Preserves several options when latency, calibration, and quality conflict.

More frequent validation creates more selection opportunities

Evaluating every few steps can identify short-lived peaks, but it also increases compute and the chance of choosing noise. Validating rarely may miss a meaningful transition, or spend budget long after the model started getting worse.

Cadence should match metric variability, schedule phases, and cost. Report how many checkpoints were considered.

The cost of considering many has been measured, and the failure has a name. Overtuning is overfitting to the validation estimate at the level of selection rather than at the level of weights. A 2025 reanalysis of hyperparameter-optimization benchmark data, by Schneider and colleagues, found it more common than previously assumed and usually mild: roughly 60% of runs showed none at all. The tail is the part that matters. “In approximately 10% of cases, overtuning leads to the selection of a seemingly optimal HPC with worse generalization error than the default or first configuration tried.” Severity concentrates in the small-data regime, which is exactly where frequent validation on a small held-out split is most tempting.

Ordinary fine-tuning shows the same thing. Dodge and colleagues fine-tuned BERT hundreds of times per task in 2020, “varying only the random seeds”, and released “training and validation scores for 2,100 trials”. On small datasets “many fine-tuning trials diverge part of the way through training”. Stopping the weakest runs early is a budget decision, and their paper offers “best practices for practitioners to stop training less promising runs early”.

For inference, normalization buffers, tokenizer or preprocessing versions, and calibration parameters may be essential. For resume, optimizer, scheduler, scaler, sampler, and random states also matter. Label every checkpoint by its purpose. “Best model” is incomplete when the surrounding state and selection metric are absent.

Checkpoint count is part of the model-selection procedure.

Comparison

Raw, smoothed, and sequential decisions

Smoothing changes how long a real turn takes to show, and how often a stop fires on noise.

A minimum-improvement threshold is a claim about how large a change has to be before it is not fluctuation. So it has to clear something measurable, and the fluctuation has been measured. Bouthillier and colleagues modelled every source of it in a 2021 benchmark across five deep-learning tasks and architectures. Data sampling, parameter initialization and hyperparameter choice each move benchmark results materially. They move them enough that an estimator deliberately randomising more of those sources approximates the ideal exhaustive estimator better than a lower-variance one that holds them fixed, at 51× less compute. Their second recommendation states the consequence: “Deciding of whether the benchmarks give evidence that one algorithm outperforms another should not build solely on comparing average performance but account for variance.”

An early-stopping rule makes that comparison in miniature, once per validation event, against whichever of those sources the run leaves free. A raw-metric rule with no declared delta is that comparison made without the variance term.

FigureComparison · 3 columns

Raw metric

React to each validation observation directly.

  • Strength: immediate
  • Risk: noisy stops
  • Use: stable large validation sets
  • Need: minimum delta

Smoothed metric

Average or filter several observations before deciding.

  • Strength: noise reduction
  • Risk: delayed response
  • Use: frequent evaluation
  • Need: declared window

Confidence-aware rule

Use uncertainty or repeated evaluation to judge meaningful change.

  • Strength: explicit evidence
  • Risk: more compute
  • Use: high-stakes selection
  • Need: valid dependence model

Visual

An early-stopping policy has several independent controls

Write them before the run begins. Each control below is a separate decision. Leaving one unstated does not remove it — it fixes it at whatever the framework's default happens to be, chosen by nobody and reported by no one.

FigureHierarchy · 6 levels
  • Selection metric

    The measure used to rank or accept checkpoints.

    • Evaluation cadence

      How often the metric is computed.

      • Minimum improvement

        The change considered meaningful rather than noise.

        • Patience window

          How long to continue without sufficient improvement.

          • Restore rule

            Which checkpoint is loaded after stopping.

            • Tie-breakers

              How latency, calibration, or simplicity resolve similar scores.

Analogy

Auditioning many performers with the same panel

One panel gives the rehearsal advice, watches every attempt, and then selects the best performance it has seen. The panel is no longer an independent judge.

Every additional audition spends a little more of that independence, and none of it comes back at the end. A validation set consumed by repeated checkpoint selection behaves the same way.

A validation set guides development; a final test estimates after development decisions stop.

Validation is a decision instrument, not untouched final evidence

Learning rates, loss weights, augmentation, patience, architecture, and checkpoint choice are all influenced by validation results. Repeated access therefore adapts the project to that set.

A final test or later temporal holdout is needed for a less biased estimate after decisions are frozen. Even that evidence can be exhausted if reused for another round.

The Netflix Prize was built around that split, and its organisers said why. About 3 million withheld ratings formed a qualifying set. Half of it scored the public leaderboard: RMSE “is computed immediately and automatically for a fixed but unknown half of the qualifying set (the “quiz” subset)”, wrote Bennett and Lanning, both of Netflix, describing the design in 2007. The other half, the test subset, “is not reported and is used by Netflix to identify potential winners of a Prize”. A third subset, the probe, kept its labels and was attached to the training data so teams could check themselves offline. Yehuda Koren, whose team took the $1M Grand Prize, gave the reason for the second, silent half in his own report on the winning solution: “This precludes clever systems which might “game” the competition by learning about the Quiz set through repeated submissions.” Every entrant got a validation set to develop against. The prize was decided on a set nobody ever saw a score from.

Every look at held-out performance spends some selection freedom.

Case

What a fresh test set costs models selected on the old one

Someone built the fresh test set and priced the reused one. In 2019 Recht and colleagues built new test sets for CIFAR-10 and ImageNet. Across a broad range of models they found “accuracy drops of 3% - 15% on CIFAR-10 and 11% - 14% on ImageNet”. Blum and Hardt had made the same worry precise in 2015: a public leaderboard lets participants “begin to overfit to the holdout data”, and their Ladder algorithm limits what each new submission can learn.

The other half of the picture is that the same team went looking for that overfitting in the wild and largely failed to find it. Also in 2019, Roelofs and colleagues took 120 Kaggle classification competitions, kept those with at least 1,000 submissions before the deadline, and compared each submission's public-leaderboard score against its score on the private split. The effect sizes were typically small, “e.g., less than 1% classification accuracy”. Their conclusion: “Overall, we conclude that the classification competitions on Kaggle show little to no signs of overfitting.”

The two results measure different things and both are worth carrying. Rebuilding a test set from scratch also changes the distribution. Reusing one, as a leaderboard does, changes only who has seen it. Three to fifteen points on a rebuilt CIFAR-10 set and under one point of adaptivity gap across 120 real competitions are compatible. What they jointly imply is that the number of checkpoints considered is a quantity to report and calibrate against, not a reason to stop looking at held-out data.

Visual

Predefine checkpoint selection

Every entry below is fixed before the run launches, not after the curves arrive.

Step 5 is not only a research convention. Regulators have written it down. On 27 October 2021 the US FDA, Health Canada and the UK MHRA jointly issued ten Guiding Principles for Good Machine Learning Practice for Medical Device Development. Guiding Principle 4 is “Training data sets are independent of test sets”, and it spells out what independence obliges a developer to do: “Training and test datasets are selected and maintained to be appropriately independent of one another. All potential sources of dependence, including patient, data acquisition and site factors are considered and addressed to assure independence.” The verbs are active. Dependence is to be enumerated and addressed, not assumed absent because two files were split by a random seed. A checkpoint chosen by looking at the final set is a source of dependence like any other.

FigureProcess · 5 steps
  1. 1. Choose the primary metric

    Tie it to the intended decision and stable validation protocol.

  2. 2. Set minimum change

    Use domain relevance and metric uncertainty rather than arbitrary decimals.

  3. 3. Set cadence and patience

    Express patience in validation events and underlying resource consumed.

  4. 4. Define tie-breakers

    Prefer calibration, simplicity, latency, or earlier checkpoints when quality is equivalent.

  5. 5. Freeze before final test

    Lock the chosen state and all thresholds before using final evidence.

Key takeaways