S2CDR: Smoothing-Sharpening Process Model for Cross-Domain Recommendation
Xiaodong Li, Juwei Yue, Xinghua Zhang, Jiawei Sheng, Wenyuan Zhang, Taoyu Su, Zefeng Zhang, Tingwen Liu
Abstract
User cold-start problem is a long-standing challenge in recommendation systems. Fortunately, cross-domain recommendation (CDR) has emerged as a highly effective remedy for the user cold-start challenge, with recently developed diffusion models (DMs) demonstrating exceptional performance. However, these DMs-based CDR methods focus on dealing with user-item interactions, overlooking correlations between items across the source and target domains. Meanwhile, the Gaussian noise added in the forward process of diffusion models would hurt user's personalized preference, leading to the difficulty in transferring user preference across domains. To this end, we propose a novel paradigm of Smoothing-Sharpening Process Model for CDR to cold-start users, termed as S2CDR which features a corruption-recovery architecture and is solved with respect to ordinary differential equations (ODEs). Specifically, the smoothing process gradually corrupts the original user-item/item-item interaction matrices derived from both domains into smoothed preference signals in a noise-free manner, and the sharpening process iteratively sharpens the preference signals to recover the unknown interactions for cold-start users. Wherein, for the smoothing process, we introduce the heat equation on the item-item similarity graph to better capture the correlations between items across domains, and further build the tailor-designed low-pass filter to filter out the high-frequency noise information for capturing user's intrinsic preference, in accordance with the graph signal processing (GSP) theory. Extensive experiments on three real-world CDR scenarios confirm that our S2CDR significantly outperforms previous SOTA methods in a training-free manner.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 4736b1ce-e68e-47d3-8b8c-36afb6e261e3Builds on19
- Denoising Diffusion Probabilistic ModelsJonathan Ho, Ajay Jain, Pieter AbbeelNeurIPS 2020 · 35,902 citations
- LightGCN: Simplifying and Powering Graph Convolution Network for RecommendationXiangnan He, Kuan Deng, Xiang Wang, Yan Li et al.SIGIR 2020 · 4,448 citations
- Generate What You Prefer: Reshaping Sequential Recommendation via Guided DiffusionZhengyi Yang, Jiancan Wu, Zhicai Wang, Xiang Wang et al.NeurIPS 2023 · 205 citations
- DisenCDR: Learning Disentangled Representations for Cross-Domain RecommendationJiangxia Cao, Xixun Lin, Xin Cong, Jing Ya et al.SIGIR 2022 · 119 citations
- Cross-Domain Recommendation to Cold-Start Users via Variational Information BottleneckJiangxia Cao, Jiawei Sheng, Xin Cong, Tingwen Liu et al.ICDE 2022 · 112 citations
Related papers
- Exploring Preference-Guided Diffusion Model for Cross-Domain RecommendationXiaodong Li, Hengzhu Tang, Jiawei Sheng, Xinghua Zhang et al.KDD 2025 · 6 citations
- CD-CDR: Conditional Diffusion-based Item Generation for Cross-Domain RecommendationHanyu Li, Jiayu Li, Weizhi Ma, Peijie Sun et al.SIGIR 2025 · 7 citations
- Personalized Multi-Interest Modeling for Cross-Domain Recommendation to Cold-Start UsersXiaodong Li, Jiawei Sheng, Jiangxia Cao, Xinghua Zhang et al.ICDE 2025 · 1 citation
- Joint Similarity Item Exploration and Overlapped User Guidance for Multi-Modal Cross-Domain RecommendationWeiming Liu, Chaochao Chen, Jiahe Xu, Xinting Liao et al.WWW 2025 · 3 citations
- Reducing Item Discrepancy via Differentially Private Robust Embedding Alignment for Privacy-Preserving Cross Domain RecommendationWeiming Liu, Xiaolin Zheng, Chaochao Chen, Jiahe Xu et al.ICML 2024 · 5 citations
