Developmental robotics, optimal artificial curiosity, creativity, music, and the fine arts

Connection Science

Volumn 18, Issue 2, 2006, Pages 173-187

  Schmidhuber, Jürgen ^a,b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

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

Author keywords

Artificial creativity; Artificial curiosity; Developmental robotics; Exploration; Fine arts; Music; World models

Indexed keywords

ARTIFICIAL CREATIVITY; ARTIFICIAL CURIOSITY; DEVELOPMENTAL ROBOTICS; FINE ARTS; MUSIC; WORLD MODEL;

MACHINE DESIGN; NATURAL RESOURCES EXPLORATION; OPTIMIZATION; REINFORCEMENT LEARNING;

ROBOTICS;

EID: 33745616086     PISSN: 09540091     EISSN: 13600494     Source Type: Journal    
DOI: 10.1080/09540090600768658     Document Type: Review

References (63)

1. M. Balter, "Seeking the key to music", Science, 306, pp. 1120-1122, 2004.
2. A.G. Barto, S. Singh and N. Chentanez, "Intrinsically motivated learning of hierarchical collections of skills", in Proceedings of International Conference on Developmental Learning (ICDL), Cambridge, MA: MIT Press, 2004.
3. D. Blank and L. Meeden, Developmental Robotics AAAI Spring Symposium, Stanford, CA. Available online at: http://cs.brynmawr.edu/DevRob05/schedule/, 2005.
4. D. Blank and L. Meeden, "Introduction to developmental robotics", Connect. Sci., 18(2), pp. 93-96, 2006.
5. D.A. Cohn, "Neural network exploration using optimal experiment design", in Advances in Neural Information Processing Systems 6, J., Cowan, G. Tesauro and J. Alspector, eds, Morgan Kaufmann, 1994, pp. 679-686.
6. V.V. Fedorov, Theory of Optimal Experiments, Academic Press, 1972.
7. K. Gödel, Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I, Monatshefte für Mathematik und Physik, 38, pp. 173-198, 1931.
8. K. Gold and B. Scassellati, "Learning acceptable windows of contingency", Connect. Sci., 18(2), pp. 217-228, 2006.
9. S. Hochreiter and J. Schmidhuber, "Long short-term memory", Neural Comput., 9(8), pp. 1735-1780, 1997.
10. D.A. Huffman, "A method for construction of minimum-redundancy codes", Proc. IRE, 40, pp. 1098-1101, 1952.
11. M. Hutter, Universal Artificial Intelligence: Sequential Decisions based on Algorithmic Probability, Berlin: Springer, (On J. Schmidhuber's SNF grant 20-61847), 2004.
12. J. Hwang, J. Choi, S. Oh and R.J.M. II, "Query-based learning applied to partially trained multilayer perceptrons", IEEE Trans. Neural Netw., 2(1), pp. 131-136, 1991.
13. L.P. Kaelbling, M.L. Littman and A.W. Moore, "Reinforcement learning: a survey", Journal of AI Res., 4, pp. 237-285, 1996.
14. A.N. Kolmogorov, "Three approaches to the quantitative definition of information", Probl. Inf. Transm., 1, pp. 1-11, 1965.
15. B. Kuipers, P. Beeson, J. Modayil and J. Provost, "Bootstrap learning of foundational representations", Connect. Sci., 18(2), pp. 145-158, 2006.
16. S. Kullback, Statistics and Information Theory, New York: John Wiley and Sons, 1959.
17. L.A. Levin, "Universal sequential search problems", Probl. Inf. Transm., 9(3), pp. 265-266, 1973.
18. M. Li and P.M.B. Vitányi, An Introduction to Kolmogorov Complexity and its Applications (2nd edition), Springer, 1997.
19. D.J.C. MacKay, "Information-based objective functions for active data selection", Neural Comput., 4(2), pp. 550-604, 1992.
20. L. Olsson, C.L. Nehaniv and D. Polani, "From unknown sensors and actuators to actions grounded in sensorimotor perceptions", Connect. Sci., 18(2), pp. 121-144, 2006.
21. P.-Y. Oudeyer and F. Kaplan, "Discovering communication", Connect. Sci., 18(2), pp. 189-206, 2006.
22. B. A. Pearlmutter, "Gradient calculations for dynamic recurrent neural networks: a survey", IEEE Trans. Neural Netw., 6(5), pp. 1212-1228, 1995.
23. R. Penrose, "A generalized inverse for matrices", in Proceedings of the Cambridge Philosophy Society, 1955, vol. 51, pp. 406-413.
24. S. Pinker, How the mind works, New York: Norton, 1997.
25. M. Plutowski, G. Cottrell and H. White, "Learning Mackey-Glass from 25 examples, plus or minus 2", in Advances in Neural Information Processing Systems 6, J. Cowan, G. Tesauro and J. Alspector, eds, Morgan Kaufmann, 1994, pp. 1135-1142.
26. J. Provost, B.J. Kuipers and R. Miikkulainen, "Developing navigation behavior through self-organizing distinctive state abstraction", Connect. Sci., 18(2), pp. 159-172, 2006.
27. A.J. Robinson and F. Fallside, "The utility driven dynamic error propagation network". Technical Report CUED/F-INFENG/TR.1, Cambridge University, Engineering Department (1987).
28. M. Schlesinger, "Decomposing infants' object representations: a dual-route processing account", Connect. Sci., 18(2), pp. 207-216, 2006.
29. J. Schmidhuber, "Making the world differentiable: on using fully recurrent self-supervised neural networks for dynamic reinforcement learning and planning in non-stationary environments". Technical Report FKI-126-90, Institut für Informatik, Technische Universität München (1990).
30. J. Schmidhuber, "Adaptive curiosity and adaptive confidence". Technical Report FKI-149-91, Institut für Informatik, Technische Universität München, (1991a); See also (Schmidhuber, 1991b).
31. J. Schmidhuber, "Curious model-building control systems", in Proceedings of the International Joint Conference on Neural Networks, Singapore, vol. 2, IEEE Press, 1991b, pp. 1458-1463.
32. J. Schmidhuber, "A possibility for implementing curiosity and boredom in model-building neural controllers", in Proc. of the International Conference on Simulation of Adaptive Behavior: From Animals to Animals, J.A. Meyer and S.W. Wilson, eds, MIT Press/Bradford Books, 1991c, pp. 222-227.
33. J. Schmidhuber, "Reinforcement learning in Markovian and non-Markovian environments", in Advances in Neural Information Processing Systems 3 (NIPS 3), D.S. Lippman, J.E. Moody and D.S. Touretzky, eds, Morgan Kaufmann, 199 Id, pp. 500-506.
34. 3) time complexity learning algorithm for fully recurrent continually running networks", Neural Comput., 4(2), 243-248, 1992a.
35. J. Schmidhuber, "Learning complex, extended sequences using the principle of history compression", Neural Comput., 4(2), 234-242, 1992b.
36. J. Schmidhuber, "Low-complexity art", Leonardo, J. Int. Soc. Arts, Sci. Technol., 30(2), 97-103, 1997a.
37. J. Schmidhuber, "What's interesting?". Technical Report IDSIA-35-97, IDSIA. Available online at: ftp://ftp.idsia.ch/pub/juergen/ interest.ps.gz (1997b); extended abstract in Proc. Snowbird'98, Utah, 1998; see also (Schmidhuber, 2002a).
38. J. Schmidhuber, "Facial beauty and fractal geometry". Technical Report TR IDSIA-28-98, IDSIA, Published in the Cogprint Archive: http://cogprints.soton.ac.uk, (1998).
39. J. Schmidhuber, "Exploring the predictable", in Advances in Evolutionary Computing, A. Ghosh and S. Tsuitsui, eds, Springer, 2002a, pp. 579-612.
40. J. Schmidhuber, "Hierarchies of generalized Kolmogorov complexities and nonenumerable universal measures computable in the limit", Int. J. Found. Comput. Sci., 13(4), 587-612, 2002b.
41. J. Schmidhuber, "The Speed Prior: a new simplicity measure yielding near-optimal computable predictions", in Proceedings of the 15th Annual Conference on Computational Learning Theory (COLT 2002), J. Kivinen and R.H. Sloan, eds, Lecture Notes in Artificial Intelligence, Sydney, Australia: Springer, 2002c, pp. 216-228.
42. J. Schmidhuber. "Gödel machines: self-referential universal problem solvers making provably optimal self-improvements". Technical Report IDSIA-19-03, arXiv:cs.LO/0309048, IDSIA, Manno-Lugano, Switzerland, (2003).
43. J. Schmidhuber. "Overview of artificial curiosity and active exploration, with links to publications since 1990". Available online at: http://www.idsia.ch/~juergen/interest.html, (2004a).
44. J. Schmidhuber, "Overview of work on robot learning, with publications". Available online at: http://www.idsia.ch/~juergen/ learningrobots.html, (2004b).
45. J. Schmidhuber, "RNN overview, with links to a dozen journal publications". Available online at "http://www.idsia.ch/~juergen/rnn. html, (2004c).
46. J. Schmidhuber, "Completely self-referential optimal reinforcement learners", in Artificial Neural Networks: Biological Inspirations - ICANN 2005, LNCS 3697, W. Duch, J. Kacprzyk, E. Oja and S. Zadrozny, eds, Berlin, Heidelberg: Springer-Verlag, 2005a, pp. 223-233, Plenary talk
47. J. Schmidhuber, "Gödel machines: fully self-referential optimal universal problem solvers", in Artificial General Intelligence, B. Goertzel and C. Pennachin, eds, Springer Verlag, 2006.
48. J. Schmidhuber, "Gödel machines: towards a technical justification of consciousness", in Adaptive Agents and Multi-Agent Systems III (LNCS 3394), D. Kudenko, D. Kazakov and E. Alonso, eds, Springer Verlag, 2005c, pp. 1-23.
49. J. Schmidhuber and B. Bakker, "NIPS 2003 RNNaissance workshop on recurrent neural networks, Whistler, CA". Available online at: http://www.idsia.ch/~juergen/rnnaissance.html, (2003).
50. J. Schmidhuber and S. Heil, "Sequential neural text compression", IEEE Trans. Neural Netw., 7(1), pp. 142-146, 1996.
51. J. Schmidhuber and R. Huber, "Learning to generate artificial fovea trajectories for target detection", Int. J. Neural Syst., 2(1 & 2), pp. 135-141, 1991.
52. J. Schmidhuber, J. Zhao and N. Schraudolph, "Reinforcement learning with self-modifying policies", in Learning to learn, S. Thrun and L. Pratt, eds, Kluwer, 1997a, pp. 293-309.
53. J. Schmidhuber, J. Zhao and M. Wiering, "Shifting inductive bias with success-story algorithm, adaptive Levin search, and incremental self-improvement", Mach. Learn., 28, pp. 105-130, 1997b.
54. S. Singh, A.G. Barto and N. Chentanez, "Intrinsically motivated reinforcement learning", in Advances in Neural Information Processing Systems 17 (NIPS), Cambridge, MA: MIT Press, 2005.
55. R.J. Solomonoff, "A formal theory of inductive inference. Part I", Inf. Control, 7, pp. 1-22, 1964.
56. R.J. Solomonoff, "Complexity-based induction systems", IEEE Trans. Inf. Theory, IT-24(5), pp. 422-432, 1978.
57. J. Storck, S. Hochreiter and J. Schmidhuber, "Reinforcement driven information acquisition in non-deterministic environments", in Proceedings of the International Conference on Artificial Neural Networks, Paris, vol. 2, EC2 & Cie, 1995, pp. 159-164.
58. D. Stronger and P. Stone, "Towards autonomous sensor and actuator model induction on a mobile robot", Connect. Sci., 18(2), pp. 97-119, 2006.
59. R. Sutton and A. Barto, Reinforcement Learning: An Introduction, MIT Press: Cambridge, MA, 1998.
60. A.M. Turing, "On computable numbers, with an application to the Entscheidungsproblem", Proc. London Mathematical Soc., Series 2, 41, pp. 230-267, 1936.
61. C.J.C.H. Watkins, "Learning from delayed rewards". PhD Thesis, King's College, Oxford, 1989.
62. P.J. Werbos, "Generalization of backpropagation with application to a recurrent gas market model", Neural Netw., 1, pp. 339-356, 1988.
63. R.J. Williams and D. Zipser, "Gradient-based learning algorithms for recurrent networks and their computational complexity", in Back-Propagation: Theory, Architectures and Applications. Hillsdale, NJ: Erlbaum, 1994.