Adversarial Gradient Driven Exploration for Deep Click-Through Rate Prediction

被引:8
|
作者
Wu, Kailun [1 ]
Bian, Weijie [1 ]
Chan, Zhangming [1 ]
Ren, Lejian [1 ]
Xiang, Shiming [2 ]
Han, Shuguang [1 ]
Deng, Hongbo [1 ]
Zheng, Bo [1 ]
机构
[1] Alibaba Grp, Beijing, Peoples R China
[2] Chinese Acad Sci, Inst Automat, Beijing, Peoples R China
关键词
Exploration and Exploitation; Recommender Systems; Click-Through Rate Prediction; Online Advertising;
D O I
10.1145/3534678.3539461
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Exploration-Exploitation (E&E) algorithms are commonly adopted to deal with the feedback-loop issue in large-scale online recommender systems. Most of existing studies believe that high uncertainty can be a good indicator of potential reward, and thus primarily focus on the estimation of model uncertainty. We argue that such an approach overlooks the subsequent effect of exploration on model training. From the perspective of online learning, the adoption of an exploration strategy would also affect the collecting of training data, which further influences model learning. To understand the interaction between exploration and training, we design a Pseudo-Exploration module that simulates the model updating process after a certain item is explored and the corresponding feedback is received. We further show that such a process is equivalent to adding an adversarial perturbation to the model input, and thereby name our proposed approach as an the Adversarial Gradient Driven Exploration (AGE). For production deployment, we propose a dynamic gating unit to pre-determine the utility of an exploration. This enables us to utilize the limited amount of resources for exploration, and avoid wasting pageview resources on ineffective exploration. The effectiveness of AGE was firstly examined through an extensive number of ablation studies on an academic dataset. Meanwhile, AGE has also been deployed to one of the world-leading display advertising platforms, and we observe significant improvements on various top-line evaluation metrics.
引用
收藏
页码:2050 / 2058
页数:9
相关论文
共 50 条
  • [31] Deep Field-Aware Interaction Machine for Click-Through Rate Prediction
    Qi, Gaofeng
    Li, Ping
    MOBILE INFORMATION SYSTEMS, 2021, 2021
  • [32] Click-through Rate Prediction Based on Deep Belief Nets and Its Optimization
    Chen J.-H.
    Zhang Q.
    Wang S.-L.
    Shi J.-Y.
    Zhao Z.-Q.
    Ruan Jian Xue Bao/Journal of Software, 2019, 30 (12): : 3665 - 3682
  • [33] Towards Understanding the Overfitting Phenomenon of Deep Click-Through Rate Prediction Models
    Zhang, Zhao-Yu
    Sheng, Xiang-Rong
    Zhang, Yujing
    Jiang, Biye
    Han, Shuguang
    Deng, Hongbo
    Zheng, Bo
    PROCEEDINGS OF THE 31ST ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, CIKM 2022, 2022, : 2671 - 2680
  • [34] Deep Spatio-Temporal Attention Network for Click-Through Rate Prediction
    Li, Xin-Lu
    Gao, Peng
    Lei, Yuan-Yuan
    Zhang, Le-Xuan
    Fang, Liang-Kuan
    INTELLIGENT COMPUTING METHODOLOGIES, PT III, 2022, 13395 : 626 - 638
  • [35] Deep Character-Level Click-Through Rate Prediction for Sponsored Search
    Edizel, Bora
    Mantrach, Amin
    Bai, Xiao
    SIGIR'17: PROCEEDINGS OF THE 40TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2017, : 305 - 314
  • [36] Deep Situation-Aware Interaction Network for Click-Through Rate Prediction
    Lv, Yimin
    Wang, Shuli
    Jin, Beihong
    Yu, Yisong
    Zhang, Yapeng
    Dong, Jian
    Wang, Yongkang
    Wang, Xingxing
    Wang, Dong
    PROCEEDINGS OF THE 17TH ACM CONFERENCE ON RECOMMENDER SYSTEMS, RECSYS 2023, 2023, : 171 - 182
  • [37] Deep User Multi-interest Network for Click-Through Rate Prediction
    Wu, Ming
    Xing, Junqian
    Chen, Shanxiong
    KNOWLEDGE SCIENCE, ENGINEERING AND MANAGEMENT, PT II, 2022, 13369 : 57 - 69
  • [38] Click-through Rate Prediction and Uncertainty Quantification Based on Bayesian Deep Learning
    Wang, Xiaowei
    Dong, Hongbin
    ENTROPY, 2023, 25 (03)
  • [39] Deep Interest Context Network for Click-Through Rate
    Yu, Mingting
    Liu, Tingting
    Yin, Jian
    Chai, Peilin
    APPLIED SCIENCES-BASEL, 2022, 12 (19):
  • [40] Interpretable Click-Through Rate Prediction through Hierarchical Attention
    Li, Zeyu
    Cheng, Wei
    Chen, Yang
    Chen, Haifeng
    Wang, Wei
    PROCEEDINGS OF THE 13TH INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING (WSDM '20), 2020, : 313 - 321