Sciweavers

10054 search results - page 69 / 2011
» On the Complexity of Function Learning
Sort
View
JCP
2007
121views more  JCP 2007»
13 years 10 months ago
Learning by Discrimination: A Constructive Incremental Approach
Abstract— This paper presents i-AA1 , a constructive, incremental learning algorithm for a special class of weightless, self-organizing networks. In i-AA1 , learning consists of ...
Christophe G. Giraud-Carrier, Tony R. Martinez
TNN
1998
112views more  TNN 1998»
13 years 9 months ago
A class of competitive learning models which avoids neuron underutilization problem
— In this paper, we study a qualitative property of a class of competitive learning (CL) models, which is called the multiplicatively biased competitive learning (MBCL) model, na...
Clifford Sze-Tsan Choy, Wan-Chi Siu
ICONIP
2009
13 years 7 months ago
Tracking in Reinforcement Learning
Reinforcement learning induces non-stationarity at several levels. Adaptation to non-stationary environments is of course a desired feature of a fair RL algorithm. Yet, even if the...
Matthieu Geist, Olivier Pietquin, Gabriel Fricout
AIEDAM
1998
87views more  AIEDAM 1998»
13 years 9 months ago
Learning to set up numerical optimizations of engineering designs
Gradient-based numerical optimization of complex engineering designs offers the promise of rapidly producing better designs. However, such methods generally assume that the object...
Mark Schwabacher, Thomas Ellman, Haym Hirsh
ICML
1994
IEEE
14 years 1 months ago
Hierarchical Self-Organization in Genetic programming
This paper presents an approach to automatic discovery of functions in Genetic Programming. The approach is based on discovery of useful building blocks by analyzing the evolution...
Justinian P. Rosca, Dana H. Ballard