Gradient clipping eliminates the dependence on maximum delay in the oracle complexity of asynchronous SGD, yielding convergence in expectation and high probability under sub-Weibull gradient noise.
arXiv preprint arXiv:2306.08393 , year =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Clipping Makes Distributed and Federated Asynchronous SGD Robust to Stragglers
Gradient clipping eliminates the dependence on maximum delay in the oracle complexity of asynchronous SGD, yielding convergence in expectation and high probability under sub-Weibull gradient noise.