DocumentCode :
2701751
Title :
Genetic reinforcement learning for neural networks
Author :
Dominic, S. ; Das, R. ; Whitley, D. ; Anderson, C.
Author_Institution :
Dept. of Comput. Sci., Colorado State Univ., Fort Collins, CO, USA
fYear :
1991
fDate :
8-14 Jul 1991
Firstpage :
71
Abstract :
It is pointed out that the genetic algorithms which have been shown to yield good performance for neural network weight optimization are really genetic hill-climbers, with a strong reliance on mutation rather than hyperplane sampling. Neural control problems are more appropriate for these genetic hill-climbers than supervised learning applications because in reinforcement learning applications gradient information is not directly available. Genetic reinforcement learning produces competitive results with the adaptive heuristic critic method, another reinforcement learning paradigm for neural networks that employs temporal difference methods. The genetic hill-climbing algorithm appears to be robust over a wide range of learning conditions
Keywords :
genetic algorithms; learning systems; neural nets; stability; genetic algorithms; genetic hill-climbers; genetic reinforcement learning; mutation; neural control problems; neural network weight optimization; Computer science; Encoding; Failure analysis; Genetic algorithms; Genetic mutations; Neural networks; Neurofeedback; Robustness; Sampling methods; Supervised learning;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Neural Networks, 1991., IJCNN-91-Seattle International Joint Conference on
Conference_Location :
Seattle, WA
Print_ISBN :
0-7803-0164-1
Type :
conf
DOI :
10.1109/IJCNN.1991.155315
Filename :
155315
Link To Document :
بازگشت