论文标题
ADNFM:用于CTR预测的细心基于Densenet的分解机
AdnFM: An Attentive DenseNet based Factorization Machine for CTR Prediction
论文作者
论文摘要
在本文中,我们考虑点击率率(CTR)预测问题。分解机及其变体考虑配对特征交互,但通常由于高时间复杂性,我们不会使用FM进行高阶特征交互。鉴于深层神经网络(DNN)在许多领域的成功,研究人员提出了几种基于DNN的模型来学习高阶特征相互作用。多层感知器(MLP)已被广泛用于从功能嵌入到最终逻辑的可靠映射。在本文中,我们旨在探索有关这些高阶特征交互的更多信息。但是,高阶特征相互作用值得更多关注和进一步发展。受到计算机视觉中密集连接的卷积网络(Densenet)的巨大成就的启发,我们提出了一个新型模型,称为“ Actentive densenet分解机”(ADNFM)。 ADNFM可以通过使用馈送前向神经网络的所有隐藏层作为隐式高阶功能来提取更全面的深度特征,然后通过注意机制选择主要功能。同样,使用DNN的隐式方式的高阶交互比以FM的明确方式更具成本效益。在两个现实世界数据集上进行的广泛实验表明,所提出的模型可以有效地改善CTR预测的性能。
In this paper, we consider the Click-Through-Rate (CTR) prediction problem. Factorization Machines and their variants consider pair-wise feature interactions, but normally we won't do high-order feature interactions using FM due to high time complexity. Given the success of deep neural networks (DNNs) in many fields, researchers have proposed several DNN-based models to learn high-order feature interactions. Multi-layer perceptrons (MLP) have been widely employed to learn reliable mappings from feature embeddings to final logits. In this paper, we aim to explore more about these high-order features interactions. However, high-order feature interaction deserves more attention and further development. Inspired by the great achievements of Densely Connected Convolutional Networks (DenseNet) in computer vision, we propose a novel model called Attentive DenseNet based Factorization Machines (AdnFM). AdnFM can extract more comprehensive deep features by using all the hidden layers from a feed-forward neural network as implicit high-order features, then selects dominant features via an attention mechanism. Also, high-order interactions in the implicit way using DNNs are more cost-efficient than in the explicit way, for example in FM. Extensive experiments on two real-world datasets show that the proposed model can effectively improve the performance of CTR prediction.