Searching for minimal neural networks in fourier space

Artificial General Intelligence - Proceedings of the Third Conference on Artificial General Intelligence, AGI 2010

Volumn , Issue , 2010, Pages 61-66

  Koutník, Jan ^a,b   Gomez, Faustino ^a,b   Schmidhuber, Jürgen ^a,b  

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

^b UNIVERSITY OF LUGANO   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; ENCODING (SYMBOLS); FREQUENCY DOMAIN ANALYSIS; NATURAL LANGUAGE PROCESSING SYSTEMS;

FREQUENCY COEFFICIENT; FREQUENCY DOMAINS; GENERALIZATION PERFORMANCE; LONG-TERM DEPENDENCIES; MINIMUM DESCRIPTION LENGTH; TRAINING EXAMPLE; UNIVERSAL NETWORK; WEIGHT MATRICES;

NETWORK CODING;

EID: 77954099341     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.2991/agi.2010.28     Document Type: Conference Paper

References (16)

1. Zdeněk Buk, Jan Koutník, and Miroslav Šnorek. NEAT in HyperNEAT substituted with genetic programming. In International Conference on Adaptive and Natural Computing Algorithms (ICANNGA 2009), 2009.
2. S. Dominic, R. Das, D. Whitley, and C. Anderson. Genetic reinforcement learning for neural networks. In Proceedings of the International Joint Conference on Neural Networks (Seattle, WA), pages 71-76. Piscataway, NJ: IEEE, 1991.
3. Frederic Gruau. Cellular encoding of genetic neural networks. Technical Report RR-92-21, Ecole Normale Superieure de Lyon, Institut IMAG, Lyon, France, 1992.
4. Jason Gauci and Kenneth Stanley. Generating large-scale neural networks through discovering geometric regularities. In Proceedings of the Conference on Genetic and Evolutionary Computation, pages 997-1004, New York, NY, USA, 2007. ACM.
5. A. N. Kolmogorov. Three approaches to the quantitative definition of information. Problems of Information Transmission, 1:1-11, 1965.
6. L. A. Levin. Universal sequential search problems. Problems of Information Transmission, 9(3):265-266, 1973.
7. M. Li and P. M. B. Vitányi. An Introduction to Kolmogorov Complexity and its Applications (2nd edition). Springer, 1997.
8. Nicholas J. Radcliffe. Genetic set recombination and its application to neural network topology optimisation. Neural Computing and Applications, 1(1):67-90, 1993.
9. J. Rissanen. Modeling by shortest data description. Automatica, 14:465-471, 1978.
10. J. Schmidhuber. Discovering solutions with low Kolmogorov complexity and high generalization capability. In A. Prieditis and S. Russell, editors, Proceedings of the Twelfth International Conference on Machine Learning (ICML), pages 488-496. Morgan Kaufmann Publishers, San Francisco, CA, 1995.
11. J. Schmidhuber. Discovering neural nets with low Kolmogorov complexity and high generalization capability. Neural Networks, 10(5):857-873, 1997.
12. J. Schmidhuber. The Speed Prior: a new simplicity measure yielding near-optimal computable predictions. In J. Kivinen and R. H. Sloan, editors, Proceedings of the 15th Annual Conference on Computational Learning Theory (COLT 2002), Lecture Notes in Artificial Intelligence, pages 216-228. Springer, Sydney, Australia, 2002.
13. R. J. Solomonoff. A formal theory of inductive inference. Part I. Information and Control, 7:1 - 22, 1964.
14. Tom Schaul and Jürgen Schmidhuber. Towards a practical universal search. In Submitted to the Third Conference on Artficial General Intelligence, 2010.
15. C. S. Wallace and D. M. Boulton. An information theoretic measure for classification. Computer Journal, 11(2): 185-194, 1968.
16. Alexis Wieland. Evolving neural network controllers for unstable systems. In Proceedings of the International Joint Conference on Neural Networks (Seattle, WA), pages 667-673. Piscataway, NJ: IEEE, 1991.