mlsanityData to 14 Oct 2026

Offline Data Enhanced On-Policy Policy Gradient with Provable Guarantees

arXiv 2311.08384 ↗First posted 14 Nov 2023cs.LG cs.AI stat.MLcited by 11

On the map: Offline RL and imitation learning from data → Offline RL algorithms

Abstract (arXiv)

Hybrid RL is the setting where an RL agent has access to both offline data and online data by interacting with the real-world environment. In this work, we propose a new hybrid RL algorithm that combines an on-policy actor-critic method with offline data. On-policy methods such as policy gradient and natural policy gradient (NPG) have shown to be more robust to model misspecification, though sometimes it may not be as sample efficient as methods that rely on off-policy learning. On the other hand, offline methods that depend on off-policy training often require strong assumptions in theory and are less stable to train in practice. Our new approach integrates a procedure of off-policy training on the offline data into an on-policy NPG framework. We show that our approach, in theory, can obtain a best-of-both-worlds type of result -- it achieves the state-of-art theoretical guarantees of offline RL when offline RL-specific assumptions hold, while at the same time maintaining the theoretical guarantees of on-policy NPG regardless of the offline RL assumptions' validity. Experimentally, in challenging rich-observation environments, we show that our approach outperforms a state-of-the-art hybrid RL baseline which only relies on off-policy policy optimization, demonstrating the empirical benefit of combining on-policy and off-policy learning. Our code is publicly available at https://github.com/YifeiZhou02/HNPG.

Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Placed in Offline RL algorithms, one of 13 directions in Offline RL and imitation learning from data. Builds on 35 of its 52 references that are in the map. First posted on arXiv 14 Nov 2023.

Builds on

35 of 52 references.

Closest ancestors · 11

Same direction, newest first

  1. 2023ENOTO: Improving Offline-to-Online Reinforcement Learning with Q-Ensembles12 Jun
  2. 2023Cal-QL: Calibrated Offline RL Pre-Training for Efficient Online Fine-Tuning9 Mar
  3. 2023The In-Sample Softmax for Offline Reinforcement Learning28 Feb
  4. 2022The Role of Coverage in Online Reinforcement Learning9 Oct
  5. 2021Offline Reinforcement Learning: Fundamental Barriers for Value Function Approximation21 Nov
  6. 2021Representation Learning for Online and Offline RL in Low-rank MDPs9 Oct
  7. 2021Pessimistic Model-based Offline Reinforcement Learning under Partial Coverage13 Jul
  8. 2021Offline-to-Online Reinforcement Learning via Balanced Replay and Pessimistic Q-Ensemble1 Jul
  9. 2021Bellman-consistent Pessimism for Offline Reinforcement Learning13 Jun
  10. 2021Corruption-Robust Offline Reinforcement Learning11 Jun
  11. 2020Conservative Q-Learning for Offline Reinforcement Learning8 Jun

Other references · 24

  1. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
  2. 2022Training language models to follow instructions with human feedbackcited by 15,971
  3. 2017Proximal Policy Optimization Algorithmscited by 15,215
  4. 2015Trust Region Policy Optimizationcited by 2,580
  5. 2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 2,026
  6. 2021Ego4D: Around the World in 3,000 Hours of Egocentric Videocited by 1,556
  7. 2018Soft Actor-Critic Algorithms and Applicationscited by 1,240
  8. 2019Dota 2 with Large Scale Deep Reinforcement Learningcited by 1,103
  9. 2019Stabilizing Off-Policy Q-Learning via Bootstrapping Error Reductioncited by 840
  10. 2019Solving Rubik's Cube with a Robot Handcited by 734
  11. 2022MineDojo: Building Open-Ended Embodied Agents with Internet-Scale Knowledgecited by 478
  12. 2023Efficient Online Reinforcement Learning with Offline Datacited by 363
12 more
  1. 2019Information-Theoretic Considerations in Batch Reinforcement Learningcited by 287
  2. 2021Bellman Eluder Dimension: New Rich Classes of RL Problems, and Sample-Efficient Algorithmscited by 223
  3. 2021Bilinear Classes: A Structural Framework for Provable Generalization in RLcited by 178
  4. 2019Provably efficient RL with Rich Observations via Latent State Decodingcited by 169
  5. 2022Hybrid RL: Using Both Offline and Online Data Can Make RL Efficientcited by 161
  6. 2019Kinematic State Abstraction and Provably Efficient Rich-Observation Reinforcement Learningcited by 114
  7. 2020PC-PG: Policy Cover Directed Exploration for Provable Policy Gradient Learningcited by 92
  8. 2016Q-Prop: Sample-Efficient Policy Gradient with An Off-Policy Criticcited by 81
  9. 2022Efficient Reinforcement Learning in Block MDPs: A Model-free Representation Learning Approachcited by 51
  10. 2017Interpolated Policy Gradient: Merging On-Policy and Off-Policy Gradient Estimation for Deep Reinforcement Learningcited by 40
  11. 2022Provable Benefits of Representational Transfer in Reinforcement Learningcited by 38
  12. 2023Representation Learning with Multi-Step Inverse Kinematics: An Efficient and Optimal Approach to Rich-Observation RLcited by 22

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 7; 2025: 1; 2026: 3.

11 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2022Offline RL Policies Should be Trained to be Adaptive
  2. 2021NeoRL: A Near Real-World Benchmark for Offline Reinforcement Learning
  3. 2025Evaluation-Time Policy Switching for Offline Reinforcement Learning
  4. 2025Augmenting Online RL with Offline Data is All You Need: A Unified Hybrid RL Algorithm Design and Analysis
  5. 2022Leveraging Offline Data in Online Reinforcement Learning
  6. 2026Action-Free Offline-to-Online RL via Discretised State Policies
  7. 2023Finetuning from Offline Reinforcement Learning: Challenges, Trade-offs and Practical Solutions
  8. 2023Adaptive Policy Learning for Offline-to-Online Reinforcement Learning