Sciweavers

4544 search results - page 317 / 909
» Reinforcement Learning with Time
Sort
View
IJCNN
2006
IEEE
15 years 10 months ago
Improving the Convergence of Backpropagation by Opposite Transfer Functions
—The backpropagation algorithm is a very popular approach to learning in feed-forward multi-layer perceptron networks. However, in many scenarios the time required to adequately ...
Mario Ventresca, Hamid R. Tizhoosh
IJCAI
2007
15 years 5 months ago
Learning to Count by Think Aloud Imitation
Although necessary, learning to discover new solutions is often long and difficult, even for supposedly simple tasks such as counting. On the other hand, learning by imitation pr...
Laurent Orseau
CONNECTION
2006
101views more  CONNECTION 2006»
15 years 4 months ago
Learning acceptable windows of contingency
By learning a range of possible times over which the effect of an action can take place, a robot can reason more effectively about causal and contingent relationships in the world...
Kevin Gold, Brian Scassellati
ICML
2009
IEEE
16 years 4 months ago
Learning when to stop thinking and do something!
An anytime algorithm is capable of returning a response to the given task at essentially any time; typically the quality of the response improves as the time increases. Here, we c...
Barnabás Póczos, Csaba Szepesv&aacut...
141
Voted
ICANN
2010
Springer
15 years 5 months ago
Model of the Hippocampal Learning of Spatio-temporal Sequences
We propose a model of the hippocampus aimed at learning the timed association between subsequent sensory events. The properties of the neural network allow it to learn and predict ...
Julien Hirel, Philippe Gaussier, Mathias Quoy