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, Leffler, Bethany R., Li, Lihong, Littman, Michael L., Roy, Nicholas |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Journal of Machine Learning Research
2010
|
Online Access: | http://hdl.handle.net/1721.1/60042 https://orcid.org/0000-0002-8293-0492 |
Similar Items
-
Compact parametric models for efficient sequential decision making in high-dimensional, uncertain domains
by: Brunskill, Emma Patricia
Published: (2010) -
Efficient Planning under Uncertainty with Macro-actions
by: He, Ruijie, et al.
Published: (2011) -
A provably passive and cost-efficient model for inductive interconnects
by: Yu, Hao, et al.
Published: (2010) -
Provably efficient scheduling for relaxed multithreaded computations
by: Gordienko, Maksim.
Published: (2008) -
Private and Provably Efficient Federated Decision-Making
by: Dubey, Abhimanyu
Published: (2022)