AutoOpt: Automatic Hyperparameter Scheduling and Optimization for Deep Click-through Rate Prediction

被引:0
作者
Li, Yujun [1 ]
Tang, Xing [1 ]
Chen, Bo [1 ]
Huang, Yimin [1 ]
Tang, Ruiming [1 ]
Li, Zhenguo [1 ]
机构
[1] Noahs Ark Lab, Hong Kong, Peoples R China
来源
PROCEEDINGS OF THE 17TH ACM CONFERENCE ON RECOMMENDER SYSTEMS, RECSYS 2023 | 2023年
关键词
CTR Prediction; Hyperparameter optimization; Recommendation; Online advertising;
D O I
10.1145/3604915.3608800
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Click-through Rate (CTR) prediction is essential for commercial recommender systems. Recently, to improve the prediction accuracy, plenty of deep learning-based CTR models have been proposed, which are sensitive to hyperparameters and difficult to optimize well. General hyperparameter optimization methods fix these hyperparameters across the entire model training and repeat them multiple times. This trial-and-error process not only leads to suboptimal performance but also requires non-trivial computation efforts. In this paper, we propose an automatic hyperparameters scheduling and optimization method for deep CTR models, AutoOpt, making the optimization process more stable and efficient. Specifically, the whole training regime is firstly divided into several consecutive stages, where a data-efficient model is learned to model the relation between model states and prediction performance. To optimize the stage-wise hyperparameters, AutoOpt uses the global and local scheduling modules to propose proper hyperparameters for the next stage based on the training in the current stage. Extensive experiments on three public benchmarks are conducted to validate the effectiveness of AutoOpt. Moreover, AutoOpt has been deployed onto an advertising platform and a music platform, where online A/B tests also demonstrate superior improvement. In addition, the code of our algorithm is publicly available in MindSpore.
引用
收藏
页码:183 / 194
页数:12
相关论文
共 47 条
  • [1] Adams R.P., 2012, 25 INT C NEURAL INFP, P2951, DOI DOI 10.5555/2999325.2999464.47
  • [2] [Anonymous], 2020, MindSpore
  • [3] [Anonymous], 2015, P 2015 C EMPIRICAL M
  • [4] CAN: Feature Co-Action Network for Click-Through Rate Prediction
    Bian, Weijie
    Wu, Kailun
    Ren, Lejian
    Pi, Qi
    Zhang, Yujing
    Xiao, Can
    Sheng, Xiang-Rong
    Zhu, Yong-Nan
    Chan, Zhangming
    Mou, Na
    Luo, Xinchen
    Xiang, Shiming
    Zhou, Guorui
    Zhu, Xiaoqiang
    Deng, Hongbo
    [J]. WSDM'22: PROCEEDINGS OF THE FIFTEENTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING, 2022, : 57 - 65
  • [5] Simple and Scalable Response Prediction for Display Advertising
    Chapelle, Olivier
    Manavoglu, Eren
    Rosales, Romer
    [J]. ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY, 2015, 5 (04)
  • [6] Chauhan Karansingh, 2020, 2020 2nd International Conference on Innovative Mechanisms for Industry Applications (ICIMIA). Proceedings, P205, DOI 10.1109/ICIMIA48430.2020.9074859
  • [7] Differentiating Regularization Weights - A Simple Mechanism to Alleviate Cold Start in Recommender Systems
    Chen, Hung-Hsuan
    Chen, Pu
    [J]. ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2019, 13 (01)
  • [8] XGBoost: A Scalable Tree Boosting System
    Chen, Tianqi
    Guestrin, Carlos
    [J]. KDD'16: PROCEEDINGS OF THE 22ND ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2016, : 785 - 794
  • [9] λOpt: Learn to Regularize Recommender Models in Finer Levels
    Chen, Yihong
    Chen, Bei
    He, Xiangnan
    Gao, Chen
    Li, Yong
    Lou, Jian-Guang
    Wang, Yue
    [J]. KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, : 978 - 986
  • [10] Cheng H.-T., 2016, P 1 WORKSH DEEP LEAR, P7, DOI [DOI 10.1145/2988450.2988454, 10.1145/2988450.2988454]