Next: About this document ...
Up: No Title
Previous: Summary
-
- 1
- Geoffrey E. Hinton and Drew van Camp: `Keeping neural networks simple by minimizing the description length of the weights'. In: Proceedings of the COLT'93, (Santa Cruz, California, 1993) pp. 5-13
- 2
- S. Kullback and R. A. Leibler: `On information and sufficiency'. The Annals of Mathematical Statistics 22, pp. 79-86 (1951)
- 3
- Radford M. Neal: `Bayesian Learning for Neural Networks'. Lecture Notes in Statistics No. 118 (Springer-Verlag, 1996)
- 4
- Radford M. Neal and Geoffrey E. Hinton: `A view of the EM algorithm that justifies incremental, sparse and other variants'. In: Learning in Graphical Models. ed. by Michael I. Jordan (1998)
- 5
- Claude E. Shannon: `A mathematical theory of communication'. Bell System Technical Journal 27, pp. 379-423 and 623-656 (1948)
- 6
- S. M. Stigler: `Translation of Laplace's 1774 memoir on ``Probability of causes'''. Statistical Science, 1(3), pp. 359-378 (1986)
Harri Lappalainen
2000-03-03