Geiringer Theorems: From Population Genetics to Computational Intelligence, Memory Evolutive Systems and Hebbian Learning

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 wi...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Mitavskiy, Boris, Tuci, Elio, Cannings, Chris, Rowe, Jonathan, He, Jun
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 11.05.2013
Subjects:	Algorithms Artificial intelligence Biological models (mathematics) Cognition Computer memory Computer simulation Crossovers Evolutionary algorithms Graph theory Machine learning Monte Carlo simulation Neural networks Theorems
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!