Learning Explicit User Interest Boundary for Recommendation

被引:9
作者
Zhuo, Jianhuan [1 ]
Zhu, Qiannan [2 ]
Yue, Yinliang [1 ]
Zhao, Yuhong [3 ]
机构
[1] Univ Chinese Acad Sci Beijing, Chinese Acad Sci Sch Cyber Secur, Inst Informat Engn, Beijing, Peoples R China
[2] Renmin Univ China, Beijing Key Lab Big Data Management & Anal Method, Gaoling Sch Artificial Intelligence, Beijing, Peoples R China
[3] Chinese Acad Sci, Inst Informat Engn, Beijing, Peoples R China
来源
PROCEEDINGS OF THE ACM WEB CONFERENCE 2022 (WWW'22) | 2022年
关键词
Recommender System; Loss Function; User Interest Boundary;
D O I
10.1145/3485447.3511971
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The core objective of modelling recommender systems from implicit feedback is to maximize the positive sample score s(p) and minimize the negative sample score sn, which can usually be summarized into two paradigms: the pointwise and the pairwise. The pointwise approaches fit each sample with its label individually, which is flexible in weighting and sampling on instance-level but ignores the inherent ranking property. By qualitatively minimizing the relative score s(n) - s(p), the pairwise approaches capture the ranking of samples naturally but suffer from training efficiency. Additionally, both approaches are hard to explicitly provide a personalized decision boundary to determine if users are interested in items unseen. To address those issues, we innovatively introduce an auxiliary score b(u) for each user to represent the User Interest Boundary(UIB) and individually penalize samples that cross the boundary with pairwise paradigms, i.e., the positive samples whose score is lower than b(u) and the negative samples whose score is higher than b(u). In this way, our approach successfully achieves a hybrid loss of the pointwise and the pairwise to combine the advantages of both. Analytically, we show that our approach can provide a personalized decision boundary and significantly improve the training efficiency without any special sampling strategy. Extensive results show that our approach achieves significant improvements on not only the classical pointwise or pairwise models but also state-of-the-art models with complex loss function and complicated feature encoding.
引用
收藏
页码:193 / 202
页数:10
相关论文
共 35 条
  • [1] Bellogin A., 2013, Proceedings of the 7th ACM conference on Recommender systems, RecSys '13, P387, DOI [10.1145/2507157.2507191, DOI 10.1145/2507157.2507191]
  • [2] Burges Chris J.C., 2005, MSRTR200506
  • [3] Cantador Ivan, 2011, P 5 ACM C REC SYST R
  • [4] Efficient Neural Matrix Factorization without Sampling for Recommendation
    Chen, Chong
    Min, Zhang
    Zhang, Yongfeng
    Liu, Yiqun
    Ma, Shaoping
    [J]. ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2020, 38 (02)
  • [5] Deep Neural Networks for YouTube Recommendations
    Covington, Paul
    Adams, Jay
    Sargin, Emre
    [J]. PROCEEDINGS OF THE 10TH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS'16), 2016, : 191 - 198
  • [6] Ding JT, 2019, PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P2230
  • [7] Ding Jingtao, 2020, NEURIPS
  • [8] Duchi J, 2011, J MACH LEARN RES, V12, P2121
  • [9] Guo HF, 2018, Arxiv, DOI arXiv:1804.04950
  • [10] The MovieLens Datasets: History and Context
    Harper, F. Maxwell
    Konstan, Joseph A.
    [J]. ACM TRANSACTIONS ON INTERACTIVE INTELLIGENT SYSTEMS, 2016, 5 (04)