Minimax PAC Bounds on the Sample Complexity of Reinforcement Learning with a Generative Model

Azar et al. "Minimax PAC Bounds on the Sample Complexity of Reinforcement Learning with a Generative Model." Machine Learning, 2013. doi:10.1007/S10994-013-5368-1

[Azar et al. "Minimax PAC Bounds on the Sample Complexity of Reinforcement Learning with a Generative Model." Machine Learning, 2013.](https://mlanthology.org/mlj/2013/azar2013mlj-minimax/) doi:10.1007/S10994-013-5368-1

@article{azar2013mlj-minimax,
  title     = {{Minimax PAC Bounds on the Sample Complexity of Reinforcement Learning with a Generative Model}},
  author    = {Azar, Mohammad Gheshlaghi and Munos, Rémi and Kappen, Hilbert J.},
  journal   = {Machine Learning},
  year      = {2013},
  pages     = {325-349},
  doi       = {10.1007/S10994-013-5368-1},
  volume    = {91},
  url       = {https://mlanthology.org/mlj/2013/azar2013mlj-minimax/}
}