Learning to Explore in Diverse Reward Settings via Temporal-Difference-Error Maximization
On the map: Deep reinforcement learning methods → Deep RL algorithms and representations
Abstract (arXiv)
Numerous heuristics and advanced approaches have been proposed for exploration in different settings for deep reinforcement learning. Noise-based exploration generally fares well with dense-shaped rewards and bonus-based exploration with sparse rewards. However, these methods usually require additional tuning to deal with undesirable reward settings by adjusting hyperparameters and noise distributions. Rewards that actively discourage exploration, i.e., with an action cost and no other dense signal to follow, can pose a major challenge. We propose a novel exploration method, Stable Error-seeking Exploration (SEE), that is robust across dense, sparse, and exploration-adverse reward settings. To this endeavor, we revisit the idea of maximizing the TD-error as a separate objective. Our method introduces three design choices to mitigate instability caused by far-off-policy learning, the conflict of interest of maximizing the cumulative TD-error in an episodic setting, and the non-stationary nature of TD-errors. SEE can be combined with off-policy algorithms without modifying the optimization pipeline of the original objective. In our experimental analysis, we show that a Soft-Actor Critic agent with the addition of SEE performs robustly across three diverse reward settings in a variety of tasks without hyperparameter adjustments.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Placed in Deep RL algorithms and representations, one of 15 directions in Deep reinforcement learning methods. Builds on 19 of its 26 references that are in the map. First posted on arXiv 16 Jun 2025.
Builds on
19 of 26 references.
Closest ancestors · 2
Same direction, newest first
- 2024MaxInfoRL: Boosting exploration in reinforcement learning through information gain maximization16 Dec
- 2024To the Max: Reinventing Reward in Reinforcement Learning2 Feb
Other references · 17
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
- 2015Continuous control with deep reinforcement learningcited by 3,407
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,274
- 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,417
- 2018Off-Policy Deep Reinforcement Learning without Explorationcited by 1,241
- 2018Soft Actor-Critic Algorithms and Applicationscited by 1,240
- 2017Hindsight Experience Replaycited by 1,136
- 2018Exploration by Random Network Distillationcited by 993
- 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 639
- 2017Noisy Networks for Explorationcited by 266
- 2021On Bonus-Based Exploration Methods in the Arcade Learning Environmentcited by 37
- 2020Parameter-Based Value Functionscited by 24
5 more
- 2019Q-Learning for Continuous Actions with Cross-Entropy Guided Policiescited by 18
- 2021Collect & Infer -- a fresh look at data-efficient Reinforcement Learningcited by 17
- 2021Decoupled Exploration and Exploitation Policies for Sample-Efficient Reinforcement Learningcited by 14
- 2020Maximum Reward Formulation In Reinforcement Learningcited by 10
- 2022General Policy Evaluation and Improvement by Learning to Identify Few But Crucial Statescited by 10
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.
- 2026Contextual Intelligence The Next Leap for Reinforcement Learningcited by 1
- 2025Subjective functionscited by 0
- 2026Contextual Intelligence The Next Leap for Reinforcement Learning17 Feb 2026
- 2025Subjective functions17 Dec 2025
Similar, not cited
Close in wording, no citation either way
- 2024Deterministic Exploration via Stationary Bellman Error Maximization
- 2025Exploration by Random Reward Perturbation
- 2025Beyond Noisy-TVs: Noise-Robust Exploration Via Learning Progress Monitoring
- 2024Beyond Optimism: Exploration With Partially Observable Rewards
- 2026Learning to Explore with Parameter-Space Noise: A Deep Dive into Parameter-Space Noise for Reinforcement Learning with Verifiable Rewards
- 2026Emergence of Exploration in Policy Gradient Reinforcement Learning via Retrying
- 2024VDSC: Enhancing Exploration Timing with Value Discrepancy and State Counts
- 2024Hyper: Hyperparameter Robust Efficient Exploration in Reinforcement Learning