Auto-bidding under Return-on-Spend Constraints with Uncertainty Quantification
Jiale Han, Chun Gan, Chengcheng Zhang, Jie He, Zhangang Lin, Ching Law, Xiaowu Dai
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper9
- Dual Mirror Descent for Online Allocation ProblemsSantiago R. Balseiro, Haihao Lu, Vahab S. MirrokniICML 2020 · 被引用 102 次
- Robust Auction Design in the Auto-bidding WorldSantiago R. Balseiro, Yuan Deng, Jieming Mao, Vahab S. Mirrokni 等NeurIPS 2021 · 被引用 95 次
- A Unifying Framework for Online Optimization with Long-Term ConstraintsMatteo Castiglioni, Andrea Celli, Alberto Marchesi, Giulia Romano 等NeurIPS 2022 · 被引用 59 次
- Online Bidding Algorithms for Return-on-Spend Constrained Advertisers✱Zhe Feng, Swati Padmanabhan, Di WangWWW 2023 · 被引用 38 次
- Field-aware Calibration: A Simple and Empirically Strong Method for Reliable Probabilistic PredictionsFeiyang Pan, Xiang Ao, Pingzhong Tang, Min Lu 等WWW 2020 · 被引用 30 次
相关 Paper
- Online Bidding under RoS Constraints without Knowing the ValueSushant Vijayan, Zhe Feng, Swati Padmanabhan, Karthikeyan Shanmugam 等WWW 2025 · 被引用 4 次
- No-Regret Algorithms in non-Truthful Auctions with Budget and ROI ConstraintsGagan Aggarwal, Giannis Fikioris, Mingfei ZhaoWWW 2025 · 被引用 13 次
- Individual Welfare Guarantees in the Autobidding World with Machine-learned AdviceYuan Deng, Negin Golrezaei, Patrick Jaillet, Jason Cheuk Nam Liang 等WWW 2024 · 被引用 11 次
- Sustainable Online Reinforcement Learning for Auto-biddingZhiyu Mou, Yusen Huo, Rongquan Bai, Mingzhou Xie 等NeurIPS 2022 · 被引用 53 次
- A Field Guide for Pacing Budget and ROS ConstraintsSantiago R. Balseiro, Kshipra Bhawalkar, Zhe Feng, Haihao Lu 等ICML 2024 · 被引用 7 次
