Near-optimal PAC bounds for discounted MDPs (Q465258)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Near-optimal PAC bounds for discounted MDPs |
scientific article; zbMATH DE number 6362899
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Near-optimal PAC bounds for discounted MDPs |
scientific article; zbMATH DE number 6362899 |
Statements
Near-optimal PAC bounds for discounted MDPs (English)
0 references
31 October 2014
0 references
sample-complexity
0 references
PAC bounds
0 references
Markov decision processes
0 references
reinforcement learning
0 references
0 references
0.9773077368736268
0 references
0.863233745098114
0 references
0.8285092115402222
0 references
0.8222609162330627
0 references
0.8079649806022644
0 references
