Keywords
Curse of dimensionalityComputer scienceMathematical optimizationGeneralityIterative methodRate of convergenceMathematicsArtificial intelligenceEconomics
Affiliated Institutions
Related Publications
Generalization in Reinforcement Learning: Safely Approximating the Value Function
A straightforward approach to the curse of dimensionality inreinforcement learning and dynamic programming is to replace the lookup table with a generalizing function approximat...
Contraction Mappings in the Theory Underlying Dynamic Programming
Next article Contraction Mappings in the Theory Underlying Dynamic ProgrammingEric V. DenardoEric V. Denardohttps://doi.org/10.1137/1009030PDFBibTexSections ToolsAdd to favorite...
Stochastic power control for cellular radio systems
For wireless communication systems, iterative power control algorithms have been proposed to minimize the transmitter power while maintaining reliable communication between mobi...
Projection-Based Approximation and a Duality with Kernel Methods
Projection pursuit regression and kernel regression are methods for estimating a smooth function of several variables from noisy data obtained at scattered sites. Methods based ...
PILCO: A Model-Based and Data-Efficient Approach to Policy Search
In this paper, we introduce pilco, a practical, data-efficient model-based policy search method. Pilco reduces model bias, one of the key problems of model-based reinforcement l...
Publication Info
- Year
- 2011
- Type
- article
- Volume
- 9
- Issue
- 3
- Pages
- 310-335
- Citations
- 256
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
256
OpenAlex
Cite This
Dimitri P. Bertsekas
(2011).
Approximate policy iteration: a survey and some new methods.
Journal of Control Theory and Applications
, 9
(3)
, 310-335.
https://doi.org/10.1007/s11768-011-1005-3
Identifiers
- DOI
- 10.1007/s11768-011-1005-3