CAFe compresses client updates against the previous aggregate, improving the DCGD convergence bound by (1-omega) without control variates, under equal step sizes and bounded heterogeneity.
Communication-efficient learning of deep networks from decentralized data,
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
cs.LG 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Communication Compression for Distributed Learning without Control Variates
CAFe compresses client updates against the previous aggregate, improving the DCGD convergence bound by (1-omega) without control variates, under equal step sizes and bounded heterogeneity.