Exploring the predictable
暂无分享,去创建一个
[1] Gerhard Weiß,et al. Hierarchical Chunking in Classifier Systems , 1994, AAAI.
[2] David J. C. MacKay,et al. Information-Based Objective Functions for Active Data Selection , 1992, Neural Computation.
[3] Jürgen Schmidhuber,et al. Discovering Predictable Classifications , 1993, Neural Computation.
[4] Gregory J. Chaitin,et al. On the Length of Programs for Computing Finite Binary Sequences: statistical considerations , 1969, JACM.
[5] N N Schraudolph,et al. Processing images by semi-linear predictability minimization. , 1997, Network.
[6] Jürgen Schmidhuber,et al. Flat Minima , 1997, Neural Computation.
[7] Kagan Tumer,et al. Using Collective Intelligence to Route Internet Traffic , 1998, NIPS.
[8] Jürgen Schmidhuber,et al. Market-Based Reinforcement Learning in Partially Observable Worlds , 2001, ICANN.
[9] Gerhard We. Hierarchical Chunking in Classifier Systems , 1994 .
[10] Charles F. Hockett,et al. A mathematical theory of communication , 1948, MOCO.
[11] Jürgen Schmidhuber,et al. A Local Learning Algorithm for Dynamic Feedforward and Recurrent Networks , 1989 .
[12] Stewart W. Wilson. Classifier Fitness Based on Accuracy , 1995, Evolutionary Computation.
[13] J. Schmidhuber. Facial beauty and fractal geometry , 1998 .
[14] H. Franke,et al. Ästhetik als Informationsverarbeitung , 1974 .
[15] Arthur L. Samuel,et al. Some studies in machine learning using the game of checkers , 2000, IBM J. Res. Dev..
[16] Eric B. Baum,et al. Toward a Model of Intelligence as an Economy of Agents , 1999, Machine Learning.
[17] Elie Bienenstock,et al. Neural Networks and the Bias/Variance Dilemma , 1992, Neural Computation.
[18] Gerald Tesauro,et al. TD-Gammon, a Self-Teaching Backgammon Program, Achieves Master-Level Play , 1994, Neural Computation.
[19] Garrison W. Cottrell,et al. Learning Mackey-Glass from 25 Examples, Plus or Minus 2 , 1993, NIPS.
[20] W. J. Studden,et al. Theory Of Optimal Experiments , 1972 .
[21] Sandip Sen,et al. Adaption and Learning in Multi-Agent Systems , 1995, Lecture Notes in Computer Science.
[22] Terrence J. Sejnowski,et al. Unsupervised Discrimination of Clustered Data via Optimization of Binary Information Gain , 1992, NIPS.
[23] Jürgen Schmidhuber,et al. Curious model-building control systems , 1991, [Proceedings] 1991 IEEE International Joint Conference on Neural Networks.
[24] Juergen Schmidhuber,et al. A General Method For Incremental Self-Improvement And Multi-Agent Learning In Unrestricted Environme , 1999 .
[25] Jürgen Schmidhuber,et al. Semilinear Predictability Minimization Produces Well-Known Feature Detectors , 1996, Neural Computation.
[26] Jürgen Schmidhuber,et al. Artificial curiosity based on discovering novel algorithmic predictability through coevolution , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).
[27] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.
[28] Long-Ji Lin,et al. Reinforcement learning for robots using neural networks , 1992 .
[29] John H. Holland,et al. Properties of the Bucket Brigade , 1985, ICGA.
[30] W. Daniel Hillis,et al. Co-evolving parasites improve simulated evolution as an optimization procedure , 1990 .
[31] Ray J. Solomonoff,et al. A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..
[32] Jenq-Neng Hwang,et al. Query-based learning applied to partially trained multilayer perceptrons , 1991, IEEE Trans. Neural Networks.
[33] Stewart W. Wilson. ZCS: A Zeroth Level Classifier System , 1994, Evolutionary Computation.
[34] Jürgen Schmidhuber,et al. Discovering Neural Nets with Low Kolmogorov Complexity and High Generalization Capability , 1997, Neural Networks.
[35] Jürgen Schmidhuber,et al. Shifting Inductive Bias with Success-Story Algorithm, Adaptive Levin Search, and Incremental Self-Improvement , 1997, Machine Learning.
[36] J. Schmidhuber. What''s interesting? , 1997 .
[37] Jordan B. Pollack,et al. Why did TD-Gammon Work? , 1996, NIPS.
[38] Jürgen Schmidhuber,et al. Learning Factorial Codes by Predictability Minimization , 1992, Neural Computation.
[39] Jürgen Schmidhuber,et al. Reinforcement Learning with Self-Modifying Policies , 1998, Learning to Learn.
[40] Douglas B. Lenat,et al. Theory Formation by Heuristic Search , 1983, Artificial Intelligence.
[41] Jürgen Schmidhuber,et al. A possibility for implementing curiosity and boredom in model-building neural controllers , 1991 .
[42] Jürgen Schmidhuber,et al. Low-Complexity Art , 2017 .
[43] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.
[44] David A. Cohn,et al. Neural Network Exploration Using Optimal Experiment Design , 1993, NIPS.
[45] A. Kolmogorov. Three approaches to the quantitative definition of information , 1968 .