Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

CaDRec: Contextualized and Debiased Recommender Model (2404.06895v3)

Published 10 Apr 2024 in cs.IR

Abstract: Recommender models aimed at mining users' behavioral patterns have raised great attention as one of the essential applications in daily life. Recent work on graph neural networks (GNNs) or debiasing methods has attained remarkable gains. However, they still suffer from (1) over-smoothing node embeddings caused by recursive convolutions with GNNs, and (2) the skewed distribution of interactions due to popularity and user-individual biases. This paper proposes a contextualized and debiased recommender model (CaDRec). To overcome the over-smoothing issue, we explore a novel hypergraph convolution operator that can select effective neighbors during convolution by introducing both structural context and sequential context. To tackle the skewed distribution, we propose two strategies for disentangling interactions: (1) modeling individual biases to learn unbiased item embeddings, and (2) incorporating item popularity with positional encoding. Moreover, we mathematically show that the imbalance of the gradients to update item embeddings exacerbates the popularity bias, thus adopting regularization and weighting schemes as solutions. Extensive experiments on four datasets demonstrate the superiority of the CaDRec against state-of-the-art (SOTA) methods. Our source code and data are released at https://github.com/WangXFng/CaDRec.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (51)
  1. LightGCL: Simple Yet Effective Graph Contrastive Learning for Recommendation. In The Eleventh International Conference on Learning Representations.
  2. DisenCDR: Learning Disentangled Representations for Cross-Domain Recommendation. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval. 267–277.
  3. Bias Issues and Solutions in Recommender System: Tutorial on the RecSys 2021. In Fifteenth ACM Conference on Recommender Systems. 825–827.
  4. Multi-view graph attention network for travel recommendation. Expert Systems with Applications 191 (2022), 116234.
  5. Co-training Disentangled Domain Adaptation Network for Leveraging Popularity Bias in Recommenders. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval. 60–69.
  6. Addressing unmeasured confounder for recommendation with sensitivity analysis. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 305–315.
  7. Explaining and harnessing adversarial examples. arXiv preprint arXiv:1412.6572 (2014).
  8. Pre-training graph neural networks for cold-start users and items representation. In Proceedings of the 14th ACM International Conference on Web Search and Data Mining. 265–273.
  9. Lightgcn: Simplifying and powering graph convolution network for recommendation. In Proceedings of the 43rd International ACM SIGIR conference on research and development in Information Retrieval. 639–648.
  10. Causpref: Causal preference learning for out-of-distribution recommendation. In Proceedings of the ACM Web Conference 2022. 410–421.
  11. Word level robustness enhancement: Fight perturbation with perturbation. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 36. 10785–10793.
  12. Nicolas Keriven. 2022. Not too little, not too much: a theoretical analysis of graph (over) smoothing. Advances in Neural Information Processing Systems 35 (2022), 2268–2281.
  13. Be causal: De-biasing social network confounding in recommendation. ACM Transactions on Knowledge Discovery from Data 17, 1 (2023), 1–23.
  14. Towards personalized fairness based on causal notion. In Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval. 1054–1063.
  15. Improving Graph Collaborative Filtering with Neighborhood-enriched Contrastive Learning. In Proceedings of the ACM Web Conference 2022. 2320–2329.
  16. Mitigating confounding bias in recommendation via information bottleneck. In Proceedings of the 15th ACM Conference on Recommender Systems. 351–360.
  17. Debiased representation learning in recommendation via information bottleneck. ACM Transactions on Recommender Systems 1, 1 (2023), 1–27.
  18. Interest-aware message-passing gcn for recommendation. In Proceedings of the Web Conference 2021. 1296–1305.
  19. Point-of-interest recommendation: Exploiting self-attentive autoencoders with neighbor-aware influence. In Proceedings of the 27th ACM international conference on information and knowledge management. 697–706.
  20. Less is more: reweighting important spectral graph features for recommendation. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval. 1273–1282.
  21. Contrastive learning for representation degeneration problem in sequential recommendation. In Proceedings of the fifteenth ACM international conference on web search and data mining. 813–823.
  22. Mitigating popularity bias in recommendation with unbalanced interactions: A gradient perspective. In 2022 IEEE International Conference on Data Mining (ICDM). IEEE, 438–447.
  23. BPR: Bayesian personalized ranking from implicit feedback. arXiv preprint arXiv:1205.2618 (2012).
  24. Deep perturbation learning: enhancing the network performance via image perturbations. In International Conference on Machine Learning. PMLR, 32273–32287.
  25. SMINet: State-Aware Multi-Aspect Interests Representation Network for Cold-Start Users Recommendation. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 36. 8476–8484.
  26. Laurens Van der Maaten and Geoffrey Hinton. 2008. Visualizing data using t-SNE. Journal of machine learning research 9, 11 (2008).
  27. Attention is all you need. Advances in neural information processing systems 30 (2017).
  28. Towards Representation Alignment and Uniformity in Collaborative Filtering. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 1816–1825.
  29. Diffusion Recommender Model. In Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval. 832–841.
  30. EEDN: Enhanced Encoder-Decoder Network with Local and Global Interactions for POI Recommendation. In Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval. 383–392.
  31. STaTRL: Spatial-temporal and text representation learning for POI recommendation. Applied Intelligence 53, 7 (2023), 8286–8301.
  32. A survey on the fairness of recommender systems. ACM Transactions on Information Systems 41, 3 (2023), 1–43.
  33. Self-supervised graph learning for recommendation. In Proceedings of the 44th international ACM SIGIR conference on research and development in information retrieval. 726–735.
  34. PD-GAN: Adversarial learning for personalized diversity-promoting recommendation.. In IJCAI, Vol. 19. 3870–3876.
  35. Automated Self-Supervised Learning for Recommendation. In Proceedings of the ACM Web Conference 2023. 992–1002.
  36. Hypergraph contrastive collaborative filtering. In Proceedings of the 45th International ACM SIGIR conference on research and development in information retrieval. 70–79.
  37. Self-supervised hypergraph transformer for recommender systems. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 2100–2109.
  38. Representation Matters When Learning From Biased Feedback in Recommendation. In Proceedings of the 31st ACM International Conference on Information & Knowledge Management. 2220–2229.
  39. Spatio-temporal hypergraph learning for next POI recommendation. In Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval. 403–412.
  40. XSimGCL: Towards extremely simple graph contrastive learning for recommendation. IEEE Transactions on Knowledge and Data Engineering (2023).
  41. Socially-aware self-supervised tri-training for recommendation. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining. 2084–2092.
  42. Self-supervised multi-channel hypergraph convolutional network for social recommendation. In Proceedings of the Web Conference 2021. 413–424.
  43. Are graph augmentations necessary? simple graph contrastive learning for recommendation. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval. 1294–1303.
  44. Low-Pass Graph Convolutional Network for Recommendation. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 36. 8954–8961.
  45. Incorporating Bias-aware Margins into Contrastive Loss for Collaborative Filtering. In Advances in Neural Information Processing Systems, Vol. 35. 7866–7878.
  46. Invariant Collaborative Filtering to Popularity Distribution Shift. In Proceedings of the ACM Web Conference 2023. 1240–1251.
  47. Recommendation with Causality enhanced Natural Language Explanations. In Proceedings of the ACM Web Conference 2023. 876–886.
  48. Mitigating the Popularity Bias of Graph Collaborative Filtering: A Dimensional Collapse Perspective. Advances in Neural Information Processing Systems 36 (2024).
  49. Popularity Bias Is Not Always Evil: Disentangling Benign and Harmful Bias for Recommendation. IEEE Transactions on Knowledge & Data Engineering 01 (2022), 1–13.
  50. Disentangling user interest and conformity for recommendation with causal embedding. In Proceedings of the Web Conference 2021. 2980–2991.
  51. Adaptive Popularity Debiasing Aggregator for Graph Collaborative Filtering. In Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval. 7–17.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Xinfeng Wang (6 papers)
  2. Fumiyo Fukumoto (6 papers)
  3. Jin Cui (15 papers)
  4. Yoshimi Suzuki (5 papers)
  5. Jiyi Li (16 papers)
  6. Dongjin Yu (5 papers)
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now