Causality Enhancement for Cross-Domain Recommendation
- URL: http://arxiv.org/abs/2510.14641v1
- Date: Thu, 16 Oct 2025 12:54:46 GMT
- Title: Causality Enhancement for Cross-Domain Recommendation
- Authors: Zhibo Wu, Yunfan Wu, Lin Jiang, Ping Yang, Yao Hu,
- Abstract summary: Cross-domain recommendation forms a crucial component in recommendation systems.<n>We propose a causality-enhanced framework, named CE-CDR.<n>We derive a theoretically unbiased Partial Label Causal Loss to generalize beyond the biased causality-aware dataset.
- Score: 12.30363925420891
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Cross-domain recommendation forms a crucial component in recommendation systems. It leverages auxiliary information through source domain tasks or features to enhance target domain recommendations. However, incorporating inconsistent source domain tasks may result in insufficient cross-domain modeling or negative transfer. While incorporating source domain features without considering the underlying causal relationships may limit their contribution to final predictions. Thus, a natural idea is to directly train a cross-domain representation on a causality-labeled dataset from the source to target domain. Yet this direction has been rarely explored, as identifying unbiased real causal labels is highly challenging in real-world scenarios. In this work, we attempt to take a first step in this direction by proposing a causality-enhanced framework, named CE-CDR. Specifically, we first reformulate the cross-domain recommendation as a causal graph for principled guidance. We then construct a causality-aware dataset heuristically. Subsequently, we derive a theoretically unbiased Partial Label Causal Loss to generalize beyond the biased causality-aware dataset to unseen cross-domain patterns, yielding an enriched cross-domain representation, which is then fed into the target model to enhance target-domain recommendations. Theoretical and empirical analyses, as well as extensive experiments, demonstrate the rationality and effectiveness of CE-CDR and its general applicability as a model-agnostic plugin. Moreover, it has been deployed in production since April 2025, showing its practical value in real-world applications.
Related papers
- Enhancing Transferability and Consistency in Cross-Domain Recommendations via Supervised Disentanglement [13.553355329509243]
Cross-domain recommendation aims to alleviate the data sparsity by transferring knowledge across domains.<n>Disentangled representation learning provides an effective solution to model complex user preferences.<n>We propose DGCDR, a GNN-enhanced encoder-decoder framework.
arXiv Detail & Related papers (2025-07-23T01:29:45Z) - Deconfounding Causal Inference through Two-Branch Framework with Early-Forking for Sensor-Based Cross-Domain Activity Recognition [5.74620895704135]
We propose a causality-inspired representation learning algorithm for cross-domain activity recognition.<n>Experiments on several public HAR benchmarks demonstrate that our approach significantly outperforms eleven related state-of-the-art baselines.
arXiv Detail & Related papers (2025-07-05T04:33:57Z) - Unsupervised Structural-Counterfactual Generation under Domain Shift [1.9652313502216219]
We present a novel generative modeling challenge: generating counterfactual samples in a target domain based on factual observations from a source domain.<n>Our framework combines the posterior distribution of effect-intrinsic variables from the source domain with the prior distribution of domain-intrinsic variables from the target domain to synthesize the desired counterfactuals.
arXiv Detail & Related papers (2025-02-17T16:48:16Z) - The Devil is in the Sources! Knowledge Enhanced Cross-Domain Recommendation in an Information Bottleneck Perspective [20.354832981118935]
Cross-domain Recommendation (CDR) aims to alleviate the data sparsity and the cold-start problems in traditional recommender systems.
We propose a novel knowledge enhanced cross-domain recommendation framework named CoTrans.
arXiv Detail & Related papers (2024-09-29T06:30:44Z) - Towards Unified and Adaptive Cross-Domain Collaborative Filtering via Graph Signal Processing [48.04521184170971]
Cross-Domain Recommendation (CDR) has emerged as a promising solution by leveraging dense domains to improve recommendations in sparse target domains.<n>We propose CGSP, a unified and adaptive CDR framework based on graph signal processing (GSP)
arXiv Detail & Related papers (2024-07-17T07:52:45Z) - 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) - Domain Generalization via Causal Adjustment for Cross-Domain Sentiment
Analysis [59.73582306457387]
We focus on the problem of domain generalization for cross-domain sentiment analysis.
We propose a backdoor adjustment-based causal model to disentangle the domain-specific and domain-invariant representations.
A series of experiments show the great performance and robustness of our model.
arXiv Detail & Related papers (2024-02-22T13:26:56Z) - Relation Matters: Foreground-aware Graph-based Relational Reasoning for
Domain Adaptive Object Detection [81.07378219410182]
We propose a new and general framework for DomainD, named Foreground-aware Graph-based Reasoning (FGRR)
FGRR incorporates graph structures into the detection pipeline to explicitly model the intra- and inter-domain foreground object relations.
Empirical results demonstrate that the proposed FGRR exceeds the state-of-the-art on four DomainD benchmarks.
arXiv Detail & Related papers (2022-06-06T05:12:48Z) - Domain-Agnostic Prior for Transfer Semantic Segmentation [197.9378107222422]
Unsupervised domain adaptation (UDA) is an important topic in the computer vision community.
We present a mechanism that regularizes cross-domain representation learning with a domain-agnostic prior (DAP)
Our research reveals that UDA benefits much from better proxies, possibly from other data modalities.
arXiv Detail & Related papers (2022-04-06T09:13:25Z) - Unsupervised Domain Generalization for Person Re-identification: A
Domain-specific Adaptive Framework [50.88463458896428]
Domain generalization (DG) has attracted much attention in person re-identification (ReID) recently.
Existing methods usually need the source domains to be labeled, which could be a significant burden for practical ReID tasks.
We propose a simple and efficient domain-specific adaptive framework, and realize it with an adaptive normalization module.
arXiv Detail & Related papers (2021-11-30T02:35:51Z) - Discriminative Cross-Domain Feature Learning for Partial Domain
Adaptation [70.45936509510528]
Partial domain adaptation aims to adapt knowledge from a larger and more diverse source domain to a smaller target domain with less number of classes.
Recent practice on domain adaptation manages to extract effective features by incorporating the pseudo labels for the target domain.
It is essential to align target data with only a small set of source data.
arXiv Detail & Related papers (2020-08-26T03:18:53Z) - Bi-Directional Generation for Unsupervised Domain Adaptation [61.73001005378002]
Unsupervised domain adaptation facilitates the unlabeled target domain relying on well-established source domain information.
Conventional methods forcefully reducing the domain discrepancy in the latent space will result in the destruction of intrinsic data structure.
We propose a Bi-Directional Generation domain adaptation model with consistent classifiers interpolating two intermediate domains to bridge source and target domains.
arXiv Detail & Related papers (2020-02-12T09:45:39Z)
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.