GRADSTOP: Early Stopping of Gradient Descent via Posterior Sampling
Arash Jamshidi, Lauri Sepp\"al\"ainen, Katsiaryna Haitsiukevich, Hoang Phuc Hau Luu, Anton Bj\"orklund, Kai Puolam\"aki

TL;DR
GRADSTOP introduces a gradient-based early stopping method that estimates the Bayesian posterior from gradients, avoiding the need for a hold-out validation set and improving performance in data-limited scenarios.
Contribution
It proposes a novel stochastic early stopping technique using gradient information to estimate the Bayesian posterior, eliminating the need for a validation set.
Findings
Achieves small test loss comparable to validation-based methods
Performs well in data-limited settings like transfer learning
Can be integrated into gradient descent libraries with minimal overhead
Abstract
Machine learning models are often learned by minimising a loss function on the training data using a gradient descent algorithm. These models often suffer from overfitting, leading to a decline in predictive performance on unseen data. A standard solution is early stopping using a hold-out validation set, which halts the minimisation when the validation loss stops decreasing. However, this hold-out set reduces the data available for training. This paper presents GRADSTOP, a novel stochastic early stopping method that only uses information in the gradients, which are produced by the gradient descent algorithm ``for free.'' Our main contributions are that we estimate the Bayesian posterior by the gradient information, define the early stopping problem as drawing sample from this posterior, and use the approximated posterior to obtain a stopping criterion. Our empirical evaluation shows…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
