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

Source: [First-Explore, then Exploit: Meta-Learning to Solve Hard Exploration-Exploitation Trade-Offs](<https://www.sota2.com/research/paper/68fa75871e209131cea68644>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2026-01-02T07:58:56.406Z

Authors: Ben Norman, Jeff Clune

Published: 2023-07-05T13:20:21.000Z

## Abstract

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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

- [Cumulative Reward Maximization on Bandits with One Fixed Arm](<https://www.sota2.com/research/sota/cumulative-reward-maximization-on-bandits-with-one-fixed-arm.md>): Cumulative Reward Maximization; Bandits with One Fixed Arm; Mean Cumulative Reward: 127.7.

- [Cumulative Reward Maximization on Dark Treasure Rooms](<https://www.sota2.com/research/sota/cumulative-reward-maximization-on-dark-treasure-rooms.md>): Cumulative Reward Maximization; Dark Treasure Rooms; Mean Cumulative Reward: 2.

- [Cumulative Reward Maximization on Ray Maze](<https://www.sota2.com/research/sota/cumulative-reward-maximization-on-ray-maze.md>): Cumulative Reward Maximization; Ray Maze; Mean Cumulative Reward: 0.47.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2307.02276>)

[PDF](<https://arxiv.org/pdf/2307.02276.pdf>)

[Implementation](<https://github.com/btnorman/First-Explore>)
