@article{discovery10146198,
         journal = {Genetic Programming and Evolvable Machines},
       publisher = {Springer Verlag},
           title = {Genetic programming convergence},
            year = {2021},
           month = {March},
           pages = {71--104},
            note = {This version is the author accepted manuscript. For information on re-use, please refer to the publisher's terms and conditions.},
          volume = {23},
             url = {https://doi.org/10.1007/s10710-021-09405-9},
        abstract = {We study both genotypic and phenotypic convergence in GP floating point continuous domain symbolic regression over thousands of generations. Subtree fitness variation across the population is measured and shown in many cases to fall. In an expanding region about the root node, both genetic opcodes and function evaluation values are identical or nearly identical. Bottom up (leaf to root) analysis shows both syntactic and semantic (including entropy) similarity expand from the outermost node. Despite large regions of zero variation, fitness continues to evolve and near zero crossover disruption suggests improved GP systems within existing memory use.},
          author = {Langdon, WB},
        keywords = {Evolutionary computation, stochastic search, diversity, bottom up
incremental evaluation, PIE, propagation, infection, and execution, SIMD parallel processing, AVX vector instructions}
}