G-maximization: An unsupervised learning procedure for discovering regularities
暂无分享,去创建一个
Hill climbing is used to maximize an information theoretic measure of the difference
between the actual behavior of a unit and the behavior that would be predicted by a
statistician who knew the first order statistics of the inputs but believed them to be
independent. This causes the unit to detect higher order correlations among its inputs.
Initial simulations are presented, and seem encouraging. We describe an extension of the
basic idea which makes it resemble competitive learning and which causes members of a
population of these units to differentiate, each extracting different structure from the input.
[1] D. Marr. A theory of cerebellar cortex , 1969, The Journal of physiology.
[2] Roman Bek,et al. Discourse on one way in which a quantum-mechanics language on the classical logical base can be built up , 1978, Kybernetika.
[3] Francis Crick,et al. The function of dream sleep , 1983, Nature.
[4] Geoffrey E. Hinton,et al. A Learning Algorithm for Boltzmann Machines , 1985, Cogn. Sci..
[5] Geoffrey E. Hinton,et al. Learning internal representations by error propagation , 1986 .