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.
翻译:模拟强大的互动是“点通率”(CTR)预测中的一项关键挑战,这是个人化广告和建议系统最典型的机器学习任务之一。虽然发展手工化互动对少数数据集有效,但通常需要为广泛的情景进行艰苦和乏味的建筑工程。近年来,为自动设计互动,提出了几种神经结构搜索方法。然而,现有方法仅探索互动生成操作者有限的类型和联系,导致普遍化能力低。为了解决这些问题,我们提出了一种更普遍的建立强大互动的自动化方法,称为“自动化”。本文的主要贡献如下:自动制造协会采用一个更一般的搜索空间,从现有网络连接中普及计算图,而图边缘的互动操作者则从具有代表性的手工艺作品中提取。它使得可以搜索各种强大的地貌互动,从而产生更高的AUC和低的广度记录损失。此外,AutoPI利用基于梯度的搜索战略,以大幅低计算成本进行勘探。我们实验性地评估了AutoPI的通用标准结构。