Cover Image

Last Iterate Convergence of AdaGrad-Norm for Convex Non-Smooth Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Preobrazhenskaia, Margarita, Sidorov, Makar, Preobrazhenskii, Igor, Gorbunov, Eduard
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Clipping Improves Adam-Norm and AdaGrad-Norm when the Noise Is Heavy-Tailed
by: Chezhegov, Savelii, et al.
Published: (2024)

A Riemannian AdaGrad-Norm Method
by: Bento, Glaydston de C., et al.
Published: (2025)

AdaGrad under Anisotropic Smoothness
by: Liu, Yuxing, et al.
Published: (2024)

Revisiting Convergence of AdaGrad with Relaxed Assumptions
by: Hong, Yusu, et al.
Published: (2024)

Remove that Square Root: A New Efficient Scale-Invariant Version of AdaGrad
by: Choudhury, Sayantan, et al.
Published: (2024)

Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimization
by: Jiang, Ruichen, et al.
Published: (2024)

Universality of AdaGrad Stepsizes for Stochastic Optimization: Inexact Oracle, Acceleration and Variance Reduction
by: Rodomanov, Anton, et al.
Published: (2024)

AdaGrad Meets Muon: Adaptive Stepsizes for Orthogonal Updates
by: Zhang, Minxin, et al.
Published: (2025)

AdaGrad-Diff: A New Version of the Adaptive Gradient Algorithm
by: Bojovic, Matia, et al.
Published: (2026)

Modeling AdaGrad, RMSProp, and Adam with Integro-Differential Equations
by: Heredia, Carlos
Published: (2024)

Convergence of Clipped-SGD for Convex $(L_0,L_1)$-Smooth Optimization with Heavy-Tailed Noise
by: Chezhegov, Savelii, et al.
Published: (2025)

Can Adaptive Gradient Methods Converge under Heavy-Tailed Noise? A Case Study of AdaGrad
by: Liu, Zijian
Published: (2026)

Linear Convergence Rate in Convex Setup is Possible! Gradient Descent Method Variants under $(L_0,L_1)$-Smoothness
by: Lobanov, Aleksandr, et al.
Published: (2024)

Methods with Local Steps and Random Reshuffling for Generally Smooth Non-Convex Federated Optimization
by: Demidovich, Yury, et al.
Published: (2024)

Last-Iterate Complexity of SGD for Convex and Smooth Stochastic Problems
by: Garrigos, Guillaume, et al.
Published: (2025)

Median Clipping for Zeroth-order Non-Smooth Convex Optimization and Multi-Armed Bandit Problem with Heavy-tailed Symmetric Noise
by: Kornilov, Nikita, et al.
Published: (2024)

Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization
by: Liu, Zijian, et al.
Published: (2025)

Methods for Convex $(L_0,L_1)$-Smooth Optimization: Clipping, Acceleration, and Adaptivity
by: Gorbunov, Eduard, et al.
Published: (2024)

High Probability Complexity Bounds for Non-Smooth Stochastic Optimization with Heavy-Tailed Noise
by: Gorbunov, Eduard, et al.
Published: (2021)

Fast Last-Iterate Convergence of SGD in the Smooth Interpolation Regime
by: Attia, Amit, et al.
Published: (2025)

Last Iterate Convergence of Popov Method for Non-monotone Stochastic Variational Inequalities
by: Vankov, Daniil, et al.
Published: (2023)

Last-Iterate Convergence of Anchored Gradient Descent
by: Cai, Yang, et al.
Published: (2026)

On Convergence of Incremental Gradient for Non-Convex Smooth Functions
by: Koloskova, Anastasia, et al.
Published: (2023)

Locally Linear Convergence for Nonsmooth Convex Optimization via Coupled Smoothing and Momentum
by: Baghbadorani, Reza Rahimi, et al.
Published: (2025)

Stochastic Non-Smooth Non-Convex Optimization with Decision-Dependent Distributions
by: Liu, Chengchang, et al.
Published: (2026)

Optimal Primal-Dual Algorithm with Last iterate Convergence Guarantees for Stochastic Convex Optimization Problems
by: Boob, Digvijay, et al.
Published: (2024)

AdaBB: Adaptive Barzilai-Borwein Method for Convex Optimization
by: Zhou, Danqing, et al.
Published: (2024)

Prediction-Correction Algorithm for Time-Varying Smooth Non-Convex Optimization
by: Iwakiri, Hidenori, et al.
Published: (2024)

On the Last-Iterate Convergence of Shuffling Gradient Methods
by: Liu, Zijian, et al.
Published: (2024)

Stability and convergence analysis of AdaGrad for non-convex optimization via novel stopping time-based techniques
by: Jin, Ruinan, et al.
Published: (2024)

Stochastic Decentralized Optimization of Non-Smooth Convex and Convex-Concave Problems over Time-Varying Networks
by: Divilkovskiy, Maxim, et al.
Published: (2025)

Global Convergence of Control-Based Lagrangian Flows for Non-Convex Optimization
by: Pirrera, Simone, et al.
Published: (2026)

Stochastic Non-Smooth Convex Optimization with Unbounded Gradients
by: Kovalev, Dmitry
Published: (2026)

A Note on Complexity for Two Classes of Structured Non-Smooth Non-Convex Compositional Optimization
by: Yao, Yao, et al.
Published: (2024)

Convergence Rate of the Last Iterate of Stochastic Proximal Algorithms
by: Vaidyan, Kevin Kurian Thomas, et al.
Published: (2026)

Revisiting the Last-Iterate Convergence of Stochastic Gradient Methods
by: Liu, Zijian, et al.
Published: (2023)

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

Convergence of the Iterates for Momentum and RMSProp for Local Smooth Functions: Adaptation is the Key
by: Bensaid, Bilel, et al.
Published: (2024)

Convergence of Clipped SGD on Convex $(L_0,L_1)$-Smooth Functions
by: Gaash, Ofir, et al.
Published: (2025)

Adam-SHANG: A Convergent Adam-Type Method for Stochastic Smooth Convex Optimization
by: Yu, Yaxin, et al.
Published: (2026)