Minimax PAC-Bounds on the Sample Complexity of Reinforcement Learning with a Generative Model, in 'Machine Learning Journal
| Title: | Minimax PAC-Bounds on the Sample Complexity of Reinforcement Learning with a Generative Model, in 'Machine Learning Journal |
|---|---|
| Authors: | Mohammad Gheshlaghi Azar; Minimax Pac; Hal Id Hal |
| Contributors: | The Pennsylvania State University CiteSeerX Archives |
| Source: | https://hal.archives-ouvertes.fr/hal-00831875/document/. |
| Publication Year: | 2012 |
| Collection: | CiteSeerX |
| Description: | To cite this version |
| Document Type: | text |
| Language: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.652.179 |
| Availability: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.652.179 |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Accession Number: | edsbas.3F1B6902 |
| Database: | BASE |