Finding approximate local minima faster than gradient descent (Q4978058): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 09:29, 8 February 2024

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