Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model (Q399890): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 1206.6461 / rank | |||
Normal rank |
Revision as of 13:17, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model |
scientific article |
Statements
Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model (English)
0 references
20 August 2014
0 references
sample complexity
0 references
Markov decision processes
0 references
reinforcement learning
0 references
learning theory
0 references