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

Distributionally Robust Graph-based Recommendation System (2402.12994v2)

Published 20 Feb 2024 in cs.IR

Abstract: With the capacity to capture high-order collaborative signals, Graph Neural Networks (GNNs) have emerged as powerful methods in Recommender Systems (RS). However, their efficacy often hinges on the assumption that training and testing data share the same distribution (a.k.a. IID assumption), and exhibits significant declines under distribution shifts. Distribution shifts commonly arises in RS, often attributed to the dynamic nature of user preferences or ubiquitous biases during data collection in RS. Despite its significance, researches on GNN-based recommendation against distribution shift are still sparse. To bridge this gap, we propose Distributionally Robust GNN (DR-GNN) that incorporates Distributional Robust Optimization (DRO) into the GNN-based recommendation. DR-GNN addresses two core challenges: 1) To enable DRO to cater to graph data intertwined with GNN, we reinterpret GNN as a graph smoothing regularizer, thereby facilitating the nuanced application of DRO; 2) Given the typically sparse nature of recommendation data, which might impede robust optimization, we introduce slight perturbations in the training distribution to expand its support. Notably, while DR-GNN involves complex optimization, it can be implemented easily and efficiently. Our extensive experiments validate the effectiveness of DR-GNN against three typical distribution shifts. The code is available at https://github.com/WANGBohaO-jpg/DR-GNN.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (59)
  1. Graph convolutional matrix completion. arXiv preprint arXiv:1706.02263 (2017).
  2. LightGCL: Simple Yet Effective Graph Contrastive Learning for Recommendation. arXiv preprint arXiv:2302.08191 (2023).
  3. Collaborative similarity embedding for recommender systems. In The World Wide Web Conference. 2637–2643.
  4. AutoDebias: Learning to debias for recommendation. In Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval. 21–30.
  5. Bias and debias in recommender system: A survey and future directions. ACM Transactions on Information Systems 41, 3 (2023), 1–39.
  6. Uncertainty-Aware Robust Learning on Noisy Graphs. arXiv preprint arXiv:2306.08210 (2023).
  7. Graph Convolution Network based Recommender Systems: Learning Guarantee and Item Mixture Powered Strategy. Advances in Neural Information Processing Systems 35 (2022), 3900–3912.
  8. On the equivalence of decoupled graph convolution network and label propagation. In Proceedings of the Web Conference 2021. 3651–3662.
  9. Graph neural networks for social recommendation. In The world wide web conference. 417–426.
  10. Graph collaborative signals denoising and augmentation for recommendation. In Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval. 2037–2041.
  11. Alleviating Matthew Effect of Offline Reinforcement Learning in Interactive Recommendation. arXiv preprint arXiv:2307.04571 (2023).
  12. Predict then propagate: Graph neural networks meet personalized pagerank. arXiv preprint arXiv:1810.05997 (2018).
  13. 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.
  14. Neural collaborative filtering. In Proceedings of the 26th international conference on world wide web. 173–182.
  15. Fast matrix factorization for online recommendation with implicit feedback. In Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval. 549–558.
  16. Causpref: Causal preference learning for out-of-distribution recommendation. In Proceedings of the ACM Web Conference 2022. 410–421.
  17. Zhaolin Hu and L Jeff Hong. 2013. Kullback-Leibler divergence constrained distributionally robust optimization. Available at Optimization Online 1, 2 (2013), 9.
  18. Thomas N Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016).
  19. Matrix factorization techniques for recommender systems. Computer 42, 8 (2009), 30–37.
  20. A unified view on graph neural networks as graph signal denoising. In Proceedings of the 30th ACM International Conference on Information & Knowledge Management. 1202–1211.
  21. Benjamin M Marlin and Richard S Zemel. 2009. Collaborative prediction and ranking with non-random missing data. In Proceedings of the third ACM conference on Recommender systems. 5–12.
  22. Foundations of machine learning. MIT press.
  23. Athanasios N Nikolakopoulos and George Karypis. 2019. Recwalk: Nearly uncoupled random walks for top-n recommendation. In Proceedings of the twelfth ACM international conference on web search and data mining. 150–158.
  24. Distributionally robust language modeling. arXiv preprint arXiv:1909.02060 (2019).
  25. Distributionally robust semi-supervised learning over graphs. arXiv preprint arXiv:2110.10582 (2021).
  26. Distributionally robust neural networks for group shifts: On the importance of regularization for worst-case generalization. arXiv preprint arXiv:1911.08731 (2019).
  27. Recommendations as treatments: Debiasing learning and evaluation. In international conference on machine learning. PMLR, 1670–1679.
  28. Distributionally robust logistic regression. Advances in Neural Information Processing Systems 28 (2015).
  29. Certifying some distributional robustness with principled adversarial training. arXiv preprint arXiv:1710.10571 (2017).
  30. Session-based social recommendation via dynamic graph attention networks. In Proceedings of the Twelfth ACM international conference on web search and data mining. 555–563.
  31. Matthew Staib and Stefanie Jegelka. 2019. Distributionally robust optimization and generalization in kernel methods. Advances in Neural Information Processing Systems 32 (2019).
  32. Neighbor interaction aware graph convolution networks for recommendation. In Proceedings of the 43rd international ACM SIGIR conference on research and development in information retrieval. 1289–1298.
  33. Learning to denoise unreliable interactions for graph collaborative filtering. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval. 122–132.
  34. Laurens Van der Maaten and Geoffrey Hinton. 2008. Visualizing data using t-SNE. Journal of machine learning research 9, 11 (2008).
  35. Attention is all you need. Advances in neural information processing systems 30 (2017).
  36. Graph attention networks. arXiv preprint arXiv:1710.10903 (2017).
  37. Generalizing to unseen domains via adversarial data augmentation. Advances in neural information processing systems 31 (2018).
  38. Robust distillation for worst-class performance. arXiv preprint arXiv:2206.06479 (2022).
  39. Causal representation learning for out-of-distribution recommendation. In Proceedings of the ACM Web Conference 2022. 3562–3571.
  40. Kgat: Knowledge graph attention network for recommendation. In Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining. 950–958.
  41. Efficient bi-level optimization for recommendation denoising. In Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 2502–2511.
  42. Invariant preference learning for general debiasing in recommendation. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 1969–1978.
  43. Distributionally-robust Recommendations for Improving Worst-case User Experience. In Proceedings of the ACM Web Conference 2022. 3606–3610.
  44. Understanding contrastive learning via distributionally robust optimization. arXiv preprint arXiv:2310.11048 (2023).
  45. BSL: Understanding and Improving Softmax Loss for Recommendation. arXiv preprint arXiv:2312.12882 (2023).
  46. Self-supervised graph learning for recommendation. In Proceedings of the 44th international ACM SIGIR conference on research and development in information retrieval. 726–735.
  47. Towards Robust Fairness-aware Recommendation. In Proceedings of the 17th ACM Conference on Recommender Systems. 211–222.
  48. A Generic Learning Framework for Sequential Recommendation with Distribution Shifts. In Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval.
  49. XSimGCL: Towards extremely simple graph contrastive learning for recommendation. IEEE Transactions on Knowledge and Data Engineering (2023).
  50. 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.
  51. Wenhui Yu and Zheng Qin. 2020. Graph convolutional network for recommendation with low-pass collaborative filters. In International Conference on Machine Learning. PMLR, 10936–10945.
  52. Doro: Distributional and outlier robust optimization. In International Conference on Machine Learning. PMLR, 12345–12355.
  53. Invariant Collaborative Filtering to Popularity Distribution Shift. In Proceedings of the ACM Web Conference 2023. 1240–1251.
  54. Robust graph learning under Wasserstein uncertainty. arXiv preprint arXiv:2105.04210 (2021).
  55. Explainable recommendation: A survey and new perspectives. Foundations and Trends® in Information Retrieval 14, 1 (2020), 1–101.
  56. Hierarchical Invariant Learning for Domain Generalization Recommendation. In Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 3470–3479.
  57. RecBole 2.0: towards a more up-to-date recommendation library. In Proceedings of the 31st ACM International Conference on Information & Knowledge Management. 4722–4726.
  58. Popularity bias is not always evil: Disentangling benign and harmful bias for recommendation. IEEE Transactions on Knowledge and Data Engineering (2022).
  59. Adaptive Popularity Debiasing Aggregator for Graph Collaborative Filtering. (2023).
Citations (8)
View on Semantic Scholar

Summary

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

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