# Frequentist Regret Bounds for Randomized Least-Squares Value Iteration

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. Under the assumption that the Markov decision process has low-rank transition dynamics, we prove that the frequentist regret of RLSVI is upper-bounded by O(d^2 H^2 √(T)) where d are the feature dimension, H is the horizon, and T is the total number of steps. To the best of our knowledge, this is the first frequentist regret analysis for randomized exploration with function approximation.

06/15/2021

### Randomized Exploration for Reinforcement Learning with General Value Function Approximation

We propose a model-free reinforcement learning algorithm inspired by the...
10/23/2020

### Improved Worst-Case Regret Bounds for Randomized Least-Squares Value Iteration

This paper studies regret minimization with randomized value functions i...
12/12/2019

### Provably Efficient Exploration in Policy Optimization

While policy-based reinforcement learning (RL) achieves tremendous succe...
11/16/2020

### No-Regret Reinforcement Learning with Value Function Approximation: a Kernel Embedding Approach

We consider the regret minimisation problem in reinforcement learning (R...
05/15/2018

### Feedback-Based Tree Search for Reinforcement Learning

Inspired by recent successes of Monte-Carlo tree search (MCTS) in a numb...
06/19/2023

### Least Square Value Iteration is Robust Under Locally Bounded Misspecification Error

The success of reinforcement learning heavily relies on the function app...
10/15/2018

### Successor Uncertainties: exploration and uncertainty in temporal difference learning

We consider the problem of balancing exploration and exploitation in seq...
{"ft_lang_label":"__label__en","ft_lang_prob":0.8810569,"math_prob":0.8968049,"size":975,"snap":"2023-40-2023-50","text_gpt3_token_len":197,"char_repetition_ratio":0.11431514,"word_repetition_ratio":0.0,"special_character_ratio":0.17435898,"punctuation_ratio":0.074074075,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.979872,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-12-04T22:55:10Z\",\"WARC-Record-ID\":\"<urn:uuid:89342974-11e9-4d87-82fd-7651c4e08dd6>\",\"Content-Length\":\"152359\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:4d4050b7-1093-46cd-b88c-3443ec4e1ec8>\",\"WARC-Concurrent-To\":\"<urn:uuid:60ab9011-b65c-48ca-a815-7a4db23d3918>\",\"WARC-IP-Address\":\"54.191.144.167\",\"WARC-Target-URI\":\"http://api.deepai.org/publication/frequentist-regret-bounds-for-randomized-least-squares-value-iteration\",\"WARC-Payload-Digest\":\"sha1:7JULRV7IYPCJ6UN2MOTVNNIA2WVNZUAM\",\"WARC-Block-Digest\":\"sha1:P6MNHJR2KVFZVBH72AR555XD6BN6VSBJ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679100535.26_warc_CC-MAIN-20231204214708-20231205004708-00300.warc.gz\"}"}