See this document in CiteSeerX!

A System for Incremental Learning Based on Algorithmic Probability (1989)  (Make Corrections)  (5 citations)
Ray J. Solomonoff
AAAI Symp on The Theory and Application of Minimal Length Encoding



  Home/Search   Context   Related

 
View or download:
std.com/~rjs/IncLrn89.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  std.com/~rjs/pubs (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We have employed Algorithmic Probability Theory to construct a system for machine learning of great power and generality. The principal thrust of present research is the design of sequences of problems to train this system. (Update)

Context of citations to this paper:   More

...language. Informally, a revolution corresponds to a self improvement with high conceptual jump size (an expression coined by Solomonoff, 1990), while evolution corresponds to a sequence of selfimprovements with low conceptual jump sizes. 3. Inserting prior bias. The...

.... Informally, a revolution corresponds to a self improvement with high conceptual jump size (an expression coined by Solomonoff [46]) One nice thing about open ended incremental self improvement is that there is no significant theoretical limit to the nature of the...

Cited by:   More
A General Method for Incremental Self-Improvement and.. - Schmidhuber (1996)   (Correct)
Minimal Model Complexity Search - Chris McConnell   (Correct)
A General Method for Incremental Self-Improvement and.. - Schmidhuber (1998)   (Correct)

Active bibliography (related documents):   More   All
1.5:   The Application Of Algorithmic Probability to Problems in.. - Solomonoff (1986)   (Correct)
0.5:   A FORMAL THEORY OF INDUCTIVE INFERENCE, Part l - Solomonoff (1964)   (Correct)
0.5:   Hopfield Neural Network in HEP Track Reconstruction - Muresan, Pentia (1995)   (Correct)

Similar documents based on text:   More   All
0.3:   Progress in Incremental Machine Learning - Solomonoff (2003)   (Correct)
0.2:   Inductive Inference Theory - A Unified Approach To Problems In.. - Solomonoff (1975)   (Correct)
0.2:   The Universal Distribution and Machine Learning - Solomonoff   (Correct)

Related documents from co-citation:   More   All
6:   A formal theory of inductive inference (context) - Solomonoff - 1964
5:   the length of programs for computing finite binary sequences - Chaitin - 1966
4:   An Introduction to Kolmogorov Complexity and Its Applications - Li, Vitanyi - 1997

BibTeX entry:   (Update)

Solomonoff, R. (1990). A system for incremental learning based on algorithmic probability. In Pednault, E. P. D., editor, The Theory and Application of Minimal-Length Encoding (Preprint of Symposium papers of AAAI 1990 Spring Symposium). http://citeseer.ist.psu.edu/solomonoff89system.html   More

@article{ solomonoff90system,
    author = "R. Solomonoff",
    title = "A system for incremental learning based on algorithmic probability",
    journal = "AAAI Symp on The Theory and Application of Minimal Length Encoding",
    pages = "140--146",
    year = "1990",
    url = "citeseer.ist.psu.edu/solomonoff89system.html" }
Citations (may not include all citations):
550   Parallel Distributed Processing (context) - Rumelhart, McCleland - 1986
537   A Theory of the Learnable (context) - Valiant - 1984
300   Soar: An Architecture for General Intelligence (context) - Newell, Laird et al. - 1987
144   Computational Limitations of Learning from Examples (context) - Valiant, Pitt - 1988
115   Simon and Schuster (context) - Minsky - 1986
95   Computer Science Press (context) - Storer - 1988
78   Universal Coding, Information, Prediction and Estimation (context) - Rissanen - 1984
68   The Acquisition of Syntactic Knowledge (context) - Berwick - 1985
63   The Definition of Random Sequences (context) - Martin--Lof - 1966
39   Randomness and Mathematical Proof (context) - Chaitin - 1975
31   CYC: Using Common Sense Knowledge to Overcome Brittleness an.. (context) - Lenat, Parkash et al. - 1986
24   McGraw--Hill (context) - of, Vision - 1975
23   AM: Discovery in Mathematics as Heuristic Search (context) - Lenat - 1982
18   Universal Search Problems (context) - Levin - 1973
13   Universal Gambling Schemes and the Complexity Measures of Ko.. (context) - Cover - 1974
10   An Information Theoretic Approach to time Bounds of On--Line.. (context) - Paul, Seifers et al. - 1981
6   A Procedure for Grammatical Inference (context) - Horning - 1971
5   Maximum Entropy as a Special Case of the Minimum Description.. (context) - Feder - 1988
3   Zator Co (context) - Report - 1960
2   Neurocomputing (context) - Anderson, Rosenfeld - 1988

Documents on the same site (http://world.std.com/~rjs/pubs.html):   More
The Application Of Algorithmic Probability to Problems in.. - Solomonoff (1986)   (Correct)
Progress in Incremental Machine Learning - Solomonoff (2003)   (Correct)
The Universal Distribution and Machine Learning - Solomonoff   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC