scispace - formally typeset
Open AccessProceedings ArticleDOI

Deep Interest Network for Click-Through Rate Prediction

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
Proceedings ArticleDOI

TAGNN: Target Attentive Graph Neural Networks for Session-based Recommendation

TL;DR: In TAGNN, target-aware attention adaptively activates different user interests with respect to varied target items and the learned interest representation vector varies with different target items, greatly improving the expressiveness of the model.
Proceedings ArticleDOI

AKUPM: Attention-Enhanced Knowledge-Aware User Preference Model for Recommendation

TL;DR: A novel model named Attention-enhanced Knowledge-aware User Preference Model (AKUPM) is proposed for click-through rate (CTR) prediction, which achieves substantial gains in terms of common evaluation metrics over several state-of-the-art baselines.
Proceedings Article

MLaaS in the Wild: Workload Analysis and Scheduling in Large-Scale Heterogeneous GPU Clusters

TL;DR: This paper presents a characterization study of a two-month workload trace collected from a production MLaaS cluster with over 6,000 GPUs in Alibaba, and describes the current solutions and calls for further investiga-tions into the challenges that remain open to address.
Posted Content

Mixed Dimension Embeddings with Application to Memory-Efficient Recommendation Systems

TL;DR: This work proposes mixed dimension embedding layers in which the dimension of a particular embedding vector can depend on the frequency of the item, which drastically reduces the memory requirement for the embedding, while maintaining and sometimes improving the ML performance.
Proceedings ArticleDOI

Hierarchical User Profiling for E-commerce Recommender Systems

TL;DR: This paper proposes HUP, a Hierarchical User Profiling framework, a Pyramid Recurrent Neural Networks, equipped with Behavior-LSTM to formulate users' hierarchical real-time interests at multiple scales, and demonstrates the significant performance gains of the HUP against state-of-the-art methods for the hierarchical user profiling and recommendation problems.
References
More filters
Proceedings Article

Adam: A Method for Stochastic Optimization

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.
Related Papers (5)
Trending Questions (1)
How does Google Ads use historical data and machine learning algorithms to predict keyword performance?

The provided paper does not mention Google Ads or how historical data and machine learning algorithms are used to predict keyword performance. The paper focuses on click-through rate prediction in online advertising, specifically in the Alibaba display advertising system.