Emergent Mind
Worst-Case Regret Bounds for Exploration via Randomized Value Functions
(1906.02870)
Published Jun 7, 2019
in
cs.LG
,
cs.AI
,
cs.SY
,
and
stat.ML
Abstract
This paper studies a recent proposal to use randomized value functions to drive exploration in reinforcement learning. These randomized value functions are generated by injecting random noise into the training data, making the approach compatible with many popular methods for estimating parameterized value functions. By providing a worst-case regret bound for tabular finite-horizon Markov decision processes, we show that planning with respect to these randomized value functions can induce provably efficient exploration.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.