OMNIREP: originating meaning by coevolving encodings and representations
A major effort in the practice of evolutionary computation goes into deciding how to represent individuals in the evolving population. This task is actually composed of two subtasks: defining a data structure that is the representation and defining the encoding that enables to interpret the representation. In this paper we employ a coevolutionary algorithm—dubbed OMNIREP—to discover both a representation and an encoding that solve a particular problem of interest. We describe four experiments that provide a proof-of-concept of OMNIREP’s essential merit. We think that the proposed methodology holds potential as a problem solver and also as an exploratory medium when scouting for good representations.
KeywordsEvolutionary algorithms Cooperative coevolution Interpretation
This work was supported by National Institutes of Health grants AI116794, DK112217, ES013508, HL134015, LM010098, LM011360, LM012601, and TR001263.
- 1.Angeline PJ, Pollack JB (1994) Coevolving high-level representations. In: Langton CG (ed) Artificial life III, vol XVII of SFI studies in the sciences of complexity. Addison-Wesley, Santa Fe, pp 55–71Google Scholar
- 4.Bentley P, Kumar S (1999) Three ways to grow designs: a comparison of embryogenies for an evolutionary design problem. In: Proceedings of the 1st annual conference on genetic and evolutionary computation-GECCO’99, vol 1. Morgan Kaufmann Publishers Inc., San Francisco, pp 35–43Google Scholar
- 11.Gruau F, Whitley D, Pyeatt L (1996) A comparison between cellular encoding and direct encoding for genetic neural networks. In: Proceedings of the 1st annual conference on genetic programming. MIT Press, Cambridge, pp 81–89Google Scholar
- 12.Hart WE, Kammeyer TE, Belew RK (1995) The role of development in genetic algorithms. In: Whitley LD, Vose MD (eds) Foundations of genetic algorithms, vol 3. Elsevier, Amsterdam, pp 315–332Google Scholar
- 17.Lee CY, Antonsson EK (2000) Variable length genomes for evolutionary algorithms. In: Proceedings of the genetic and evolutionary computation conference. Morgan Kaufmann, San FranciscoGoogle Scholar
- 20.Neri F, Cotta C, Moscato P (2012) Handbook of memetic algorithms, vol 379. Springer, BerlinGoogle Scholar
- 21.Nicolau M, Ryan C (2002) LINKGAUGE: tackling hard deceptive problems with a new linkage learning genetic algorithm. In: Proceedings of the 4th annual conference on genetic and evolutionary computation. Morgan Kaufmann Publishers Inc., San Francisco, pp 488–494Google Scholar
- 24.Ryan C, Collins JJ, O’Neill M (1998) Grammatical evolution: evolving programs for an arbitrary language. In: Proceedings genetic programming, first European workshop, EuroGP’98. Paris, pp 83–96Google Scholar
- 25.Sipper M, Fu W, Ahuja K, Moore JH (2018) Investigating the parameter space of evolutionary algorithms. BioData Min 11(2):1–14Google Scholar