Sciweavers

10054 search results - page 116 / 2011
» On the Complexity of Function Learning
Sort
View
ICCBR
2005
Springer
15 years 6 months ago
CBR for State Value Function Approximation in Reinforcement Learning
CBR is one of the techniques that can be applied to the task of approximating a function over high-dimensional, continuous spaces. In Reinforcement Learning systems a learning agen...
Thomas Gabel, Martin A. Riedmiller
109
Voted
ESANN
2001
15 years 1 months ago
Learning fault-tolerance in Radial Basis Function Networks
This paper describes a method of supervised learning based on forward selection branching. This method improves fault tolerance by means of combining information related to general...
Xavier Parra, Andreu Català
ALT
2005
Springer
15 years 9 months ago
Monotone Conditional Complexity Bounds on Future Prediction Errors
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true ...
Alexey V. Chernov, Marcus Hutter
ICML
2005
IEEE
16 years 1 months ago
Proto-value functions: developmental reinforcement learning
This paper presents a novel framework called proto-reinforcement learning (PRL), based on a mathematical model of a proto-value function: these are task-independent basis function...
Sridhar Mahadevan
93
Voted
LICS
2008
IEEE
15 years 7 months ago
The Ordinal Recursive Complexity of Lossy Channel Systems
We show that reachability and termination for lossy channel systems is exactly at level Fωω in the Fast-Growing Hierarchy of recursive functions, the first level that dominates...
Pierre Chambart, Ph. Schnoebelen