Each cycle picks T<P algorithms at random and selects the best performing one as the parent (i.e. tournament selection, [25]). This parent is then copied and mutated to produce a child algorithm that is added to the population, while the oldest algorithm in the population is removed.
As usual with "evolving" in the title, the actual methods are toyish, not evolutionary. It's 1980s level. In fact, that [25] is a review from 1991, which in turn cites the actual source for their method from 1981. LOL
To be fair, on a very high level, every evolutionary algorithm seems naive/old-school/simple (actually that can be said of any ML method, really). It's the details that matter, and if you look at them in the paper (the fitness and proxy tasks, the functional equivalence checking and whatnot) it seems clear that it's very distant from 80s style work.
In another comment you mention NEAT and its variants. On a high-level those seem extremely simple too, so I find the comparison a bit bizzare...
Lovely username, but I was talking precisely about selection method. NEAT is far far away from tournament selection. And natural evolution as-we-know-it(tm) is several levels further.
2
u/rafgro Mar 11 '20
As usual with "evolving" in the title, the actual methods are toyish, not evolutionary. It's 1980s level. In fact, that [25] is a review from 1991, which in turn cites the actual source for their method from 1981. LOL