article10.1016/j.patcog.2022.108746
Federating recommendations using differentially private prototypes
Mónica Ribero,Jette Henderson,Sinead A. Williamson,Haris Vikalo +3 more
Abstract: Machine learning methods exploit similarities in users’ activity patterns to provide recommendations in applications across a wide range of fields including entertainment, dating, and commerce. However, in domains that demand protection of personally sensitive data, such as medicine or banking, how can we learn recommendation models without accessing the sensitive data and without inadvertently leaking private information? Many situations in the medical field prohibit centralizing the data from different hospitals and thus require learning from information kept in separate databases. We propose a new federated approach to learning global and local private models for recommendation without collecting raw data, user statistics, or information about personal preferences. Our method produces a set of locally learned prototypes that allow us to infer global behavioral patterns while providing differential privacy guarantees for users in any database of the system. By requiring only two rounds of communication, we both reduce the communication costs and avoid excessive privacy loss associated with typical federated learning iterative procedures. We test our framework on synthetic data, real federated medical data, and a federated version of Movielens ratings. We show that local adaptation of the global model allows the proposed method to outperform centralized matrix-factorization-based recommender system models, both in terms of the accuracy of matrix reconstruction and in terms of the relevance of recommendations, while maintaining provable privacy guarantees. We also show that our method is more robust and has smaller variance than individual models learned by independent entities.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures

Figure 9: Average rank on the Movielens 1M dataset. Privacy deteriorates performance, however DP-prototypes allow entities to collaborate and improve recommendations. 
Figure 3: k-means objective vs. level of privacy. As decreases, private k-means approaches the objective of non-private k-means. 
Figure 4: Private k-means on synthetic data. Larger values of , i.e. less privacy, decrease the loss value. A large k does not necessarily result in better performance. As shown in subfigure , for larger values of means, the private k-means algorithm repeats centers instead of overfitting, and objective minimization is stalled. 
Figure 5: Convergence of matrix factorization for different number of entities 
Figure 6: Comparison of different prototype methods. As k and ` increase, k-random exemplars and private k-means maintain competitive performance. 
Figure 1: Results on synthetic data
Citations
•Posted Content
FedML: A Research Library and Benchmark for Federated Machine Learning
Chaoyang He,Songze Li,Jinhyun So,Mi Zhang,Hongyi Wang,Xiaoyang Wang,Praneeth Vepakomma,Abhishek Singh,Hang Qiu,Li Shen,Peilin Zhao,Kang Yan,Yang Liu,Ramesh Raskar,Qiang Yang,Murali Annavaram,A. Salman Avestimehr +16 more
TL;DR: FedML is introduced, an open research library and benchmark that facilitates the development of new federated learning algorithms and fair performance comparisons and can provide an efficient and reproducible means of developing and evaluating algorithms for the Federated learning research community.
Federated Social Recommendation with Graph Neural Network
TL;DR: Zhang et al. as mentioned in this paper proposed a federated learning framework for social recommendation based on Graph Neural Networks (GNNs), which adopts relational attention and aggregation to handle heterogeneity.
150
•Posted Content
Communication-Efficient Federated Learning via Optimal Client Sampling
Mónica Ribero,Haris Vikalo +1 more
TL;DR: This work proposes a novel, simple and efficient way of updating the central model in communication-constrained settings based on collecting models from clients with informative updates and estimating local updates that were not communicated, and modeling the progression of model's weights by an Ornstein-Uhlenbeck process.
Federated Machine Learning, Privacy-Enhancing Technologies, and Data Protection Laws in Medical Research: Scoping Review
Alissa Brauneck,Louisa Schmalhorst,Mohammad Mahdi Kazemi Majdabadi,Mohammad Bakhtiari,Uwe Völker,Jan Baumbach,Linda Baumbach,Gabriele Buchholtz +7 more
TL;DR: In this paper , a scoping review aimed to summarize the current discussion on the legal questions and concerns related to federated learning (FL) systems in medical research is presented, focusing on whether and to what extent FL applications and training processes are compliant with the GDPR data protection law and whether the use of differential privacy (DP and SMPC) affects this legal compliance.
Fairness and privacy preserving in federated learning: A survey
Taki Hasan Rafi,Faiza Anan Noor,Tahmid Hussain,Dong‐Kyu Chae +3 more
TL;DR: The existing FL systems face challenges in preserving privacy and fairness. Existing research fails to balance privacy, fairness, and model performance. To address these challenges, a comprehensive overview of privacy and fairness concerns in FL is needed.
23
References
•Book
Distributed Optimization and Statistical Learning Via the Alternating Direction Method of Multipliers
Stephen Boyd,Neal Parikh,Eric Chu,Borja Peleato,Jonathan Eckstein +4 more
- 23 May 2011
TL;DR: It is argued that the alternating direction method of multipliers is well suited to distributed convex optimization, and in particular to large-scale problems arising in statistics, machine learning, and related areas.
Matrix Factorization Techniques for Recommender Systems
TL;DR: As the Netflix Prize competition has demonstrated, matrix factorization models are superior to classic nearest neighbor techniques for producing product recommendations, allowing the incorporation of additional information such as implicit feedback, temporal effects, and confidence levels.
Calibrating noise to sensitivity in private data analysis
Cynthia Dwork,Frank McSherry,Kobbi Nissim,Adam Smith +3 more
- 04 Mar 2006
TL;DR: In this article, the authors show that for several particular applications substantially less noise is needed than was previously understood to be the case, and also show the separation results showing the increased value of interactive sanitization mechanisms over non-interactive.
Advances and open problems in federated learning
Peter Kairouz,H. Brendan McMahan,Brendan Avent,Aurélien Bellet,Mehdi Bennis,Arjun Nitin Bhagoji,Kallista Bonawitz,Zachary Charles,Graham Cormode,Rachel Cummings,Rafael G. L. D'Oliveira,Hubert Eichner,Salim El Rouayheb,David Evans,Josh Gardner,Zachary Garrett,Adrià Gascón,Badih Ghazi,Phillip B. Gibbons,Marco Gruteser,Zaid Harchaoui,Chaoyang He,Lie He,Zhouyuan Huo,Ben Hutchinson,Justin Hsu,Martin Jaggi,Tara Javidi,Gauri Joshi,Mikhail Khodak,Jakub Konecní,Aleksandra Korolova,Farinaz Koushanfar,Sanmi Koyejo,Tancrède Lepoint,Yang Liu,Prateek Mittal,Mehryar Mohri,Richard Nock,Ayfer Ozgur,Rasmus Pagh,Hang Qi,Daniel Ramage,Ramesh Raskar,Mariana Raykova,Dawn Song,Weikang Song,Sebastian U. Stich,Ziteng Sun,Ananda Theertha Suresh,Florian Tramèr,Praneeth Vepakomma,Jianyu Wang,Li Xiong,Zheng Xu,Qiang Yang,Felix X. Yu,Han Yu,Sen Zhao +58 more
- 23 Jun 2021
TL;DR: In this article, the authors describe the state-of-the-art in the field of federated learning from the perspective of distributed optimization, cryptography, security, differential privacy, fairness, compressed sensing, systems, information theory, and statistics.
Using collaborative filtering to weave an information tapestry
TL;DR: Tapestry is intended to handle any incoming stream of electronic documents and serves both as a mail filter and repository; its components are the indexer, document store, annotation store, filterer, little box, remailer, appraiser and reader/browser.
4.7K