2026
Instance-Dependent Fixed-Budget Pure Exploration in Reinforcement Learning
ICLR 2026poster
We study the problem of fixed budget pure exploration in reinforcement learning. The goal is to identify a near-optimal policy, given a fixed budget on the number of interactions with the environment. Unlike the standard PAC setting, we do not require the target error level $\epsilon$ and failure ra…