Corpus ID: 207870436

# Frequentist Regret Bounds for Randomized Least-Squares Value Iteration

@article{Zanette2020FrequentistRB,
title={Frequentist Regret Bounds for Randomized Least-Squares Value Iteration},
author={Andrea Zanette and David Brandfonbrener and M. Pirotta and A. Lazaric},
journal={ArXiv},
year={2020},
volume={abs/1911.00567}
}
• Andrea Zanette, +1 author A. Lazaric
• Published 2020
• Mathematics, Computer Science
• ArXiv
• We consider the exploration-exploitation dilemma in finite-horizon reinforcement learning (RL). When the state space is large or continuous, traditional tabular approaches are unfeasible and some form of function approximation is mandatory. In this paper, we introduce an optimistically-initialized variant of the popular randomized least-squares value iteration (RLSVI), a model-free algorithm where exploration is induced by perturbing the least-squares approximation of the action-value function… CONTINUE READING