Deep Exploration via Randomized Value Functions

2017-03-22 · Ian Osband, Benjamin Van Roy, Daniel Russo, Zheng Wen

We study the use of randomized value functions to guide deep exploration in reinforcement learning. This offers an elegant means for synthesizing statistically and computationally efficient exploration with common practical approaches to value function learning. We present several reinforcement learning algorithms that leverage randomized value functions and demonstrate their efficacy through computational studies. We also prove a regret bound that establishes statistical efficiency with a tabular representation.

📄 PDF Abstract BibTeX arXiv:1703.07608

Code (0)

등록된 구현이 없습니다.

Tasks

Efficient Explorationreinforcement-learning Reinforcement Learning Reinforcement Learning (RL)

Worst-Case Regret Bounds for Exploration via Randomized Value Functions

2019-06-07 · NeurIPS 2019 12 · Daniel Russo

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, maki…

Efficient Exploration reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)

Generalization and Exploration via Randomized Value Functions

2014-02-04 · Ian Osband, Benjamin Van Roy, Zheng Wen

We propose randomized least-squares value iteration (RLSVI) -- a new reinforcement learning algorithm designed to explore and generalize efficiently via linearly parameterized value functions. We explain why versions of …

Efficient Exploration reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)

Near-Optimal Randomized Exploration for Tabular Markov Decision Processes

2021-02-19 · Zhihan Xiong, Ruoqi Shen, Qiwen Cui, Maryam Fazel 외

We study algorithms using randomized value functions for exploration in reinforcement learning. This type of algorithms enjoys appealing empirical performance. We show that when we use 1) a single random seed in each epi…

Randomized Value Functions via Multiplicative Normalizing Flows

2018-06-06 · Ahmed Touati, Harsh Satija, Joshua Romoff, Joelle Pineau 외

Randomized value functions offer a promising approach towards the challenge of efficient exploration in complex environments with high dimensional state and action spaces. Unlike traditional point estimate methods, rando…

Efficient Exploration Thompson Sampling

On Optimistic versus Randomized Exploration in Reinforcement Learning

2017-06-13 · Ian Osband, Benjamin Van Roy

We discuss the relative merits of optimistic and randomized approaches to exploration in reinforcement learning. Optimistic approaches presented in the literature apply an optimistic boost to the value estimate at each s…

Computational Efficiency reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)