Table of Contents
Fetching ...

Learning Rate Optimization for Deep Neural Networks Using Lipschitz Bandits

Padma Priyanka, Sheetal Kalyani, Avhishek Chatterjee

TL;DR

A Lipschitz bandit-driven approach for tuning the learning rate of neural networks is proposed, which enables more efficient training of neural networks, leading to less training time and less computational cost.

Abstract

Learning rate is a crucial parameter in training of neural networks. A properly tuned learning rate leads to faster training and higher test accuracy. In this paper, we propose a Lipschitz bandit-driven approach for tuning the learning rate of neural networks. The proposed approach is compared with the popular HyperOpt technique used extensively for hyperparameter optimization and the recently developed bandit-based algorithm BLiE. The results for multiple neural network architectures indicate that our method finds a better learning rate using a) fewer evaluations and b) lesser number of epochs per evaluation, when compared to both HyperOpt and BLiE. Thus, the proposed approach enables more efficient training of neural networks, leading to lower training time and lesser computational cost.

Learning Rate Optimization for Deep Neural Networks Using Lipschitz Bandits

TL;DR

A Lipschitz bandit-driven approach for tuning the learning rate of neural networks is proposed, which enables more efficient training of neural networks, leading to less training time and less computational cost.

Abstract

Learning rate is a crucial parameter in training of neural networks. A properly tuned learning rate leads to faster training and higher test accuracy. In this paper, we propose a Lipschitz bandit-driven approach for tuning the learning rate of neural networks. The proposed approach is compared with the popular HyperOpt technique used extensively for hyperparameter optimization and the recently developed bandit-based algorithm BLiE. The results for multiple neural network architectures indicate that our method finds a better learning rate using a) fewer evaluations and b) lesser number of epochs per evaluation, when compared to both HyperOpt and BLiE. Thus, the proposed approach enables more efficient training of neural networks, leading to lower training time and lesser computational cost.
Paper Structure (12 sections, 4 equations, 3 figures, 4 tables, 1 algorithm)

This paper contains 12 sections, 4 equations, 3 figures, 4 tables, 1 algorithm.

Figures (3)

  • Figure 1: Best trace comparison of Zooming algorithm and HyperOpt for Single hidden layer ReLU network
  • Figure 2: Best trace comparison of Zooming algorithm and HyperOpt for Single hidden layer Sigmoid network
  • Figure 3: Best trace comparison of Zooming algorithm and HyperOpt for ResNet20 network architecture with CIFAR10 dataset.