A potentially powerful application of evolutionary computation (EC) is to evolve neural networks for automated control tasks. However, in such tasks environments can be unpredictable and fixed control policies may fail when conditions suddenly change. Thus, there is a need to evolve neural networks that can adapt, i.e. change their control policy dynamically as conditions change. In this paper, we examine two methods for evolving neural networks with dynamic policies. The first method evolves recurrent neural networks with fixed connection weights, relying on internal state changes to lead to changes in behavior. The second method evolves local rules that govern connection weight changes. The surprising experimental result is that the former method can be more effective than evolving networks with dynamic weights, calling into question the intuitive notion that networks with dynamic synapses are necessary for evolving solutions to adaptive tasks.

PDF, PS

In Proceedings of the 2003 Congress on Evolutionary Computation, Piscataway, NJ, 2003. IEEE.

@InProceedings{stanley:cec03, title={Evolving Adaptive Neural Networks with and Without Adaptive Synapses}, author={Kenneth O. Stanley and Bobby D. Bryant and Risto Miikkulainen}, booktitle={Proceedings of the 2003 Congress on Evolutionary Computation}, address={Piscataway, NJ}, publisher={IEEE}, url="http://nn.cs.utexas.edu/?stanley:cec03", year={2003} }