← Search

Jee Won Park

2 accepted papers

2020

Exploration in Reinforcement Learning with Deep Covering Options

ICLR 2020poster

While many option discovery methods have been proposed to accelerate exploration in reinforcement learning, they are often heuristic. Recently, covering options was proposed to discover a set of options that provably reduce the upper bound of the environment's cover time, a measure of the difficulty…

Cited by 66SourceScholar
2019

Discovering Options for Exploration by Minimizing Cover Time

ICML 2019oral

One of the main challenges in reinforcement learning is solving tasks with sparse reward. We show that the difficulty of discovering a distant rewarding state in an MDP is bounded by the expected cover time of a random walk over the graph induced by the MDP’s transition dynamics. We therefore propos…

Cited by 64SourcePDFScholar