On the parallelization upper bound for asynchronous stochastic gradients descent in non-convex optimization (Q2696976)
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: On the parallelization upper bound for asynchronous stochastic gradients descent in non-convex optimization |
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
