JD-BP: A Joint-Decision Generative Framework for Auto-Bidding and Pricing

• URL: http://arxiv.org/abs/2604.05845v1
• Date: Tue, 07 Apr 2026 13:11:12 GMT
• Title: JD-BP: A Joint-Decision Generative Framework for Auto-Bidding and Pricing
• Abstract summary: Auto-bidding services optimize real-time bidding strategies for advertisers under key performance indicator (KPI) constraints.<n> uncertainties such as model prediction errors and feedback latency can cause bidding strategies to deviate from ex-post optimality.<n>We propose JD-BP, a Joint generative Decision framework for Bidding and Pricing.
• Score: 15.898784873581677
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Auto-bidding services optimize real-time bidding strategies for advertisers under key performance indicator (KPI) constraints such as target return on investment and budget. However, uncertainties such as model prediction errors and feedback latency can cause bidding strategies to deviate from ex-post optimality, leading to inefficient allocation. To address this issue, we propose JD-BP, a Joint generative Decision framework for Bidding and Pricing. Unlike prior methods, JD-BP jointly outputs a bid value and a pricing correction term that acts additively with the payment rule such as GSP. To mitigate adverse effects of historical constraint violations, we design a memory-less Return-to-Go that encourages future value maximizing of bidding actions while the cumulated bias is handled by the pricing correction. Moreover, a trajectory augmentation algorithm is proposed to generate joint bidding-pricing trajectories from a (possibly arbitrary) base bidding policy, enabling efficient plug-and-play deployment of our algorithm from existing RL/generative bidding models. Finally, we employ an Energy-Based Direct Preference Optimization method in conjunction with a cross-attention module to enhance the joint learning performance of bidding and pricing correction. Offline experiments on the AuctionNet dataset demonstrate that JD-BP achieves state-of-the-art performance. Online A/B tests at JD.com confirm its practical effectiveness, showing a 4.70% increase in ad revenue and a 6.48% improvement in target cost.

Related papers

• DRIVE: Distributional and Retrieval-Augmented Bidding with Value Evaluation [39.181584470241354]
  offline reinforcement learning and Transformer-based sequence modeling have shown promise for learning bidding policies from logged data.<n>We propose DRIVE, a unified Transformer-based framework that decouples candidate action generation from decision making for offline auto-bidding.<n>Experiments on AuctionNet and additional offline reinforcement learning benchmarks demonstrate that DRIVE consistently improves bidding performance and generalizes well across multiple Transformer-based methods.
  arXiv  Detail & Related papers  (2026-06-12T07:21:07Z)
• Unbiased Dynamic Pruning for Efficient Group-Based Policy Optimization [60.87651283510059]
  Group Relative Policy Optimization (GRPO) effectively scales LLM reasoning but incurs prohibitive computational costs.<n>We propose Dynamic Pruning Policy Optimization (DPPO), a framework that enables dynamic pruning while preserving unbiased gradient estimation.<n>To mitigate the data sparsity induced by pruning, we introduce Dense Prompt Packing, a window-based greedy strategy.
  arXiv  Detail & Related papers  (2026-03-04T14:48:53Z)
• Learning Personalized Ad Impact via Contextual Reinforcement Learning under Delayed Rewards [36.029144318322686]
  We model ad bidding as a Contextual Markov Decision Process (CMDP) with delayed Poisson rewards.<n>For efficient estimation, we propose a two-stage maximum likelihood estimator combined with data-splitting strategies.<n>We design a reinforcement learning algorithm to derive efficient personalized bidding strategies.
  arXiv  Detail & Related papers  (2025-10-22T22:08:36Z)
• Generative Bid Shading in Real-Time Bidding Advertising [7.7746704524695485]
  This paper introduces Generative Bid Shading(GBS) as an end-to-end generative model.<n>It incorporates an autoregressive approach to generate ratios by capturing stepwise residual reward models.<n>It has been deployed on the Meit platform serving billions of bid requests daily.
  arXiv  Detail & Related papers  (2025-08-06T03:34:49Z)
• Cost-aware Stopping for Bayesian Optimization [46.95172329282389]
  We propose a cost-aware stopping rule for Bayesian optimization that adapts to varying evaluation costs and is free of tuning.<n>We prove a theoretical guarantee bounding the expected cumulative evaluation cost incurred by our stopping rule when paired with state-of-the-art acquisition functions.
  arXiv  Detail & Related papers  (2025-07-16T17:54:14Z)
• 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)
• 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)
• Provably Mitigating Overoptimization in RLHF: Your SFT Loss is Implicitly an Adversarial Regularizer [52.09480867526656]
  We identify the source of misalignment as a form of distributional shift and uncertainty in learning human preferences.<n>To mitigate overoptimization, we first propose a theoretical algorithm that chooses the best policy for an adversarially chosen reward model.<n>Using the equivalence between reward models and the corresponding optimal policy, the algorithm features a simple objective that combines a preference optimization loss and a supervised learning loss.
  arXiv  Detail & Related papers  (2024-05-26T05:38:50Z)
• Demystifying Advertising Campaign Bid Recommendation: A Constraint target CPA Goal Optimization [19.857681941728597]
  This paper presents a bid optimization scenario to achieve the desired cost-per-acquisition (tCPA) goals for advertisers. We build the optimization engine to make a decision by solving the rigorously formalized constrained optimization problem. The proposed model can naturally recommend the bid that meets the advertisers' expectations by making inference over advertisers' historical auction behaviors.
  arXiv  Detail & Related papers  (2022-12-26T07:43:26Z)
• Mitigating Algorithmic Bias with Limited Annotations [65.060639928772]
  When sensitive attributes are not disclosed or available, it is needed to manually annotate a small part of the training data to mitigate bias. We propose Active Penalization Of Discrimination (APOD), an interactive framework to guide the limited annotations towards maximally eliminating the effect of algorithmic bias. APOD shows comparable performance to fully annotated bias mitigation, which demonstrates that APOD could benefit real-world applications when sensitive information is limited.
  arXiv  Detail & Related papers  (2022-07-20T16:31:19Z)
• Dynamic Knapsack Optimization Towards Efficient Multi-Channel Sequential Advertising [52.3825928886714]
  We formulate the sequential advertising strategy optimization as a dynamic knapsack problem. We propose a theoretically guaranteed bilevel optimization framework, which significantly reduces the solution space of the original optimization space. To improve the exploration efficiency of reinforcement learning, we also devise an effective action space reduction approach.
  arXiv  Detail & Related papers  (2020-06-29T18:50:35Z)
• Reserve Price Optimization for First Price Auctions [14.18752189817994]
  We propose a gradient-based algorithm to adaptively update and optimize reserve prices based on estimates of bidders' responsiveness to experimental shocks in reserves. We show that revenue in a first-price auction can be usefully decomposed into a emphdemand component and a emphbidding component, and introduce techniques to reduce the variance of each component.
  arXiv  Detail & Related papers  (2020-06-11T15:35:19Z)
• Optimal Bidding Strategy without Exploration in Real-time Bidding [14.035270361462576]
  maximizing utility with a budget constraint is the primary goal for advertisers in real-time bidding (RTB) systems. Previous works ignore the losing auctions to alleviate the difficulty with censored states. We propose a novel practical framework using the maximum entropy principle to imitate the behavior of the true distribution observed in real-time traffic.
  arXiv  Detail & Related papers  (2020-03-31T20:43:28Z)

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.