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

Documenti analoghi

• The Anytime Convergence of Stochastic Gradient Descent with Momentum: From a Continuous-Time Perspective
  di: Feng, Yasong, et al.
  Pubblicazione: (2023)
• Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods
  di: Feng, Yasong, et al.
  Pubblicazione: (2025)
• Tight Analysis of Difference-of-Convex Algorithm (DCA) Improves Convergence Rates for Proximal Gradient Descent
  di: Rotaru, Teodor, et al.
  Pubblicazione: (2025)
• The Sample Complexity of Gradient Descent in Stochastic Convex Optimization
  di: Livni, Roi
  Pubblicazione: (2024)
• Frictionless Hamiltonian Descent and Coordinate Hamiltonian Descent for Strongly Convex Quadratic Problems
  di: Wang, Jun-Kun
  Pubblicazione: (2024)