Saved in:
Bibliographic Details
Main Author: Bilel, Bensaid
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2412.14637
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912161282916352
author Bilel, Bensaid
author_facet Bilel, Bensaid
contents The classical Armijo backtracking algorithm achieves the optimal complexity for smooth functions like gradient descent but without any hyperparameter tuning. However, the smoothness assumption is not suitable for Deep Learning optimization. In this work, we show that some variants of the Armijo optimizer achieves acceleration and optimal complexities under assumptions more suited for Deep Learning: the (L 0 , L 1 ) smoothness condition and analyticity. New dependences on the smoothness constants and the initial gap are established. The results theoretically highlight the powerful efficiency of Armijo-like conditions for highly non-convex problems.
format Preprint
id arxiv_https___arxiv_org_abs_2412_14637
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Complexities of Armijo-like algorithms in Deep Learning context
Bilel, Bensaid
Optimization and Control
The classical Armijo backtracking algorithm achieves the optimal complexity for smooth functions like gradient descent but without any hyperparameter tuning. However, the smoothness assumption is not suitable for Deep Learning optimization. In this work, we show that some variants of the Armijo optimizer achieves acceleration and optimal complexities under assumptions more suited for Deep Learning: the (L 0 , L 1 ) smoothness condition and analyticity. New dependences on the smoothness constants and the initial gap are established. The results theoretically highlight the powerful efficiency of Armijo-like conditions for highly non-convex problems.
title Complexities of Armijo-like algorithms in Deep Learning context
topic Optimization and Control
url https://arxiv.org/abs/2412.14637