Tighter Regret Analysis and Optimization of Online Federated Learning
Dohyeok Kwon, Jonghwan Park, Songnam Hong

TL;DR
This paper introduces OFedIQ, a communication-efficient online federated learning method that reduces communication costs by 99% while maintaining optimal regret performance, addressing real-world streaming data scenarios.
Contribution
It proposes OFedIQ, a novel communication-efficient algorithm for online federated learning, with a derived regret bound accounting for data heterogeneity and communication techniques.
Findings
OFedIQ reduces communication costs by 99%.
The regret bound captures data heterogeneity and communication effects.
Experimental results validate the effectiveness of OFedIQ.
Abstract
In federated learning (FL), it is commonly assumed that all data are placed at clients in the beginning of machine learning (ML) optimization (i.e., offline learning). However, in many real-world applications, it is expected to proceed in an online fashion. To this end, online FL (OFL) has been introduced, which aims at learning a sequence of global models from decentralized streaming data such that the so-called cumulative regret is minimized. Combining online gradient descent and model averaging, in this framework, FedOGD is constructed as the counterpart of FedSGD in FL. While it can enjoy an optimal sublinear regret, FedOGD suffers from heavy communication costs. In this paper, we present a communication-efficient method (named OFedIQ) by means of intermittent transmission (enabled by client subsampling and periodic transmission) and quantization. For the first time, we derive the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Stochastic Gradient Optimization Techniques · Advanced Bandit Algorithms Research
