Revisiting Two-tower Models for Unbiased Learning to Rank

被引:10
作者
Yan, Le [1 ]
Qin, Zhen [1 ]
Zhuang, Honglei [1 ]
Wang, Xuanhui [1 ]
Bendersky, Michael [1 ]
Najork, Marc [1 ]
机构
[1] Google, Mountain View, CA 94043 USA
来源
PROCEEDINGS OF THE 45TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '22) | 2022年
关键词
Unbiased Learning to Rank; Expectation Maximization; Bias Factorization;
D O I
10.1145/3477495.3531837
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Two-tower architecture is commonly used in real-world systems for Unbiased Learning to Rank ( ULTR), where a Deep Neural Network (DNN) tower models unbiased relevance predictions, while another tower models observation biases inherent in the training data like user clicks. This two-tower architecture introduces inductive biases to allow more efficient use of limited observational logs and better generalization during deployment than single-tower architecture that may learn spurious correlations between relevance predictions and biases. However, despite their popularity, it is largely neglected in the literature that existing two-tower models assume that the joint distribution of relevance prediction and observation probabilities are completely factorizable. In this work, we revisit two-tower models for ULTR. We rigorously show that the factorization assumption can be too strong for real-world user behaviors, and existing methods may easily fail under slightly milder assumptions. We then propose several novel ideas that consider a wider spectrum of user behaviors while still under the two-tower framework to maintain simplicity and generalizability. Our concerns of existing two-tower models and the effectiveness of our proposed methods are validated on both controlled synthetic and large-scale real-world datasets.
引用
收藏
页码:2410 / 2414
页数:5
相关论文
共 29 条
[1]   A General Framework for Counterfactual Learning-to-Rank [J].
Agarwal, Aman ;
Takatsu, Kenta ;
Zaitsev, Ivan ;
Joachims, Thorsten .
PROCEEDINGS OF THE 42ND INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '19), 2019, :5-14
[2]   Unbiased Learning to Rank: Online or Offline? [J].
Ai, Qingyao ;
Yang, Tao ;
Wang, Huazheng ;
Mao, Jiaxin .
ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2021, 39 (02)
[3]   Unbiased Learning to Rank with Unbiased Propensity Estimation [J].
Ai, Qingyao ;
Bi, Keping ;
Luo, Cheng ;
Guo, Jiafeng ;
Croft, W. Bruce .
ACM/SIGIR PROCEEDINGS 2018, 2018, :385-394
[4]  
[Anonymous], 2008, P SIGIR, DOI [10.1145/1390334.1390392, DOI 10.1145/1390334.1390392]
[5]  
[Anonymous], 2009, P 18 INT C WORLD WID
[6]   A Neural Click Model for Web Search [J].
Borisov, Alexey ;
Markov, Ilya ;
de Rijke, Maarten ;
Serdyukov, Pavel .
PROCEEDINGS OF THE 25TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW'16), 2016, :531-541
[7]  
Chapelle D, 2011, COMPUT FLUID SOLID M, P1, DOI 10.1007/978-3-642-16408-8
[8]  
Chen Jianling Sun Mouxiang, 2021, P 44 INT ACM SIGIR C
[9]  
Chu Wenjie, 2021, ARXIV211202767
[10]  
Chuklin Aleksandr, 2015, Click Models for Web Search