A Discipline of Evolutionary Programming
Paul Vitanyi
Abstract
Genetic fitness optimization using small populations or small population updates across generations generally suffers from randomly diverging evolutions. We propose a notion of highly probable fitness optimization through feasible evolutionary computing runs on small size populations. Based on rapidly mixing Markov chains, the approach pertains to most types of evolutionary genetic algorithms, genetic programming and the like. We establish that for systems having associated rapidly mixing Markov chains and appropriate stationary distributions the new method finds optimal programs (individuals) with probability almost 1. To make the method useful would require a structured design methodology where the development of the program and the guarantee of the rapidly mixing property go hand in hand. We analyze a simple example to show that the method is implementable. More significant examples require theoretical advances, for example with respect to the Metropolis filter.
Create a lesson
Related papers
ANTShapes Benchmarking Datasets for Event-Based Neuromorphic Object Classification
M. Middleton, H. Kayan, B. Sen Bhattacharya et al.
Bug Localization from Bug Reports: A Multi-Objective Approach
Waleed Ahmad, Mehtab Kiran Suddle, Maryam Bashir
Synthesis of Hopfield Neural Network: Novel Results
Garimella Rama Murthy
Homo-RAG: Homology-Guided Retrieval-Augmented Generation for Cross-Species Gene Function Prediction
Azrin Sultana
Learning Whom to Trust : Decision-Generated Credibility in Social Learning
Gabriel Bontemps, Abhishek Banerjee
On Scaling Coordinate-Based Neuroevolution: The Quadtree Bottleneck in ES-HyperNEAT
Romain Claret, Michael O'Neill, Paul Cotofrei et al.