Sciweavers

704 search results - page 6 / 141
» Improved Learning of AC0 Functions
Sort
View
ESANN
2003
13 years 9 months ago
Approximation of Function by Adaptively Growing Radial Basis Function Neural Networks
In this paper a neural network for approximating function is described. The activation functions of the hidden nodes are the Radial Basis Functions (RBF) whose parameters are learn...
Jianyu Li, Siwei Luo, Yingjian Qi
ICML
2007
IEEE
14 years 8 months ago
Constructing basis functions from directed graphs for value function approximation
Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...
Jeffrey Johns, Sridhar Mahadevan
GECCO
2006
Springer
156views Optimization» more  GECCO 2006»
13 years 11 months ago
Improving GP classifier generalization using a cluster separation metric
Genetic Programming offers freedom in the definition of the cost function that is unparalleled among supervised learning algorithms. However, this freedom goes largely unexploited...
Ashley George, Malcolm I. Heywood
ITS
2004
Springer
110views Multimedia» more  ITS 2004»
14 years 26 days ago
Scaffolding Self-Explanation to Improve Learning in Exploratory Learning Environments.
Abstract. Successful learning though exploration in open learning environments has been shown to depend on whether students possess the necessary meta-cognitive skills, including s...
Andrea Bunt, Cristina Conati, Kasia Muldner
FOCI
2007
IEEE
14 years 1 months ago
Opposite Transfer Functions and Backpropagation Through Time
— Backpropagation through time is a very popular discrete-time recurrent neural network training algorithm. However, the computational time associated with the learning process t...
Mario Ventresca, Hamid R. Tizhoosh