Measuring and optimizing behavioral complexity for evolutionary reinforcement learning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5769 LNCS, Issue PART 2, 2009, Pages 765-774

  Gomez, Faustino J ^a   Togelius, Julian ^a   Schmidhuber, Juergen ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL LEARNING; BEHAVIORAL COMPLEXITY; DECISION TASK; MODEL COMPLEXITY; STATIC PROBLEMS; STRUCTURAL COMPLEXITY;

BACKPROPAGATION; DECISION MAKING; REINFORCEMENT; REINFORCEMENT LEARNING;

NEURAL NETWORKS;

EID: 70450227694     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04277-5_77     Document Type: Conference Paper

References (16)

1. Baronchelli, A., Caglioti, E., Loreto, V.: Artificial sequences and complexity measures. Journal of Statistical Mechanics (2005)
2. De Jong, E.D., Pollack, J.B.: Multi-objective methods for tree size control. Genetic Programming and Evolvable Machines 4(3), 211-233 (2003)
3. De Jong, E.D., Watson, R.A., Pollack, J.B.: Reducing bloat and promoting diversity using multi-objective methods. In: Spector, L., Goodman, E.D., Wu, A., Langdon, W.B., Voigt, H.-M., Gen, M., Sen, S., Dorigo, M., Pezeshk, S., Garzon, M.H., Burke, E. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, pp. 11-18. Morgan Kaufmann, San Francisco (2001)
4. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transaction on Evolutionary Computation 6, 182-197 (2002)
5. Gomez, F.: Sustaining diversity using behavioral information distance. In: Proceedings of the Genetic and Evolutionary Computation Conference (to appear, 2009)
6. Iba, H., Garis, H.D., Sato, T.: Genetic programming using a minimum description length principle. In: Advances in Genetic Programming, pp. 265-284. MIT Press, Cambridge (1994)
7. Li, M., Vitányi, P.M.B.: An introduction to Kolmogorov complexity and its applications. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, pp. 188-254. Elsevier Science Publishers B.V., Amsterdam (1990)
8. Rissanen, J.: Modeling by shortest data description. Automatica, 465-471 (1978)
9. Teller, A.: Advances in Genetic Programming, ch. 9. MIT Press, Cambridge (1994)
10. Toffolo, A., Benini, E.: Genetic diversity as an objective in multi-objective evolutionary algorithms. Evolutionary Computation 11(2), 151-167 (2003)
11. Togelius, J.: Optimization, Imitation and Innovation: Computational Intelligence and Games. PhD thesis, Department of Computing and Electronic Systems, University of Essex, Colchester, UK (2007)
12. Zhang, B.-T., Muhlenbein, H.: Evolving optimal neural networks using genetic algorithms with occam's razor. Complex Systems 7, 199-220 (1993)
13. Zhang, B.-T., Muhlenbein, H.: Balancing accuracy and parsimony in genetic programming. Evolutionary Computation 3, 17-38 (1995)
14. Zhang, B.-T., Mühlenbein, H.: MDL-based fitness functions for learning parsimonious programs. In: Siegel, E.V., Koza, J.R. (eds.) Working Notes for the AAAI Symposium on Genetic Programming, November 10-12, pp. 122-126. MIT, Cambridge (1995) AAAI
15. Zhang, B.-T., Ohm, P., Mühlenbein, H.: Evolutionary induction of sparse neural trees. Evolutionary Computation 5(2), 213-236 (1997)
16. Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory (September 1978)