Command Palette
Search for a command to run...
Wentao Ouyang; Xiuwu Zhang; Shukui Ren; Chao Qi; Zhaojie Liu; Yanlong Du

Abstract
Click-through rate (CTR) prediction is a critical task in online advertising systems. Most existing methods mainly model the feature-CTR relationship and suffer from the data sparsity issue. In this paper, we propose DeepMCP, which models other types of relationships in order to learn more informative and statistically reliable feature representations, and in consequence to improve the performance of CTR prediction. In particular, DeepMCP contains three parts: a matching subnet, a correlation subnet and a prediction subnet. These subnets model the user-ad, ad-ad and feature-CTR relationship respectively. When these subnets are jointly optimized under the supervision of the target labels, the learned feature representations have both good prediction powers and good representation abilities. Experiments on two large-scale datasets demonstrate that DeepMCP outperforms several state-of-the-art models for CTR prediction.
Code Repositories
Benchmarks
| Benchmark | Methodology | Metrics |
|---|---|---|
| click-through-rate-prediction-on-avito | DeepMCP | AUC: 0.7927 Log Loss: 0.05518 |
| click-through-rate-prediction-on-company | DeepMCP | AUC: 0.7674 Log Loss: 0.2341 |
Build AI with AI
From idea to launch — accelerate your AI development with free AI co-coding, out-of-the-box environment and best price of GPUs.