BLADE achieves sublinear dynamic regret in federated online decision-making with stateful costs using O(T/K) communication under the condition that path length V_T = o(T^{1/4}) when K is set to ceil(sqrt(T)).
Stich , title =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Communication-Efficient Federated Online Decision-Making with Stateful Costs
BLADE achieves sublinear dynamic regret in federated online decision-making with stateful costs using O(T/K) communication under the condition that path length V_T = o(T^{1/4}) when K is set to ceil(sqrt(T)).