A General Method For Automatic Discovery of Powerful Interactions In Click-Through Rate Prediction
Ze Meng, Jinnian Zhang, Yumeng Li, Jiancheng Li, Tanchao Zhu, Lifeng Sun
Abstract
Modeling powerful interactions is a critical challenge in Click-through rate (CTR) prediction, which is one of the most typical machine learning tasks in personalized advertising and recommender systems. Although developing hand-crafted interactions is effective for a small number of datasets, it generally requires laborious and tedious architecture engineering for extensive scenarios. In recent years, several neural architecture search (NAS) methods have been proposed for designing interactions automatically. However, existing methods only explore limited types and connections of operators for interaction generation, leading to low generalization ability. To address these problems, we propose a more general automated method for building powerful interactions named AutoPI. The main contributions of this paper are as follows: AutoPI adopts a more general search space in which the computational graph is generalized from existing network connections, and the interactive operators in the edges of the graph are extracted from representative hand-crafted works. It allows searching for various powerful feature interactions to produce higher AUC and lower Logloss in a wide variety of applications. Besides, AutoPI utilizes a gradient-based search strategy for exploration with a significantly low computational cost. Experimentally, we evaluate AutoPI on a diverse suite of benchmark datasets, demonstrating the generalizability and efficiency of AutoPI over hand-crafted architectures and state-of-the-art NAS algorithms.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 1d2940f6-882a-4b6f-b765-d19ca46452fcCited by top-tier papers3
- Optimizing Feature Set for Click-Through Rate PredictionFuyuan Lyu, Xing Tang, Dugang Liu, Liang Chen et al.WWW 2023 · 37 citations
- Memorize, Factorize, or be Naive: Learning Optimal Feature Interaction Methods for CTR PredictionFuyuan Lyu, Xing Tang, Huifeng Guo, Ruiming Tang et al.ICDE 2022 · 18 citations
- Continuous Input Embedding Size Search For Recommender SystemsYunke Qu, Tong Chen, Xiangyu Zhao, Lizhen Cui et al.SIGIR 2023 · 16 citations
Builds on4
- PC-DARTS: Partial Channel Connections for Memory-Efficient Architecture SearchYuhui Xu, Lingxi Xie, Xiaopeng Zhang, Xin Chen et al.ICLR 2020 · 691 citations
- Adaptive Factorization Network: Learning Adaptive-Order Feature InteractionsWeiyu Cheng, Yanyan Shen, Linpeng HuangAAAI 2020 · 202 citations
- Towards Automated Neural Interaction Discovery for Click-Through Rate PredictionQingquan Song, Dehua Cheng, Hanning Zhou, Jiyan Yang et al.KDD 2020 · 63 citations
- AutoGroup: Automatic Feature Grouping for Modelling Explicit High-Order Feature Interactions in CTR PredictionBin Liu, Niannan Xue, Huifeng Guo, Ruiming Tang et al.SIGIR 2020 · 48 citations
Related papers
- NAS-CTR: Efficient Neural Architecture Search for Click-Through Rate PredictionGuanghui Zhu, Feng Cheng, Defu Lian, Chunfeng Yuan et al.SIGIR 2022 · 9 citations
- Looking at CTR Prediction Again: Is Attention All You Need?Yuan Cheng, Yanbo XueSIGIR 2021 · 18 citations
- Cognitive Evolutionary Search to Select Feature Interactions for Click-Through Rate PredictionRunlong Yu, Xiang Xu, Yuyang Ye, Qi Liu et al.KDD 2023 · 13 citations
- NASRec: Weight Sharing Neural Architecture Search for Recommender SystemsTunhou Zhang, Dehua Cheng, Yuchen He, Zhengxing Chen et al.WWW 2023 · 20 citations
- AutoGSR: Neural Architecture Search for Graph-based Session RecommendationJingfan Chen, Guanghui Zhu, Haojun Hou, Chunfeng Yuan et al.SIGIR 2022 · 25 citations
