Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model (Q399890): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:27, 30 January 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
