paper-with-me

홈 › Papers

Parameter-free version of Adaptive Gradient Methods for Strongly-Convex Functions

2023-06-11 · Deepak Gouda, Hassan Naveed, Salil Kamath

The optimal learning rate for adaptive gradient methods applied to {\lambda}-strongly convex functions relies on the parameters {\lambda} and learning rate {\eta}. In this paper, we adapt a universal algorithm along the lines of Metagrad, to get rid of this dependence on {\lambda} and {\eta}. The main idea is to concurrently run multiple experts and combine their predictions to a master algorithm. This master enjoys O(d log T) regret bounds.

📄 PDF Abstract BibTeX arXiv:2306.06613

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Interpreting Adaptive Gradient Methods by Parameter Scaling for Learning-Rate-Free Optimization

2024-01-06 · Min-Kook Suh, Seung-Woo Seo

We address the challenge of estimating the learning rate for adaptive gradient methods used in training deep neural networks. While several learning-rate-free approaches have been proposed, they are typically tailored fo…

Parameter-free projected gradient descent

2023-05-31 · Evgenii Chzhen, Christophe Giraud, Gilles Stoltz

We consider the problem of minimizing a convex function over a closed convex set, with Projected Gradient Descent (PGD). We propose a fully parameter-free version of AdaGrad, which is adaptive to the distance between the…

Stochastic Optimization

Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization

2024-06-04 · Ruichen Jiang, Ali Kavis, Qiujiang Jin, Sujay Sanghavi 외

We propose adaptive, line search-free second-order methods with optimal rate of convergence for solving convex-concave min-max problems. By means of an adaptive step size, our algorithms feature a simple update rule that…

Second-order methods

Tuning-Free Sampling via Optimization on the Space of Probability Measures

2025-10-29 · Louis Sharrock, Christopher Nemeth arxiv

We introduce adaptive, tuning-free step size schedules for gradient-based sampling algorithms obtained as time-discretizations of Wasserstein gradient flows. The result is a suite of tuning-free sampling algorithms, incl…

Stochastic Optimization

Can We Remove the Square-Root in Adaptive Gradient Methods? A Second-Order Perspective

2024-02-05 · Wu Lin, Felix Dangel, Runa Eschenhagen, Juhan Bae 외

Adaptive gradient optimizers like Adam(W) are the default training algorithms for many deep learning architectures, such as transformers. Their diagonal preconditioner is based on the gradient outer product which is inco…

Second-order methods