Learning Rate Optimization for Deep Neural Networks Using Lipschitz Bandits

Padma Priyanka, Sheetal Kalyani, Avhishek Chatterjee
9/15/2024
cs.LG

No confident code implementation found for this paper.

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.

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{priyanka2024learning,
  title  = {Learning Rate Optimization for Deep Neural Networks Using Lipschitz Bandits},
  author = {Padma Priyanka and Sheetal Kalyani and Avhishek Chatterjee},
  year   = {2024},
  eprint = {2409.09783},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2409.09783v1}
}

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/2409.09783.svg)](https://codeofpaper.com/paper/2409.09783)

Discussion