paper-with-me

홈 › Papers

Learning Rate Optimization for Deep Neural Networks Using Lipschitz Bandits

2024-09-15 · Padma Priyanka, Sheetal Kalyani, Avhishek Chatterjee

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.

📄 PDF Abstract BibTeX arXiv:2409.09783

Code (0)

등록된 구현이 없습니다.

Tasks

Hyperparameter Optimization

Similar Papers 제목 키워드 기반

Invariant Lipschitz Bandits: A Side Observation Approach

2022-12-14 · Nam Phuong Tran, Long Tran-Thanh

Symmetry arises in many optimization and decision-making problems, and has attracted considerable attention from the optimization community: By utilizing the existence of such symmetries, the process of searching for opt…

Decision MakingSequential Decision Making

Lipschitz Dueling Bandits over Continuous Action Spaces

2026-04-01 · Mudit Sharma, Shweta Jain, Vaneet Aggarwal, Ganesh Ghalme arxiv

We study for the first time, stochastic dueling bandits over continuous action spaces with Lipschitz structure, where feedback is purely comparative. While dueling bandits and Lipschitz bandits have been studied separate…

Comparator-adaptive Convex Bandits

2020-07-16 · NeurIPS 2020 12 · Dirk van der Hoeven, Ashok Cutkosky, Haipeng Luo

We study bandit convex optimization methods that adapt to the norm of the comparator, a topic that has only been studied before for its full-information counterpart. Specifically, we develop convex bandit algorithms with…

Lipschitz Bandits: Regret Lower Bounds and Optimal Algorithms

2014-05-19 · Stefan Magureanu, Richard Combes, Alexandre Proutiere

We consider stochastic multi-armed bandit problems where the expected reward is a Lipschitz function of the arm, and where the set of arms is either discrete or continuous. For discrete Lipschitz bandits, we derive asymp…

Multi-Armed Bandits

Every Call is Precious: Global Optimization of Black-Box Functions with Unknown Lipschitz Constants

2025-02-06 · Fares Fourati, Salma Kharrat, Vaneet Aggarwal, Mohamed-Slim Alouini

Optimizing expensive, non-convex, black-box Lipschitz continuous functions presents significant challenges, particularly when the Lipschitz constant of the underlying function is unknown. Such problems often demand numer…

global-optimization