One Big Net For Everything

By J. Urgen Schmidhuber. 2018

34 citations recorded by the source corpus.

I apply recent work on "learning to think" (2015) and on PowerPlay (2011) to the incremental training of an increasingly general problem solver, continually learning to solve new tasks without forgetting previous skills. The problem solver is a single recurrent neural network (or similar general purpose computer) called ONE. ONE is unusual in the sense that it is trained in various ways, e.g., by black box optimization / reinforcement learning / artificial evolution as well as supervised / unsupervised learning. For example, ONE may learn through neuroevolution to control a robot through environment-changing actions, and learn through unsupervised gradient descent to predict future inputs and vector-valued reward signals as suggested in 1990. User-given tasks can be defined through extra goal-defining input patterns, also proposed in 1990. Suppose ONE has already learned many skills. Now a copy of ONE can be re-trained to learn a new skill, e.g., through neuroevolution without a teacher. Here it may profit from re-using previously learned subroutines, but it may also forget previous skills. Then ONE is retrained in PowerPlay style (2011) on stored input/output traces of (a) ONE's copy executing the new skill and (b) previous instances of ONE whose skills are still considered worth memorizing. Simultaneously, ONE is retrained on old traces (even those of unsuccessful trials) to become a better predictor, without additional expensive interaction with the enviroment. More and more control and prediction skills are thus collapsed into ONE, like in the chunker-automatizer system of the neural history compressor (1991). This forces ONE to relate partially analogous skills (with shared algorithmic information) to each other, creating common subroutines in form of shared subnetworks of ONE, to greatly speed up subsequent learning of additional, novel but algorithmically related skills.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Large Language Models

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Sergey Levine
  2. Yoshua Bengio
  3. Pieter Abbeel
  4. Ruslan Salakhutdinov
  5. Quoc V. Le
  6. Chelsea Finn
  7. Mohit Bansal
  8. Trevor Darrell

In Computational Theory and Mathematics

  1. Sergey Levine
  2. Yoshua Bengio
  3. David R Ha
  4. Richard E. Turner
  5. Yee Whye Teh
  6. Nicolas Manfred Otto Heess
  7. Jost Tobias Springenberg
  8. Emilio Parisotto

In Large Language Models

  1. Sergey Levine
  2. Yoshua Bengio
  3. Yee Whye Teh
  4. Oriol Vinyals
  5. David R Ha
  6. Razvan Pascanu
  7. Ryota Kanai
  8. Shuntaro Sasai

Citations in the corpus