Performance Bounds in $L_p$‐norm for Approximate Value Iteration (Q5453575)
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: Performance Bounds in L_p‐norm for Approximate Value Iteration |
scientific article; zbMATH DE number 5256901
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Performance Bounds in $L_p$‐norm for Approximate Value Iteration |
scientific article; zbMATH DE number 5256901 |
Statements
Performance Bounds in $L_p$‐norm for Approximate Value Iteration (English)
0 references
3 April 2008
0 references
Markov decision processes
0 references
dynamic programming
0 references
optimal control
0 references
function approximation
0 references
error analysis
0 references
reinforcement learning
0 references
statistical learning
0 references
0.844353199005127
0 references
0.8137878179550171
0 references
0.8136429786682129
0 references
0.7990292906761169
0 references
0.7959030866622925
0 references
