Feature-based methods for large scale dynamic programming
Machine Learning - Special issue on reinforcement learning
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Variable Resolution Discretization in Optimal Control
Machine Learning
Max-norm projections for factored MDPs
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Reinforcement learning with a bilinear q function
EWRL'11 Proceedings of the 9th European conference on Recent Advances in Reinforcement Learning
Rational market making with probabilistic knowledge
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
| Hi-index | 0.00 |
This paper studies fitted value iteration for continuous state numerical dynamic programming using nonexpansive function approximators. A number of approximation schemes are discussed. The main contribution is to provide error bounds for approximate optimal policies generated by the value iteration algorithm.