Finding approximate local minima faster than gradient descent (Q4978058)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding approximate local minima faster than gradient descent |
scientific article; zbMATH DE number 6761889
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding approximate local minima faster than gradient descent |
scientific article; zbMATH DE number 6761889 |
Statements
Finding approximate local minima faster than gradient descent (English)
0 references
17 August 2017
0 references
cubic regularization
0 references
deep learning
0 references
nonconvex optimization
0 references
second-order optimization
0 references
0.8755626
0 references
0.8598255
0 references
0.8555993
0 references
0.85513186
0 references
0.8500608
0 references
0.8461437
0 references
0.8460072
0 references
