Skip to main navigation Skip to search Skip to main content

Generative Auto-Bidding with Value-Guided Explorations

Jingtong Gao, Yewen Li, Shuai Mao, Peng Jiang, Nan Jiang, Yejing Wang, Qingpeng Cai*, Fei Pan, Peng Jiang, Kun Gai, Bo An, Xiangyu Zhao*

*Corresponding author for this work

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

Abstract

Auto-bidding, with its strong capability to optimize bidding decisions within dynamic and competitive online environments, has become a pivotal strategy for advertising platforms. Existing approaches typically employ rule-based strategies or Reinforcement Learning (RL) techniques. However, rule-based strategies lack the flexibility to adapt to time-varying market conditions, and RL-based methods struggle to capture essential historical dependencies and observations within Markov Decision Process (MDP) frameworks. Furthermore, these approaches often face challenges in ensuring strategy adaptability across diverse advertising objectives. Additionally, as offline training methods are increasingly adopted to facilitate the deployment and maintenance of stable online strategies, the issues of documented behavioral patterns and behavioral collapse resulting from training on fixed offline datasets become increasingly significant. To address these limitations, this paper introduces a novel offline Generative Auto-bidding framework with Value-Guided Explorations (GAVE). GAVE accommodates various advertising objectives through a score-based Return-To-Go (RTG) module. Moreover, GAVE integrates an action exploration mechanism with an RTG-based evaluation method to explore novel actions while ensuring stability-preserving updates. A learnable value function is also designed to guide the direction of action exploration and mitigate Out-of-Distribution (OOD) problems. Experimental results on two offline datasets and real-world deployments demonstrate that GAVE outperforms state-of-the-art baselines in both offline evaluations and online A/B tests. By applying the core methods of this framework, we proudly secured first place in the NeurIPS 2024 competition, ‘AIGB Track: Learning Auto-Bidding Agents with Generative Models’ 1. The implementation code is publicly available to facilitate reproducibility and further research. © 2025 Copyright held by the owner/author(s).
Original languageEnglish
Title of host publicationSIGIR 2025 - Proceedings of the 48th International ACM SIGIR Conference on Research and Development in Information Retrieval
PublisherAssociation for Computing Machinery
Pages244-254
ISBN (Print)9798400715921
DOIs
Publication statusPublished - Jul 2025
Event48th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2025) - Padova Congress Center, Padua, Italy
Duration: 13 Jul 202517 Jul 2025
https://sigir2025.dei.unipd.it/

Publication series

NameSIGIR - Proceedings of the 48th International ACM SIGIR Conference on Research and Development in Information Retrieval

Conference

Conference48th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2025)
Abbreviated titleSIGIR '25
PlaceItaly
CityPadua
Period13/07/2517/07/25
Internet address

Bibliographical note

Full text of this publication does not contain sufficient affiliation information. With consent from the author(s) concerned, the Research Unit(s) information for this record is based on the existing academic department affiliation of the author(s).

Funding

This research was partially supported by Kuaishou, Research Impact Fund (No. R1015-23), and Collaborative Research Fund (No. C104324GF).

Research Keywords

  • Auto-bidding
  • Decision Transformer
  • Generative Model

RGC Funding Information

  • RGC-funded

Fingerprint

Dive into the research topics of 'Generative Auto-Bidding with Value-Guided Explorations'. Together they form a unique fingerprint.

Cite this