Uniform-pac Bounds For Reinforcement Learning With Linear Function Approximation

Abstract

We study reinforcement learning (RL) with linear function approximation. Existing algorithms for this problem only have high-probability regret and/or Probably Approximately Correct (PAC) sample complexity guarantees, which cannot guarantee the convergence to the optimal policy. In this paper, in order to overcome the limitation of existing algorithms, we propose a new algorithm called FLUTE, which enjoys uniform-PAC convergence to the optimal policy with high probability. The uniform-PAC guarantee is the strongest possible guarantee for reinforcement learning in the literature, which can directly imply both PAC and high probability regret bounds, making our algorithm superior to all existing algorithms with linear function approximation. At the core of our algorithm is a novel minimax value function estimator and a multi-level partition scheme to select the training samples from historical observations. Both of these techniques are new and of independent interest.

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyhe2021uniform

Related papers

• Provably Efficient Reinforcement Learning With Linear Function Approximation (2019)11.76
• Distributionally Robust Offline Reinforcement Learning With Linear Function Approximation (2022)0.00
• Distributional Reinforcement Learning With Linear Function Approximation (2019)0.00
• Unifying PAC And Regret: Uniform PAC Bounds For Episodic Reinforcement Learning (2017)0.00
• A Nearly Optimal And Low-switching Algorithm For Reinforcement Learning With General Function Approximation (2023)0.00
• Posterior Sampling With Delayed Feedback For Reinforcement Learning With Linear Function Approximation (2023)0.00
• Reward-free Model-based Reinforcement Learning With Linear Function Approximation (2021)0.00
• Prior-dependent Analysis Of Posterior Sampling Reinforcement Learning With Function Approximation (2024)0.00