Efficient sampling in approximate dynamic programming algorithms (Q2477014)
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: Efficient sampling in approximate dynamic programming algorithms |
scientific article; zbMATH DE number 5248747
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient sampling in approximate dynamic programming algorithms |
scientific article; zbMATH DE number 5248747 |
Statements
Efficient sampling in approximate dynamic programming algorithms (English)
0 references
12 March 2008
0 references
Stochastic optimal control problem
0 references
Dynamic programming
0 references
Sample complexity
0 references
Deterministic learning
0 references
Low-discrepancy sequences
0 references
0 references
0 references
0 references
0 references
0.7975624799728394
0 references
0.7974581718444824
0 references
0.7813840508460999
0 references
0.7785820364952087
0 references
0.7651886940002441
0 references
