REVIEW 4 cited by
Federated Learning of a Mixture of Global and Local Models
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Federated Learning of a Mixture of Global and Local Models
read the original abstract
We propose a new optimization formulation for training federated learning models. The standard formulation has the form of an empirical risk minimization problem constructed to find a single global model trained from the private data stored across all participating devices. In contrast, our formulation seeks an explicit trade-off between this traditional global model and the local models, which can be learned by each device from its own private data without any communication. Further, we develop several efficient variants of SGD (with and without partial participation and with and without variance reduction) for solving the new formulation and prove communication complexity guarantees. Notably, our methods are similar but not identical to federated averaging / local SGD, thus shedding some light on the role of local steps in federated learning. In particular, we are the first to i) show that local steps can improve communication for problems with heterogeneous data, and ii) point out that personalization yields reduced communication complexity.
Forward citations
Cited by 4 Pith papers
-
Robust Decentralized Optimization under Node Failures via Adaptive Regularization
Legacy-GT lets a departing node hand a gradient-anchored quadratic surrogate and tracker correction to one neighbor, yielding geometrically decaying residual bias instead of permanent drop-and-forget bias.
-
Demystifying the Optimal Fair Classifier in Multi-Class Classification
Derives tractable optimal fair multi-class classifier and supplies in-processing and post-processing algorithms that converge to the accuracy-fairness Pareto frontier.
-
Collaborative and Efficient Fine-tuning: Leveraging Task Similarity
CoLoRA shares a low-rank adapter pair across users plus a small personal matrix, improving fine-tuning for similar tasks and providing a recovery guarantee.
-
Exploring CKKS Parameter Trade-offs for Privacy-Preserving Personalized Federated Learning
pFedCKKS derives CKKS parameter constraints for PFL under 128-bit security reducing choices to inner and outer ciphertext primes and evaluates precision-cost trade-offs on FEMNIST, CelebA and Sentiment140.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.