Skip to content
conftrace_

near-minimax optimal

1 paper

Explore in graph

Co-occurring keywords · papers mentioning both

parallel exploration (1) reward-free reinforcement learning (1) reward-free exploration (1) markov game (1) linear mdp (1) reinforcement learning (1)

Papers

One Policy is Enough: Parallel Exploration with a Single Policy is Near-Optimal for Reward-Free Reinforcement Learning AISTATS 2023