On stochastic accelerated gradient with convergence rate
type: Item
instance of: scholarly article
title: On stochastic accelerated gradient with convergence rate
author: Xingxing Zha
author: Yongquan Zhang
author: Yiyuan Cheng
published in: Open Mathematics
publication date: 2023-01-17T00:00:00Z
Mathematics Subject Classification ID: 68Q19
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 7642974
zbMATH Keywords: least-square regression
zbMATH Keywords: logistic regression
zbMATH Keywords: accelerated stochastic approximation
zbMATH Keywords: convergence rate
describes a project that uses: Adam
describes a project that uses: AdaGrad
describes a project that uses: Pegasos
MaRDI profile type: Publication
full work available at URL: math-2022-0499
OpenAlex ID: W4312532619
cites work: A Stochastic Approximation Method
cites work: Acceleration of Stochastic Approximation by Averaging
cites work: Pegasos: primal estimated sub-gradient solver for SVM
cites work: Robust Stochastic Approximation Approach to Stochastic Programming
cites work: Iteration-complexity of first-order penalty methods for convex programming
cites work: Accelerated gradient methods for nonconvex nonlinear and stochastic programming
cites work: Q5396673
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Incrementally updated gradient methods for constrained and regularized optimization
cites work: Smooth minimization of non-smooth functions
cites work: Gradient methods for minimizing composite functions
cites work: An optimal method for stochastic composite optimization
cites work: Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework
cites work: Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
cites work: Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
cites work: Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
cites work: Large-Scale Machine Learning with Stochastic Gradient Descent
cites work: Katyusha: the first direct acceleration of stochastic gradient methods
DOI: 10.1515/MATH-2022-0499
description: scientific article; zbMATH DE number 7642974