Generative Large-Scale Pre-trained Models for Automated Ad Bidding Optimization
Yu Lei, Jiayang Zhao, Yilei Zhao, Zhaoqi Zhang, Linyou Cai, Qianlong Xie, Xingxing Wang

TL;DR
This paper introduces GRAD, a scalable generative model for automated ad bidding that improves revenue and ROI by addressing challenges in online advertising environments.
Contribution
The paper presents GRAD, a novel foundation model combining a mixture-of-experts and causal transformer for constraint-aware, diverse, and scalable ad bidding optimization.
Findings
GRAD increases platform revenue significantly.
Implementation in Meituan led to 2.18% GMV growth.
ROI improved by 10.68% with GRAD.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConsumer Market Behavior and Pricing · Auction Theory and Applications · Advanced Bandit Algorithms Research
