Abstract
Click-through rate (CTR) prediction based on deep neural networks has made significant progress in recommendation systems. However, these methods often suffer from CTR underestimation due to insufficient impressions for long-tail items. When formalizing CTR prediction as a contextual bandit problem, exploration methods provide a natural solution addressing this issue. In this paper, we first benchmark state-of-the-art exploration methods in the recommendation system setting. We find that the combination of gradient-based uncertainty modeling and Thompson Sampling achieves a significant advantage. On the basis of the benchmark, we further propose a general enhancement strategy, Underestimation Refinement (UR), which explicitly incorporates the prior knowledge that insufficient impressions likely leads to CTR underestimation. This strategy is applicable to almost all the existing exploration methods. Experimental results validate UR's effectiveness, achieving consistent improvement across all baseline exploration methods.
Author supplied keywords
Cite
CITATION STYLE
Song, Y., Wang, L., Dang, H., Zhou, W., Guan, J., Zhao, X., … Shao, J. (2021). Underestimation Refinement: A General Enhancement Strategy for Exploration in Recommendation Systems. In SIGIR 2021 - Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval (pp. 1818–1822). Association for Computing Machinery, Inc. https://doi.org/10.1145/3404835.3462983
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.