Causal Disentangled Recommendation Against User Preference Shifts
Not on the map. Why?
Abstract (arXiv)
Recommender systems easily face the issue of user preference shifts. User representations will become out-of-date and lead to inappropriate recommendations if user preference has shifted over time. To solve the issue, existing work focuses on learning robust representations or predicting the shifting pattern. There lacks a comprehensive view to discover the underlying reasons for user preference shifts. To understand the preference shift, we abstract a causal graph to describe the generation procedure of user interaction sequences. Assuming user preference is stable within a short period, we abstract the interaction sequence as a set of chronological environments. From the causal graph, we find that the changes of some unobserved factors (e.g., becoming pregnant) cause preference shifts between environments. Besides, the fine-grained user preference over categories sparsely affects the interactions with different items. Inspired by the causal graph, our key considerations to handle preference shifts lie in modeling the interaction generation procedure by: 1) capturing the preference shifts across environments for accurate preference prediction, and 2) disentangling the sparse influence from user preference to interactions for accurate effect estimation of preference. To this end, we propose a Causal Disentangled Recommendation (CDR) framework, which captures preference shifts via a temporal variational autoencoder and learns the sparse influence from multiple environments. Specifically, an encoder is adopted to infer the unobserved factors from user interactions while a decoder is to model the interaction generation process. Besides, we introduce two learnable matrices to disentangle the sparse influence from user preference to interactions. Lastly, we devise a multi-objective loss to optimize CDR. Extensive experiments on three datasets show the superiority of CDR.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Mar 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 4; 2026: 2.
8 papers.
- 2024Graph Representation Learning via Causal Diffusion for Out-of-Distribution Recommendationcited by 11
- 2025Distributionally Robust Graph Out-of-Distribution Recommendation via Diffusion Modelcited by 7
- 2023DPR: An Algorithm Mitigate Bias Accumulation in Recommendation feedback loopscited by 0
- 2025Intrinsic and Extrinsic Factor Disentanglement for Recommendation in Various Context Scenarioscited by 0
- 2025Causal Negative Sampling via Diffusion Model for Out-of-Distribution Recommendationcited by 0
- 2025Diversity Recommendation via Causal Deconfounding of Co-purchase Relations and Counterfactual Exposurecited by 0
- 2026Conditionally Identifiable Latent-Environment Modeling for Out-of-Distribution Recommendationcited by 0
- 2026GenCAR: Generative Counterfactual Alignment with Risk-Controlled Selection for Out-of-Distribution Recommendationcited by 0
- 2026GenCAR: Generative Counterfactual Alignment with Risk-Controlled Selection for Out-of-Distribution Recommendation2 Sep 2026
- 2026Conditionally Identifiable Latent-Environment Modeling for Out-of-Distribution Recommendation4 Aug 2026
- 2025Diversity Recommendation via Causal Deconfounding of Co-purchase Relations and Counterfactual Exposure19 Dec 2025
- 2025Causal Negative Sampling via Diffusion Model for Out-of-Distribution Recommendation10 Aug 2025
- 2025Intrinsic and Extrinsic Factor Disentanglement for Recommendation in Various Context Scenarios5 Mar 2025
- 2025Distributionally Robust Graph Out-of-Distribution Recommendation via Diffusion Model26 Jan 2025
- 2024Graph Representation Learning via Causal Diffusion for Out-of-Distribution Recommendation1 Aug 2024
- 2023DPR: An Algorithm Mitigate Bias Accumulation in Recommendation feedback loops10 Nov 2023