For a user-helper-master network with straggling links and up to T colluding helpers, the optimal user-to-helper and helper-to-master rates are both 1/(N_r - T), and secure aggregation is impossible when N_r is at most T.
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.IT 1years
2024 1verdicts
ACCEPT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Capacity of Hierarchical Secure Coded Gradient Aggregation with Straggling Communication Links
For a user-helper-master network with straggling links and up to T colluding helpers, the optimal user-to-helper and helper-to-master rates are both 1/(N_r - T), and secure aggregation is impossible when N_r is at most T.