Distributed clipped stochastic gradient descent over time-varying directed graphs is proved to converge with high probability under heavy-tailed gradient noise.
Finite-time consensus problems for networks of dynamic agents,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
other 1
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1roles
other 1polarities
unclear 1representative citing papers
citing papers explorer
-
High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise
Distributed clipped stochastic gradient descent over time-varying directed graphs is proved to converge with high probability under heavy-tailed gradient noise.