Why random reshuffling beats stochastic gradient descent (Q2227529)

From MaRDI portal
Revision as of 03:44, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Why random reshuffling beats stochastic gradient descent
scientific article

    Statements

    title
    Why random reshuffling beats stochastic gradient descent (English)
    0 references
    author
    Mert Gürbüzbalaban
    0 references
    Pablo A. Parrilo
    0 references
    Asuman Ozdaglar
    0 references
    publication date
    15 February 2021
    0 references
    Mathematics Subject Classification ID
    90C30
    0 references
    90C06
    0 references
    90C25
    0 references
    90C15
    0 references
    zbMATH DE Number
    7310574
    0 references
    zbMATH Keywords
    convergence rate
    0 references
    cycle gradient error
    0 references
    describes a project that uses
    Saga
    0 references
    Jellyfish
    0 references
    OpenAlex ID
    W1866529865
    0 references
    arXiv ID
    1510.08560
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2227529&oldid=33481207"
    Powered by MediaWiki