Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
175 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Rethinking Cross-Domain Sequential Recommendation under Open-World Assumptions (2311.04590v6)

Published 8 Nov 2023 in cs.IR

Abstract: Cross-Domain Sequential Recommendation (CDSR) methods aim to tackle the data sparsity and cold-start problems present in Single-Domain Sequential Recommendation (SDSR). Existing CDSR works design their elaborate structures relying on overlapping users to propagate the cross-domain information. However, current CDSR methods make closed-world assumptions, assuming fully overlapping users across multiple domains and that the data distribution remains unchanged from the training environment to the test environment. As a result, these methods typically result in lower performance on online real-world platforms due to the data distribution shifts. To address these challenges under open-world assumptions, we design an \textbf{A}daptive \textbf{M}ulti-\textbf{I}nterest \textbf{D}ebiasing framework for cross-domain sequential recommendation (\textbf{AMID}), which consists of a multi-interest information module (\textbf{MIM}) and a doubly robust estimator (\textbf{DRE}). Our framework is adaptive for open-world environments and can improve the model of most off-the-shelf single-domain sequential backbone models for CDSR. Our MIM establishes interest groups that consider both overlapping and non-overlapping users, allowing us to effectively explore user intent and explicit interest. To alleviate biases across multiple domains, we developed the DRE for the CDSR methods. We also provide a theoretical analysis that demonstrates the superiority of our proposed estimator in terms of bias and tail bound, compared to the IPS estimator used in previous work.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (76)
  1. Controlling popularity bias in learning-to-rank recommendation. In Proceedings of the eleventh ACM conference on recommender systems. 42–46.
  2. Contrastive Cross-Domain Sequential Recommendation. In Proceedings of the 31st ACM International Conference on Information & Knowledge Management. 138–147.
  3. Cross-domain recommendation to cold-start users via variational information bottleneck. In 2022 IEEE 38th International Conference on Data Engineering (ICDE). IEEE, 2209–2223.
  4. Controllable multi-interest framework for recommendation. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 2942–2951.
  5. Exploring periodicity and interactivity in multi-interest framework for sequential recommendation. arXiv preprint arXiv:2106.04415 (2021).
  6. Bias and debias in recommender system: A survey and future directions. ACM Transactions on Information Systems 41, 3 (2023), 1–39.
  7. Social recommendation with missing not at random data. In 2018 IEEE International Conference on Data Mining (ICDM). IEEE, 29–38.
  8. Learning and fusing multiple user interest representations for micro-video and movie recommendations. IEEE Transactions on Multimedia 23 (2020), 484–496.
  9. HeroGRAPH: A Heterogeneous Graph Framework for Multi-Target Cross-Domain Recommendation.. In ORSUM@ RecSys.
  10. Doubly robust policy evaluation and learning. arXiv preprint arXiv:1103.4601 (2011).
  11. Offline a/b testing for recommender systems. In Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining. 198–206.
  12. DA-GCN: A domain-aware attentive graph convolution network for shared-account cross-domain sequential recommendation. arXiv preprint arXiv:2105.03300 (2021).
  13. Hyperbolic Contrastive Graph Representation Learning for Session-based Recommendation. IEEE Transactions on Knowledge and Data Engineering (2023).
  14. Poincaré Heterogeneous Graph Neural Networks for Sequential Recommendation. ACM Transactions on Information Systems 41, 3 (2023), 1–26.
  15. Hcgr: Hyperbolic contrastive graph representation learning for session-based recommendation. arXiv preprint arXiv:2107.05366 (2021).
  16. Disentangled Representations Learning for Multi-target Cross-domain Recommendation. ACM Transactions on Information Systems 41, 4 (2023), 1–27.
  17. Probabilistic matrix factorization with non-random missing data. In International conference on machine learning. PMLR, 1512–1520.
  18. Probabilistic matrix factorization with non-random missing data. In International conference on machine learning.
  19. Session-based recommendations with recurrent neural networks. arXiv preprint arXiv:1511.06939 (2015).
  20. Reusing historical interaction data for faster online learning to rank for IR. In Proceedings of the sixth ACM international conference on Web search and data mining. 183–192.
  21. Conet: Collaborative cross networks for cross-domain recommendation. In Proceedings of the 27th ACM international conference on information and knowledge management. 667–676.
  22. Unbiased learning-to-rank with biased feedback. In Proceedings of the tenth ACM international conference on web search and data mining. 781–789.
  23. SeongKu et al. Kang. 2019. Semi-supervised learning for cross-domain recommendation to cold-start users. In CIKM.
  24. Wang-Cheng Kang and Julian McAuley. 2018. Self-attentive sequential recommendation. In 2018 IEEE international conference on data mining (ICDM). IEEE, 197–206.
  25. Walid Krichene and Steffen Rendle. 2020. On sampled metrics for item recommendation. In Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining. 1748–1757.
  26. Multi-interest network with dynamic routing for recommendation at Tmall. In Proceedings of the 28th ACM international conference on information and knowledge management. 2615–2623.
  27. Dual attentive sequential learning for cross-domain click-through rate prediction. In Proceedings of the 27th ACM SIGKDD conference on knowledge discovery & data mining. 3172–3180.
  28. Pan Li and Alexander Tuzhilin. 2020. Ddtcdr: Deep dual transfer cross domain recommendation. In Proceedings of the 13th International Conference on Web Search and Data Mining. 331–339.
  29. Debiasing learning based cross-domain recommendation. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining. 3190–3199.
  30. A general knowledge distillation framework for counterfactual recommendation via uniform data. In Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval. 831–840.
  31. Cross domain recommendation via bi-directional transfer graph collaborative filtering networks. In Proceedings of the 29th ACM international conference on information & knowledge management. 885–894.
  32. Joint Internal Multi-Interest Exploration and External Domain Alignment for Cross Domain Sequential Recommendation. In Proceedings of the ACM Web Conference 2023. 383–394.
  33. Exploiting Variational Domain-Invariant User Embedding for Partially Overlapped Cross Domain Recommendation. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval. 312–321.
  34. MAMDR: A Model Agnostic Learning Framework for Multi-Domain Recommendation. In 2023 IEEE 39th International Conference on Data Engineering (ICDE). IEEE.
  35. Mixed information flow for cross-domain sequential recommendations. ACM Transactions on Knowledge Discovery from Data (TKDD) 16, 4 (2022), 1–32.
  36. π𝜋\piitalic_π-net: A parallel information-sharing network for shared-account cross-domain sequential recommendations. In Proceedings of the 42nd international ACM SIGIR conference on research and development in information retrieval. 685–694.
  37. Collaborative filtering and the missing at random assumption. UAI (2012).
  38. Minet: Mixed interest network for cross-domain click-through rate prediction. In Proceedings of the 29th ACM international conference on information & knowledge management. 2669–2676.
  39. Ladislav Peska and Peter Vojtas. 2020. Off-line vs. On-line Evaluation of Recommender Systems in Small E-commerce. In Proceedings of the 31st ACM Conference on Hypertext and Social Media. 291–300.
  40. Adjusting for confounding with text matching. American Journal of Political Science 64, 4 (2020), 887–903.
  41. Yuta Saito. 2020a. Asymmetric tri-training for debiasing missing-not-at-random explicit feedback. In Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval. 309–318.
  42. Yuta Saito. 2020b. Unbiased pairwise learning from biased implicit feedback. In Proceedings of the 2020 ACM SIGIR on International Conference on Theory of Information Retrieval.
  43. The graph neural network model. IEEE transactions on neural networks 20, 1 (2008), 61–80.
  44. Recommendations as treatments: Debiasing learning and evaluation. In international conference on machine learning. PMLR, 1670–1679.
  45. Xiang-Rong et al. Sheng. 2021. One model to serve all: Star topology adaptive recommender for multi-domain ctr prediction. In CIKM.
  46. Harald Steck. 2010. Training and testing of recommender systems on data missing not at random. In Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining. 713–722.
  47. Harald Steck. 2013. Evaluation of recommendations: rating-prediction and ranking. In Proceedings of the 7th ACM conference on Recommender systems.
  48. BERT4Rec: Sequential recommendation with bidirectional encoder representations from transformer. In Proceedings of the 28th ACM international conference on information and knowledge management. 1441–1450.
  49. Parallel Split-Join Networks for Shared Account Cross-domain Sequential Recommendations. IEEE Transactions on Knowledge and Data Engineering (2021).
  50. Adith Swaminathan and Thorsten Joachims. 2015. The self-normalized estimator for counterfactual learning. advances in neural information processing systems 28 (2015).
  51. Roman Vershynin. 2018. High-dimensional probability: An introduction with applications in data science. Vol. 47. Cambridge university press.
  52. Transrec: Learning transferable recommendation from mixture-of-modality feedback. arXiv preprint arXiv:2206.06190 (2022).
  53. Combinatorial learning of robust deep graph matching: an embedding based approach. IEEE Transactions on Pattern Analysis and Machine Intelligence (2020).
  54. LinSATNet: the positive linear satisfiability neural networks. In International Conference on Machine Learning. PMLR, 36605–36625.
  55. Doubly robust joint learning for recommendation on data missing not at random. In International Conference on Machine Learning. PMLR, 6638–6647.
  56. Combating selection biases in recommender systems with a few unbiased ratings. In Proceedings of the 14th ACM International Conference on Web Search and Data Mining. 427–435.
  57. Towards open-world feature extrapolation: An inductive graph learning approach. Advances in Neural Information Processing Systems 34 (2021), 19435–19447.
  58. Dual Graph Attention Networks for Deep Latent Representation of Multifaceted Social Effects in Recommender Systems. In The World Wide Web Conference. 2091–2102.
  59. Towards open-world recommendation: An inductive model-based collaborative filtering approach. In International Conference on Machine Learning. PMLR, 11329–11339.
  60. NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classification. In Advances in Neural Information Processing Systems.
  61. SGFormer: Simplifying and Empowering Transformers for Large-Graph Representations. In Advances in Neural Information Processing Systems (NeurIPS).
  62. Recursive multi-relational graph convolutional network for automatic photo selection. IEEE Transactions on Multimedia (2022).
  63. Neural Node Matching for Multi-Target Cross Domain Recommendation. arXiv preprint arXiv:2302.05919 (2023).
  64. Towards Open-world Cross-Domain Sequential Recommendation: A Model-Agnostic Contrastive Denoising Approach. arXiv preprint arXiv:2311.04760 (2023).
  65. Towards out-of-distribution sequential event prediction: A causal treatment. arXiv preprint arXiv:2210.13005 (2022).
  66. Debiased Contrastive Learning for Sequential Recommendation. In The Web Conference 2023: International World Wide Web Conference.
  67. Parameter-efficient transfer from sequential behaviors for user modeling and recommendation. In Proceedings of the 43rd International ACM SIGIR conference on research and development in Information Retrieval. 1469–1478.
  68. One person, one model, one world: Learning continual user representation without forgetting. In Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval. 696–705.
  69. Representation-based completion of knowledge graph with open-world data. In 2020 5th International Conference on Computer and Communication Systems (ICCCS). IEEE, 1–8.
  70. Cross-domain recommendation with probabilistic knowledge transfer. In International Conference on Neural Information Processing. Springer, 208–219.
  71. A unified framework of active transfer learning for cross-system recommendation. Artificial Intelligence 245 (2017), 38–55.
  72. M5: Multi-Modal Multi-Interest Multi-Scenario Matching for Over-the-Top Recommendation. In Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 5650–5659.
  73. Revisiting alternative experimental settings for evaluating top-n item recommendation algorithms. In Proceedings of the 29th ACM International Conference on Information & Knowledge Management. 2329–2332.
  74. Deep interest evolution network for click-through rate prediction. In Proceedings of the AAAI conference on artificial intelligence, Vol. 33. 5941–5948.
  75. Deep interest network for click-through rate prediction. In Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining. 1059–1068.
  76. A deep framework for cross-domain and cross-system recommendations. arXiv preprint arXiv:2009.06215 (2020).
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