Distributionally Robust Federated Averaging
Yuyang Deng, Mohammad Mahdi Kamani, Mehrdad Mahdavi

TL;DR
This paper introduces a novel communication-efficient federated learning algorithm, DRFA, designed for distributionally robust optimization, with proven convergence and experimental validation.
Contribution
It proposes the DRFA algorithm with a snapshotting scheme for distributionally robust federated learning, analyzing its convergence in various settings and extending to regularized objectives.
Findings
DRFA achieves convergence in convex and nonconvex settings.
The proximal variant DRFA-Prox converges with provable rates.
Experimental results support theoretical claims.
Abstract
In this paper, we study communication efficient distributed algorithms for distributionally robust federated learning via periodic averaging with adaptive sampling. In contrast to standard empirical risk minimization, due to the minimax structure of the underlying optimization problem, a key difficulty arises from the fact that the global parameter that controls the mixture of local losses can only be updated infrequently on the global stage. To compensate for this, we propose a Distributionally Robust Federated Averaging (DRFA) algorithm that employs a novel snapshotting scheme to approximate the accumulation of history gradients of the mixing parameter. We analyze the convergence rate of DRFA in both convex-linear and nonconvex-linear settings. We also generalize the proposed idea to objectives with regularization on the mixture parameter and propose a proximal variant, dubbed as…
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.
Code & Models
Videos
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Cooperative Communication and Network Coding · Sparse and Compressive Sensing Techniques
