ACM Home Page
Please provide us with feedback. Feedback
Keeping the neural networks simple by minimizing the description length of the weights
Full text PdfPdf (889 KB)
Source Annual Workshop on Computational Learning Theory archive
Proceedings of the sixth annual conference on Computational learning theory table of contents
Santa Cruz, California, United States
Pages: 5 - 13  
Year of Publication: 1993
ISBN:0-89791-611-5
Authors
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 15,   Downloads (12 Months): 47,   Citation Count: 21
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/168304.168306
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
Le Cun, Y., Boser, B., Denker, J. S., Henderson, D., Howard, R. E., Hubbard, W. and Jackel, L. D. (1989) Back-Propagation Applied to Handwritten Zipcode Recognition. Neural Computation, 1, 541-551.
 
4
 
5
Neal, R. M. (1993) Bayesian learning via stochastic dynamics. In Giles, C. L., Hanson, S. J. and Cowan, J.
 
6
D. (Eds), Advances in Neural Information Processing Systems 5, Morgan Kaufmann, San Mateo CA.
 
7
 
8
Rissanen, J. (1986) Stochastic Complexity and Modeling. Annals of Statistics, 14, 1080-1100.

CITED BY  21

Collaborative Colleagues:
Geoffrey E. Hinton: colleagues
Drew van Camp: colleagues