A gossip-based FTRL algorithm for distributed online convex optimization with random agent availability achieves expected network regret O(κ/p min{√N, N^{1/4}/√p} √T).
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Distributed Online Optimization with Stochastic Agent Availability
A gossip-based FTRL algorithm for distributed online convex optimization with random agent availability achieves expected network regret O(κ/p min{√N, N^{1/4}/√p} √T).