Generative Large-Scale Pre-trained Models for Automated Ad Bidding Optimization

• URL: http://arxiv.org/abs/2508.02002v1
• Date: Mon, 04 Aug 2025 02:46:18 GMT
• Title: Generative Large-Scale Pre-trained Models for Automated Ad Bidding Optimization
• Authors: Yu Lei, Jiayang Zhao, Yilei Zhao, Zhaoqi Zhang, Linyou Cai, Qianlong Xie, Xingxing Wang,
• Abstract summary: 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.
• Score: 5.460538555236247
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Modern auto-bidding systems are required to balance overall performance with diverse advertiser goals and real-world constraints, reflecting the dynamic and evolving needs of the industry. Recent advances in conditional generative models, such as transformers and diffusers, have enabled direct trajectory generation tailored to advertiser preferences, offering a promising alternative to traditional Markov Decision Process-based methods. However, these generative methods face significant challenges, such as the distribution shift between offline and online environments, limited exploration of the action space, and the necessity to meet constraints like marginal Cost-per-Mille (CPM) and Return on Investment (ROI). To tackle these challenges, we propose GRAD (Generative Reward-driven Ad-bidding with Mixture-of-Experts), a scalable foundation model for auto-bidding that combines an Action-Mixture-of-Experts module for diverse bidding action exploration with the Value Estimator of Causal Transformer for constraint-aware optimization. Extensive offline and online experiments demonstrate that GRAD significantly enhances platform revenue, highlighting its effectiveness in addressing the evolving and diverse requirements of modern advertisers. Furthermore, GRAD has been implemented in multiple marketing scenarios at Meituan, one of the world's largest online food delivery platforms, leading to a 2.18% increase in Gross Merchandise Value (GMV) and 10.68% increase in ROI.

Related papers

• HALO: Hindsight-Augmented Learning for Online Auto-Bidding [2.9058410231275014]
  Digital advertising platforms operate millisecond-level auctions through Real-Time Bidding (RTB) systems.<n>This dynamic mechanism enables precise audience targeting but introduces profound operational complexity.<n>We propose HALO: Hindsight-Augmented Learning for Online Auto-Bidding.
  arXiv  Detail & Related papers  (2025-08-05T09:47:26Z)
• Multi-task Offline Reinforcement Learning for Online Advertising in Recommender Systems [54.709976343045824]
  Current offline reinforcement learning (RL) methods face substantial challenges when applied to sparse advertising scenarios.<n>We propose MTORL, a novel multi-task offline RL model that targets two key objectives.<n>We employ multi-task learning to decode actions and rewards, simultaneously addressing channel recommendation and budget allocation.
  arXiv  Detail & Related papers  (2025-06-29T05:05:13Z)
• The Real Barrier to LLM Agent Usability is Agentic ROI [110.31127571114635]
  Large Language Model (LLM) agents represent a promising shift in human-AI interaction.<n>We highlight a critical usability gap in high-demand, mass-market applications.
  arXiv  Detail & Related papers  (2025-05-23T11:40:58Z)
• EGA-V2: An End-to-end Generative Framework for Industrial Advertising [19.927005856735445]
  We introduce End-to-End Generative Advertising (EGA-V2), the first unified framework that holistically models user interests, point-of-interest (POI) and creative generation, ad allocation, and payment optimization.<n>Our results highlight its potential as a pioneering fully generative advertising solution, paving the way for next-generation industrial ad systems.
  arXiv  Detail & Related papers  (2025-05-23T06:55:02Z)
• WebEvolver: Enhancing Web Agent Self-Improvement with Coevolving World Model [55.276852838877346]
  Self-evolving agents are trained on trajectories sampled autonomously based on their own policies.<n>We propose a novel framework that introduces a co-evolving World Model LLM.<n>This world model predicts the next observation based on the current observation and action within the web environment.
  arXiv  Detail & Related papers  (2025-04-23T02:54:31Z)
• External Large Foundation Model: How to Efficiently Serve Trillions of Parameters for Online Ads Recommendation [58.49335224405165]
  Ads recommendation is a prominent service of online advertising systems and has been actively studied.<n>Recent studies indicate that scaling-up and advanced design of the recommendation model can bring significant performance improvement.<n>However, with a larger model scale, such prior studies have a significantly increasing gap from industry as they often neglect two fundamental challenges in industrial-scale applications.
  arXiv  Detail & Related papers  (2025-02-20T22:35:52Z)
• GAS: Generative Auto-bidding with Post-training Search [26.229396732360787]
  We propose a flexible and practical Generative Auto-bidding scheme using post-training Search, termed GAS, to refine a base policy model's output.<n>Experiments conducted on the real-world dataset and online A/B test on the Kuaishou advertising platform demonstrate the effectiveness of GAS.
  arXiv  Detail & Related papers  (2024-12-22T13:47:46Z)
• 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)
• Refined Mechanism Design for Approximately Structured Priors via Active Regression [50.71772232237571]
  We consider the problem of a revenue-maximizing seller with a large number of items for sale to $n$ strategic bidders. It is well-known that optimal and even approximately-optimal mechanisms for this setting are notoriously difficult to characterize or compute.
  arXiv  Detail & Related papers  (2023-10-11T20:34:17Z)
• ROI Constrained Bidding via Curriculum-Guided Bayesian Reinforcement Learning [34.82004227655201]
  We specialize in ROI-Constrained Bidding in non-stationary markets. Based on a Partially Observable Constrained Markov Decision Process, we propose the first hard barrier solution to accommodate non-monotonic constraints. Our method exploits a parameter-free indicator-augmented reward function and develops a Curriculum-Guided Bayesian Reinforcement Learning framework.
  arXiv  Detail & Related papers  (2022-06-10T17:30:12Z)
• 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.