No learning rates needed: Introducing SALSA -- Stable Armijo Line Search Adaptation
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917737340600320 |
|---|---|
| author | Kenneweg, Philip Kenneweg, Tristan Fumagalli, Fabian Hammer, Barbara |
| author_facet | Kenneweg, Philip Kenneweg, Tristan Fumagalli, Fabian Hammer, Barbara |
| contents | In recent studies, line search methods have been demonstrated to significantly enhance the performance of conventional stochastic gradient descent techniques across various datasets and architectures, while making an otherwise critical choice of learning rate schedule superfluous. In this paper, we identify problems of current state-of-the-art of line search methods, propose enhancements, and rigorously assess their effectiveness. Furthermore, we evaluate these methods on orders of magnitude larger datasets and more complex data domains than previously done. More specifically, we enhance the Armijo line search method by speeding up its computation and incorporating a momentum term into the Armijo criterion, making it better suited for stochastic mini-batching. Our optimization approach outperforms both the previous Armijo implementation and a tuned learning rate schedule for the Adam and SGD optimizers. Our evaluation covers a diverse range of architectures, such as Transformers, CNNs, and MLPs, as well as data domains, including NLP and image data.
Our work is publicly available as a Python package, which provides a simple Pytorch optimizer. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_20650 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | No learning rates needed: Introducing SALSA -- Stable Armijo Line Search Adaptation Kenneweg, Philip Kenneweg, Tristan Fumagalli, Fabian Hammer, Barbara Machine Learning Artificial Intelligence In recent studies, line search methods have been demonstrated to significantly enhance the performance of conventional stochastic gradient descent techniques across various datasets and architectures, while making an otherwise critical choice of learning rate schedule superfluous. In this paper, we identify problems of current state-of-the-art of line search methods, propose enhancements, and rigorously assess their effectiveness. Furthermore, we evaluate these methods on orders of magnitude larger datasets and more complex data domains than previously done. More specifically, we enhance the Armijo line search method by speeding up its computation and incorporating a momentum term into the Armijo criterion, making it better suited for stochastic mini-batching. Our optimization approach outperforms both the previous Armijo implementation and a tuned learning rate schedule for the Adam and SGD optimizers. Our evaluation covers a diverse range of architectures, such as Transformers, CNNs, and MLPs, as well as data domains, including NLP and image data. Our work is publicly available as a Python package, which provides a simple Pytorch optimizer. |
| title | No learning rates needed: Introducing SALSA -- Stable Armijo Line Search Adaptation |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2407.20650 |