Finding approximate local minima faster than gradient descent (Q4978058)

From MaRDI portal
Revision as of 21:06, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6761889
Language Label Description Also known as
English
Finding approximate local minima faster than gradient descent
scientific article; zbMATH DE number 6761889

    Statements

    Finding approximate local minima faster than gradient descent (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 August 2017
    0 references
    cubic regularization
    0 references
    deep learning
    0 references
    nonconvex optimization
    0 references
    second-order optimization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references