1995
DOI: 10.1126/science.7761831
|View full text |Cite
|
Sign up to set email alerts
|

The "Wake-Sleep" Algorithm for Unsupervised Neural Networks

Abstract: An unsupervised learning algorithm for a multilayer network of stochastic neurons is described. Bottom-up "recognition" connections convert the input into representations in successive hidden layers, and top-down "generative" connections reconstruct the representation in one layer from the representation in the layer above. In the "wake" phase, neurons are driven by recognition connections, and generative connections are adapted to increase the probability that they would reconstruct the correct activity vecto… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

9
600
0

Year Published

2000
2000
2024
2024

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 827 publications
(620 citation statements)
references
References 6 publications
9
600
0
Order By: Relevance
“…The target entering the opposite net slowly "cools down" to become the input. The Helmholtz Machine (Dayan et al, 1995;Dayan and Hinton, 1996) may be viewed as an unsupervised (Sec. 5.6.4) variant thereof (Peter Dayan, personal communication, 1994).…”
Section: Ideas For Dealing With Long Time Lags and Deep Capsmentioning
confidence: 99%
See 1 more Smart Citation
“…The target entering the opposite net slowly "cools down" to become the input. The Helmholtz Machine (Dayan et al, 1995;Dayan and Hinton, 1996) may be viewed as an unsupervised (Sec. 5.6.4) variant thereof (Peter Dayan, personal communication, 1994).…”
Section: Ideas For Dealing With Long Time Lags and Deep Capsmentioning
confidence: 99%
“…Many UL methods are designed to maximize entropy-related, information-theoretic (Boltzmann, 1909;Shannon, 1948;Kullback and Leibler, 1951) objectives (e.g., Linsker, 1988;Barlow et al, 1989;MacKay and Miller, 1990;Plumbley, 1991;Schmidhuber, 1992b,c;Schraudolph and Sejnowski, 1993;Redlich, 1993;Zemel, 1993;Zemel and Hinton, 1994;Field, 1994;Hinton et al, 1995;Dayan and Zemel, 1995;Amari et al, 1996;Deco and Parra, 1997).…”
Section: Potential Benefits Of Ul For Slmentioning
confidence: 99%
“…factor and cluster analysis) and those motivated by Bayesian inference and learning (e.g. Dayan et al, 1995;Hinton, Dayan, Frey, & Neal, 1995). The goal of generative models is "to learn representations that are economical to describe but allow the input to be reconstructed accurately" .…”
Section: The Nature Of Inputs Causes and Representationsmentioning
confidence: 99%
“…factor and cluster analysis) and those motivated by Bayesian inference and learning (e.g. Dayan et al, 1995;Hinton et al, 1995). Indeed many of the algorithms discussed under the heading of information theory can be formulated as generative models.…”
Section: Generative Models and Representational Learningmentioning
confidence: 99%