Stochastic momentum methods for non-convex learning without bounded assumptions (Q6057975): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient Convergence in Gradient methods with Errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization Methods for Large-Scale Machine Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptivity of Stochastic Gradient Methods for Nonconvex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5593503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some methods of speeding up the convergence of iteration methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Stochastic Approximation Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive Polyak heavy-ball method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Understanding Machine Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sign stochastic gradient descents without bounded gradient assumption for the finite sum minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid stochastic optimization framework for composite nonconvex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5149016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of the RMSProp deep learning method with penalty for nonconvex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Varying-Parameter Convergent-Differential Neural-Network for Solving Time-Varying Convex QP Problem Constrained by Linear-Equality / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:57, 3 August 2024

scientific article; zbMATH DE number 7755815
Language Label Description Also known as
English
Stochastic momentum methods for non-convex learning without bounded assumptions
scientific article; zbMATH DE number 7755815

    Statements

    Stochastic momentum methods for non-convex learning without bounded assumptions (English)
    0 references
    0 references
    0 references
    0 references
    26 October 2023
    0 references
    non-convex optimization
    0 references
    last-iterate convergence rate
    0 references
    stochastic momentum methods
    0 references
    PL condition
    0 references
    machine learning
    0 references

    Identifiers