Cargando…
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...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Public Library of Science
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7402485/ https://www.ncbi.nlm.nih.gov/pubmed/32750097 http://dx.doi.org/10.1371/journal.pone.0236661 |