mlsanityData to 7 Oct 2026

First-Explore, then Exploit: Meta-Learning to Solve Hard Exploration-Exploitation Trade-Offs

arXiv 2307.02276 ↗First posted 5 Jul 2023cs.LG cs.AIcited by 4

Not on the map. Why?

Abstract (arXiv)

Standard reinforcement learning (RL) agents never intelligently explore like a human (i.e. taking into account complex domain priors and adapting quickly based on previous exploration). Across episodes, RL agents struggle to perform even simple exploration strategies, for example systematic search that avoids exploring the same location multiple times. This poor exploration limits performance on challenging domains. Meta-RL is a potential solution, as unlike standard RL, meta-RL can learn to explore, and potentially learn highly complex strategies far beyond those of standard RL, strategies such as experimenting in early episodes to learn new skills, or conducting experiments to learn about the current environment. Traditional meta-RL focuses on the problem of learning to optimally balance exploration and exploitation to maximize the cumulative reward of the episode sequence (e.g., aiming to maximize the total wins in a tournament -- while also improving as a player). We identify a new challenge with state-of-the-art cumulative-reward meta-RL methods. When optimal behavior requires exploration that sacrifices immediate reward to enable higher subsequent reward, existing state-of-the-art cumulative-reward meta-RL methods become stuck on the local optimum of failing to explore. Our method, First-Explore, overcomes this limitation by learning two policies: one to solely explore, and one to solely exploit. When exploring requires forgoing early-episode reward, First-Explore significantly outperforms existing cumulative meta-RL methods. By identifying and solving the previously unrecognized problem of forgoing reward in early episodes, First-Explore represents a significant step towards developing meta-RL algorithms capable of human-like exploration on a broader range of domains.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 21 of its 30 references that are in the map. First posted on arXiv 5 Jul 2023.

Builds on

21 of 30 references.

References · 21

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
  3. 2021Efficiently Modeling Long Sequences with Structured State Spacescited by 2,424
  4. 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,201
  5. 2021Decision Transformer: Reinforcement Learning via Sequence Modelingcited by 1,528
  6. 2019Solving Rubik's Cube with a Robot Handcited by 699
  7. 2020Long Range Arena: A Benchmark for Efficient Transformerscited by 696
  8. 2016RL2: Fast Reinforcement Learning via Slow Reinforcement Learningcited by 490
  9. 2016Learning to reinforcement learncited by 369
  10. 2019VariBAD: A Very Good Method for Bayes-Adaptive Deep RL via Meta-Learningcited by 210
  11. 2018Optimization of Molecules via Deep Reinforcement Learningcited by 199
  12. 2022In-context Reinforcement Learning with Algorithm Distillationcited by 186
9 more
  1. 2019Paired Open-Ended Trailblazer (POET): Endlessly Generating Increasingly Complex and Diverse Learning Environments and Their Solutionscited by 182
  2. 2023Human-Timescale Adaptation in an Open-Ended Task Spacecited by 136
  3. 2023A Tutorial on Meta-Reinforcement Learningcited by 102
  4. 2020Decoupling Exploration and Exploitation for Meta-Reinforcement Learning without Sacrificescited by 59
  5. 2018Some Considerations on Learning to Explore via Meta-Reinforcement Learningcited by 43
  6. 2019Environment Probing Interaction Policiescited by 39
  7. 2020Towards Effective Context for Meta-Reinforcement Learning: an Approach based on Contrastive Learningcited by 29
  8. 2020Exploration in Approximate Hyper-State Space for Meta Reinforcement Learningcited by 28
  9. 2020MetaCURE: Meta Reinforcement Learning with Empowerment-Driven Explorationcited by 24

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 2.

4 papers.