FedeRank: User Controlled Feedback with Federated Recommender Systems
- URL: http://arxiv.org/abs/2012.11328v3
- Date: Wed, 20 Jan 2021 10:28:21 GMT
- Title: FedeRank: User Controlled Feedback with Federated Recommender Systems
- Authors: Vito Walter Anelli, Yashar Deldjoo, Tommaso Di Noia, Antonio Ferrara,
Fedelucio Narducci
- Abstract summary: Data privacy is one of the most prominent concerns in the digital era.
We present FedeRank, a privacy-preserving distributed machine learning paradigm.
We show the effectiveness of FedeRank in terms of recommendation accuracy, even with a small portion of shared user data.
- Score: 4.474834288759608
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Recommender systems have shown to be a successful representative of how data
availability can ease our everyday digital life. However, data privacy is one
of the most prominent concerns in the digital era. After several data breaches
and privacy scandals, the users are now worried about sharing their data. In
the last decade, Federated Learning has emerged as a new privacy-preserving
distributed machine learning paradigm. It works by processing data on the user
device without collecting data in a central repository. We present FedeRank
(https://split.to/federank), a federated recommendation algorithm. The system
learns a personal factorization model onto every device. The training of the
model is a synchronous process between the central server and the federated
clients. FedeRank takes care of computing recommendations in a distributed
fashion and allows users to control the portion of data they want to share. By
comparing with state-of-the-art algorithms, extensive experiments show the
effectiveness of FedeRank in terms of recommendation accuracy, even with a
small portion of shared user data. Further analysis of the recommendation
lists' diversity and novelty guarantees the suitability of the algorithm in
real production environments.
Related papers
- Federated Face Forgery Detection Learning with Personalized Representation [63.90408023506508]
Deep generator technology can produce high-quality fake videos that are indistinguishable, posing a serious social threat.
Traditional forgery detection methods directly centralized training on data.
The paper proposes a novel federated face forgery detection learning with personalized representation.
arXiv Detail & Related papers (2024-06-17T02:20:30Z) - A Novel Neural Network-Based Federated Learning System for Imbalanced
and Non-IID Data [2.9642661320713555]
Most machine learning algorithms rely heavily on large amount of data which may be collected from various sources.
To combat this issue, researchers have introduced federated learning, where a prediction model is learnt by ensuring the privacy of data of clients data.
In this research, we propose a centralized, neural network-based federated learning system.
arXiv Detail & Related papers (2023-11-16T17:14:07Z) - A Privacy Preserving System for Movie Recommendations Using Federated Learning [12.751432553199628]
We present a recommender system for movie recommendations, which provides privacy and thus trustworthiness on multiple levels.
It is trained using federated learning and thus, by its very nature, privacy-preserving.
A novel federated learning scheme, called FedQ, is employed, which not only addresses the problem of non-i.i.d.-ness and small local datasets.
arXiv Detail & Related papers (2023-03-07T17:22:38Z) - FedGRec: Federated Graph Recommender System with Lazy Update of Latent
Embeddings [108.77460689459247]
We propose a Federated Graph Recommender System (FedGRec) to mitigate privacy concerns.
In our system, users and the server explicitly store latent embeddings for users and items, where the latent embeddings summarize different orders of indirect user-item interactions.
We perform extensive empirical evaluations to verify the efficacy of using latent embeddings as a proxy of missing interaction graph.
arXiv Detail & Related papers (2022-10-25T01:08:20Z) - Recommendation Systems with Distribution-Free Reliability Guarantees [83.80644194980042]
We show how to return a set of items rigorously guaranteed to contain mostly good items.
Our procedure endows any ranking model with rigorous finite-sample control of the false discovery rate.
We evaluate our methods on the Yahoo! Learning to Rank and MSMarco datasets.
arXiv Detail & Related papers (2022-07-04T17:49:25Z) - FedCL: Federated Contrastive Learning for Privacy-Preserving
Recommendation [98.5705258907774]
FedCL can exploit high-quality negative samples for effective model training with privacy well protected.
We first infer user embeddings from local user data through the local model on each client, and then perturb them with local differential privacy (LDP)
Since individual user embedding contains heavy noise due to LDP, we propose to cluster user embeddings on the server to mitigate the influence of noise.
arXiv Detail & Related papers (2022-04-21T02:37:10Z) - Recommendation Unlearning [27.99369346343332]
RecEraser is a general and efficient machine unlearning framework tailored to recommendation task.
We first design three novel data partition algorithms to divide training data into balanced groups based on their similarity.
Experimental results on three public benchmarks show that RecEraser can not only achieve efficient unlearning, but also outperform the state-of-the-art unlearning methods in terms of model utility.
arXiv Detail & Related papers (2022-01-18T08:43:34Z) - Collaborative Unsupervised Visual Representation Learning from
Decentralized Data [34.06624704343615]
We propose a novel federated unsupervised learning framework, FedU.
In this framework, each party trains models from unlabeled data independently using contrastive learning with an online network and a target network.
FedU preserves data privacy as each party only has access to its raw data.
arXiv Detail & Related papers (2021-08-14T08:34:11Z) - Differentially Private Secure Multi-Party Computation for Federated
Learning in Financial Applications [5.50791468454604]
Federated learning enables a population of clients, working with a trusted server, to collaboratively learn a shared machine learning model.
This reduces the risk of exposing sensitive data, but it is still possible to reverse engineer information about a client's private data set from communicated model parameters.
We present a privacy-preserving federated learning protocol to a non-specialist audience, demonstrate it using logistic regression on a real-world credit card fraud data set, and evaluate it using an open-source simulation platform.
arXiv Detail & Related papers (2020-10-12T17:16:27Z) - WAFFLe: Weight Anonymized Factorization for Federated Learning [88.44939168851721]
In domains where data are sensitive or private, there is great value in methods that can learn in a distributed manner without the data ever leaving the local devices.
We propose Weight Anonymized Factorization for Federated Learning (WAFFLe), an approach that combines the Indian Buffet Process with a shared dictionary of weight factors for neural networks.
arXiv Detail & Related papers (2020-08-13T04:26:31Z) - Multi-Center Federated Learning [62.57229809407692]
This paper proposes a novel multi-center aggregation mechanism for federated learning.
It learns multiple global models from the non-IID user data and simultaneously derives the optimal matching between users and centers.
Our experimental results on benchmark datasets show that our method outperforms several popular federated learning methods.
arXiv Detail & Related papers (2020-05-03T09:14:31Z)
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.