Entire Space Multi-Task Model: An Effective Approach for Estimating Post-Click Conversion Rate

被引:270
作者
Ma, Xiao [1 ]
Zhao, Liqin [1 ]
Huang, Guan [1 ]
Wang, Zhi [1 ]
Hu, Zelin [1 ]
Zhu, Xiaoqiang [1 ]
Gai, Kun [1 ]
机构
[1] Alibaba Inc, Hangzhou, Zhejiang, Peoples R China
来源
ACM/SIGIR PROCEEDINGS 2018 | 2018年
关键词
post-click conversion rate; multi-task learning; sample selection bias; data sparsity; entire-space modeling;
D O I
10.1145/3209978.3210104
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Estimating post-click conversion rate (CVR) accurately is crucial for ranking systems in industrial applications such as recommendation and advertising. Conventional CVR modeling applies popular deep learning methods and achieves state-of-the-art performance. However it encounters several task-specific problems in practice, making CVR modeling challenging. For example, conventional CVR models are trained with samples of clicked impressions while utilized to make inference on the entire space with samples of all impressions. This causes a sample selection bias problem. Besides, there exists an extreme data .sparsity problem, making the model fitting rather difficult. In this paper, we model CVR in a brand-new perspective by making good use of sequential pattern of user actions, i.e., impression -> click -> conversion. The proposed Entire Space Multi-task Model (ESMM) can eliminate the two problems simultaneously by i) modeling CVR directly over the entire space, ii) employing a feature representation transfer learning strategy. Experiments on dataset gathered from traffic logs of Taobao's recommender system demonstrate that ESMM significantly outperforms competitive methods. We also release a sampling version of this dataset to enable future research. To the best of our knowledge, this is the first public dataset which contains samples with sequential dependence of click and conversion labels for CVR modeling.
引用
收藏
页码:1137 / 1140
页数:4
相关论文
共 9 条
[1]  
[Anonymous], 2017, ARXIV PREPRINT
[2]  
[Anonymous], P 1 WORKSH DEEP LEAR, DOI [10.1145/2988450.2988454, DOI 10.1145/2988450.2988454]
[3]  
Dasdan A., 2012, P 18 ACM SIGKDD INT
[4]   One-Class Collaborative Filtering [J].
Pan, Rong ;
Zhou, Yunhong ;
Cao, Bin ;
Liu, Nathan N. ;
Lukose, Rajan ;
Scholz, Martin ;
Yang, Qiang .
ICDM 2008: EIGHTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2008, :502-+
[5]  
Weiss G.M., 2004, ACM SIGKDD Explorations Newsletter, V6, DOI DOI 10.1145/1007730.1007734
[6]  
Zadrozny Bianca., 2004, LEARNING EVALUATING
[7]  
Zhang W., 2016, P 22 INT C KNOWL DIS
[8]  
Zhou G., 2017, ARXIV170606978STATML
[9]   Optimized Cost per Click in Taobao Display Advertising [J].
Zhu, Han ;
Jin, Junqi ;
Tan, Chang ;
Pan, Fei ;
Zeng, Yifan ;
Li, Han ;
Gai, Kun .
KDD'17: PROCEEDINGS OF THE 23RD ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2017, :2191-2200