Density-based User Representation using Gaussian Process Regression for Multi-interest Personalized Retrieval
Abstract: Accurate modeling of the diverse and dynamic interests of users remains a significant challenge in the design of personalized recommender systems. Existing user modeling methods, like single-point and multi-point representations, have limitations w.r.t.\ accuracy, diversity, and adaptability. To overcome these deficiencies, we introduce density-based user representations (DURs), a novel method that leverages Gaussian process regression (GPR) for effective multi-interest recommendation and retrieval. Our approach, GPR4DUR, exploits DURs to capture user interest variability without manual tuning, incorporates uncertainty-awareness, and scales well to large numbers of users. Experiments using real-world offline datasets confirm the adaptability and efficiency of GPR4DUR, while online experiments with simulated users demonstrate its ability to address the exploration-exploitation trade-off by effectively utilizing model uncertainty.
- Auer, P. Using confidence bounds for exploitation-exploration trade-offs. J. Mach. Learn. Res., 3:397–422, mar 2003. ISSN 1532-4435.
- Finite-time analysis of the multiarmed bandit problem. Mach. Learn., 47(2–3):235–256, may 2002.
- Fatigue-aware bandits for dependent click models. ArXiv, abs/2008.09733, 2020.
- Controllable multi-interest framework for recommendation. In KDD ’20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Virtual Event, CA, USA, August 23-27, 2020, pp. 2942–2951. ACM, 2020.
- Exploring periodicity and interactivity in multi-interest framework for sequential recommendation. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021, pp. 1426–1433. ijcai.org, 2021.
- Bias and debias in recommender system: A survey and future directions. CoRR, abs/2010.03240, 2020.
- Chen, M. Exploration in recommender systems. In RecSys ’21: Fifteenth ACM Conference on Recommender Systems, Amsterdam, The Netherlands, 27 September 2021 - 1 October 2021, pp. 551–553. ACM, 2021.
- A survey of collaborative filtering-based recommender systems: From traditional methods to hybrid methods based on social networks. IEEE Access, 6:64301–64320, 2018.
- Click Models for Web Search. Morgan & Claypool, 2015. ISBN 9781627056489. doi: 10.2200/S00654ED1V01Y201507ICR043.
- Deep neural networks for youtube recommendations. In Proceedings of the 10th ACM Conference on Recommender Systems, Boston, MA, USA, September 15-19, 2016, pp. 191–198. ACM, 2016a.
- Deep neural networks for youtube recommendations. In Proceedings of the 10th ACM conference on recommender systems, pp. 191–198, 2016b.
- Pixie: A system for recommending 3+ billion items to 200+ million users in real-time. In Proceedings of the 2018 world wide web conference, pp. 1775–1784, 2018.
- Grcar, M. User profiling: Collaborative filtering. In Proceedings of SIKDD 2004 at Multiconference IS, pp. 75–78, 2004.
- The movielens datasets: History and context. 5(4), 2015. ISSN 2160-6455.
- Ups and downs: Modeling the visual evolution of fashion trends with one-class collaborative filtering. In WWW, pp. 507–517. ACM, 2016.
- Neural collaborative filtering. In Barrett, R., Cummings, R., Agichtein, E., and Gabrilovich, E. (eds.), Proceedings of the 26th International Conference on World Wide Web, WWW 2017, Perth, Australia, April 3-7, 2017, pp. 173–182. ACM, 2017.
- Session-based recommendations with recurrent neural networks. In 4th International Conference on Learning Representations, ICLR 2016, San Juan, Puerto Rico, May 2-4, 2016, Conference Track Proceedings, 2016.
- Collaborative gaussian processes for preference learning. Advances in neural information processing systems, 25, 2012.
- K-Means Clustering, pp. 563–564. Springer US, Boston, MA, 2010. ISBN 978-0-387-30164-8. doi: 10.1007/978-0-387-30164-8˙425. URL https://doi.org/10.1007/978-0-387-30164-8_425.
- Self-attentive sequential recommendation. In IEEE International Conference on Data Mining, ICDM 2018, Singapore, November 17-20, 2018, pp. 197–206. IEEE Computer Society, 2018.
- Koren, Y. Factorization meets the neighborhood: a multifaceted collaborative filtering model. In Li, Y., Liu, B., and Sarawagi, S. (eds.), Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Las Vegas, Nevada, USA, August 24-27, 2008, pp. 426–434. ACM, 2008.
- Multi-interest network with dynamic routing for recommendation at tmall. In Proceedings of the 28th ACM International Conference on Information and Knowledge Management, CIKM 2019, Beijing, China, November 3-7, 2019, pp. 2615–2623. ACM, 2019.
- Time interval aware self-attention for sequential recommendation. In Caverlee, J., Hu, X. B., Lalmas, M., and Wang, W. (eds.), WSDM ’20: The Thirteenth ACM International Conference on Web Search and Data Mining, Houston, TX, USA, February 3-7, 2020, pp. 322–330. ACM, 2020.
- Variational autoencoders for collaborative filtering. In Proceedings of the 2018 World Wide Web Conference on World Wide Web, WWW 2018, Lyon, France, April 23-27, 2018, pp. 689–698. ACM, 2018a.
- Variational autoencoders for collaborative filtering. In Champin, P., Gandon, F., Lalmas, M., and Ipeirotis, P. G. (eds.), Proceedings of the 2018 World Wide Web Conference on World Wide Web, WWW 2018, Lyon, France, April 23-27, 2018, pp. 689–698. ACM, 2018b.
- A category-aware multi-interest model for personalized product search. In WWW ’22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25 - 29, 2022, pp. 360–368. ACM, 2022.
- Is a single vector enough?: Exploring node polysemy for network embedding. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD 2019, Anchorage, AK, USA, August 4-8, 2019, pp. 932–940. ACM, 2019.
- Density weighting for multi-interest personalized recommendation. In arxiv eprint: arxiv 2308.01563, 2023.
- Pinnersage: Multi-modal user embedding framework for recommendations at pinterest. In KDD ’20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Virtual Event, CA, USA, August 23-27, 2020, pp. 2311–2320. ACM, 2020.
- Rasmussen, C. E. Gaussian Processes in Machine Learning, pp. 63–71. Springer Berlin Heidelberg, Berlin, Heidelberg, 2004.
- Gaussian Processes for Machine Learning (Adaptive Computation and Machine Learning). The MIT Press, 2005. ISBN 026218253X.
- Rendle, S. Factorization machines. In Webb, G. I., Liu, B., Zhang, C., Gunopulos, D., and Wu, X. (eds.), ICDM 2010, The 10th IEEE International Conference on Data Mining, Sydney, Australia, 14-17 December 2010, pp. 995–1000. IEEE Computer Society, 2010.
- BPR: bayesian personalized ranking from implicit feedback. In UAI 2009, Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, Montreal, QC, Canada, June 18-21, 2009, pp. 452–461. AUAI Press, 2009.
- Introduction to Recommender Systems Handbook, pp. 1–35. Springer US, Boston, MA, 2011.
- A tutorial on thompson sampling. Found. Trends Mach. Learn., 11(1):1–96, jul 2018.
- Everyone’s preference changes differently: A weighted multi-interest model for retrieval. In International Conference on Machine Learning, pp. 31228–31242. PMLR, 2023.
- Normalized cuts and image segmentation. IEEE Transactions on pattern analysis and machine intelligence, 22(8):888–905, 2000.
- Sparse-interest network for sequential recommendation. In WSDM ’21, The Fourteenth ACM International Conference on Web Search and Data Mining, Virtual Event, Israel, March 8-12, 2021, pp. 598–606. ACM, 2021.
- Neural graph collaborative filtering. In SIGIR, pp. 165–174. ACM, 2019.
- Disentangled graph collaborative filtering. In Proceedings of the 43rd International ACM SIGIR conference on research and development in Information Retrieval, SIGIR 2020, Virtual Event, China, July 25-30, 2020, pp. 1001–1010. ACM, 2020a.
- Disenhan: Disentangled heterogeneous graph attention network for recommendation. In CIKM ’20: The 29th ACM International Conference on Information and Knowledge Management, Virtual Event, Ireland, October 19-23, 2020, pp. 1605–1614. ACM, 2020b.
- Ward, J. H. Hierarchical grouping to optimize an objective function. Journal of the American Statistical Association, 58(301):236–244, 1963. ISSN 01621459. URL http://www.jstor.org/stable/2282967.
- Nonlinear latent factorization by embedding multiple user interests. In Seventh ACM Conference on Recommender Systems, RecSys ’13, Hong Kong, China, October 12-16, 2013, pp. 65–68. ACM, 2013.
- Gaussian processes for regression. In Touretzky, D., Mozer, M., and Hasselmo, M. (eds.), Advances in Neural Information Processing Systems, volume 8. MIT Press, 1995. URL https://proceedings.neurips.cc/paper_files/paper/1995/file/7cce53cf90577442771720a370c3c723-Paper.pdf.
- Beyond independent relevance: methods and evaluation metrics for subtopic retrieval. In SIGIR, pp. 10–17. ACM, 2003.
- Birch: an efficient data clustering method for very large databases. ACM sigmod record, 25(2):103–114, 1996.
- Mirn: A multi-interest retrieval network with sequence-to-interest em routing. PLOS ONE, 18(2):e0281275, 2023.
- Learning tree-based deep model for recommender systems. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD 2018, London, UK, August 19-23, 2018, pp. 1079–1088. ACM, 2018.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.