The Sample-Complexity of General Reinforcement Learning

The Sample-Complexity of General Reinforcement Learning

22 August 2013

Marcus Hutter

ArXiv (abs)PDF HTML

Papers citing "The Sample-Complexity of General Reinforcement Learning"

9 / 9 papers shown

Title
BOFormer: Learning to Solve Multi-Objective Bayesian Optimization via Non-Markovian RL Yu-Heng Hung Kai-Jie Lin Yu-Heng Lin Chien-Yi Wang Cheng Sun Ping-Chun Hsieh 67 1 0 28 May 2025
Towards Efficient Risk-Sensitive Policy Gradient: An Iteration Complexity Analysis Rui Liu Erfaun Noorani Pratap Tokekar John S. Baras 102 1 0 13 Mar 2024
Optimal Regret Bounds for Selecting the State Representation in Reinforcement Learning Odalric-Ambrym Maillard P. Nguyen R. Ortner D. Ryabko 110 30 0 11 Feb 2013
Optimistic Agents are Asymptotically Optimal P. Sunehag Marcus Hutter 83 14 0 29 Sep 2012
On the Sample Complexity of Reinforcement Learning with a Generative Model M. G. Azar Rémi Munos H. Kappen 89 156 0 27 Jun 2012
PAC Bounds for Discounted MDPs Tor Lattimore Marcus Hutter 106 190 0 17 Feb 2012
Asymptotically Optimal Agents Tor Lattimore Marcus Hutter AI4CE 114 36 0 27 Jul 2011
Time Consistent Discounting Tor Lattimore Marcus Hutter 111 17 0 27 Jul 2011
On the Possibility of Learning in Reactive Environments with Arbitrary Dependence D. Ryabko Marcus Hutter 101 24 0 31 Oct 2008