Adjusted shuffling SARAH: advancing complexity analysis via dynamic gradient weighting

DOI10.1007/S10957-026-03033-YMaRDI QIDQ7293284zbMATH OpenFDO

Authors Duc Toan Nguyen, Trang H. Tran, Lam M. Nguyen

Publication date 9 July 2026

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10957-026-03033-Y

Mathematics Subject Classification ID

Calculus of variations and optimal control; optimization (49-XX) Mathematical programming (90Cxx)

Cites work

• A Stochastic Approximation Method
• Convergence rate of incremental gradient and incremental Newton methods
• Global convergence rate of proximal incremental aggregated gradient methods
• scientific article; zbMATH DE number 3144846 (Why is no real title available?)
• scientific article; zbMATH DE number 7255141 (Why is no real title available?)
• scientific article; zbMATH DE number 7626722 (Why is no real title available?)
• Inexact SARAH algorithm for stochastic optimization
• Learning-rate-free momentum SGD with reshuffling converges in nonsmooth nonconvex optimization
• Linear convergence of cyclic SAGA
• On the Convergence Rate of Incremental Aggregated Gradient Algorithms
• Optimization for deep learning: an overview
• Optimization methods for large-scale machine learning
• Parallel stochastic gradient algorithms for large-scale matrix completion
• Random-reshuffled SARAH does not need full gradient computations
• Shuffling momentum gradient algorithm for convex optimization
• Surpassing gradient descent provably: a cyclic incremental method with linear convergence rate
• The Elements of Statistical Learning
• Variance-Reduced Stochastic Learning Under Random Reshuffling

This page was built for publication: Adjusted shuffling SARAH: advancing complexity analysis via dynamic gradient weighting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7293284)