U-Clip: On-Average Unbiased Stochastic Gradient Clipping
Not on the map. Why?
Abstract (arXiv)
U-Clip is a simple amendment to gradient clipping that can be applied to any iterative gradient optimization algorithm. Like regular clipping, U-Clip involves using gradients that are clipped to a prescribed size (e.g. with component wise or norm based clipping) but instead of discarding the clipped portion of the gradient, U-Clip maintains a buffer of these values that is added to the gradients on the next iteration (before clipping). We show that the cumulative bias of the U-Clip updates is bounded by a constant. This implies that the clipped updates are unbiased on average. Convergence follows via a lemma that guarantees convergence with updates ui as long as sumi=1t (ui - gi) = o(t) where gi are the gradients. Extensive experimental exploration is performed on CIFAR10 with further validation given on ImageNet.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 20 of its 28 references that are in the map. First posted on arXiv 6 Feb 2023.
Builds on
20 of 28 references.
References · 20
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,326
- 2016Deep Learning with Differential Privacycited by 2,728
- 2016Identity Mappings in Deep Residual Networkscited by 1,965
- 2021Scaling Language Models: Methods, Analysis & Insights from Training Gophercited by 1,202
- 2017Self-Normalizing Neural Networkscited by 598
- 2014Convex Optimization: Algorithms and Complexitycited by 575
- 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 552
- 2019Why gradient clipping accelerates training: A theoretical justification for adaptivitycited by 341
- 2019Differentially Private Learning with Adaptive Clippingcited by 220
- 2019A Tail-Index Analysis of Stochastic Gradient Noise in Deep Neural Networkscited by 214
- 2020Understanding Gradient Clipping in Private SGD: A Geometric Perspectivecited by 142
8 more
- 2020Stochastic Optimization with Heavy-Tailed Noise via Accelerated Gradient Clippingcited by 104
- 2020Improved Analysis of Clipping Algorithms for Non-convex Optimizationcited by 89
- 2019AdaCliP: Adaptive Clipping for Private SGDcited by 77
- 2015Beyond Convexity: Stochastic Quasi-Convex Optimizationcited by 76
- 2021Understanding Clipping for Federated Learning: Convergence and Client-Level Differential Privacycited by 69
- 2021Stochastic Training is Not Necessary for Generalizationcited by 63
- 2021Stability and Convergence of Stochastic Gradient Clipping: Beyond Lipschitz Continuity and Smoothnesscited by 37
- 2021Isotuning With Applications To Scale-Free Online Learningcited by 4
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 1.
2 papers.