A Unified Framework for Campaign Performance Forecasting in Online Display Advertising
Not on the map. Why?
Abstract (arXiv)
Advertisers usually enjoy the flexibility to choose criteria like target audience, geographic area and bid price when planning an campaign for online display advertising, while they lack forecast information on campaign performance to optimize delivery strategies in advance, resulting in a waste of labour and budget for feedback adjustments. In this paper, we aim to forecast key performance indicators for new campaigns given any certain criteria. Interpretable and accurate results could enable advertisers to manage and optimize their campaign criteria. There are several challenges for this very task. First, platforms usually offer advertisers various criteria when they plan an advertising campaign, it is difficult to estimate campaign performance unifiedly because of the great difference among bidding types. Furthermore, complex strategies applied in bidding system bring great fluctuation on campaign performance, making estimation accuracy an extremely tough problem. To address above challenges, we propose a novel Campaign Performance Forecasting framework, which firstly reproduces campaign performance on historical logs under various bidding types with a unified replay algorithm, in which essential auction processes like match and rank are replayed, ensuring the interpretability on forecast results. Then, we innovatively introduce a multi-task learning method to calibrate the deviation of estimation brought by hard-to-reproduce bidding strategies in replay. The method captures mixture calibration patterns among related forecast indicators to map the estimated results to the true ones, improving both accuracy and efficiency significantly. Experiment results on a dataset from Taobao.com demonstrate that the proposed framework significantly outperforms other baselines by a large margin, and an online A/B test verifies its effectiveness in the real world.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 21 of its 40 references that are in the map. First posted on arXiv 24 Feb 2022.
Builds on
21 of 40 references.
References · 21
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,617
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
- 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 673
- 2016TensorFlow: Large-Scale Machine Learning on Heterogeneous Distributed Systemscited by 660
- 2017Deep Interest Network for Click-Through Rate Predictioncited by 541
- 2016Cross-stitch Networks for Multi-task Learningcited by 466
- 2018Deep Interest Evolution Network for Click-Through Rate Predictioncited by 336
- 2013Learning Factored Representations in a Deep Mixture of Expertscited by 275
- 2018Entire Space Multi-Task Model: An Effective Approach for Estimating Post-Click Conversion Ratecited by 172
- 2018Budget Constrained Bidding by Model-free Reinforcement Learning in Display Advertisingcited by 60
9 more
- 2016Mean Absolute Percentage Error for regression modelscited by 58
- 2017Optimized Cost per Click in Taobao Display Advertisingcited by 57
- 2019Joint Optimization of Tree-based Index and Deep Model for Recommender Systemscited by 37
- 2019Bid Optimization by Multivariable Control in Display Advertisingcited by 37
- 2013Real-time Bidding for Online Advertising: Measurement and Analysiscited by 32
- 2019Field-aware Calibration: A Simple and Empirically Strong Method for Reliable Probabilistic Predictionscited by 19
- 2016Optimal Real-Time Bidding Frameworks Discussioncited by 5
- 2021Truncation-Free Matching System for Display Advertising at Alibabacited by 3
- 2019Forecasting Granular Audience Size for Online Advertisingcited by 1
Built on by
Not cited yet.