Cover Image

Stochastic Gradient Descent Revisited

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Louzi, Azar
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Probability Machine Learning 90C15, 90C26, 90C60
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Shuffling the Stochastic Mirror Descent via Dual Lipschitz Continuity and Kernel Conditioning
by: Qiu, Junwen, et al.
Published: (2026)

Optimal Asymptotic Rates for (Stochastic) Gradient Descent under the Local PL-Condition: A Geometric Approach
by: Kassing, Sebastian, et al.
Published: (2026)

A Generalized Version of Chung's Lemma and its Applications
by: Jiang, Li, et al.
Published: (2024)

A Normal Map-Based Proximal Stochastic Gradient Method: Convergence and Identification Properties
by: Qiu, Junwen, et al.
Published: (2023)

Taming Nonconvex Stochastic Mirror Descent with General Bregman Divergence
by: Fatkhullin, Ilyas, et al.
Published: (2024)

An Algebraically Converging Stochastic Gradient Descent Algorithm for Global Optimization
by: Engquist, Björn, et al.
Published: (2022)

Stochastic First-Order Methods with Non-smooth and Non-Euclidean Proximal Terms for Nonconvex High-Dimensional Stochastic Optimization
by: Xie, Yue, et al.
Published: (2024)

Projected Gradient Methods with Momentum
by: Lapucci, Matteo, et al.
Published: (2026)

A Globally Convergent Gradient Method with Momentum
by: Lapucci, Matteo, et al.
Published: (2024)

Riemannian Gradient Method with Momentum
by: Leggio, Filippo, et al.
Published: (2026)

Optimization without Retraction on the Random Generalized Stiefel Manifold
by: Vary, Simon, et al.
Published: (2024)

A New Random Reshuffling Method for Nonsmooth Nonconvex Finite-sum Optimization
by: Qiu, Junwen, et al.
Published: (2023)

High Probability Guarantees for Random Reshuffling
by: Yu, Hengxu, et al.
Published: (2023)

On Tackling High-Dimensional Nonconvex Stochastic Optimization via Stochastic First-Order Methods with Non-smooth Proximal Terms and Variance Reduction
by: Xie, Yue, et al.
Published: (2025)

What is the long-run distribution of stochastic gradient descent? A large deviations analysis
by: Azizian, Waïss, et al.
Published: (2024)

Metric Entropy-Free Sample Complexity Bounds for Sample Average Approximation in Convex Stochastic Programming
by: Liu, Hongcheng, et al.
Published: (2024)

A Stochastic Quasi-Newton Method in the Absence of Common Random Numbers
by: Menickelly, Matt, et al.
Published: (2023)

Boosted Stochastic Frank-Wolfe for Constrained Nonconvex Optimization
by: Nandhan, Navil, et al.
Published: (2026)

Depth-first directional search for nonconvex optimization
by: Zhang, Yuxuan, et al.
Published: (2024)

A KL-based Analysis Framework with Applications to Non-Descent Optimization Methods
by: Qiu, Junwen, et al.
Published: (2024)

Global Optimization of Gaussian processes
by: Schweidtmann, Artur M., et al.
Published: (2020)

Bilevel Learning via Inexact Stochastic Gradient Descent
by: Salehi, Mohammad Sadegh, et al.
Published: (2025)

MoSSP: A Momentum-Based Single-Loop Stochastic Penalty Method for Nonconvex Constrained DC-Regularized Optimization
by: Li, Luxuan, et al.
Published: (2026)

Norm-induced Cuts: Outer Approximation for Lipschitzian Constraint Functions
by: Göß, Adrian, et al.
Published: (2024)

Convex Regularization and Convergence of Policy Gradient Flows under Safety Constraints
by: Malo, Pekka, et al.
Published: (2024)

A Fisher-Rao gradient flow for entropy-regularised Markov decision processes in Polish spaces
by: Kerimkulov, Bekzhan, et al.
Published: (2023)

Stochastic Optimization under Hidden Convexity
by: Fatkhullin, Ilyas, et al.
Published: (2023)

Scenario approach for minmax optimization with emphasis on the nonconvex case: positive results and caveats
by: K, Mishal Assif P, et al.
Published: (2019)

A Unifying Convexification Framework for Chance-Constrained Programs via Bilinear Extended Formulations over a Simplex
by: Davarnia, Danial, et al.
Published: (2025)

Extended Triangle Inequalities for Nonconvex Box-Constrained Quadratic Programming
by: Anstreicher, Kurt M., et al.
Published: (2025)

Natural Gradient VI: Guarantees for Non-Conjugate Models
by: Sun, Fangyuan, et al.
Published: (2025)

Gradient Norm Regularization Second-Order Algorithms for Solving Nonconvex-Strongly Concave Minimax Problems
by: Wang, Jun-Lin, et al.
Published: (2024)

Random Reshuffling with Momentum for Nonconvex Problems: Iteration Complexity and Last Iterate Convergence
by: Qiu, Junwen, et al.
Published: (2024)

Achieving $\tilde{\mathcal{O}}(1/N)$ Optimality Gap in Restless Bandits through Gaussian Approximation
by: Yan, Chen, et al.
Published: (2024)

Policy Gradient Algorithms for Robust MDPs with Non-Rectangular Uncertainty Sets
by: Li, Mengmeng, et al.
Published: (2023)

Effective Front-Descent Algorithms with Convergence Guarantees
by: Lapucci, Matteo, et al.
Published: (2024)

Application and issues in abstract convexity
by: Millán, Reinier Díaz, et al.
Published: (2022)

Convex quadratic sets and the complexity of mixed integer convex quadratic programming
by: Del Pia, Alberto
Published: (2023)

BattOpt: Optimal Facility Planning for Electric Vehicle Battery Recycling
by: Brun, Matthew, et al.
Published: (2024)

Optimization with Trained Machine Learning Models Embedded
by: Schweidtmann, Artur M., et al.
Published: (2022)