Finding approximate local minima faster than gradient descent (Q4978058): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2609037894 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1611.01146 / rank | |||
Normal rank | |||
Latest revision as of 21:06, 19 April 2024
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
