arxiv
PublishedMay 19, 2026 at 4:00 AM
Clipped Gradient Methods for Nonsmooth Convex Optimization under Heavy-Tailed Noise: A Refined Analysis
Publisher summary· verbatim
arXiv:2512.23178v3 Announce Type: replace-cross Abstract: Optimization under heavy-tailed noise has become popular recently, since it better fits many modern machine learning tasks, as captured by empirical observations. Concretely, instead of a finite second moment on gradient noise, a bounded ${\f
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivLearning to Discretize: Diffusion-Based Adaptive Mesh with Spectral Guidance6harxivEvaluating Reliability in Machine Learning Models for Early Chronic Kidney Disease Prediction: A Systematic Review of Data Leakage and Predictor Stability6harxivSelf-Evolving In-Context Learning for Direct Pilot-to-Beamformer Design in MU-MISO Systems6harxivAre we Merging the Right Models? Impact of Expert Training Duration on Model Merging for LLMs6hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗