Discovering Neural Nets with Low Kolmogorov Complexity and High Generalization Capability
- 1 July 1997
- journal article
- Published by Elsevier in Neural Networks
- Vol. 10 (5) , 857-873
- https://doi.org/10.1016/s0893-6080(96)00127-x
Abstract
No abstract availableKeywords
This publication has 50 references indexed in Scilit:
- Statistical Theory of Learning Curves under Entropic Loss CriterionNeural Computation, 1993
- Understanding Retinal Color Coding from First PrinciplesNeural Computation, 1992
- Applications of Time-Bounded Kolmogorov Complexity in Complexity TheoryPublished by Springer Nature ,1992
- UNSUPERVISED LEARNING PROCEDURES FOR NEURAL NETWORKSInternational Journal of Neural Systems, 1991
- Unsupervised LearningNeural Computation, 1989
- What Size Net Gives Valid Generalization?Neural Computation, 1989
- Occam's RazorInformation Processing Letters, 1987
- Neuronlike adaptive elements that can solve difficult learning control problemsIEEE Transactions on Systems, Man, and Cybernetics, 1983
- On the Length of Programs for Computing Finite Binary SequencesJournal of the ACM, 1969
- On the Length of Programs for Computing Finite Binary SequencesJournal of the ACM, 1966