Distributed clipped stochastic gradient descent over time-varying directed graphs is proved to converge with high probability under heavy-tailed gradient noise.
A new approach to consensus problems in discrete-time multiagent 18 systems with time-delays,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 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.