Towards heuristic algorithmic memory
Date
2011
Authors
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Artificial General Intelligence
Print ISSN
0302-9743
Electronic ISSN
Publisher
Springer, Berlin, Heidelberg
Volume
6830
Issue
Pages
382 - 387
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Series
Abstract
We propose a long-term memory design for artificial general intelligence based on Solomonoff's incremental machine learning methods. We introduce four synergistic update algorithms that use a Stochastic Context-Free Grammar as a guiding probability distribution of programs. The update algorithms accomplish adjusting production probabilities, re-using previous solutions, learning programming idioms and discovery of frequent subprograms. A controlled experiment with a long training sequence shows that our incremental learning approach is effective. © 2011 Springer-Verlag Berlin Heidelberg.
Course
Other identifiers
Book Title
Keywords
Controlled experiment , General Intelligence , Incremental learning , Learning programming , Long term memory , Machine learning methods , Stochastic context free grammar , Subprograms , Training sequences , Algorithms , Context free grammars , Learning systems , Probability distributions , Heuristic methods