mlsanityData to 7 Oct 2026

Optimistic Curiosity Exploration and Conservative Exploitation with Linear Reward Shaping

arXiv 2209.07288 ↗First posted 15 Sep 2022cs.LG cs.AIcited by 6

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

Abstract (arXiv)

In this work, we study the simple yet universally applicable case of reward shaping in value-based Deep Reinforcement Learning (DRL). We show that reward shifting in the form of the linear transformation is equivalent to changing the initialization of the Q-function in function approximation. Based on such an equivalence, we bring the key insight that a positive reward shifting leads to conservative exploitation, while a negative reward shifting leads to curiosity-driven exploration. Accordingly, conservative exploitation improves offline RL value estimation, and optimistic value estimation improves exploration for online RL. We validate our insight on a range of RL tasks and show its improvement over baselines: (1) In offline RL, the conservative exploitation leads to improved performance based on off-the-shelf algorithms; (2) In online continuous control, multiple value functions with different shifting constants can be used to tackle the exploration-exploitation dilemma for better sample efficiency; (3) In discrete control tasks, a negative reward shifting yields an improvement over the curiosity-based exploration method.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Placed in Offline RL algorithms, one of 13 directions in Offline RL and imitation learning from data. Builds on 55 of its 92 references that are in the map. First posted on arXiv 15 Sep 2022.

Builds on

55 of 92 references.

Closest ancestors · 6

Same direction, newest first

  1. 2022RORL: Robust Offline Reinforcement Learning via Conservative Smoothing6 Jun
  2. 2021Uncertainty-Based Offline Reinforcement Learning with Diversified Q-Ensemble4 Oct
  3. 2021Risk-Averse Offline Reinforcement Learning10 Feb
  4. 2020D4RL: Datasets for Deep Data-Driven Reinforcement Learning15 Apr
  5. 2020Keep Doing What Worked: Behavioral Modelling Priors for Offline Reinforcement Learning19 Feb
  6. 2019Behavior Regularized Offline Reinforcement Learning26 Nov

Other references · 49

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
  3. 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
  4. 2015Continuous control with deep reinforcement learningcited by 3,279
  5. 2015Trust Region Policy Optimizationcited by 2,503
  6. 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
  7. 2018Off-Policy Deep Reinforcement Learning without Explorationcited by 1,227
  8. 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,173
  9. 2017Hindsight Experience Replaycited by 1,096
  10. 2019Dota 2 with Large Scale Deep Reinforcement Learningcited by 1,084
  11. 2018Exploration by Random Network Distillationcited by 966
  12. 2019Stabilizing Off-Policy Q-Learning via Bootstrapping Error Reductioncited by 833
37 more
  1. 2017A Distributional Perspective on Reinforcement Learningcited by 743
  2. 2018Diversity is All You Need: Learning Skills without a Reward Functioncited by 734
  3. 2019Solving Rubik's Cube with a Robot Handcited by 699
  4. 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 632
  5. 2016Deep Exploration via Bootstrapped DQNcited by 518
  6. 2017Minimax Regret Bounds for Reinforcement Learningcited by 500
  7. 2016RL2: Fast Reinforcement Learning via Slow Reinforcement Learningcited by 490
  8. 2018Is Q-learning Provably Efficient?cited by 485
  9. 2017Distributional Reinforcement Learning with Quantile Regressioncited by 464
  10. 2019Dynamics-Aware Unsupervised Discovery of Skillscited by 308
  11. 2016#Exploration: A Study of Count-Based Exploration for Deep Reinforcement Learningcited by 307
  12. 2021Randomized Ensembled Double Q-Learning: Learning Fast Without a Modelcited by 278
  13. 2018Large-Scale Study of Curiosity-Driven Learningcited by 277
  14. 2018Multi-Goal Reinforcement Learning: Challenging Robotics Environments and Request for Researchcited by 256
  15. 2017Count-Based Exploration with Neural Density Modelscited by 255
  16. 2017Automated Curriculum Learning for Neural Networkscited by 251
  17. 2018Randomized Prior Functions for Deep Reinforcement Learningcited by 218
  18. 2019Go-Explore: a New Approach for Hard-Exploration Problemscited by 207
  19. 2017Teacher-Student Curriculum Learningcited by 197
  20. 2018Distributed Distributional Deterministic Policy Gradientscited by 195
  21. 2016Sample Efficient Actor-Critic with Experience Replaycited by 185
  22. 2017Reverse Curriculum Generation for Reinforcement Learningcited by 185
  23. 2020SUNRISE: A Simple Unified Framework for Ensemble Learning in Deep Reinforcement Learningcited by 150
  24. 2018Self-Imitation Learningcited by 135
  25. 2020Phasic Policy Gradientcited by 121
  26. 2019Teacher algorithms for curriculum learning of Deep RL in continuously parameterized environmentscited by 113
  27. 2020Conservative Safety Critics for Explorationcited by 107
  28. 2022Rethinking Goal-conditioned Supervised Learning and Its Connection to Offline RLcited by 89
  29. 2019Better Exploration with Optimistic Actor-Criticcited by 88
  30. 2019Estimating Risk and Uncertainty in Deep Reinforcement Learningcited by 68
  31. 2019A Comparative Analysis of Expected and Distributional Reinforcement Learningcited by 47
  32. 2018DORA The Explorer: Directed Outreaching Reinforcement Action-Selectioncited by 27
  33. 2020Optimistic Exploration even with a Pessimistic Initialisationcited by 25
  34. 2019Policy Continuation with Hindsight Inverse Dynamicscited by 22
  35. 2019Distributional Policy Optimization: An Alternative Approach for Continuous Controlcited by 21
  36. 2021Model-Free Risk-Sensitive Reinforcement Learningcited by 7
  37. 2020Zeroth-Order Supervised Policy Improvementcited by 6

Built on by

Cited by year

Citing papers per year: 2023: 2; 2024: 3; 2025: 1.

6 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025General Exploratory Bonus for Optimistic Exploration in RLHF
  2. 2025Towards Efficient Online Exploration for Reinforcement Learning with Human Feedback
  3. 2022Provably Efficient Offline Reinforcement Learning with Trajectory-Wise Reward
  4. 2025CDE: Curiosity-Driven Exploration for Efficient Reinforcement Learning in Large Language Models
  5. 2026Modification-Considering Value Learning for Reward Hacking Mitigation in RL
  6. 2026Peng's Q(λ) for Conservative Value Estimation in Offline Reinforcement Learning
  7. 2026Robo-ValueRL: Reliable Value Estimation for Offline-to-Online Reinforcement Learning
  8. 2024Strategically Conservative Q-Learning