Auto-bidding under Return-on-Spend Constraints with Uncertainty Quantification
Jiale Han, Chun Gan, Chengcheng Zhang, Jie He, Zhangang Lin, Ching Law, Xiaowu Dai
Abstract
Auto-bidding systems are widely used in advertising to automatically determine bid values under constraints such as total budget and Return-on-Spend (RoS) targets. Existing works often assume that the value of an ad impression, such as the conversion rate, is known. This paper considers the more realistic scenario where the true value is unknown. We propose a novel method that uses conformal prediction to quantify the uncertainty of these values based on machine learning methods trained on historical bidding data with contextual features, without assuming the data are i.i.d. This approach is compatible with current industry systems that use machine learning to predict values. Building on prediction intervals, we introduce an adjusted value estimator derived from machine learning predictions, and show that it provides performance guarantees without requiring knowledge of the true value. We apply this method to enhance existing auto-bidding algorithms with budget and RoS constraints, and establish theoretical guarantees for achieving high reward while keeping RoS violations low. Empirical results on both simulated and real-world industrial datasets demonstrate that our approach improves performance while maintaining computational efficiency. CCS Concepts • Applied computing → Online auctions.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext b5681bfe-8832-4eda-9db5-1724cff3f94cBuilds on9
- Dual Mirror Descent for Online Allocation ProblemsSantiago R. Balseiro, Haihao Lu, Vahab S. MirrokniICML 2020 · 102 citations
- Robust Auction Design in the Auto-bidding WorldSantiago R. Balseiro, Yuan Deng, Jieming Mao, Vahab S. Mirrokni et al.NeurIPS 2021 · 95 citations
- A Unifying Framework for Online Optimization with Long-Term ConstraintsMatteo Castiglioni, Andrea Celli, Alberto Marchesi, Giulia Romano et al.NeurIPS 2022 · 59 citations
- Online Bidding Algorithms for Return-on-Spend Constrained Advertisers✱Zhe Feng, Swati Padmanabhan, Di WangWWW 2023 · 38 citations
- Field-aware Calibration: A Simple and Empirically Strong Method for Reliable Probabilistic PredictionsFeiyang Pan, Xiang Ao, Pingzhong Tang, Min Lu et al.WWW 2020 · 30 citations
Related papers
- Online Bidding under RoS Constraints without Knowing the ValueSushant Vijayan, Zhe Feng, Swati Padmanabhan, Karthikeyan Shanmugam et al.WWW 2025 · 4 citations
- No-Regret Algorithms in non-Truthful Auctions with Budget and ROI ConstraintsGagan Aggarwal, Giannis Fikioris, Mingfei ZhaoWWW 2025 · 13 citations
- Individual Welfare Guarantees in the Autobidding World with Machine-learned AdviceYuan Deng, Negin Golrezaei, Patrick Jaillet, Jason Cheuk Nam Liang et al.WWW 2024 · 11 citations
- Sustainable Online Reinforcement Learning for Auto-biddingZhiyu Mou, Yusen Huo, Rongquan Bai, Mingzhou Xie et al.NeurIPS 2022 · 53 citations
- A Field Guide for Pacing Budget and ROS ConstraintsSantiago R. Balseiro, Kshipra Bhawalkar, Zhe Feng, Haihao Lu et al.ICML 2024 · 7 citations
