scientific article; zbMATH DE number 7626722
From MaRDI portal
Publication:5053196
Recommendations
- scientific article; zbMATH DE number 1322672
- Convergence analysis of gradient descent stochastic algorithms
- Unified analysis of stochastic gradient methods for composite convex and smooth optimization
- Convergence analysis of smoothed stochastic gradient-type algorithm
- On the sufficient descent property of the Shanno's conjugate gradient method
- scientific article; zbMATH DE number 1778080
- scientific article; zbMATH DE number 3871042
- On the convergence analysis of the optimized gradient method
- A unified convergence analysis of stochastic Bregman proximal gradient and extragradient methods
Cites work
- A hybrid stochastic optimization framework for composite nonconvex optimization
- A Stochastic Approximation Method
- Acceleration of Stochastic Approximation by Averaging
- Adaptive subgradient methods for online learning and stochastic optimization
- Convergence rate of incremental gradient and incremental Newton methods
- Convergence rate of incremental subgradient algorithms
- Cubic regularization of Newton method and its global performance
- scientific article; zbMATH DE number 7255141 (Why is no real title available?)
- Incremental subgradient methods for nondifferentiable optimization
- Introductory lectures on convex optimization. A basic course.
- Optimization methods for large-scale machine learning
- Robust Stochastic Approximation Approach to Stochastic Programming
- SGDLibrary: a MATLAB library for stochastic optimization algorithms
- Some methods of speeding up the convergence of iteration methods
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Variance-Reduced Stochastic Learning Under Random Reshuffling
- Why random reshuffling beats stochastic gradient descent
Cited in
(17)- Adaptive step size rules for stochastic optimization in large-scale learning
- Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality
- Random-reshuffled SARAH does not need full gradient computations
- A Unified Convergence Analysis for Shuffling-Type Gradient Methods
- Global stability of first-order methods for coercive tame functions
- Variance-reduced reshuffling gradient descent for nonconvex optimization: centralized and distributed algorithms
- An algorithm for learning representations of models with scarce data
- A new random reshuffling method for nonsmooth nonconvex finite-sum optimization
- Last-iterate convergence of shuffling momentum gradient method under the Kurdyka-Lojasiewicz inequality
- Shuffling momentum gradient algorithm for convex optimization
- Sharp bounds for sequential federated learning on heterogeneous data
- Communication-efficient distributed gradient descent via random projection
- Convergence of ease-controlled random reshuffling gradient algorithms under Lipschitz smoothness
- Natural Gradient Variational Bayes Without Fisher Matrix Analytic Calculation and Its Inversion
- Convergence of Adam for non-convex objectives: relaxed hyperparameters and non-ergodic case
- A unified theoretical framework for the last-iterate convergence of stochastic adaptive optimization
- Adjusted shuffling SARAH: advancing complexity analysis via dynamic gradient weighting
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5053196)
