mlsanityData to 7 Oct 2026

Adversarial Gradient Driven Exploration for Deep Click-Through Rate Prediction

arXiv 2112.11136 ↗First posted 21 Dec 2021cs.IR cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 29 of its 65 references that are in the map. First posted on arXiv 21 Dec 2021.

Builds on

29 of 65 references.

References · 29

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  3. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  4. 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
  5. 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
  6. 2016Universal adversarial perturbationscited by 774
  7. 2016Wide & Deep Learning for Recommender Systemscited by 745
  8. 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 673
  9. 2017Deep Interest Network for Click-Through Rate Predictioncited by 541
  10. 2018Deep Interest Evolution Network for Click-Through Rate Predictioncited by 336
  11. 2018Not All Samples Are Created Equal: Deep Learning with Importance Samplingcited by 323
  12. 2020Bias and Debias in Recommender System: A Survey and Future Directionscited by 239
17 more
  1. 2020Search-based User Interest Modeling with Lifelong Sequential Behavior Data for Click-Through Rate Predictioncited by 176
  2. 2020Neural Thompson Samplingcited by 127
  3. 2019Practice on Long Sequential User Behavior Modeling for Click-Through Rate Predictioncited by 118
  4. 2017How Algorithmic Confounding in Recommendation Systems Increases Homogeneity and Decreases Utilitycited by 116
  5. 2019Multi-Interest Network with Dynamic Routing for Recommendation at Tmallcited by 113
  6. 2019Deep Session Interest Network for Click-Through Rate Predictioncited by 64
  7. 2020How to Retrain Recommender System? A Sequential Meta-Learning Methodcited by 42
  8. 2014A Neural Networks Committee for the Contextual Bandit Problemcited by 23
  9. 2020Deep Bayesian Bandits: Exploring in Online Personalized Recommendationscited by 23
  10. 2021Multi-facet Contextual Bandits: A Neural Network Perspectivecited by 20
  11. 2018PG-TS: Improved Thompson Sampling for Logistic Contextual Banditscited by 18
  12. 2020Exploration in Online Advertising Systems with Deep Uncertainty-Aware Learningcited by 12
  13. 2016Are Accuracy and Robustness Correlated?cited by 11
  14. 2019Recommendation System-based Upper Confidence Bound for Online Advertisingcited by 7
  15. 2017Deep density networks and uncertainty in recommender systemscited by 4
  16. 2019FIS-GAN: GAN with Flow-based Importance Samplingcited by 1
  17. 2020Weighting Is Worth the Wait: Bayesian Optimization with Importance Samplingcited by 1

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 2; 2024: 1.

4 papers.