Delayed supermartingale convergence lemmas for stochastic approximation with Nesterov momentum
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910479424684032 |
|---|---|
| author | Ming-Kun, Zhang |
| author_facet | Ming-Kun, Zhang |
| contents | This paper focus on the convergence of stochastic approximation with Nesterov momentum. Nesterov acceleration has proven effective in machine learning for its ability to reduce computational complexity. The issue of delayed information in the acceleration term remains a challenge to achieving the almost sure convergence. Based on the delayed supermatingale convergence lemmas, we give a series of framework for almost sure convergence. Our framework applies to several widely-used random iterative methods, such as stochastic subgradient methods, the proximal Robbins-Monro method for general stochastic optimization, and the proximal stochastic subgradient method for composite optimization. Through the applications of our framework, these methods with Nesterov acceleration achieve almost sure convergence. And three groups of numerical experiments is to check out theoretical results. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_06018 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Delayed supermartingale convergence lemmas for stochastic approximation with Nesterov momentum Ming-Kun, Zhang Optimization and Control This paper focus on the convergence of stochastic approximation with Nesterov momentum. Nesterov acceleration has proven effective in machine learning for its ability to reduce computational complexity. The issue of delayed information in the acceleration term remains a challenge to achieving the almost sure convergence. Based on the delayed supermatingale convergence lemmas, we give a series of framework for almost sure convergence. Our framework applies to several widely-used random iterative methods, such as stochastic subgradient methods, the proximal Robbins-Monro method for general stochastic optimization, and the proximal stochastic subgradient method for composite optimization. Through the applications of our framework, these methods with Nesterov acceleration achieve almost sure convergence. And three groups of numerical experiments is to check out theoretical results. |
| title | Delayed supermartingale convergence lemmas for stochastic approximation with Nesterov momentum |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2406.06018 |