Clustered Federated Learning via Generalized Total Variation Minimization
Yasmin SarcheshmehPour, Yu Tian, Linli Zhang, Alexander Jung

TL;DR
This paper introduces a flexible, decentralized federated learning framework based on generalized total variation minimization, capable of handling diverse models and network structures, with proven robustness and theoretical guarantees.
Contribution
It formulates federated learning as GTV minimization, unifying and extending existing methods, and develops a decentralized algorithm with theoretical performance bounds.
Findings
The algorithm is robust against inexact computations.
GTV minimization effectively pools homogeneous local datasets.
Theoretical bounds relate model deviation to network structure.
Abstract
We study optimization methods to train local (or personalized) models for decentralized collections of local datasets with an intrinsic network structure. This network structure arises from domain-specific notions of similarity between local datasets. Examples for such notions include spatio-temporal proximity, statistical dependencies or functional relations. Our main conceptual contribution is to formulate federated learning as generalized total variation (GTV) minimization. This formulation unifies and considerably extends existing federated learning methods. It is highly flexible and can be combined with a broad range of parametric models, including generalized linear models or deep neural networks. Our main algorithmic contribution is a fully decentralized federated learning algorithm. This algorithm is obtained by applying an established primal-dual method to solve GTV…
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
TopicsStatistical Methods and Inference
