Federated Neural Collaborative Filtering
- URL: http://arxiv.org/abs/2106.04405v1
- Date: Wed, 2 Jun 2021 21:05:41 GMT
- Title: Federated Neural Collaborative Filtering
- Authors: Vasileios Perifanis and Pavlos S. Efraimidis
- Abstract summary: We present a federated version of the state-of-the-art Neural Collaborative Filtering (NCF) approach for item recommendations.
The system, named FedNCF, allows learning without requiring users to expose or transmit their raw data.
We discuss the peculiarities observed in the application of FL in a collaborative filtering (CF) task as well as we evaluate the privacy-preserving mechanism in terms of computational cost.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In this work, we present a federated version of the state-of-the-art Neural
Collaborative Filtering (NCF) approach for item recommendations. The system,
named FedNCF, allows learning without requiring users to expose or transmit
their raw data. Experimental validation shows that FedNCF achieves comparable
recommendation quality to the original NCF system. Although federated learning
(FL) enables learning without raw data transmission, recent attacks showed that
FL alone does not eliminate privacy concerns. To overcome this challenge, we
integrate a privacy-preserving enhancement with a secure aggregation scheme
that satisfies the security requirements against an honest-but-curious (HBC)
entity, without affecting the quality of the original model. Finally, we
discuss the peculiarities observed in the application of FL in a collaborative
filtering (CF) task as well as we evaluate the privacy-preserving mechanism in
terms of computational cost.
Related papers
- Efficient and Robust Regularized Federated Recommendation [52.24782464815489]
The recommender system (RSRS) addresses both user preference and privacy concerns.
We propose a novel method that incorporates non-uniform gradient descent to improve communication efficiency.
RFRecF's superior robustness compared to diverse baselines.
arXiv Detail & Related papers (2024-11-03T12:10:20Z) - Privacy-preserving Federated Primal-dual Learning for Non-convex and Non-smooth Problems with Model Sparsification [51.04894019092156]
Federated learning (FL) has been recognized as a rapidly growing area, where the model is trained over clients under the FL orchestration (PS)
In this paper, we propose a novel primal sparification algorithm for and guarantee non-smooth FL problems.
Its unique insightful properties and its analyses are also presented.
arXiv Detail & Related papers (2023-10-30T14:15:47Z) - UFed-GAN: A Secure Federated Learning Framework with Constrained
Computation and Unlabeled Data [50.13595312140533]
We propose a novel framework of UFed-GAN: Unsupervised Federated Generative Adversarial Network, which can capture user-side data distribution without local classification training.
Our experimental results demonstrate the strong potential of UFed-GAN in addressing limited computational resources and unlabeled data while preserving privacy.
arXiv Detail & Related papers (2023-08-10T22:52:13Z) - Differentially Private Wireless Federated Learning Using Orthogonal
Sequences [56.52483669820023]
We propose a privacy-preserving uplink over-the-air computation (AirComp) method, termed FLORAS.
We prove that FLORAS offers both item-level and client-level differential privacy guarantees.
A new FL convergence bound is derived which, combined with the privacy guarantees, allows for a smooth tradeoff between the achieved convergence rate and differential privacy levels.
arXiv Detail & Related papers (2023-06-14T06:35:10Z) - PS-FedGAN: An Efficient Federated Learning Framework Based on Partially
Shared Generative Adversarial Networks For Data Privacy [56.347786940414935]
Federated Learning (FL) has emerged as an effective learning paradigm for distributed computation.
This work proposes a novel FL framework that requires only partial GAN model sharing.
Named as PS-FedGAN, this new framework enhances the GAN releasing and training mechanism to address heterogeneous data distributions.
arXiv Detail & Related papers (2023-05-19T05:39:40Z) - Private and Reliable Neural Network Inference [6.7386666699567845]
We present the first system which enables privacy-preserving inference on reliable NNs.
We employ these building blocks to enable privacy-preserving NN inference with robustness and fairness guarantees in a system called Phoenix.
arXiv Detail & Related papers (2022-10-27T16:58:45Z) - FedSPLIT: One-Shot Federated Recommendation System Based on Non-negative
Joint Matrix Factorization and Knowledge Distillation [7.621960305708476]
We present the first unsupervised one-shot federated CF implementation, named FedSPLIT, based on NMF joint factorization.
FedSPLIT can obtain similar results than the state of the art (and even outperform it in certain situations) with a substantial decrease in the number of communications.
arXiv Detail & Related papers (2022-05-04T23:42:14Z) - Understanding Clipping for Federated Learning: Convergence and
Client-Level Differential Privacy [67.4471689755097]
This paper empirically demonstrates that the clipped FedAvg can perform surprisingly well even with substantial data heterogeneity.
We provide the convergence analysis of a differential private (DP) FedAvg algorithm and highlight the relationship between clipping bias and the distribution of the clients' updates.
arXiv Detail & Related papers (2021-06-25T14:47:19Z) - A Federated Multi-View Deep Learning Framework for Privacy-Preserving
Recommendations [25.484225182093947]
Privacy-preserving recommendations are gaining momentum due to concerns over user privacy and data security.
FedRec algorithms have been proposed to realize personalized privacy-preserving recommendations.
This paper presents FLMV-DSSM, a generic content-based federated multi-view recommendation framework.
arXiv Detail & Related papers (2020-08-25T04:19:40Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.