Sciweavers

10054 search results - page 120 / 2011
» On the Complexity of Function Learning
Sort
View
TCS
2010
14 years 11 months ago
Maximal width learning of binary functions
This paper concerns learning binary-valued functions defined on IR, and investigates how a particular type of ‘regularity’ of hypotheses can be used to obtain better generali...
Martin Anthony, Joel Ratsaby
89
Voted
AUSAI
2004
Springer
15 years 6 months ago
A Dynamic Allocation Method of Basis Functions in Reinforcement Learning
In this paper, we propose a dynamic allocation method of basis functions, an Allocation/Elimination Gaussian Softmax Basis Function Network (AE-GSBFN), that is used in reinforcemen...
Shingo Iida, Kiyotake Kuwayama, Masayoshi Kanoh, S...
87
Voted
AIPS
2008
15 years 2 months ago
Learning Heuristic Functions through Approximate Linear Programming
Planning problems are often formulated as heuristic search. The choice of the heuristic function plays a significant role in the performance of planning systems, but a good heuris...
Marek Petrik, Shlomo Zilberstein
88
Voted
ATAL
2010
Springer
15 years 1 months ago
Basis function construction for hierarchical reinforcement learning
This paper introduces an approach to automatic basis function construction for Hierarchical Reinforcement Learning (HRL) tasks. We describe some considerations that arise when con...
Sarah Osentoski, Sridhar Mahadevan
AAAI
2011
14 years 17 days ago
Value Function Approximation in Reinforcement Learning Using the Fourier Basis
We describe the Fourier Basis, a linear value function approximation scheme based on the Fourier Series. We empirically evaluate its properties, and demonstrate that it performs w...
George Konidaris, Sarah Osentoski, Philip Thomas