Learning Federated Representations and Recommendations with Limited Negatives
Not on the map. Why?
Abstract (arXiv)
Deep retrieval models are widely used for learning entity representations and recommendations. Federated learning provides a privacy-preserving way to train these models without requiring centralization of user data. However, federated deep retrieval models usually perform much worse than their centralized counterparts due to non-IID (independent and identically distributed) training data on clients, an intrinsic property of federated learning that limits negatives available for training. We demonstrate that this issue is distinct from the commonly studied client drift problem. This work proposes batch-insensitive losses as a way to alleviate the non-IID negatives issue for federated movie recommendations. We explore a variety of techniques and identify that batch-insensitive losses can effectively improve the performance of federated deep retrieval models, increasing the relative recall of the federated model by up to 93.15% and reducing the relative gap in recall between it and a centralized model from 27.22% - 43.14% to 0.53% - 2.42%. We also open-source our code framework to accelerate further research and applications of federated deep retrieval models.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 16 of its 23 references that are in the map. First posted on arXiv 18 Aug 2021.
Builds on
16 of 23 references.
References · 16
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2018Federated Optimization in Heterogeneous Networkscited by 2,971
- 2019On the Convergence of FedAvg on Non-IID Datacited by 1,220
- 2018Federated Learning with Non-IID Datacited by 1,099
- 2021FedBN: Federated Learning on Non-IID Features via Local Batch Normalizationcited by 565
- 2019The Non-IID Data Quagmire of Decentralized Machine Learningcited by 303
- 2017Efficient Natural Language Response Suggestion for Smart Replycited by 228
- 2020Mime: Mimicking Centralized Stochastic Algorithms in Federated Learningcited by 152
- 2019Learning Dense Representations for Entity Retrievalcited by 122
- 2021FedMix: Approximation of Mixup under Mean Augmented Federated Learningcited by 108
- 2020Federated Learning with Only Positive Labelscited by 55
- 2018Learning Cross-Lingual Sentence Representations via a Multi-task Dual-Encoder Modelcited by 46
4 more
- 2018End-to-End Retrieval in Continuous Spacecited by 46
- 2018Learning Semantic Textual Similarity from Conversationscited by 41
- 2017Learning Spread-out Local Feature Descriptorscited by 34
- 2016Length bias in Encoder Decoder Models and a Case for Global Conditioningcited by 14
Built on by
Citing papers per year: 2021: 1; 2022: 3; 2023: 1; 2024: 1.
6 papers.
- 2024User-LLM: Efficient LLM Contextualization with User Embeddingscited by 74
- 2022Mixed Federated Learning: Joint Decentralized and Centralized Learningcited by 8
- 2022FedCL: Federated Contrastive Learning for Privacy-Preserving Recommendationcited by 6
- 2021Robust Convergence in Federated Learning through Label-wise Clusteringcited by 2
- 2022Federated Training of Dual Encoding Models on Small Non-IID Client Datasetscited by 2
- 2023Towards Federated Learning Under Resource Constraints via Layer-wise Training and Depth Dropoutcited by 2
- 2024User-LLM: Efficient LLM Contextualization with User Embeddings21 Feb 2024
- 2023Towards Federated Learning Under Resource Constraints via Layer-wise Training and Depth Dropout11 Sep 2023
- 2022Federated Training of Dual Encoding Models on Small Non-IID Client Datasets30 Sep 2022
- 2022Mixed Federated Learning: Joint Decentralized and Centralized Learning26 May 2022
- 2022FedCL: Federated Contrastive Learning for Privacy-Preserving Recommendation21 Apr 2022
- 2021Robust Convergence in Federated Learning through Label-wise Clustering28 Dec 2021