Scope-aware Re-ranking with Gated Attention in Feed

被引:2
作者
Qian, Hao [1 ]
Wu, Qintong [1 ]
Zhang, Kai [2 ]
Zhang, Zhiqiang [1 ]
Gu, Lihong [1 ]
Zeng, Xiaodong [1 ]
Zhou, Jun [1 ]
Gu, Jinjie [1 ]
机构
[1] Ant Grp, Hangzhou, Peoples R China
[2] Univ Sci & Technol China, Sch Data Sci, Hefei, Anhui, Peoples R China
来源
WSDM'22: PROCEEDINGS OF THE FIFTEENTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING | 2022年
关键词
Recommender System; Learing To Rank; Re-ranking;
D O I
10.1145/3488560.3498403
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Modern recommendation systems introduce the re-ranking stage to optimize the entire list directly. This paper focuses on the design of re-ranking framework in feed to optimally model the mutual influence between items and further promote user engagement. On mobile devices, users browse the feed almost in a top-down manner and rarely compare items back and forth. Besides, users often compare item with its adjacency based on their partial observations. Given the distinct user behavior patterns, the modeling of mutual influence between items should be carefully designed. Existing re-ranking models encode the mutual influence between items with sequential encoding methods. However, previous works may be dissatisfactory due to the ignorance of connections between items on different scopes. In this paper, we first discuss Unidirectivity and Locality on the impacts and consequences, then report corresponding solutions in industrial applications. We propose a novel framework based on the empirical evidence from user analysis. To address the above problems, we design a Scope-aware Re-ranking with Gated Attention model (SRGA) to emulate the user behavior patterns from two aspects: 1) we emphasize the influence along the user's common browsing direction; 2) we strength the impacts of pivotal adjacent items within the user visual window. Specifically, we design a global scope attention to encode inter-item patterns unidirectionally from top to bottom. Besides, we devise a local scope attention sliding over the recommendation list to underline interactions among neighboring items. Furthermore, we design a learned gate mechanism to aggregating the information dynamically from local and global scope attention. Extensive offline experiments and online A/B testing demonstrate the benefits of our novel framework. The proposed SRGA model achieves the best performance in offline metrics compared with the state-of-the-art re-ranking methods. Further, empirical results on live traffic validate that our recommender system, equipped with SRGA in the re-ranking stage, improves significantly in user engagement.
引用
收藏
页码:804 / 812
页数:9
相关论文
共 37 条
  • [21] SetRank: Learning a Permutation-Invariant Ranking Model for Information Retrieval
    Pang, Liang
    Xu, Jun
    Ai, Qingyao
    Lan, Yanyan
    Cheng, Xueqi
    Wen, Jirong
    [J]. PROCEEDINGS OF THE 43RD INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '20), 2020, : 499 - 508
  • [22] Personalized Re-ranking for Recommendation
    Pei, Changhua
    Zhang, Yi
    Zhang, Yongfeng
    Sun, Fei
    Lin, Xiao
    Sun, Hanxiao
    Wu, Jian
    Jiang, Peng
    Ge, Junfeng
    Ou, Wenwu
    Pei, Dan
    [J]. RECSYS 2019: 13TH ACM CONFERENCE ON RECOMMENDER SYSTEMS, 2019, : 3 - 11
  • [23] Qin Tao, 2013, CoRR abs/1306.2597
  • [24] Qin Zhen., INT C LEARNING REPRE
  • [25] Radford A, 2018, IMPROVING LANGUAGE U
  • [26] Taylor M., 2008, P 2008 INT C WEB SEA, P77, DOI [10.1145/1341531.1341544, DOI 10.1145/1341531.1341544]
  • [27] Learning to rank for Information Retrieval
    Liu, Tie-Yan
    [J]. Foundations and Trends in Information Retrieval, 2009, 3 (03): : 225 - 231
  • [28] Valizadegan H., 2009, NIPS, P1883
  • [29] Vaswani A, 2017, ADV NEUR IN, V30
  • [30] Deep & Cross Network for Ad Click Predictions
    Wang, Ruoxi
    Fu, Bin
    Fu, Gang
    Wang, Mingliang
    [J]. ADKDD'17: 23RD ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING (KDD 2017), 2017,