Beyond convexity-Contraction and global convergence of gradient descent.
This paper considers the analysis of continuous time gradient-based optimization algorithms through the lens of nonlinear contraction theory. It demonstrates that in the case of a time-invariant objective, most elementary results on gradient descent based on convexity can be replaced by much more ge...
Збережено в:
| Автори: | , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
Public Library of Science (PLoS)
2020-01-01
|
| Серія: | PLoS ONE |
| Онлайн доступ: | https://doi.org/10.1371/journal.pone.0236661 |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|