Generative Auto-Bidding in Large-Scale Competitive Auctions via Diffusion Completer-Aligner

• URL: http://arxiv.org/abs/2509.03348v1
• Date: Wed, 03 Sep 2025 14:25:36 GMT
• Title: Generative Auto-Bidding in Large-Scale Competitive Auctions via Diffusion Completer-Aligner
• Authors: Yewen Li, Jingtong Gao, Nan Jiang, Shuai Mao, Ruyi An, Fei Pan, Xiangyu Zhao, Bo An, Qingpeng Cai, Peng Jiang,
• Abstract summary: We propose a Causal auto-Bidding method based on a Diffusion completer-aligner framework, termed CBD.<n>We employ a trajectory-level return model to refine the generated trajectories, aligning more closely with advertisers' objectives.<n> Experimental results across diverse settings demonstrate that our approach achieves superior performance on large-scale auto-bidding benchmarks.
• Score: 37.31354488152535
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Auto-bidding is central to computational advertising, achieving notable commercial success by optimizing advertisers' bids within economic constraints. Recently, large generative models show potential to revolutionize auto-bidding by generating bids that could flexibly adapt to complex, competitive environments. Among them, diffusers stand out for their ability to address sparse-reward challenges by focusing on trajectory-level accumulated rewards, as well as their explainable capability, i.e., planning a future trajectory of states and executing bids accordingly. However, diffusers struggle with generation uncertainty, particularly regarding dynamic legitimacy between adjacent states, which can lead to poor bids and further cause significant loss of ad impression opportunities when competing with other advertisers in a highly competitive auction environment. To address it, we propose a Causal auto-Bidding method based on a Diffusion completer-aligner framework, termed CBD. Firstly, we augment the diffusion training process with an extra random variable t, where the model observes t-length historical sequences with the goal of completing the remaining sequence, thereby enhancing the generated sequences' dynamic legitimacy. Then, we employ a trajectory-level return model to refine the generated trajectories, aligning more closely with advertisers' objectives. Experimental results across diverse settings demonstrate that our approach not only achieves superior performance on large-scale auto-bidding benchmarks, such as a 29.9% improvement in conversion value in the challenging sparse-reward auction setting, but also delivers significant improvements on the Kuaishou online advertising platform, including a 2.0% increase in target cost.

Related papers

• SEGB: Self-Evolved Generative Bidding with Local Autoregressive Diffusion [9.051746879211764]
  Self-Evolved Generative Bidding (SEGB) is a framework that plans proactively and refines itself entirely offline.<n>SEGB first synthesizes plausible short-horizon future states to guide each bid, providing the agent with crucial, dynamic foresight.<n>It then performs value-guided policy refinement to iteratively discover superior strategies without any external intervention.
  arXiv  Detail & Related papers  (2025-12-31T09:05:59Z)
• HOB: A Holistically Optimized Bidding Strategy under Heterogeneous Auction Mechanisms with Organic Traffic [23.230940625345372]
  E-commerce advertising platforms typically sell commercial traffic through either second-price auction (SPA) or first-price auction (FPA)<n>For automated bidding systems, such a trend poses a critical challenge: determining optimal strategies across heterogeneous auction channels to fulfill diverse advertiser objectives.<n>We derive an efficient solution for optimal bidding under FPA channels, which takes into account the presence of organic traffic - traffic can be won for free.
  arXiv  Detail & Related papers  (2025-10-17T02:00:09Z)
• Practice on Long Behavior Sequence Modeling in Tencent Advertising [75.65309022911994]
  Long-sequence modeling has become an indispensable frontier in recommendation systems for capturing users' long-term preferences.<n>We propose several practical approaches within the two-stage framework for long-sequence modeling.<n> Deployed in production on Tencent's large-scale advertising platforms, our innovations delivered significant performance gains.
  arXiv  Detail & Related papers  (2025-09-10T06:55:57Z)
• Bidding-Aware Retrieval for Multi-Stage Consistency in Online Advertising [30.108437268612438]
  Bidding-Aware Retrieval (BAR) is a model-based retrieval framework that addresses multi-stage inconsistency by incorporating ad bid value into the retrieval scoring function.<n>BAR's core innovation is Bidding-Aware Modeling, incorporating bid signals through monotonicity-constrained learning and multi-task distillation to ensure economically coherent representations.<n>Extensive offline experiments and full-scale deployment across Alibaba's display advertising platform validated BAR's efficacy.
  arXiv  Detail & Related papers  (2025-08-07T09:43:34Z)
• Generative Large-Scale Pre-trained Models for Automated Ad Bidding Optimization [5.460538555236247]
  We propose GRAD (Generative Reward-driven Ad-bidding with Mixture-of-Experts), a scalable foundation model for auto-bidding.<n>We show that GRAD significantly enhances platform revenue, highlighting its effectiveness in addressing the evolving and diverse requirements of modern advertisers.
  arXiv  Detail & Related papers  (2025-08-04T02:46:18Z)
• 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)
• AIGB: Generative Auto-bidding via Conditional Diffusion Modeling [26.283427427408085]
  This paper introduces AI-Generated Bidding (AIGB), a novel paradigm for auto-bidding through generative modeling. In this paradigm, we propose DiffBid, a conditional diffusion modeling approach for bid generation. Experiments conducted on the real-world dataset and online A/B test on Alibaba advertising platform demonstrate the effectiveness of DiffBid.
  arXiv  Detail & Related papers  (2024-05-25T09:21:43Z)
• Online Learning under Budget and ROI Constraints via Weak Adaptivity [57.097119428915796]
  Existing primal-dual algorithms for constrained online learning problems rely on two fundamental assumptions. We show how such assumptions can be circumvented by endowing standard primal-dual templates with weakly adaptive regret minimizers. We prove the first best-of-both-worlds no-regret guarantees which hold in absence of the two aforementioned assumptions.
  arXiv  Detail & Related papers  (2023-02-02T16:30:33Z)
• VFed-SSD: Towards Practical Vertical Federated Advertising [53.08038962443853]
  We propose a semi-supervised split distillation framework VFed-SSD to alleviate the two limitations. Specifically, we develop a self-supervised task MatchedPair Detection (MPD) to exploit the vertically partitioned unlabeled data. Our framework provides an efficient federation-enhanced solution for real-time display advertising with minimal deploying cost and significant performance lift.
  arXiv  Detail & Related papers  (2022-05-31T17:45:30Z)
• A Cooperative-Competitive Multi-Agent Framework for Auto-bidding in Online Advertising [53.636153252400945]
  We propose a general Multi-Agent reinforcement learning framework for Auto-Bidding, namely MAAB, to learn the auto-bidding strategies. Our approach outperforms several baseline methods in terms of social welfare and guarantees the ad platform's revenue.
  arXiv  Detail & Related papers  (2021-06-11T08:07:14Z)
• MoTiAC: Multi-Objective Actor-Critics for Real-Time Bidding [47.555870679348416]
  We propose a Multi-ecTive Actor-Critics algorithm named MoTiAC for the problem of bidding optimization with various goals. Unlike previous RL models, the proposed MoTiAC can simultaneously fulfill multi-objective tasks in complicated bidding environments.
  arXiv  Detail & Related papers  (2020-02-18T07:16:39Z)

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.