Acceleration of Evolutionary Processes by Learning and Extended Fisher's Fundamental Theorem
So Nakashima, Tetsuya J. Kobayashi

TL;DR
This paper demonstrates that ancestral learning can accelerate evolutionary processes by estimating fitness gradients without communication, extending Fisher's fundamental theorem to quantify this acceleration based on fitness diversity.
Contribution
It introduces ancestral learning as a method for agents to accelerate evolution and extends Fisher's fundamental theorem to quantify this acceleration.
Findings
Ancestral information suffices for gradient estimation.
Learning accelerates evolution without inter-agent communication.
The extended FF-thm links fitness diversity to acceleration.
Abstract
Natural selection is general and powerful concept not only to explain evolutionary processes of biological organisms but also to design engineering systems such as genetic algorithms and particle filters. There is a surge of interest, both from biology and engineering, in considering natural selection of intellectual agents that can learn individually. Learning by individual agents of better behaviors for survival may accelerate the evolutionary processes by natural selection. We have accumulating pieces of evidence that organisms can transmit its information to the next generation via epigenetic states or memes. Also, such idea is important for engineering applications. To accelerate the evolutionary process, an agent should change their strategy so that the population fitness increases the most. Equivalently, an agent should update the strategy towards a gradient of the population…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEvolutionary Algorithms and Applications · Evolution and Genetic Dynamics · Metaheuristic Optimization Algorithms Research
