Differential Private Knowledge Transfer for Privacy-Preserving Cross-Domain Recommendation

• URL: http://arxiv.org/abs/2202.04893v1
• Date: Thu, 10 Feb 2022 08:31:37 GMT
• Title: Differential Private Knowledge Transfer for Privacy-Preserving Cross-Domain Recommendation
• Authors: Chaochao Chen, Huiwen Wu, Jiajie Su, Lingjuan Lyu, Xiaolin Zheng and Li Wang
• Abstract summary: Cross Domain Recommendation (CDR) has been popularly studied to alleviate the cold-start and data sparsity problem commonly existed in recommender systems. We propose a novel two stage based privacy-preserving CDR framework (PriCDR) PriCDR can not only protect the data privacy of the source domain, but also alleviate the data sparsity of the source domain.
• Score: 31.412833205047495
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Cross Domain Recommendation (CDR) has been popularly studied to alleviate the cold-start and data sparsity problem commonly existed in recommender systems. CDR models can improve the recommendation performance of a target domain by leveraging the data of other source domains. However, most existing CDR models assume information can directly 'transfer across the bridge', ignoring the privacy issues. To solve the privacy concern in CDR, in this paper, we propose a novel two stage based privacy-preserving CDR framework (PriCDR). In the first stage, we propose two methods, i.e., Johnson-Lindenstrauss Transform (JLT) based and Sparse-awareJLT (SJLT) based, to publish the rating matrix of the source domain using differential privacy. We theoretically analyze the privacy and utility of our proposed differential privacy based rating publishing methods. In the second stage, we propose a novel heterogeneous CDR model (HeteroCDR), which uses deep auto-encoder and deep neural network to model the published source rating matrix and target rating matrix respectively. To this end, PriCDR can not only protect the data privacy of the source domain, but also alleviate the data sparsity of the source domain. We conduct experiments on two benchmark datasets and the results demonstrate the effectiveness of our proposed PriCDR and HeteroCDR.

Related papers

• On the MIA Vulnerability Gap Between Private GANs and Diffusion Models [51.53790101362898]
  Generative Adversarial Networks (GANs) and diffusion models have emerged as leading approaches for high-quality image synthesis.<n>We present the first unified theoretical and empirical analysis of the privacy risks faced by differentially private generative models.
  arXiv  Detail & Related papers  (2025-09-03T14:18:22Z)
• Causal-Invariant Cross-Domain Out-of-Distribution Recommendation [15.522907452605788]
  Cross-Domain Recommendation (CDR) aims to leverage knowledge from a relatively data-richer source domain to address the data sparsity problem.<n>While CDR methods need to address the distribution shifts between different domains, they typically assume independent and identical distribution.<n>We propose a novel Causal-Invariant Cross-Domain Out-of-distribution Recommendation framework, called CICDOR.
  arXiv  Detail & Related papers  (2025-05-22T11:21:51Z)
• Heterogeneous Graph-based Framework with Disentangled Representations Learning for Multi-target Cross Domain Recommendation [7.247438542823219]
  CDR (Cross-Domain Recommendation) is a critical solution to data sparsity problem in recommendation system. We present HGDR (Heterogeneous Graph-based Framework with Disentangled Representations Learning), an end-to-end heterogeneous network architecture. Experiments on real-world datasets and online A/B tests prove that our proposed model can transmit information among domains effectively.
  arXiv  Detail & Related papers  (2024-07-01T02:27: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)
• Diffusion Cross-domain Recommendation [0.0]
  We propose Diffusion Cross-domain Recommendation (DiffCDR) to give high-quality outcomes to cold-start users. We first adopt the theory of DPM and design a Diffusion Module (DIM), which generates user's embedding in target domain. In addition, we consider the label data of the target domain and form the task-oriented loss function, which enables our DiffCDR to adapt to specific tasks.
  arXiv  Detail & Related papers  (2024-02-03T15:14:51Z)
• PPGenCDR: A Stable and Robust Framework for Privacy-Preserving Cross-Domain Recommendation [13.83404821252712]
  Privacy-preserving cross-domain recommendation (PPCDR) refers to preserving the privacy of users when transferring the knowledge from source domain to target domain for better performance. Existing work on cross-domain recommendation (CDR) reaches advanced and satisfying recommendation performance, but mostly neglects preserving privacy. We propose a privacy-preserving generative cross-domain recommendation (enCDR) framework for PPCDR.
  arXiv  Detail & Related papers  (2023-05-11T08:04:05Z)
• Uncertainty-Aware Source-Free Adaptive Image Super-Resolution with Wavelet Augmentation Transformer [60.31021888394358]
  Unsupervised Domain Adaptation (UDA) can effectively address domain gap issues in real-world image Super-Resolution (SR) We propose a SOurce-free Domain Adaptation framework for image SR (SODA-SR) to address this issue, i.e., adapt a source-trained model to a target domain with only unlabeled target data.
  arXiv  Detail & Related papers  (2023-03-31T03:14:44Z)
• A Prototype-Oriented Clustering for Domain Shift with Source Privacy [66.67700676888629]
  We introduce Prototype-oriented Clustering with Distillation (PCD) to improve the performance and applicability of existing methods. PCD first constructs a source clustering model by aligning the distributions of prototypes and data. It then distills the knowledge to the target model through cluster labels provided by the source model while simultaneously clustering the target data.
  arXiv  Detail & Related papers  (2023-02-08T00:15:35Z)
• Reproducibility-Oriented and Privacy-Preserving Genomic Dataset Sharing [8.959228247984337]
  We propose an innovative method that involves a differential privacy-based scheme for sharing genomic datasets. We show that our proposed scheme outperforms all other methods in detecting GWAS outcome errors, achieves better utility, and provides higher privacy protection against membership inference attacks (MIAs) By utilizing our method, genomic researchers will be inclined to share a differentially private, yet of high quality version of their datasets.
  arXiv  Detail & Related papers  (2022-09-13T22:20:41Z)
• Domain-Specific Risk Minimization for Out-of-Distribution Generalization [104.17683265084757]
  We first establish a generalization bound that explicitly considers the adaptivity gap. We propose effective gap estimation methods for guiding the selection of a better hypothesis for the target. The other method is minimizing the gap directly by adapting model parameters using online target samples.
  arXiv  Detail & Related papers  (2022-08-18T06:42:49Z)
• Source-Free Domain Adaptation via Distribution Estimation [106.48277721860036]
  Domain Adaptation aims to transfer the knowledge learned from a labeled source domain to an unlabeled target domain whose data distributions are different. Recently, Source-Free Domain Adaptation (SFDA) has drawn much attention, which tries to tackle domain adaptation problem without using source data. In this work, we propose a novel framework called SFDA-DE to address SFDA task via source Distribution Estimation.
  arXiv  Detail & Related papers  (2022-04-24T12:22:19Z)
• Collaborative Filtering with Attribution Alignment for Review-based Non-overlapped Cross Domain Recommendation [16.213603171466602]
  Cross-Domain Recommendation (CDR) has been popularly studied to utilize different domain knowledge to solve the data sparsity and cold-start problem in recommender systems. In this paper, we focus on the Review-based Non-overlapped Recommendation (RNCDR) problem. The problem is commonly-existed and challenging due to two main aspects, i.e. there are only positive user-item ratings on the target domain and there is no overlapped user across different domains. Most previous CDR approaches cannot solve the RNCDR problem well, since they cannot effectively combine review with other
  arXiv  Detail & Related papers  (2022-02-10T09:22:30Z)
• 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)
• Distill and Fine-tune: Effective Adaptation from a Black-box Source Model [138.12678159620248]
  Unsupervised domain adaptation (UDA) aims to transfer knowledge in previous related labeled datasets (source) to a new unlabeled dataset (target) We propose a novel two-step adaptation framework called Distill and Fine-tune (Dis-tune)
  arXiv  Detail & Related papers  (2021-04-04T05:29:05Z)

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.