On the parallelization upper bound for asynchronous stochastic gradients descent in non-convex optimization (Q2696976): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10957-022-02141-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4310657725 / rank | |||
Normal rank | |||
Revision as of 02:49, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the parallelization upper bound for asynchronous stochastic gradients descent in non-convex optimization |
scientific article |
Statements
On the parallelization upper bound for asynchronous stochastic gradients descent in non-convex optimization (English)
0 references
17 April 2023
0 references
non-convex optimization
0 references
asynchronous parallel optimization
0 references
saddle points escaping
0 references
deep learning
0 references
