Copertina

Clipped Gradient Methods for Nonsmooth Convex Optimization under Heavy-Tailed Noise: A Refined Analysis

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Liu, Zijian
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Optimization and Control Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Nonconvex Stochastic Optimization under Heavy-Tailed Noises: Optimal Convergence without Gradient Clipping
di: Liu, Zijian, et al.
Pubblicazione: (2024)

In-Expectation Convergence of Stochastic Gradient Methods under Heavy-Tailed Noise
di: Liu, Zijian
Pubblicazione: (2026)

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

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

Revisiting Gradient Normalization and Clipping for Nonconvex SGD under Heavy-Tailed Noise: Necessity, Sufficiency, and Acceleration
di: Sun, Tao, et al.
Pubblicazione: (2024)

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

Online Convex Optimization with Heavy Tails: Old Algorithms, New Regrets, and Applications
di: Liu, Zijian
Pubblicazione: (2025)

Second-order Optimization under Heavy-Tailed Noise: Hessian Clipping and Sample Complexity Limits
di: Sadiev, Abdurakhmon, et al.
Pubblicazione: (2025)

From Gradient Clipping to Normalization for Heavy Tailed SGD
di: Hübler, Florian, et al.
Pubblicazione: (2024)

Stochastic Weakly Convex Optimization Under Heavy-Tailed Noises
di: Zhu, Tianxi, et al.
Pubblicazione: (2025)

An Improved Analysis of the Clipped Stochastic subGradient Method under Heavy-Tailed Noise
di: Parletta, Daniela Angela, et al.
Pubblicazione: (2024)

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

Tight Long-Term Tail Decay of (Clipped) SGD in Non-Convex Optimization
di: Armacki, Aleksandar, et al.
Pubblicazione: (2026)

Optimal Asynchronous Stochastic Nonconvex Optimization under Heavy-Tailed Noise
di: Wu, Yidong, et al.
Pubblicazione: (2026)

Algorithmic Stability of Stochastic Gradient Descent with Momentum under Heavy-Tailed Noise
di: Dang, Thanh, et al.
Pubblicazione: (2025)

Accelerated Convergence of Stochastic Heavy Ball Method under Anisotropic Gradient Noise
di: Pan, Rui, et al.
Pubblicazione: (2023)

Efficient Private SCO for Heavy-Tailed Data via Averaged Clipping
di: Jin, Chenhan, et al.
Pubblicazione: (2022)

Near-Optimal Decentralized Stochastic Nonconvex Optimization with Heavy-Tailed Noise
di: Wang, Menglian, et al.
Pubblicazione: (2026)

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

Can SGD Handle Heavy-Tailed Noise?
di: Fatkhullin, Ilyas, et al.
Pubblicazione: (2025)

Scale-Invariant Neural Network Optimization: Norm Geometry and Heavy-Tailed Noise
di: Zhang, Jiayu, et al.
Pubblicazione: (2026)

Sign Operator for Coping with Heavy-Tailed Noise in Non-Convex Optimization: High Probability Bounds Under $(L_0, L_1)$-Smoothness
di: Kornilov, Nikita, et al.
Pubblicazione: (2025)

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

Sharp High-Probability Rates for Nonlinear SGD under Heavy-Tailed Noise via Symmetrization
di: Armacki, Aleksandar, et al.
Pubblicazione: (2025)

Muon Converges under Heavy-Tailed Noise: Nonconvex Hölder-Smooth Empirical Risk Minimization
di: Iiduka, Hideaki
Pubblicazione: (2026)

Sign-Based Optimizers Are Effective Under Heavy-Tailed Noise
di: Yu, Dingzhi, et al.
Pubblicazione: (2026)

Adam-family Methods for Nonsmooth Optimization with Convergence Guarantees
di: Xiao, Nachuan, et al.
Pubblicazione: (2023)

Heavy-Tailed and Long-Range Dependent Noise in Stochastic Approximation: A Finite-Time Analysis
di: Chandak, Siddharth, et al.
Pubblicazione: (2026)

Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization
di: Chen, Lesi, et al.
Pubblicazione: (2023)

Smoothed Gradient Clipping and Error Feedback for Decentralized Optimization under Symmetric Heavy-Tailed Noise
di: Yu, Shuhua, et al.
Pubblicazione: (2023)

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

An Accelerated Gradient Method for Convex Smooth Simple Bilevel Optimization
di: Cao, Jincheng, et al.
Pubblicazione: (2024)

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

Developing Lagrangian-based Methods for Nonsmooth Nonconvex Optimization
di: Xiao, Nachuan, et al.
Pubblicazione: (2024)

Muon with Nesterov Momentum: Heavy-Tailed Noise and (Randomized) Inexact Polar Decomposition
di: Choudhury, Sayantan, et al.
Pubblicazione: (2026)

Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization
di: Borodich, Ekaterina, et al.
Pubblicazione: (2025)

A Proximal Modified Quasi-Newton Method for Nonsmooth Regularized Optimization
di: Diouane, Youssef, et al.
Pubblicazione: (2024)

Zeroth-Order Methods for Stochastic Nonconvex Nonsmooth Composite Optimization
di: Chen, Ziyi, et al.
Pubblicazione: (2025)

Adaptive Proximal Gradient Method for Convex Optimization
di: Malitsky, Yura, et al.
Pubblicazione: (2023)

Concentration of General Stochastic Approximation Under Heavy-Tailed Markovian Noise
di: Agrawal, Shubhada, et al.
Pubblicazione: (2026)