Exploitation Is All You Need... for Exploration
On the map: Deep reinforcement learning methods → Deep RL algorithms and representations
Abstract (arXiv)
Ensuring sufficient exploration is a central challenge when training meta-reinforcement learning (meta-RL) agents to solve novel environments. Conventional solutions to the exploration-exploitation dilemma inject explicit incentives such as randomization, uncertainty bonuses, or intrinsic rewards to encourage exploration. In this work, we hypothesize that an agent trained solely to maximize a greedy (exploitation-only) objective can nonetheless exhibit emergent exploratory behavior, provided three conditions are met: (1) Recurring Environmental Structure, where the environment features repeatable regularities that allow past experience to inform future choices; (2) Agent Memory, enabling the agent to retain and utilize historical interaction data; and (3) Long-Horizon Credit Assignment, where learning propagates returns over a time frame sufficient for the delayed benefits of exploration to inform current decisions. Through experiments in stochastic multi-armed bandits and temporally extended gridworlds, we observe that, when both structure and memory are present, a policy trained on a strictly greedy objective exhibits information-seeking exploratory behavior. We further demonstrate, through controlled ablations, that emergent exploration vanishes if either environmental structure or agent memory is absent (Conditions 1 & 2). Surprisingly, removing long-horizon credit assignment (Condition 3) does not always prevent emergent exploration-a result we attribute to the pseudo-Thompson Sampling effect. These findings suggest that, under the right prerequisites, exploration and exploitation need not be treated as orthogonal objectives but can emerge from a unified reward-maximization process.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Deep RL algorithms and representations, one of 15 directions in Deep reinforcement learning methods. Builds on 14 of its 24 references that are in the map. First posted on arXiv 2 Aug 2025.
Builds on
14 of 24 references.
Closest ancestors · 1
Same direction, newest first
Other references · 13
- 2021Decision Transformer: Reinforcement Learning via Sequence Modelingcited by 1,546
- 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,194
- 2018Exploration by Random Network Distillationcited by 993
- 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 639
- 2016RL2: Fast Reinforcement Learning via Slow Reinforcement Learningcited by 503
- 2015Deep Recurrent Q-Learning for Partially Observable MDPscited by 465
- 2016Learning to reinforcement learncited by 377
- 2016#Exploration: A Study of Count-Based Exploration for Deep Reinforcement Learningcited by 309
- 2018Large-Scale Study of Curiosity-Driven Learningcited by 280
- 2019Stabilizing Transformers for Reinforcement Learningcited by 270
- 2019VariBAD: A Very Good Method for Bayes-Adaptive Deep RL via Meta-Learningcited by 217
- 2017Deep Exploration via Randomized Value Functionscited by 156
1 more
- 2018Count-Based Exploration with the Successor Representationcited by 112
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Look Before You Leap: Autonomous Exploration for LLM Agents
- 2026When Do Intrinsic Rewards Lead to Exploration?
- 2025When Greedy Wins: Emergent Exploitation Bias in Meta-Bandit LLM Training
- 2024Fostering Intrinsic Motivation in Reinforcement Learning with Pretrained Foundation Models
- 2025Meta-Learning to Explore via Memory Density Feedback
- 2024The Exploration-Exploitation Dilemma Revisited: An Entropy Perspective
- 2026Artifacts as Memory Beyond the Agent Boundary
- 2025Illuminating the Three Dogmas of Reinforcement Learning under Evolutionary Light