Paper

A Resizable Mini-batch Gradient Descent based on a Multi-Armed Bandit

Determining the appropriate batch size for mini-batch gradient descent is always time consuming as it often relies on grid search. This paper considers a resizable mini-batch gradient descent (RMGD) algorithm based on a multi-armed bandit for achieving best performance in grid search by selecting an appropriate batch size at each epoch with a probability defined as a function of its previous success/failure... (read more)

Results in Papers With Code
(↓ scroll down to see all results)