Sciweavers

536 search results - page 89 / 108
» Residual Algorithms: Reinforcement Learning with Function Ap...
Sort
View
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
13 years 11 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
ML
1998
ACM
131views Machine Learning» more  ML 1998»
13 years 7 months ago
Learning from Examples and Membership Queries with Structured Determinations
It is well known that prior knowledge or bias can speed up learning, at least in theory. It has proved di cult to make constructive use of prior knowledge, so that approximately c...
Prasad Tadepalli, Stuart J. Russell
ISNN
2007
Springer
14 years 1 months ago
Recurrent Fuzzy CMAC for Nonlinear System Modeling
Normal fuzzy CMAC neural network performs well because of its fast learning speed and local generalization capability for approximating nonlinear functions. However, it requires hu...
Floriberto Ortiz Rodriguez, Wen Yu, Marco A. Moren...
PPSN
2004
Springer
14 years 1 months ago
A Neuroevolutionary Approach to Emergent Task Decomposition
A scalable architecture to facilitate emergent (self-organized) task decomposition using neural networks and evolutionary algorithms is presented. Various control system architectu...
Jekanthan Thangavelautham, Gabriele M. T. D'Eleute...
IJCAI
2007
13 years 9 months ago
Using Linear Programming for Bayesian Exploration in Markov Decision Processes
A key problem in reinforcement learning is finding a good balance between the need to explore the environment and the need to gain rewards by exploiting existing knowledge. Much ...
Pablo Samuel Castro, Doina Precup