Geiringer theorems: from population genetics to computational intelligence, memory evolutive systems and Hebbian learning

Boris S. Mitavskiy, Elio Tuci, Chris Cannings, Jonathan Rowe, Jun He
2013 Natural Computing  
The classical Geiringer theorem addresses the limiting frequency of occurrence of various alleles after repeated application of crossover. It has been adopted to the setting of evolutionary algorithms and, a lot more recently, reinforcement learning and Monte-Carlo tree search methodology to cope with a rather challenging question of action evaluation at the chance nodes. The theorem motivates novel dynamic parallel algorithms that are explicitly described in the current paper for the first
more » ... . The algorithms involve independent agents traversing a dynamically constructed directed graph that possibly has loops. A rather elegant and profound category-theoretic model of cognition in biological neural networks developed by a well-known French mathematician, professor Andree Ehresmann jointly with a neurosurgeon, Jan Paul Vanbremeersch over the last thirty years provides a hint at the connection between such algorithms and Hebbian learning.
doi:10.1007/s11047-013-9395-4 fatcat:y5q4t57frbh6hd2x2nwkhybky4