Trajectory-wise Iterative Reinforcement Learning Framework for Auto-bidding
Haoming Li, Yusen Huo, Shuai Dou, Zhenzhe Zheng, Zhilin Zhang, Chuan Yu, Jian Xu, Fan Wu
Abstract
In online advertising, advertisers participate in ad auctions to acquire ad opportunities, often by utilizing auto-bidding tools provided by demand-side platforms (DSPs). The current auto-bidding algorithms typically employ reinforcement learning (RL). However, due to safety concerns, most RL-based auto-bidding policies are trained in simulation, leading to a performance degradation when deployed in online environments. To narrow this gap, we can deploy multiple auto-bidding agents in parallel to collect a large interaction dataset. Offline RL algorithms can then be utilized to train a new policy. The trained policy can subsequently be deployed for further data collection, resulting in an iterative training framework, which we refer to as iterative offline RL. In this work, we identify the performance bottleneck of this iterative offline RL framework, which originates from the ineffective exploration and exploitation caused by the inherent conservatism of offline RL algorithms. To overcome this bottleneck, we propose Trajectory-wise Exploration and Exploitation (TEE), which introduces a novel data collecting and data utilization method for iterative offline RL from a trajectory perspective. Furthermore, to ensure the safety of online exploration while preserving the dataset quality for TEE, we propose Safe Exploration by Adaptive Action Selection (SEAS). Both offline experiments and real-world experiments on Alibaba display advertising platform demonstrate the effectiveness of our proposed method.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 020039bf-f0fb-4f77-b845-b238ea3a56d3Cited by top-tier papers3
- DARA: Few-shot Budget Allocation in Online Advertising via In-Context Decision Making with RL-Finetuned LLMsMingxuan Song, Yusen Huo, Bohan Zhou, Shenglin Yin et al.WWW 2026 · 1 citation
- Generative Auto-Bidding with Unified Modeling and ExplorationMingming Zhang, Feiqing Zhuang, Na Li, Shengjie Sun et al.SIGIR 2026
- Constrained Auto-Bidding via Generative Response ModelingEunseok Yang, Xingdong Zuo, Kyung-Min KimKDD 2026
Builds on8
- Conservative Q-Learning for Offline Reinforcement LearningAviral Kumar, Aurick Zhou, George Tucker, Sergey LevineNeurIPS 2020 · 2,881 citations
- Offline Reinforcement Learning with Implicit Q-LearningIlya Kostrikov, Ashvin Nair, Sergey LevineICLR 2022 · 1,402 citations
- A Minimalist Approach to Offline Reinforcement LearningScott Fujimoto, Shixiang Shane GuNeurIPS 2021 · 1,292 citations
- Bridging Offline Reinforcement Learning and Imitation Learning: A Tale of PessimismParia Rashidinejad, Banghua Zhu, Cong Ma, Jiantao Jiao et al.NeurIPS 2021 · 373 citations
- Offline RL Without Off-Policy EvaluationDavid Brandfonbrener, Will Whitney, Rajesh Ranganath, Joan BrunaNeurIPS 2021 · 217 citations
Related papers
- Sustainable Online Reinforcement Learning for Auto-biddingZhiyu Mou, Yusen Huo, Rongquan Bai, Mingzhou Xie et al.NeurIPS 2022 · 53 citations
- Enhancing Generative Auto-bidding with Offline Reward Evaluation and Policy SearchZhiyu Mou, Yiqin Lv, Miao Xu, Qi Wang et al.ICLR 2026 · 4 citations
- DRIVE: Distributional and Retrieval-Augmented Bidding with Value EvaluationMiduo Cui, Haochen Wang, Shangqin Mao, Xun Yang et al.ICML 2026 · 1 citation
- Generative Auto-Bidding with Value-Guided ExplorationsJingtong Gao, Yewen Li, Shuai Mao, Peng Jiang et al.SIGIR 2025 · 7 citations
- Adversarial Gradient Driven Exploration for Deep Click-Through Rate PredictionKailun Wu, Weijie Bian, Zhangming Chan, Lejian Ren et al.KDD 2022 · 11 citations
