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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: HOGWILD / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: Optimal Distributed Online Prediction using Mini-Batches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5330291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex trace functions and the Wigner-Yanase-Dyson conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Asynchronous Parallel Stochastic Coordinate Descent Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Razumikhin-type theorems on exponential stability of neutral stochastic functional differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Razumikhin-type theorems on exponential stability of stochastic functional differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivariate trace inequalities / rank
 
Normal rank

Latest revision as of 22:10, 31 July 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
    0 references
    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

    Identifiers