Wake-sleep algorithm
Algorithms AIMech:WakeSleepAlgorithm DRAFT
Aliases: Wake-sleep
An alternating learning procedure that trains a generative network from observed data and recognition-sampled hidden states during wake, and trains a recognition network from generative-model samples during sleep.
Identity Notes & Concept Scope
This is the original wake-sleep procedure with separate generative and recognition parameters. It is a training algorithm for a paired probabilistic model, distinct from the Helmholtz-machine architecture, exact EM, joint ELBO-gradient training in NVIL, and reweighted wake-sleep. The original binary-sigmoid construction supplies local delta rules; the general phase distinction does not require every later model variant to use those same units. No normalized identity match was found across all 442 pinned AIO labels/scoped synonyms and 340 preceding native IDs/names/aliases. Full-checkout fixed-string searches included ignored and hidden files in worktree and main, returning 24 and 24 lines respectively. All 17 unique matched line contents were inspected in full: NVIL method distinctions, source-reading scopes, prior reviews and the carried wake-sleep discovery lead, not existing candidate records. Exact checkout counts and differences are retained in the ledger. Nine exact AIO CLASS nodes with scoped synonyms/comments and outgoing edges and six full native neighboring records were inspected. Absence is bounded to this snapshot and semantic neighborhood.
Claims & Grounded Evidence
1 Claim
Mechanism
#method
During wake, present an observed input and sample its hidden representation layer by layer through the bottom-up recognition distribution q_phi(h|x). Hold recognition parameters fixed for this update and ascend log p_theta(x,h) in the generative parameters. For the original Bernoulli-sigmoid units, a generative weight receives a learning-rate-scaled product of its sampled parent state and the difference between the sampled target state and the generative activation probability; biases use a constant parent. During sleep, sample a full configuration (x,h) ancestrally from the current top-down generative model, then ascend log q_phi(h|x) in the recognition parameters while holding generative parameters fixed. The generated lower-layer states serve as inputs and their known sampled upper-layer causes as targets. This also gives local Bernoulli delta rules in the original parameterization. The wake update follows the generative-parameter variational-bound gradient at fixed q; the sleep update instead fits recognition on model-generated inputs and targets the posterior-to-recognition KL direction averaged under model inputs. The two phases are not generally gradients of the same data ELBO.
⚠️ Curated Limitations & Negative Results
- Recognition samples are exact for q, not necessarily the model posterior. The generative wake update need not be an unbiased marginal-likelihood gradient or even have the same direction; a curator binary example demonstrates this distinction.
- The sleep input distribution is the current model distribution rather than the empirical data distribution. Poor model samples can therefore allocate recognition capacity differently from data-conditioned training.
- The original recognition distribution factors within each layer conditional on the preceding layer. This can miss explaining-away dependencies in the posterior; it does not assert unconditional independence of every hidden variable across layers.
- The original paired-model sources explicitly do not establish a common descent objective for both phases. Exact posterior recovery, global convergence and monotonic likelihood improvement are not guaranteed.
- Local binary-sigmoid rules depend on the stated conditional parameterization. No biological implementation, author-code execution or benchmark advantage is certified.
Artificial Intelligence Ontology (AIO) Grounding
Mapped AIO Classes
| AIO Target Class | Mapping Relation | Mapping Rationale |
|---|---|---|
AIO:BayesianNetwork
Bayesian Network
|
related_match | The original procedure trains a layered directed generative model through its normalized conditional distributions and a separate recognition model. The pinned target denotes that directed probabilistic model class. This is a training-method-to-model related match, not a claim that the algorithm itself is a network or is equivalent to the AIO class. |
Evidence Sources & Primary Literature
3 Sources| Source ID | Publication / Document | Type / Access | Reference & Checksum |
|---|---|---|---|
method-source
|
Geoffrey E. Hinton, Peter Dayan, Brendan J. Frey, Radford M. Neal
|
primary paper
full_text
|
ID: doi:10.1126/science.7761831
sha256:a63370a3bd28…
|
helmholtz-source
|
Peter Dayan, Geoffrey E. Hinton, Radford M. Neal, Richard S. Zemel
|
primary paper
full_text
|
ID: doi:10.1162/neco.1995.7.5.889
sha256:317a1ee43ccc…
|
reweighted-source
|
Jörg Bornschein, Yoshua Bengio
|
primary paper
full_text
|
ID: arXiv:1406.2751v4
sha256:ddd18592df0b…
|
Curation Provenance
Curator: Codex
Method: ai_assisted
Model: GPT-6
Created: 2026-10-11T17:11:00Z
Updated: 2026-10-11T17:11:00Z
Source File:
data/curated/WakeSleepAlgorithm.yaml