Uncertainty Quantification of Click and Conversion Estimates for the Autobidding

• URL: http://arxiv.org/abs/2603.01825v1
• Date: Mon, 02 Mar 2026 12:57:11 GMT
• Title: Uncertainty Quantification of Click and Conversion Estimates for the Autobidding
• Authors: Ivan Zhigalskii, Andrey Pudovikov, Aleksandr Katrutsa, Egor Samosvat,
• Abstract summary: 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.
• Score: 41.674778042920956
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Modern e-commerce platforms employ various auction mechanisms to allocate paid slots for a given item. To scale this approach to the millions of auctions, the platforms suggest promotion tools based on the autobidding algorithms. These algorithms typically depend on the Click-Through-Rate (CTR) and Conversion-Rate (CVR) estimates provided by a pre-trained machine learning model. However, the predictions of such models are uncertain and can significantly affect the performance of the autobidding algorithm. To address this issue, we propose the DenoiseBid method, which corrects the generated CTRs and CVRs to make the resulting bids more efficient in auctions. The underlying idea of our method is to employ a Bayesian approach and replace noisy CTR or CVR estimates with those from recovered distributions. To demonstrate the performance of the proposed approach, we perform extensive experiments on the synthetic, iPinYou, and BAT datasets. To evaluate the robustness of our approach to the noise scale, we use synthetic noise and noise estimated from the predictions of the pre-trained machine learning model.

Related papers

• Autobidding Arena: unified evaluation of the classical and RL-based autobidding algorithms [71.47275796833235]
  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.
  arXiv  Detail & Related papers  (2025-10-22T08:27:56Z)
• Auto-bidding under Return-on-Spend Constraints with Uncertainty Quantification [11.402112814133034]
  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.<n>This paper considers the more realistic scenario where the true value is unknown.<n>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.
  arXiv  Detail & Related papers  (2025-09-19T18:09:23Z)
• 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)
• A Data Balancing and Ensemble Learning Approach for Credit Card Fraud Detection [1.8921747725821432]
  This research introduces an innovative method for identifying credit card fraud by combining the SMOTE-KMEANS technique with an ensemble machine learning model.<n>The proposed model was benchmarked against traditional models such as logistic regression, decision trees, random forests, and support vector machines.<n>Results demonstrated that the proposed model achieved superior performance, with an AUC of 0.96 when combined with the SMOTE-KMEANS algorithm.
  arXiv  Detail & Related papers  (2025-03-27T04:59:45Z)
• Consensus-Adaptive RANSAC [104.87576373187426]
  We propose a new RANSAC framework that learns to explore the parameter space by considering the residuals seen so far via a novel attention layer. The attention mechanism operates on a batch of point-to-model residuals, and updates a per-point estimation state to take into account the consensus found through a lightweight one-step transformer.
  arXiv  Detail & Related papers  (2023-07-26T08:25:46Z)
• Towards Better Certified Segmentation via Diffusion Models [62.21617614504225]
  segmentation models can be vulnerable to adversarial perturbations, which hinders their use in critical-decision systems like healthcare or autonomous driving. Recently, randomized smoothing has been proposed to certify segmentation predictions by adding Gaussian noise to the input to obtain theoretical guarantees. In this paper, we address the problem of certifying segmentation prediction using a combination of randomized smoothing and diffusion models.
  arXiv  Detail & Related papers  (2023-06-16T16:30:39Z)
• Adaptive Fake Audio Detection with Low-Rank Model Squeezing [50.7916414913962]
  Traditional approaches, such as finetuning, are computationally intensive and pose a risk of impairing the acquired knowledge of known fake audio types. We introduce the concept of training low-rank adaptation matrices tailored specifically to the newly emerging fake audio types. Our approach offers several advantages, including reduced storage memory requirements and lower equal error rates.
  arXiv  Detail & Related papers  (2023-06-08T06:06:42Z)
• Robust multi-item auction design using statistical learning: Overcoming uncertainty in bidders' types distributions [6.5920927560926295]
  Our proposed approach utilizes nonparametric density estimation to accurately estimate bidders' types from historical bids. To further enhance efficiency of our mechanism, we introduce two novel strategies for query reduction. Simulation experiments conducted on both small-scale and large-scale data demonstrate that our mechanism consistently outperforms existing methods in terms of revenue design and query reduction.
  arXiv  Detail & Related papers  (2023-02-02T08:32:55Z)
• Adversarial Gradient Driven Exploration for Deep Click-Through Rate Prediction [39.61776002290324]
  We propose a novel exploration method called textbfAdrial textbfGradientversa Driven textbfExploration (AGE) AGE simulates the gradient updating process, which can approximate the influence of the samples of to-be-explored items for the model. The effectiveness of our approach was demonstrated on an open-access academic dataset.
  arXiv  Detail & Related papers  (2021-12-21T12:13:07Z)

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.