Learnable evolution model: Difference between revisions

Revision as of 21:29, 24 September 2017

Revision as of 12:04, 20 July 2018

Line 1:

{{Original research|date=September 2007}}

The '''learnable evolution model''' ('''LEM''') is a novel, non-[[Darwinian]] methodology for [[evolutionary computation]] that employs [[machine learning]] to guide the generation of new individuals ([[candidate solution|candidate problem solution]]s). Unlike standard, Darwinian-type evolutionary computation methods that use random or semi-random operators for generating new individuals (such as [[mutation (genetic algorithm)|mutation]]s and/or [[genetic recombination|recombination]]s), LEM employs hypothesis generation and instantiation operators.

The [[hypothesis generation]] operator applies a machine learning program to induce descriptions that distinguish between high-[[fitness (biology)|fitness]] and low-fitness individuals in each consecutive [[population]]. Such descriptions delineate areas in the [[Candidate solution|search space]] that most likely contain the desirable solutions. Subsequently the instantiation operator samples these areas to create new individuals.