Cover Image

Revisiting Stochastic Gradient Descent for Strongly Convex Objectives: Tight Uniform-in-Time Bounds

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chen, Kang, Feng, Yasong, Wang, Tianyu
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Anytime Convergence of Stochastic Gradient Descent with Momentum: From a Continuous-Time Perspective
by: Feng, Yasong, et al.
Published: (2023)

Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods
by: Feng, Yasong, et al.
Published: (2025)

Tight Analysis of Difference-of-Convex Algorithm (DCA) Improves Convergence Rates for Proximal Gradient Descent
by: Rotaru, Teodor, et al.
Published: (2025)

The Sample Complexity of Gradient Descent in Stochastic Convex Optimization
by: Livni, Roi
Published: (2024)

Frictionless Hamiltonian Descent and Coordinate Hamiltonian Descent for Strongly Convex Quadratic Problems
by: Wang, Jun-Kun
Published: (2024)

Adaptive Accelerated Gradient Descent Methods for Convex Optimization
by: Xu, Zeyi, et al.
Published: (2026)

Rapid Overfitting of Multi-Pass Stochastic Gradient Descent in Stochastic Convex Optimization
by: Vansover-Hager, Shira, et al.
Published: (2025)

Tight Lower Bounds under Asymmetric High-Order Hölder Smoothness and Uniform Convexity
by: Bai, Cedar Site, et al.
Published: (2024)

Revisiting Strong Duality, Hidden Convexity, and Gradient Dominance in the Linear Quadratic Regulator
by: Watanabe, Yuto, et al.
Published: (2025)

Gradient Descent for Convex and Smooth Noisy Optimization
by: Hu, Feifei, et al.
Published: (2024)

More Optimal Fractional-Order Stochastic Gradient Descent for Non-Convex Optimization Problems
by: Partohaghighi, Mohammad, et al.
Published: (2025)

Effective Dimension Aware Fractional-Order Stochastic Gradient Descent for Convex Optimization Problems
by: Partohaghighi, Mohammad, et al.
Published: (2025)

Complexity of Projected Gradient Methods for Strongly Convex Optimization with Hölder Continuous Gradient Terms
by: Chen, Xiaojun, et al.
Published: (2026)

Accelerated Objective Gap and Gradient Norm Convergence for Gradient Descent via Long Steps
by: Grimmer, Benjamin, et al.
Published: (2024)

Revisit First-order Methods for Geodesically Convex Optimization
by: Shu, Yunlu, et al.
Published: (2025)

High Probability Convergence Bounds for Non-convex Stochastic Gradient Descent with Sub-Weibull Noise
by: Madden, Liam, et al.
Published: (2020)

Stochastic Adaptive Gradient Descent Without Descent
by: Aujol, Jean-François, et al.
Published: (2025)

Generalized Stochastic Gradient Descent with Momentum Methods for Smooth Optimization
by: Wang, Zimeng, et al.
Published: (2026)

Exponential Stability of Primal-Dual Gradient Dynamics with Non-Strong Convexity
by: Chen, Xin, et al.
Published: (2019)

Tight Bounds for Online Convex Optimization with Adversarial Constraints
by: Sinha, Abhishek, et al.
Published: (2024)

Tight Lower Bounds for the Bit and Inner Product Oracle for Constrained Convex Optimization
by: Basu, Amitabh, et al.
Published: (2025)

Resilient Two-Time-Scale Local Stochastic Gradient Descent for Byzantine Federated Learning
by: Dutta, Amit, et al.
Published: (2024)

Universal Gradient Methods for Stochastic Convex Optimization
by: Rodomanov, Anton, et al.
Published: (2024)

Lower Bounds for Frank-Wolfe on Strongly Convex Sets
by: Halbey, Jannis, et al.
Published: (2026)

Stochastic Gradient Descent Revisited
by: Louzi, Azar
Published: (2024)

Convergence Analysis of Stochastic Gradient Descent with MCMC Estimators
by: Li, Tianyou, et al.
Published: (2023)

Quantitative Convergence Analysis of Projected Stochastic Gradient Descent for Non-Convex Losses via the Goldstein Subdifferential
by: Zheng, Yuping, et al.
Published: (2025)

Tight Finite Time Bounds of Two-Time-Scale Linear Stochastic Approximation with Markovian Noise
by: Haque, Shaan Ul, et al.
Published: (2023)

Perturbed Gradient Descent via Convex Quadratic Approximation for Nonconvex Bilevel Optimization
by: Abolfazli, Nazanin, et al.
Published: (2025)

Matching the Statistical Query Lower Bound for $k$-Sparse Parity Problems with Sign Stochastic Gradient Descent
by: Kou, Yiwen, et al.
Published: (2024)

A New Inexact Gradient Descent Method with Applications to Nonsmooth Convex Optimization
by: Khanh, Pham Duy, et al.
Published: (2023)

Stochastic Modified Equations for Stochastic Gradient Descent in Infinite-Dimensional Hilbert Spaces
by: Cerrai, Sandra, et al.
Published: (2026)

Provable Benefit of Random Permutations over Uniform Sampling in Stochastic Coordinate Descent
by: Kim, Donghwa, et al.
Published: (2025)

Tight Convergence Rates in Gradient Mapping for the Difference-of-Convex Algorithm
by: Rotaru, Teodor, et al.
Published: (2025)

Stochastic Gradient Descent with Strategic Querying
by: Jiang, Nanfei, et al.
Published: (2025)

Stochastic Gradient Descent with Adaptive Data
by: Che, Ethan, et al.
Published: (2024)

Revisiting Stochastic Approximation and Stochastic Gradient Descent
by: Karandikar, Rajeeva Laxman, et al.
Published: (2025)

Zeroth-order Stochastic Cubic Newton Method Revisited
by: Liu, Yu, et al.
Published: (2024)

A Proximal Descent Method for Minimizing Weakly Convex Optimization
by: Liao, Feng-Yi, et al.
Published: (2025)

A Communication-Efficient Stochastic Gradient Descent Algorithm for Distributed Nonconvex Optimization
by: Xie, Antai, et al.
Published: (2024)