Federated Learning with Superquantile Aggregation for Heterogeneous Data
Krishna Pillutla, Yassine Laguel, J\'er\^ome Malick, Zaid Harchaoui

TL;DR
This paper introduces a federated learning method using superquantile-based objectives to improve robustness across heterogeneous client data, with proven convergence and superior tail error performance.
Contribution
It proposes a novel superquantile aggregation approach for federated learning that enhances robustness and provides convergence guarantees.
Findings
Competitive average error performance
Outperforms in tail error statistics
Proven finite-time convergence guarantees
Abstract
We present a federated learning framework that is designed to robustly deliver good predictive performance across individual clients with heterogeneous data. The proposed approach hinges upon a superquantile-based learning objective that captures the tail statistics of the error distribution over heterogeneous clients. We present a stochastic training algorithm that interleaves differentially private client filtering with federated averaging steps. We prove finite time convergence guarantees for the algorithm: in the nonconvex case in communication rounds and in the strongly convex case with local condition number . Experimental results on benchmark datasets for federated learning demonstrate that our approach is competitive with classical ones in terms of average error and outperforms them in terms of tail statistics of…
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
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Stochastic Gradient Optimization Techniques · Random Matrices and Applications
