Learning Population Codes by Minimizing Description Length
暂无分享,去创建一个
[1] A. P. Georgopoulos,et al. Neuronal population coding of movement direction. , 1986, Science.
[2] Richard Durbin,et al. An analogue approach to the travelling salesman problem using an elastic net method , 1987, Nature.
[3] J. Rissanen. Stochastic Complexity in Statistical Inquiry Theory , 1989 .
[4] Eric Saund,et al. Dimensionality-Reduction Using Connectionist Networks , 1989, IEEE Trans. Pattern Anal. Mach. Intell..
[5] Stephen P. Luttrell,et al. Derivation of a class of training algorithms , 1990, IEEE Trans. Neural Networks.
[6] David Willshaw,et al. Application of the elastic net algorithm to the formation of ocular dominance stripes , 1990 .
[7] Geoffrey E. Hinton,et al. Autoencoders, Minimum Description Length and Helmholtz Free Energy , 1993, NIPS.
[8] Stephen M. Omohundro,et al. Surface Learning with Applications to Lipreading , 1993, NIPS.
[9] Arnfried Ossen. Learning Topology-Preserving Maps Using Self-Supervised Backpropagation , 1993 .
[10] Peter Dayan,et al. Arbitrary Elastic Topologies and Ocular Dominance , 1993, Neural Computation.
[11] R. Zemel. A minimum description length framework for unsupervised learning , 1994 .