Sustaining diversity using behavioral information distance

Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009

Volumn , Issue , 2009, Pages 113-120

  Gomez, Faustino J ^a  

^a DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

Behavioral diversity; Genetic algorithms; Kolmogorov complexity; Normalized compression distance; Recurrent neural networks; Tartarus

Indexed keywords

ALGORITHMIC INFORMATION THEORY; BEHAVIORAL DIVERSITY; COMPLEX SOLUTION; DECISION TASK; INFORMATION DISTANCE; KOLMOGOROV COMPLEXITY; NORMALIZED COMPRESSION DISTANCE; SIMILARITY MEASURE; SIMILARITY METRICS;

COMPUTATIONAL COMPLEXITY; INFORMATION THEORY; REINFORCEMENT LEARNING;

RECURRENT NEURAL NETWORKS;

EID: 72749111175     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1569901.1569918     Document Type: Conference Paper

References (11)

1. R. Cilibrasi and P. Vitanyi. Clustering by compression. IEEE Transactions on Information Theory, 51:1523-1545, 2005.
2. K. A. De Jong. An Analysis of the Behavior of a Class of Genetic Adaptive Systems. PhD thesis, The University of Michigan, Ann Arbor, MI, 1975. University Microfilms No. 76-09381.
3. D. E. Goldberg and J. Richardson. Genetic algorithms with sharing for multimodal function optimization. In J. J. Grefenstette, editor, Proceedings of the Second International Conference on Genetic Algorithms, pages 148-154. San Francisco, CA: Morgan Kaufmann, 1987.
4. W. D. Hillis. Co-evolving parasites improve simulated evolution as an optimization procedure. In J. D. Farmer, C. Langton, S. Rasmussen, and C. Taylor, editors, Artificial Life II. Addison-Wesley, Reading, MA, 1991.
5. J. Lehman and K. O. Stanley. Exploiting open-endedness to solve problems through the search for novelty. In Proceedings of the Eleventh International Conference on Artificial Life (ALIFE XI), Cambridge, MA, 2008. MIT Press.
6. M. Li, J. H. Badger, X. Chen, S. Kwong, P. Kearney, and H. Zhang. An information-based sequence distance and its application to whole mitochondrial genome phylogeny. Bioinformatics, 17(2):149-154, 2001.
7. M. Li, X. Chen, X. Li, B. Ma, and P. M. B. Vitanyi. The similarity metric. IEEE Transactions on Information Theory, 50(12):3250-3264, 2004.
8. S. W. Mahfoud. Niching Methods for Genetic Algorithms. PhD thesis, University of Illinois at Urbana-Champaign, Urbana, IL, May 1995.
9. J. Seward. bzip2 and libbzip2, version 1.0.5: A program and library for data compression, 1996-2007. http://www.bzip.org.
10. R. E. Smith, S. Forrest, and A. S. Perelson. Searching for diverse, cooperative populations with genetic algorithms. Evolutionary Computation, 1(2):127-149, 1992.
11. A. Teller. Advances in Genetic Programming, chapter 9. MIT Press, 1994.