mlsanityData to 7 Oct 2026

Trajectory-wise Iterative Reinforcement Learning Framework for Auto-bidding

arXiv 2402.15102 ↗First posted 23 Feb 2024cs.LG cs.AI cs.GTcited by 9

On the map: Offline RL and imitation learning from data → Decision transformers and sequence modeling

Abstract (arXiv)

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.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Placed in Decision transformers and sequence modeling, one of 13 directions in Offline RL and imitation learning from data. Builds on 21 of its 34 references that are in the map. First posted on arXiv 23 Feb 2024.

Builds on

21 of 34 references.

References · 21

  1. 2015Continuous control with deep reinforcement learningcited by 3,279
  2. 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
  3. 2020Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problemscited by 1,873
  4. 2020Conservative Q-Learning for Offline Reinforcement Learningcited by 1,777
  5. 2021Offline Reinforcement Learning with Implicit Q-Learningcited by 1,245
  6. 2018Off-Policy Deep Reinforcement Learning without Explorationcited by 1,227
  7. 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,173
  8. 2021A Minimalist Approach to Offline Reinforcement Learningcited by 882
  9. 2019Stabilizing Off-Policy Q-Learning via Bootstrapping Error Reductioncited by 833
  10. 2017Rainbow: Combining Improvements in Deep Reinforcement Learningcited by 774
  11. 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 632
  12. 2020Agent57: Outperforming the Atari Human Benchmarkcited by 300
9 more
  1. 2021Bridging Offline Reinforcement Learning and Imitation Learning: A Tale of Pessimismcited by 275
  2. 2017Count-Based Exploration with Neural Density Modelscited by 255
  3. 2017Parameter Space Noise for Explorationcited by 158
  4. 2020Deployment-Efficient Reinforcement Learning via Model-Based Offline Optimizationcited by 120
  5. 2017Real-Time Bidding by Reinforcement Learning in Display Advertisingcited by 90
  6. 2018Budget Constrained Bidding by Model-free Reinforcement Learning in Display Advertisingcited by 60
  7. 2022Sustainable Online Reinforcement Learning for Auto-biddingcited by 28
  8. 2022Boosting Offline Reinforcement Learning via Data Rebalancingcited by 22
  9. 2016Optimal Real-Time Bidding Frameworks Discussioncited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 2; 2026: 6.

9 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Enhancing Generative Auto-bidding with Offline Reward Evaluation and Policy Search
  2. 2026DRIVE: Distributional and Retrieval-Augmented Bidding with Value Evaluation
  3. 2023Offline Reinforcement Learning for Optimizing Production Bidding Policies
  4. 2025Optimal Return-to-Go Guided Decision Transformer for Auto-Bidding in Advertisement
  5. 2021Accelerating Offline Reinforcement Learning Application in Real-Time Bidding and Recommendation: Potential Use of Simulation
  6. 2025Expert-Guided Diffusion Planner for Auto-Bidding
  7. 2024AIGB: Generative Auto-bidding via Conditional Diffusion Modeling
  8. 2025Permutation Equivariant Model-based Offline Reinforcement Learning for Auto-bidding