Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2510.08788 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914085693554688 |
|---|---|
| author | Pudovikov, Andrey Khirianova, Alexandra Solodneva, Ekaterina Molodtsov, Gleb Katrutsa, Aleksandr Dorn, Yuriy Samosvat, Egor |
| author_facet | Pudovikov, Andrey Khirianova, Alexandra Solodneva, Ekaterina Molodtsov, Gleb Katrutsa, Aleksandr Dorn, Yuriy Samosvat, Egor |
| contents | Managing millions of digital auctions is an essential task for modern advertising auction systems. The main approach to managing digital auctions is an autobidding approach, which depends on the Click-Through Rate and Conversion Rate values. While these quantities are estimated with ML models, their prediction uncertainty directly impacts advertisers' revenue and bidding strategies. To address this issue, we propose RobustBid, an efficient method for robust autobidding taking into account uncertainty in CTR and CVR predictions. Our approach leverages advanced, robust optimization techniques to prevent large errors in bids if the estimates of CTR/CVR are perturbed. We derive the analytical solution of the stated robust optimization problem, which leads to the runtime efficiency of the RobustBid method. The synthetic, iPinYou, and BAT benchmarks are used in our experimental evaluation of RobustBid. We compare our method with the non-robust baseline and the RiskBid algorithm in terms of total conversion volume (TCV) and average cost-per-click ($CPC_{avg}$) performance metrics. The experiments demonstrate that RobustBid provides bids that yield larger TCV and smaller $CPC_{avg}$ than competitors in the case of large perturbations in CTR/CVR predictions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_08788 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Robust autobidding for noisy conversion prediction models Pudovikov, Andrey Khirianova, Alexandra Solodneva, Ekaterina Molodtsov, Gleb Katrutsa, Aleksandr Dorn, Yuriy Samosvat, Egor Computer Science and Game Theory Optimization and Control Managing millions of digital auctions is an essential task for modern advertising auction systems. The main approach to managing digital auctions is an autobidding approach, which depends on the Click-Through Rate and Conversion Rate values. While these quantities are estimated with ML models, their prediction uncertainty directly impacts advertisers' revenue and bidding strategies. To address this issue, we propose RobustBid, an efficient method for robust autobidding taking into account uncertainty in CTR and CVR predictions. Our approach leverages advanced, robust optimization techniques to prevent large errors in bids if the estimates of CTR/CVR are perturbed. We derive the analytical solution of the stated robust optimization problem, which leads to the runtime efficiency of the RobustBid method. The synthetic, iPinYou, and BAT benchmarks are used in our experimental evaluation of RobustBid. We compare our method with the non-robust baseline and the RiskBid algorithm in terms of total conversion volume (TCV) and average cost-per-click ($CPC_{avg}$) performance metrics. The experiments demonstrate that RobustBid provides bids that yield larger TCV and smaller $CPC_{avg}$ than competitors in the case of large perturbations in CTR/CVR predictions. |
| title | Robust autobidding for noisy conversion prediction models |
| topic | Computer Science and Game Theory Optimization and Control |
| url | https://arxiv.org/abs/2510.08788 |