Approximate Gradient Coding for Privacy-Flexible Federated Learning with Non-IID Data
Not on the map. Why?
Abstract (arXiv)
This work focuses on the challenges of non-IID data and stragglers/dropouts in federated learning. We introduce and explore a privacy-flexible paradigm that models parts of the clients' local data as non-private, offering a more versatile and business-oriented perspective on privacy. Within this framework, we propose a data-driven strategy for mitigating the effects of label heterogeneity and client straggling on federated learning. Our solution combines both offline data sharing and approximate gradient coding techniques. Through numerical simulations using the MNIST dataset, we demonstrate that our approach enables achieving a deliberate trade-off between privacy and utility, leading to improved model convergence and accuracy while using an adaptable portion of non-private data.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 37 of its 47 references that are in the map. First posted on arXiv 4 Apr 2024.
Builds on
37 of 47 references.
References · 37
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
- 2019Advances and Open Problems in Federated Learningcited by 3,046
- 2018Federated Learning with Non-IID Datacited by 1,108
- 2020Tackling the Objective Inconsistency Problem in Heterogeneous Federated Optimizationcited by 906
- 2019Measuring the Effects of Non-Identical Data Distribution for Federated Visual Classificationcited by 851
- 2021Model-Contrastive Federated Learningcited by 766
- 2017Federated Multi-Task Learningcited by 672
- 2020Ditto: Fair and Robust Federated Learning Through Personalizationcited by 672
- 2018Local SGD Converges Fast and Communicates Littlecited by 605
- 2020Federated Learning with Matched Averagingcited by 564
- 2021Federated Learning Based on Dynamic Regularizationcited by 562
25 more
- 2019Bayesian Nonparametric Federated Learning of Neural Networkscited by 387
- 2020Adaptive Personalized Federated Learningcited by 358
- 2020Think Locally, Act Globally: Federated Learning with Local and Global Representationscited by 325
- 2020Three Approaches for Personalization with Applications to Federated Learningcited by 325
- 2018Communication-Efficient On-Device Machine Learning: Federated Distillation and Augmentation under Non-IID Private Datacited by 243
- 2021Linear Convergence in Federated Learning: Tackling Client Heterogeneity and Sparse Gradientscited by 123
- 2021FedMix: Approximation of Mixup under Mean Augmented Federated Learningcited by 108
- 2017On the convergence properties of a K-step averaging stochastic gradient descent algorithm for nonconvex optimizationcited by 92
- 2020FedGAN: Federated Generative Adversarial Networks for Distributed Datacited by 90
- 2015Speeding Up Distributed Machine Learning Using Codescited by 76
- 2021Towards Fair Federated Learning with Zero-Shot Data Augmentationcited by 64
- 2020Federated Learning via Synthetic Datacited by 54
- 2022Towards Understanding and Mitigating Dimensional Collapse in Heterogeneous Federated Learningcited by 46
- 2019Hybrid-FL for Wireless Networks: Cooperative Learning Mechanism Using Non-IID Datacited by 38
- 2020On the Outsized Importance of Learning Rates in Local Update Methodscited by 36
- 2018Graph Oracle Models, Lower Bounds, and Gaps for Parallel Stochastic Optimizationcited by 34
- 2020Coded Computing for Low-Latency Federated Learning over Wireless Edge Networkscited by 32
- 2018Communication-Computation Efficient Gradient Codingcited by 27
- 2017Straggler Mitigation in Distributed Optimization Through Data Encodingcited by 26
- 2019ErasureHead: Distributed Gradient Descent without Delays Using Approximate Gradient Codingcited by 22
- 2021CodedPaddedFL and CodedSecAgg: Straggler Mitigation and Secure Aggregation in Federated Learningcited by 20
- 2019Fundamental Limits of Approximate Gradient Codingcited by 15
- 2020Straggler-aware Distributed Learning: Communication Computation Latency Trade-offcited by 15
- 2020Approximate Gradient Coding with Optimal Decodingcited by 14
- 2017Approximate Gradient Coding via Sparse Random Graphscited by 12
Built on by
Not cited yet.