A multi-phase randomized mixing-matrix schedule reduces worst-case per-node energy in decentralized federated learning, with convergence analysis for time-varying communication topologies.
On the convergence of decentralized gradient descent,
1 Pith paper cite this work, alongside 623 external citations. Polarity classification is still indexing.
1
Pith paper citing it
623
external citations · OpenAlex
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Time-varying Mixing Matrix Design for Energy-efficient Decentralized Federated Learning
A multi-phase randomized mixing-matrix schedule reduces worst-case per-node energy in decentralized federated learning, with convergence analysis for time-varying communication topologies.