Convergence (evolutionary computing)
It is proposed that this article be deleted because of the following concern:
If you can address this concern by improving, copyediting, sourcing, renaming, or merging the page, please edit this page and do so. You may remove this message if you improve the article or otherwise object to deletion for any reason. Although not required, you are encouraged to explain why you object to the deletion, either in your edit summary or on the talk page. If this template is removed, do not replace it. This message has remained in place for seven days, so the article may be deleted without further notice. Nominator: Please consider notifying the author/project: {{subst:proposed deletion notify|Convergence (evolutionary computing)|concern=Almost impossible to improve; even the definition is wrong. It is easier to start over.}} ~~~~Timestamp: 20240131110332 11:03, 31 January 2024 (UTC) Administrators: delete |
Convergence within the field of computer science, is a phenomenon in evolutionary computation. It causes evolution to halt because precisely every individual in the population is identical.
Full convergence might be seen in genetic algorithms (a type of evolutionary computation) using only crossover (a way of combining individuals to make new offspring). Premature convergence is when a population has converged to a single solution, but that solution is not as high of quality as expected, i.e. the population has gotten 'stuck'. However, convergence is not necessarily a negative thing, because populations often stabilise after a time, in the sense that the best programs all have a common ancestor and their behaviour is very similar (or identical) both to each other and to that of high fitness programs from the previous generations. Often the term convergence is loosely used. Convergence can be avoided with a variety of diversity-generating techniques.
References
External links
Foundations of Genetic Programming
 |  |
