Provably efficient learning with typed parametric models
To quickly achieve good performance, reinforcement-learning algorithms for acting in large continuous-valued domains must use a representation that is both sufficiently powerful to capture important domain characteristics, and yet simultaneously allows generalization, or sharing, among experiences....
Main Authors: | Brunskill, Emma (Contributor), Leffler, Bethany R. (Author), Li, Lihong (Author), Littman, Michael L. (Author), Roy, Nicholas (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Aeronautics and Astronautics (Contributor) |
Format: | Article |
Language: | English |
Published: |
Journal of Machine Learning Research,
2010-11-29T17:59:03Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Compact parametric models for efficient sequential decision making in high-dimensional, uncertain domains
by: Brunskill, Emma Patricia
Published: (2010) -
Provably efficient algorithms for decentralized optimization
by: Liu, Changxin
Published: (2021) -
Efficient, provably secure code constructions
by: Agrawal, Shweta Prem
Published: (2011) -
Contributions to Provable Security and Efficient Cryptography
by: Schmidt-Samoa, Katja
Published: (2006) -
Provably Efficient Algorithms for Numerical Tensor Algebra
by: Solomonik, Edgar
Published: (2015)