Name
Abstract | ||
|---|---|---|
Randomization is notable for being much less computationally expensive than optimization but often yielding comparable numerical performance. In this paper, we consider randomized function fitting combined with empirical value iteration for approximate dynamic programming on continuous state spaces. The method we propose is universal (i.e., not problem-dependent) and yields good approximations with high probability. A random operator theoretic framework is introduced for convergence analysis which uses a novel stochastic dominance argument. A non-asymptotic rate of convergence is obtained as a byproduct of the analysis. Numerical experiments confirm good performance of the algorithm proposed. |
Year | Venue | Field |
|---|---|---|
2017 | 2017 IEEE 56TH ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC) | Convergence (routing),Dynamic programming,Approximation algorithm,Mathematical optimization,Function approximation,Computer science,Stochastic dominance,Markov decision process,Rate of convergence,Operator (computer programming) |
DocType | ISSN | Citations |
Conference | 0743-1546 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| William B. Haskell | 1 | 58 | 12.04 |
| Pengqian Yu | 2 | 0 | 0.68 |
| Hiteshi Sharma | 3 | 0 | 2.37 |
| Rahul Jain | 4 | 65 | 6.67 |