Federated Prototype-based Contrastive Learning for Privacy-Preserving Cross-domain Recommendation

• URL: http://arxiv.org/abs/2409.03294v1
• Date: Thu, 05 Sep 2024 06:59:56 GMT
• Title: Federated Prototype-based Contrastive Learning for Privacy-Preserving Cross-domain Recommendation
• Authors: Li Wang, Quangui Zhang, Lei Sang, Qiang Wu, Min Xu,
• Abstract summary: Cross-domain recommendation (CDR) aims to improve recommendation accuracy in sparse domains by transferring knowledge from data-rich domains. Existing CDR methods often assume the availability of user-item interaction data across domains, overlooking user privacy concerns. We propose a Federated Prototype-based Contrastive Learning (CL) method for Privacy-Preserving CDR, named FedPCL-CDR.
• Score: 12.431227076940704
• License:
• Abstract: Cross-domain recommendation (CDR) aims to improve recommendation accuracy in sparse domains by transferring knowledge from data-rich domains. However, existing CDR methods often assume the availability of user-item interaction data across domains, overlooking user privacy concerns. Furthermore, these methods suffer from performance degradation in scenarios with sparse overlapping users, as they typically depend on a large number of fully shared users for effective knowledge transfer. To address these challenges, we propose a Federated Prototype-based Contrastive Learning (CL) method for Privacy-Preserving CDR, named FedPCL-CDR. This approach utilizes non-overlapping user information and prototypes to improve multi-domain performance while protecting user privacy. FedPCL-CDR comprises two modules: local domain (client) learning and global server aggregation. In the local domain, FedPCL-CDR clusters all user data to learn representative prototypes, effectively utilizing non-overlapping user information and addressing the sparse overlapping user issue. It then facilitates knowledge transfer by employing both local and global prototypes returned from the server in a CL manner. Simultaneously, the global server aggregates representative prototypes from local domains to learn both local and global prototypes. The combination of prototypes and federated learning (FL) ensures that sensitive user data remains decentralized, with only prototypes being shared across domains, thereby protecting user privacy. Extensive experiments on four CDR tasks using two real-world datasets demonstrate that FedPCL-CDR outperforms the state-of-the-art baselines.

Related papers

• Federated Domain Generalization via Prompt Learning and Aggregation [20.933631678895765]
  Federated domain generalization (FedDG) aims to improve the global model generalization in unseen domains. A common strategy in existing FedDG studies involves sharing domain-specific knowledge among clients. We introduce prompt learning to adapt pre-trained vision-language models (VLMs) in the FedDG scenario.
  arXiv  Detail & Related papers  (2024-11-15T09:26:00Z)
• Federated User Preference Modeling for Privacy-Preserving Cross-Domain Recommendation [18.0700584280752]
  Cross-domain recommendation (CDR) aims to address the data-sparsity problem by transferring knowledge across domains. Recent privacy-preserving CDR models have been proposed to solve this problem. We propose a novel Federated User Preference Modeling (FUPM) framework.
  arXiv  Detail & Related papers  (2024-08-26T23:29:03Z)
• Exploring User Retrieval Integration towards Large Language Models for Cross-Domain Sequential Recommendation [66.72195610471624]
  Cross-Domain Sequential Recommendation aims to mine and transfer users' sequential preferences across different domains. We propose a novel framework named URLLM, which aims to improve the CDSR performance by exploring the User Retrieval approach.
  arXiv  Detail & Related papers  (2024-06-05T09:19:54Z)
• A Privacy-Preserving Framework with Multi-Modal Data for Cross-Domain Recommendation [13.33679167416221]
  Cross-domain recommendation (CDR) aims to enhance recommendation accuracy in a target domain with sparse data. We propose a Privacy-Preserving Framework with Multi-Modal Data for Cross-Domain Recommendation, called P2M2-CDR.
  arXiv  Detail & Related papers  (2024-03-06T10:40:08Z)
• FedHCDR: Federated Cross-Domain Recommendation with Hypergraph Signal Decoupling [15.159012729198619]
  We propose FedHCDR, a novel Cross-Domain Recommendation framework with Hypergraph signal decoupling. In this study, we introduce an approach called hypergraph signal decoupling (HSD) to decouple the user features into domain-exclusive and domain-shared features. Extensive experiments conducted on three real-world scenarios demonstrate that FedHCDR outperforms existing baselines significantly.
  arXiv  Detail & Related papers  (2024-03-05T03:40:39Z)
• Mixed Attention Network for Cross-domain Sequential Recommendation [63.983590953727386]
  We propose a Mixed Attention Network (MAN) with local and global attention modules to extract the domain-specific and cross-domain information. Experimental results on two real-world datasets demonstrate the superiority of our proposed model.
  arXiv  Detail & Related papers  (2023-11-14T16:07:16Z)
• A cross-domain recommender system using deep coupled autoencoders [77.86290991564829]
  Two novel coupled autoencoder-based deep learning methods are proposed for cross-domain recommendation. The first method aims to simultaneously learn a pair of autoencoders in order to reveal the intrinsic representations of the items in the source and target domains. The second method is derived based on a new joint regularized optimization problem, which employs two autoencoders to generate in a deep and non-linear manner the user and item-latent factors.
  arXiv  Detail & Related papers  (2021-12-08T15:14:26Z)
• RecGURU: Adversarial Learning of Generalized User Representations for Cross-Domain Recommendation [19.61356871656398]
  Cross-domain recommendation can help alleviate the data sparsity issue in traditional sequential recommender systems. We propose the RecGURU algorithm framework to generate a Generalized User Representation (GUR) incorporating user information across domains in sequential recommendation.
  arXiv  Detail & Related papers  (2021-11-19T08:41:06Z)
• MD-CSDNetwork: Multi-Domain Cross Stitched Network for Deepfake Detection [80.83725644958633]
  Current deepfake generation methods leave discriminative artifacts in the frequency spectrum of fake images and videos. We present a novel approach, termed as MD-CSDNetwork, for combining the features in the spatial and frequency domains to mine a shared discriminative representation.
  arXiv  Detail & Related papers  (2021-09-15T14:11:53Z)
• Cross-domain Contrastive Learning for Unsupervised Domain Adaptation [108.63914324182984]
  Unsupervised domain adaptation (UDA) aims to transfer knowledge learned from a fully-labeled source domain to a different unlabeled target domain. We build upon contrastive self-supervised learning to align features so as to reduce the domain discrepancy between training and testing sets.
  arXiv  Detail & Related papers  (2021-06-10T06:32:30Z)
• Decentralised Learning from Independent Multi-Domain Labels for Person Re-Identification [69.29602103582782]
  Deep learning has been successful for many computer vision tasks due to the availability of shared and centralised large-scale training data. However, increasing awareness of privacy concerns poses new challenges to deep learning, especially for person re-identification (Re-ID) We propose a novel paradigm called Federated Person Re-Identification (FedReID) to construct a generalisable global model (a central server) by simultaneously learning with multiple privacy-preserved local models (local clients) This client-server collaborative learning process is iteratively performed under privacy control, enabling FedReID to realise decentralised learning without sharing distributed data nor collecting any
  arXiv  Detail & Related papers  (2020-06-07T13:32:33Z)

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.