On the parallelization upper bound for asynchronous stochastic gradients descent in non-convex optimization (Q2696976)

From MaRDI portal
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
    0 references
    0 references
    17 April 2023
    0 references
    0 references
    non-convex optimization
    0 references
    asynchronous parallel optimization
    0 references
    saddle points escaping
    0 references
    deep learning
    0 references
    0 references