Autobidding Arena: unified evaluation of the classical and RL-based autobidding algorithms

• URL: http://arxiv.org/abs/2510.19357v1
• Date: Wed, 22 Oct 2025 08:27:56 GMT
• Title: Autobidding Arena: unified evaluation of the classical and RL-based autobidding algorithms
• Authors: Andrey Pudovikov, Alexandra Khirianova, Ekaterina Solodneva, Aleksandr Katrutsa, Egor Samosvat, Yuriy Dorn,
• Abstract summary: We present a standardized and transparent evaluation protocol for comparing classical and reinforcement learning autobidding algorithms.<n>We utilize the most recent open-source environment developed in the industry, which accurately emulates the bidding process.
• Score: 71.47275796833235
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Advertisement auctions play a crucial role in revenue generation for e-commerce companies. To make the bidding procedure scalable to thousands of auctions, the automatic bidding (autobidding) algorithms are actively developed in the industry. Therefore, the fair and reproducible evaluation of autobidding algorithms is an important problem. We present a standardized and transparent evaluation protocol for comparing classical and reinforcement learning (RL) autobidding algorithms. We consider the most efficient autobidding algorithms from different classes, e.g., ones based on the controllers, RL, optimal formulas, etc., and benchmark them in the bidding environment. We utilize the most recent open-source environment developed in the industry, which accurately emulates the bidding process. Our work demonstrates the most promising use cases for the considered autobidding algorithms, highlights their surprising drawbacks, and evaluates them according to multiple metrics. We select the evaluation metrics that illustrate the performance of the autobidding algorithms, the corresponding costs, and track the budget pacing. Such a choice of metrics makes our results applicable to the broad range of platforms where autobidding is effective. The presented comparison results help practitioners to evaluate the candidate autobidding algorithms from different perspectives and select ones that are efficient according to their companies' targets.

Related papers

• Uncertainty Quantification of Click and Conversion Estimates for the Autobidding [41.674778042920956]
  Autobidding algorithms depend on Click-Through-Rate (CTR) and Conversion-Rate (CVR) estimates provided by a pre-trained machine learning model.<n>We propose the DenoiseBid method, which corrects the generated CTRs and CVRs to make the resulting bids more efficient in auctions.
  arXiv  Detail & Related papers  (2026-03-02T12:57:11Z)
• Direct Preference Optimization with Rating Information: Practical Algorithms and Provable Gains [67.71020482405343]
  We study how to design algorithms that can leverage additional information in the form of rating gap.<n>We present new algorithms that can achieve faster statistical rates than DPO in presence of accurate rating gap information.
  arXiv  Detail & Related papers  (2026-01-31T08:38:21Z)
• Lightweight Auto-bidding based on Traffic Prediction in Live Advertising [12.578089904793638]
  We propose a lightweight bidding algorithm Binary Constrained Bidding (BiCB)<n>BiCB neatly combines the optimal bidding formula given by mathematical analysis and the statistical method of future traffic estimation.<n>Sufficient offline and online experiments prove BiCB's good performance and low engineering cost.
  arXiv  Detail & Related papers  (2025-08-08T07:05:35Z)
• BAT: Benchmark for Auto-bidding Task [67.56067222427946]
  We present an auction benchmark encompassing the two most prevalent auction formats.<n>We implement a series of robust baselines on a novel dataset.<n>This benchmark provides a user-friendly and intuitive framework for researchers and practitioners to develop and refine innovative autobidding algorithms.
  arXiv  Detail & Related papers  (2025-05-13T12:12:34Z)
• On the Role of Feedback in Test-Time Scaling of Agentic AI Workflows [71.92083784393418]
  Agentic AI (systems that autonomously plan and act) are becoming widespread, yet their task success rate on complex tasks remains low.<n>Inference-time alignment relies on three components: sampling, evaluation, and feedback.<n>We introduce Iterative Agent Decoding (IAD), a procedure that repeatedly inserts feedback extracted from different forms of critiques.
  arXiv  Detail & Related papers  (2025-04-02T17:40:47Z)
• Procurement Auctions via Approximately Optimal Submodular Optimization [53.93943270902349]
  We study procurement auctions, where an auctioneer seeks to acquire services from strategic sellers with private costs. Our goal is to design computationally efficient auctions that maximize the difference between the quality of the acquired services and the total cost of the sellers.
  arXiv  Detail & Related papers  (2024-11-20T18:06:55Z)
• Coordinated Dynamic Bidding in Repeated Second-Price Auctions with Budgets [17.937079224726073]
  We study coordinated online bidding algorithms in repeated second-price auctions with budgets. We propose algorithms that guarantee every client a higher utility than the best she can get under independent bidding.
  arXiv  Detail & Related papers  (2023-06-13T11:55:04Z)
• Open-Set Automatic Target Recognition [52.27048031302509]
  Automatic Target Recognition (ATR) is a category of computer vision algorithms which attempts to recognize targets on data obtained from different sensors. Existing ATR algorithms are developed for traditional closed-set methods where training and testing have the same class distribution. We propose an Open-set Automatic Target Recognition framework where we enable open-set recognition capability for ATR algorithms.
  arXiv  Detail & Related papers  (2022-11-10T21:28:24Z)
• Machine Learning for Online Algorithm Selection under Censored Feedback [71.6879432974126]
  In online algorithm selection (OAS), instances of an algorithmic problem class are presented to an agent one after another, and the agent has to quickly select a presumably best algorithm from a fixed set of candidate algorithms. For decision problems such as satisfiability (SAT), quality typically refers to the algorithm's runtime. In this work, we revisit multi-armed bandit algorithms for OAS and discuss their capability of dealing with the problem. We adapt them towards runtime-oriented losses, allowing for partially censored data while keeping a space- and time-complexity independent of the time horizon.
  arXiv  Detail & Related papers  (2021-09-13T18:10:52Z)
• Adaptively Optimize Content Recommendation Using Multi Armed Bandit Algorithms in E-commerce [4.143179903857126]
  We analyze using three classic MAB algorithms, epsilon-greedy, Thompson sampling (TS), and upper confidence bound 1 (UCB1) for dynamic content recommendations. We compare the accumulative rewards of the three MAB algorithms with more than 1,000 trials using actual historical A/B test datasets. We develop a batch-updated MAB algorithm to overcome the delayed reward issue in e-commerce.
  arXiv  Detail & Related papers  (2021-07-30T21:03:38Z)
• Neural Auction: End-to-End Learning of Auction Mechanisms for E-Commerce Advertising [42.7415188090209]
  We develop deep models to efficiently extract contexts from auctions, providing rich features for auction design. DNAs have been successfully deployed in the e-commerce advertising system at Taobao.
  arXiv  Detail & Related papers  (2021-06-07T13:20:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.