A computational study into the evolution of dual-route dynamics for affective processing.

The evolutionary justification by LeDoux (1996) for his dual-route model of fear processing was analyzed computationally by applying genetic algorithms to artificial neural networks. The evolution was simulated of a neural network controlling an agent that gathered food in an artificial world and that was occasionally menaced by a predator. Connections could not change in the agent's "lifetime," so there was no learning in the simulations. Only if the smells of food and predator were hard to distinguish and the fitness reflected time pressures in escaping from the predator did the type of dual processing postulated by LeDoux emerge in the surviving agents. Processing in the "quick and dirty" pathway of the fear system ensured avoidance of both predators and food, but a distinction between food and predator was made only in the long pathway. Elaborate processing inhibited the avoidance reaction and reversed it into an approach reaction to food, but strengthened the avoidance reaction to predators (and more finely tuned the direction of escape). It is suggested that "computational neuroethology" (Beer, 1990) may help constrain reasoning in evolutionary psychology, particularly when applied to specific neurobiological models, and in the future may even generate new hypotheses for cognitive neuroscience.