Bidding Machine: Learning to Bid for Directly Optimizing Profits in Display Advertising
Kan Ren, Weinan Zhang, Ke Chang, Yifei Rong, Yong Yu, Jun Wang

TL;DR
This paper introduces Bidding Machine, a unified learning framework for real-time bidding in display advertising that jointly optimizes utility estimation, market value forecasting, and bid decision-making, leading to improved campaign performance.
Contribution
It presents a comprehensive joint optimization framework for RTB bidding that integrates three interconnected components, unlike previous methods treating them separately.
Findings
Joint optimization significantly improves campaign effectiveness.
The framework can be trained with offline batch or online sequential schemes.
Extensive offline and online tests confirm high effectiveness.
Abstract
Real-time bidding (RTB) based display advertising has become one of the key technological advances in computational advertising. RTB enables advertisers to buy individual ad impressions via an auction in real-time and facilitates the evaluation and the bidding of individual impressions across multiple advertisers. In RTB, the advertisers face three main challenges when optimizing their bidding strategies, namely (i) estimating the utility (e.g., conversions, clicks) of the ad impression, (ii) forecasting the market value (thus the cost) of the given ad impression, and (iii) deciding the optimal bid for the given auction based on the first two. Previous solutions assume the first two are solved before addressing the bid optimization problem. However, these challenges are strongly correlated and dealing with any individual problem independently may not be globally optimal. In this paper,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
