Sciweavers

995 search results - page 24 / 199
» Learning Useful Horn Approximations
Sort
View
ML
2002
ACM
154views Machine Learning» more  ML 2002»
13 years 9 months ago
Technical Update: Least-Squares Temporal Difference Learning
TD() is a popular family of algorithms for approximate policy evaluation in large MDPs. TD() works by incrementally updating the value function after each observed transition. It h...
Justin A. Boyan
AGENTS
2001
Springer
14 years 2 months ago
Using background knowledge to speed reinforcement learning in physical agents
This paper describes Icarus, an agent architecture that embeds a hierarchical reinforcement learning algorithm within a language for specifying agent behavior. An Icarus program e...
Daniel G. Shapiro, Pat Langley, Ross D. Shachter
ESANN
2004
13 years 11 months ago
High-accuracy value-function approximation with neural networks applied to the acrobot
Several reinforcement-learning techniques have already been applied to the Acrobot control problem, using linear function approximators to estimate the value function. In this pape...
Rémi Coulom
CHI
2009
ACM
14 years 10 months ago
Comparing the use of tangible and graphical programming languages for informal science education
Much of the work done in the field of tangible interaction has focused on creating tools for learning; however, in many cases, little evidence has been provided that tangible inte...
Michael S. Horn, Erin Treacy Solovey, R. Jordan Cr...
JCP
2007
143views more  JCP 2007»
13 years 9 months ago
Noisy K Best-Paths for Approximate Dynamic Programming with Application to Portfolio Optimization
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
Nicolas Chapados, Yoshua Bengio