14 search results - page 3 / 3 » Near-Optimal Reinforcement Learning in Polynomial Time |
ALT
1998
Springer
13 years 8 months ago
1998
Springer
Concept drift means that the concept about which data is obtained may shift from time to time, each time after some minimum permanence. Except for this minimum permanence, the con...
ICML
2003
IEEE
13 years 9 months ago
2003
IEEE
Shaping can be an effective method for improving the learning rate in reinforcement systems. Previously, shaping has been heuristically motivated and implemented. We provide a for...
JAIR
2008
13 years 4 months ago
2008
We present exact algorithms for identifying deterministic-actions' effects and preconditions in dynamic partially observable domains. They apply when one does not know the ac...
CACM
2010
13 years 4 months ago
2010
We introduce and analyze a natural algorithm for multi-venue exploration from censored data, which is motivated by the Dark Pool Problem of modern quantitative finance. We prove t...