Distributed Online Optimization with Stochastic Agent Availability

Motivated by practical federated learning settings where clients may not be always available, we investigate a variant of distributed online optimization where agents are active with a known probability p at each time step, and communication between neighboring agents can only take place if they are both active. We introduce a distributed variant of the FTRL algorithm and analyze its network regret, defined through the average of the instantaneous regret of the active agents. Our analysis shows that, for any connected communication graph G over N agents, the expected network regret of our FTRL variant after T steps is at most of order (kappa/p2)minbig√N,N1/4/√pbig√T, where kappa is the condition number of the Laplacian of G. We then show that similar regret bounds also hold with high probability. Moreover, we show that our notion of regret (average-case over the agents) is essentially equivalent to the standard notion of regret (worst-case over agents), implying that our bounds are not significantly improvable when p=1. Our theoretical results are supported by experiments on synthetic datasets.