mlsanityData to 7 Oct 2026

QuPeL: Quantized Personalization with Applications to Federated Learning

arXiv 2102.11786 ↗First posted 23 Feb 2021cs.LG cs.DCcited by 3

Not on the map. Why?

Abstract (arXiv)

Traditionally, federated learning (FL) aims to train a single global model while collaboratively using multiple clients and a server. Two natural challenges that FL algorithms face are heterogeneity in data across clients and collaboration of clients with em diverse resources. In this work, we introduce a textitquantized and textitpersonalized FL algorithm QuPeL that facilitates collective training with heterogeneous clients while respecting resource diversity. For personalization, we allow clients to learn textitcompressed personalized models with different quantization parameters depending on their resources. Towards this, first we propose an algorithm for learning quantized models through a relaxed optimization problem, where quantization values are also optimized over. When each client participating in the (federated) learning process has different requirements of the quantized model (both in value and precision), we formulate a quantized personalization framework by introducing a penalty term for local client objectives against a globally trained model to encourage collaboration. We develop an alternating proximal gradient update for solving this quantized personalization problem, and we analyze its convergence properties. Numerically, we show that optimizing over the quantization levels increases the performance and we validate that QuPeL outperforms both FedAvg and local training of clients in a heterogeneous setting.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 26 of its 31 references that are in the map. First posted on arXiv 23 Feb 2021.

Builds on

26 of 31 references.

References · 26

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  3. 2019Advances and Open Problems in Federated Learningcited by 3,021
  4. 2018Federated Optimization in Heterogeneous Networkscited by 2,971
  5. 2020Ensemble Distillation for Robust Model Fusion in Federated Learningcited by 678
  6. 2017Federated Multi-Task Learningcited by 669
  7. 2020Personalized Federated Learning with Moreau Envelopescited by 612
  8. 2015BinaryConnect: Training Deep Neural Networks with binary weights during propagationscited by 571
  9. 2020An Efficient Framework for Clustered Federated Learningcited by 505
  10. 2020Adaptive Personalized Federated Learningcited by 353
  11. 2020Three Approaches for Personalization with Applications to Federated Learningcited by 321
  12. 2020Personalized Federated Learning: A Meta-Learning Approachcited by 309
14 more
  1. 2019Error Feedback Fixes SignSGD and other Gradient Compression Schemescited by 306
  2. 2019Differentiable Soft Quantization: Bridging Full-Precision and Low-Bit Neural Networkscited by 234
  3. 2020Federated Learning of a Mixture of Global and Local Modelscited by 208
  4. 2016Trained Ternary Quantizationcited by 203
  5. 2020Personalized Federated Learning with First Order Model Optimizationcited by 201
  6. 2020Binary Neural Networks: A Surveycited by 184
  7. 2019Qsparse-local-SGD: Distributed SGD with Quantization, Sparsification, and Local Computationscited by 179
  8. 2019Quantization Networkscited by 151
  9. 2016QSGD: Communication-Efficient SGD via Gradient Quantization and Encodingcited by 147
  10. 2020Lower Bounds and Optimal Algorithms for Personalized Federated Learningcited by 122
  11. 2016Binarized Neural Networks: Training Deep Neural Networks with Weights and Activations Constrained to +1 or -1cited by 102
  12. 2017Training Quantized Nets: A Deeper Understandingcited by 74
  13. 2018ProxQuant: Quantized Neural Networks via Proximal Operatorscited by 56
  14. 2018BinaryRelax: A Relaxation Approach For Training Deep Neural Networks With Quantized Weightscited by 24

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 1.

3 papers.