Deep Interest Network for Click-Through Rate Prediction
Guorui Zhou,Xiaoqiang Zhu,Chenru Song,Ying Fan,Han Zhu,Xiao Ma,Yan Yanghui,Junqi Jin,Han Li,Kun Gai +9 more
- pp 1059-1068
Reads0
Chats0
TLDR
A novel model: Deep Interest Network (DIN) is proposed which tackles this challenge by designing a local activation unit to adaptively learn the representation of user interests from historical behaviors with respect to a certain ad.Abstract:
Click-through rate prediction is an essential task in industrial applications, such as online advertising. Recently deep learning based models have been proposed, which follow a similar Embedding&MLP paradigm. In these methods large scale sparse input features are first mapped into low dimensional embedding vectors, and then transformed into fixed-length vectors in a group-wise manner, finally concatenated together to fed into a multilayer perceptron (MLP) to learn the nonlinear relations among features. In this way, user features are compressed into a fixed-length representation vector, in regardless of what candidate ads are. The use of fixed-length vector will be a bottleneck, which brings difficulty for Embedding&MLP methods to capture user's diverse interests effectively from rich historical behaviors. In this paper, we propose a novel model: Deep Interest Network (DIN) which tackles this challenge by designing a local activation unit to adaptively learn the representation of user interests from historical behaviors with respect to a certain ad. This representation vector varies over different ads, improving the expressive ability of model greatly. Besides, we develop two techniques: mini-batch aware regularization and data adaptive activation function which can help training industrial deep networks with hundreds of millions of parameters. Experiments on two public datasets as well as an Alibaba real production dataset with over 2 billion samples demonstrate the effectiveness of proposed approaches, which achieve superior performance compared with state-of-the-art methods. DIN now has been successfully deployed in the online display advertising system in Alibaba, serving the main traffic.read more
Citations
More filters
Journal ArticleDOI
FeatureBox: Feature Engineering on GPUs for Massive-Scale Ads Systems
TL;DR: This paper proposes FeatureBox, a novel end-to-end training framework that pipelines the feature extraction and the training on GPU servers to save the intermediate I/O of the feature extracts and introduces a layer-wise operator scheduling algorithm to schedule these heterogeneous operators.
Posted Content
AliExpress Learning-To-Rank: Maximizing Online Model Performance without Going Online.
Guangda Huzhang,Zhen-Jia Pang,Yongqing Gao,Yawen Liu,Weijie Shen,Wen-Ji Zhou,Qing Da,Anxiang Zeng,Han Yu,Yang Yu,Zhi-Hua Zhou +10 more
TL;DR: In this paper, an evaluator-generator framework was proposed for learning-to-rank (LTR) with item context, which consists of a generalizer that generalizes to evaluate recommendations involving the context, and a generator that maximizes the evaluators score by reinforcement learning.
Book ChapterDOI
Application of Recommendation Systems Based on Deep Learning
TL;DR: Wang et al. as mentioned in this paper reviewed the research progress of recommendation systems based on deep learning in recent years and analyzed the differences between recommendation systems using deep learning and traditional recommendation systems.
Journal ArticleDOI
Extended Factorization Machines for Sequential Recommendation
Nuan Wen,Fang Zhang +1 more
TL;DR: An architecture of extended-FM is proposed for sequential recommendation, which presents temporal feature interactions in an explicit way as traditional FM’s formula and merges into higher-order interaction framework without significant changes to the deeper models themselves.
Proceedings ArticleDOI
ATJ-Net: Auto-Table-Join Network for Automatic Learning on Relational Databases
TL;DR: ATJ-Net as mentioned in this paper proposes an auto-table-join network to predict one label column with the help of multiple-tabular data, where multiple tables with relationships are considered as a hypergraph, where vertices are joinable attributes and hyperedges are tuples of tables.
References
More filters
Proceedings Article
Adam: A Method for Stochastic Optimization
Diederik P. Kingma,Jimmy Ba +1 more
TL;DR: This work introduces Adam, an algorithm for first-order gradient-based optimization of stochastic objective functions, based on adaptive estimates of lower-order moments, and provides a regret bound on the convergence rate that is comparable to the best known results under the online convex optimization framework.
Journal ArticleDOI
Regression Shrinkage and Selection via the Lasso
TL;DR: A new method for estimation in linear models called the lasso, which minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant, is proposed.
Journal Article
Dropout: a simple way to prevent neural networks from overfitting
TL;DR: It is shown that dropout improves the performance of neural networks on supervised learning tasks in vision, speech recognition, document classification and computational biology, obtaining state-of-the-art results on many benchmark data sets.
Journal Article
Visualizing Data using t-SNE
TL;DR: A new technique called t-SNE that visualizes high-dimensional data by giving each datapoint a location in a two or three-dimensional map, a variation of Stochastic Neighbor Embedding that is much easier to optimize, and produces significantly better visualizations by reducing the tendency to crowd points together in the center of the map.
Proceedings ArticleDOI
Densely Connected Convolutional Networks
TL;DR: DenseNet as mentioned in this paper proposes to connect each layer to every other layer in a feed-forward fashion, which can alleviate the vanishing gradient problem, strengthen feature propagation, encourage feature reuse, and substantially reduce the number of parameters.