PEPPER: Empowering User-Centric Recommender Systems over Gossip Learning

• URL: http://arxiv.org/abs/2208.05320v1
• Date: Tue, 9 Aug 2022 14:51:27 GMT
• Title: PEPPER: Empowering User-Centric Recommender Systems over Gossip Learning
• Authors: Yacine Belal and Aur\'elien Bellet and Sonia Ben Mokhtar and Vlad Nitu
• Abstract summary: PEPPER is a decentralized recommender system based on gossip learning principles. Our solution converges up to 42% faster than with other decentralized solutions.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recommender systems are proving to be an invaluable tool for extracting user-relevant content helping users in their daily activities (e.g., finding relevant places to visit, content to consume, items to purchase). However, to be effective, these systems need to collect and analyze large volumes of personal data (e.g., location check-ins, movie ratings, click rates .. etc.), which exposes users to numerous privacy threats. In this context, recommender systems based on Federated Learning (FL) appear to be a promising solution for enforcing privacy as they compute accurate recommendations while keeping personal data on the users' devices. However, FL, and therefore FL-based recommender systems, rely on a central server that can experience scalability issues besides being vulnerable to attacks. To remedy this, we propose PEPPER, a decentralized recommender system based on gossip learning principles. In PEPPER, users gossip model updates and aggregate them asynchronously. At the heart of PEPPER reside two key components: a personalized peer-sampling protocol that keeps in the neighborhood of each node, a proportion of nodes that have similar interests to the former and a simple yet effective model aggregation function that builds a model that is better suited to each user. Through experiments on three real datasets implementing two use cases: a location check-in recommendation and a movie recommendation, we demonstrate that our solution converges up to 42% faster than with other decentralized solutions providing up to 9% improvement on average performance metric such as hit ratio and up to 21% improvement on long tail performance compared to decentralized competitors.

Related papers

• Dissertation: On the Theoretical Foundation of Model Comparison and Evaluation for Recommender System [4.76281731053599]
  Recommender systems utilize users' historical data to infer customer interests and provide personalized recommendations. Collaborative filtering is one family of recommendation algorithms that uses ratings from multiple users to predict missing ratings. Recommender systems can be more complex and incorporate auxiliary data such as content-based attributes, user interactions, and contextual information.
  arXiv  Detail & Related papers  (2024-11-04T06:31:52Z)
• System-2 Recommenders: Disentangling Utility and Engagement in Recommendation Systems via Temporal Point-Processes [80.97898201876592]
  We propose a generative model in which past content interactions impact the arrival rates of users based on a self-exciting Hawkes process. We show analytically that given samples it is possible to disentangle System-1 and System-2 and allow content optimization based on user utility.
  arXiv  Detail & Related papers  (2024-05-29T18:19:37Z)
• Less Can Be More: Exploring Population Rating Dispositions with Partitioned Models in Recommender Systems [1.4279471205248533]
  We find that users with different rating dispositions may use the recommender system differently. We find that such partitioning improves computational efficiency but also improves top-k performance and predictive accuracy.
  arXiv  Detail & Related papers  (2023-06-20T04:16:53Z)
• On the resilience of Collaborative Learning-based Recommender Systems Against Community Detection Attack [1.9093042949944972]
  Collaborative-learning-based recommender systems emerged following the success of collaborative learning techniques such as Federated Learning (FL) and Gossip Learning (GL) In these systems, users participate in the training of a recommender system while maintaining their history of consumed items on their devices. Recent studies have revealed that collaborative learning can be vulnerable to various privacy attacks.
  arXiv  Detail & Related papers  (2023-06-15T08:02:07Z)
• 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)
• Self-supervised Graph-based Point-of-interest Recommendation [66.58064122520747]
  Next Point-of-Interest (POI) recommendation has become a prominent component in location-based e-commerce. We propose a Self-supervised Graph-enhanced POI Recommender (S2GRec) for next POI recommendation. In particular, we devise a novel Graph-enhanced Self-attentive layer to incorporate the collaborative signals from both global transition graph and local trajectory graphs.
  arXiv  Detail & Related papers  (2022-10-22T17:29:34Z)
• 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)
• Debiasing Learning for Membership Inference Attacks Against Recommender Systems [79.48353547307887]
  Learned recommender systems may inadvertently leak information about their training data, leading to privacy violations. We investigate privacy threats faced by recommender systems through the lens of membership inference. We propose a Debiasing Learning for Membership Inference Attacks against recommender systems (DL-MIA) framework that has four main components.
  arXiv  Detail & Related papers  (2022-06-24T17:57:34Z)
• 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)
• FedeRank: User Controlled Feedback with Federated Recommender Systems [4.474834288759608]
  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.
  arXiv  Detail & Related papers  (2020-12-15T22:26:54Z)
• How to Put Users in Control of their Data in Federated Top-N Recommendation with Learning to Rank [16.256897977543982]
  We present FPL, an architecture in which users collaborate in training a central factorization model while controlling the amount of sensitive data leaving their devices. The proposed approach implements pair-wise learning-to-rank optimization by following the Federated Learning principles.
  arXiv  Detail & Related papers  (2020-08-17T10:13:15Z)

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.