Demystifying Advertising Campaign Bid Recommendation: A Constraint target CPA Goal Optimization
Not on the map. Why?
Abstract (arXiv)
In cost-per-click (CPC) or cost-per-impression (CPM) advertising campaigns, advertisers always run the risk of spending the budget without getting enough conversions. Moreover, the bidding on advertising inventory has few connections with propensity one that can reach to target cost-per-acquisition (tCPA) goals. To address this problem, this paper presents a bid optimization scenario to achieve the desired tCPA goals for advertisers. In particular, we build the optimization engine to make a decision by solving the rigorously formalized constrained optimization problem, which leverages the bid landscape model learned from rich historical auction data using non-parametric learning. The proposed model can naturally recommend the bid that meets the advertisers' expectations by making inference over advertisers' historical auction behaviors, which essentially deals with the data challenges commonly faced by bid landscape modeling: incomplete logs in auctions, and uncertainty due to the variation and fluctuations in advertising bidding behaviors. The bid optimization model outperforms the baseline methods on real-world campaigns, and has been applied into a wide range of scenarios for performance improvement and revenue liftup.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 35 references that are in the map. First posted on arXiv 26 Dec 2022.
Builds on
5 of 35 references.
References · 5
- 2017Optimized Cost per Click in Taobao Display Advertisingcited by 57
- 2016Distributed Clustering of Linear Bandits in Peer to Peer Networkscited by 50
- 2016On Context-Dependent Clustering of Banditscited by 44
- 2016A Field Guide to Personalized Reserve Pricescited by 6
- 2017Sponsored Search Auctions with Rich Adscited by 3
Built on by
Not cited yet.