1233 search results - page 173 / 247 » Reinforcement learning |
117
click to vote
ICML
2001
IEEE
16 years 4 months ago
2001
IEEE
We call data weakly labeled if it has no exact label but rather a numerical indication of correctness of the label "guessed" by the learning algorithm - a situation comm...
142
click to vote
ICANN
2010
Springer
15 years 4 months ago
2010
Springer
We propose a data structure that decreases complexity of unsupervised competitive learning algorithms which are based on the growing cells structures approach. The idea is based on...
162
click to vote
NIPS
1992
15 years 5 months ago
1992
How can artificial neural nets generalize better from fewer examples? In order to generalize successfully, neural network learning methods typically require large training data se...
136
click to vote
CSREAEEE
2008
15 years 5 months ago
2008
- This paper proposes the use of an interactive web based problem solving application that utilises flowchart based programming and code generation to address the issues faced by n...
131
click to vote
ML
1998
ACM
15 years 3 months ago
1998
ACM
Following Tesauro’s work on TD-Gammon, we used a 4000 parameter feed-forward neural network to develop a competitive backgammon evaluation function. Play proceeds by a roll of t...