On Lower Bounds for Regret in Reinforcement Learning

Abstract

This is a brief technical note to clarify the state of lower bounds on regret for reinforcement learning. In particular, this paper: - Reproduces a lower bound on regret for reinforcement learning, similar to the result of Theorem 5 in the journal UCRL2 paper (Jaksch et al 2010). - Clarifies that the proposed proof of Theorem 6 in the REGAL paper (Bartlett and Tewari 2009) does not hold using the standard techniques without further work. We suggest that this result should instead be considered a conjecture as it has no rigorous proof. - Suggests that the conjectured lower bound given by (Bartlett and Tewari 2009) is incorrect and, in fact, it is possible to improve the scaling of the upper bound to match the weaker lower bounds presented in this paper. We hope that this note serves to clarify existing results in the field of reinforcement learning and provides interesting motivation for future work.

Cited by in corpus (16)

• Model-Based Reinforcement Learning with Value-Targeted Regression
• Stochastic Primal-Dual Methods and Sample Complexity of Reinforcement Learning
• Reinforcement Learning in Feature Space: Matrix Bandit, Kernels, and Regret Bound
• Reinforcement Learning with General Value Function Approximation: Provably Efficient Approach via Bounded Eluder Dimension
• Is Long Horizon Reinforcement Learning More Difficult Than Short Horizon Reinforcement Learning?
• Logarithmic Regret for Reinforcement Learning with Linear Function Approximation
• Learning to Control in Metric Space with Optimal Regret
• Near-Optimal Reinforcement Learning with Self-Play
• V-Learning -- A Simple, Efficient, Decentralized Algorithm for Multiagent RL
• A Provably Efficient Algorithm for Linear Markov Decision Process with Low Switching Cost
• Influence-Based Multi-Agent Exploration
• No-Regret Reinforcement Learning with Heavy-Tailed Rewards
• Reward Poisoning in Reinforcement Learning: Attacks Against Unknown Learners in Unknown Environments
• Reinforcement Learning with Feedback Graphs
• Accelerating the Computation of UCB and Related Indices for Reinforcement Learning
• Gap-Dependent Bounds for Two-Player Markov Games