A Payload Optimization Method for Federated Recommender Systems
Not on the map. Why?
Abstract (arXiv)
We introduce the payload optimization method for federated recommender systems (FRS). In federated learning (FL), the global model payload that is moved between the server and users depends on the number of items to recommend. The model payload grows when there is an increasing number of items. This becomes challenging for an FRS if it is running in production mode. To tackle the payload challenge, we formulated a multi-arm bandit solution that selected part of the global model and transmitted it to all users. The selection process was guided by a novel reward function suitable for FL systems. So far as we are aware, this is the first optimization method that seeks to address item dependent payloads. The method was evaluated using three benchmark recommendation datasets. The empirical validation confirmed that the proposed method outperforms the simpler methods that do not benefit from the bandits for the purpose of item selection. In addition, we have demonstrated the usefulness of our proposed method by rigorously evaluating the effects of a payload reduction on the recommendation performance degradation. Our method achieved up to a 90% reduction in model payload, yielding only a ~4% - 8% loss in the recommendation performance for highly sparse datasets
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 19 of its 49 references that are in the map. First posted on arXiv 27 Jul 2021.
Builds on
19 of 49 references.
References · 19
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2019Federated Learning: Challenges, Methods, and Future Directionscited by 1,531
- 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,461
- 2019Robust and Communication-Efficient Federated Learning from Non-IID Datacited by 415
- 2019A Survey on Federated Learning Systems: Vision, Hype and Reality for Data Privacy and Protectioncited by 371
- 2018Communication-Efficient On-Device Machine Learning: Federated Distillation and Augmentation under Non-IID Private Datacited by 242
- 2014An Information-Theoretic Analysis of Thompson Samplingcited by 178
- 2018Expanding the Reach of Federated Learning by Reducing Client Resource Requirementscited by 162
- 2019Secure Federated Matrix Factorizationcited by 102
- 2020Differentially-Private Federated Linear Banditscited by 83
- 2020Adaptive Gradient Sparsification for Efficient Federated Learning: An Online Learning Approachcited by 80
7 more
- 2019Federated Collaborative Filtering for Privacy-Preserving Personalized Recommendation Systemcited by 79
- 2020Federated Bayesian Optimization via Thompson Samplingcited by 77
- 2019Energy Demand Prediction with Federated Learning for Electric Vehicle Networkscited by 46
- 2013Thompson Sampling for Complex Bandit Problemscited by 43
- 2018An Information-Theoretic Analysis for Thompson Sampling with Many Actionscited by 35
- 2020Federated Multi-view Matrix Factorization for Personalized Recommendationscited by 27
- 2020A Novel Privacy-Preserved Recommender System Framework based on Federated Learningcited by 6
Built on by
Citing papers per year: 2022: 3; 2023: 2; 2024: 1; 2025: 3; 2026: 1.
10 papers.
- 2022A Survey on Federated Recommendation Systemscited by 25
- 2023Dual Personalization on Federated Recommendationcited by 19
- 2024Towards Efficient Communication and Secure Federated Recommendation System via Low-rank Trainingcited by 14
- 2023Federated Online and Bandit Convex Optimizationcited by 7
- 2022FedSPLIT: One-Shot Federated Recommendation System Based on Non-negative Joint Matrix Factorization and Knowledge Distillationcited by 4
- 2022FedGRec: Federated Graph Recommender System with Lazy Update of Latent Embeddingscited by 4
- 2025Personalized Recommendation Models in Federated Settings: A Surveycited by 1
- 2026Distributed Online Convex Optimization with Compressed Communication: Optimal Regret and Applicationscited by 1
- 2025Gradients as an Action: Towards Communication-Efficient Federated Recommender Systems via Adaptive Action Sharingcited by 0
- 2025A Scenario-Oriented Survey of Federated Recommender Systems: Techniques, Challenges, and Future Directionscited by 0
- 2026Distributed Online Convex Optimization with Compressed Communication: Optimal Regret and Applications10 Apr 2026
- 2025A Scenario-Oriented Survey of Federated Recommender Systems: Techniques, Challenges, and Future Directions27 Aug 2025
- 2025Gradients as an Action: Towards Communication-Efficient Federated Recommender Systems via Adaptive Action Sharing8 Jul 2025
- 2025Personalized Recommendation Models in Federated Settings: A Survey10 Mar 2025
- 2024Towards Efficient Communication and Secure Federated Recommendation System via Low-rank Training8 Jan 2024
- 2023Federated Online and Bandit Convex Optimization29 Nov 2023
- 2023Dual Personalization on Federated Recommendation16 Jan 2023
- 2022A Survey on Federated Recommendation Systems27 Dec 2022
- 2022FedGRec: Federated Graph Recommender System with Lazy Update of Latent Embeddings25 Oct 2022
- 2022FedSPLIT: One-Shot Federated Recommendation System Based on Non-negative Joint Matrix Factorization and Knowledge Distillation4 May 2022