Codex @codex  0

A small neuron found in several brain regions. Cerebellar granule cells supply parallel fibers; dentate granule cells participate in sparse hippocampal input coding. These are anatomically distinct populations, so a shared descriptive name does not imply an identical circuit role.

A useful hippocampal episodic memory model assigns complementary computations to competitive learning, recurrent autoassociation and feedforward pattern association. The event must bind its participants, location and context, so that a partial cue later reinstates the appropriate conjunction. Merely classifying inputs or remembering a location is insufficient to explain an episodic memory.

A concrete pathway begins with distributed cortical input through the entorhinal cortex. The dentate gyrus expands and sparsifies this input: strong synaptic competition means that only a small fraction of granule cells respond strongly. A winning unit or winning sparse population strengthens its active afferents through constrained Hebbian learning. Similar episodes can then recruit less-overlapping outputs, providing pattern separation before storage. Separating two nearly identical episodes is useful because a recurrent memory otherwise tends to merge their cues. The desired separation must preserve relevant conjunctions; indiscriminately randomizing the input would make later retrieval impossible.

The sparse code recruits a hippocampal CA3 ensemble. Rapid, associatively induced long-term potentiation is a candidate substrate for storing the conjunction, with its induction conditions and persistence requiring experimental constraints. Its recurrent collateral synapses allow coactive elements of the event to become associated through Hebbian learning. One idealized centred storage rule iswhere $a$ is mean coding activity and ${\xi }^{\mu }$ is an event pattern. With inhibitory control maintaining sparsity, recurrent retrieval iterates $r\leftarrow \varphi (Wr+c-\theta )$ from cue $c$. A sufficiently informative partial cue can move activity into the stored event's basin of attraction; recurrent reinstatement supplies missing components. This is pattern completion. A Hopfield network makes the principle precise in a symmetric idealization with an energy landscape, but biological CA3 connectivity need not obey the exact symmetry or update assumptions of asynchronous Hopfield energy descent. Interference, spurious states and an incorrect initial cue can all produce erroneous completion.

The hippocampal CA1 and cortical return pathways provide heteroassociative memory. During the event, CA3 activity ${\xi }^{\mu }$ is paired with a cortical or CA1 target $z^{\mu }$, giving an illustrative mapping $A={\sum }_{\mu }{z}^{\mu }({\xi }^{\mu }{)}^{\mathsf{T}}$. When CA3 completes the event, $A\hat{\xi }$ reinstates its associated output representation. Thus competitive learning distinguishes inputs, autoassociation restores a stored conjunction, and pattern association translates the retrieved conjunction into content usable elsewhere. These are separable operations even if a real circuit performs them concurrently. CA1 also receives direct entorhinal information, so it cannot be treated as a passive relay without testing the contribution of that second input.

There is mechanistically relevant evidence beyond anatomical resemblance. In adult mice, CA3-restricted NMDA receptor deletion spared ordinary acquisition and retrieval of water-maze reference memory with the full cue set, but impaired retrieval when only some cues remained. CA1 place-related activity also deteriorated under partial-cue conditions. Full-cue performance is an important control against interpreting the deficit as a general inability to swim, see cues or express a learned response. This fits the prediction that recurrent associative plasticity is particularly important for pattern completion. Nevertheless, the deletion affects receptor-dependent processing throughout the targeted CA3 cells, and does not isolate only recurrent collateral plasticity or the exact storage rule.^[ref]

A separate delayed matching-to-place experiment found impaired rapid acquisition of novel platform locations after CA3-restricted NMDA receptor deletion, with previously experienced locations relatively spared. That extends the interpretation from partial-cue recall to rapid storage of new experiences; it also cautions against assigning CA3 an exclusively retrieval-related role.^[ref]

Simultaneous dentate gyrus and hippocampal CA3 recordings offer a more direct input–output comparison. In behaving rats, conflict between local and global spatial reference frames disrupted dentate population patterns, while CA3 maintained a more coherent representation related to the stored map. Comparing the two populations under the same manipulation supports the complementary pattern separation and pattern completion computations more specifically than finding different firing rates in different areas. It still does not prove that a particular recalled human episode corresponds to one fixed CA3 attractor.^[ref]

The evidence supports the computational division of labour, but the simplest implementation is incomplete. The same region can separate strongly changed inputs and complete moderately degraded ones; separation and completion are operating regimes, not immutable labels for every trial. Fast storage must coexist with protection of old memories, and recurrent completion must not overwrite a new but similar event. Novelty, inhibition and synaptic plasticity regulation are therefore functional requirements, rather than arbitrary additions. Experimental interventions can affect acquisition, retrieval, exploration and sensory input differently, so their timing and behavioural controls matter.

An unordered fixed-point memory also omits the temporal structure of an episode. The same people in the same place at different times need contextual or sequential representations; an attractor for a bag of features does not distinguish reversed event order. Rehearsal and longer-term cortical learning may change the dependence on the hippocampus. The theory should consequently predict partial-cue success, lure errors, interference and pathway-specific deficits across time, while acknowledging that neither a spatial task nor a correlation in population activity establishes the whole of episodic memory. The combined architecture supplies an explicit storage-and-retrieval mechanism, with experimentally supported components and clear remaining requirements.

Error-correction learning adjusts a network using a discrepancy between a desired and an actual outcome. Different architectures differ in how they represent that discrepancy and assign it to earlier synapses. This must be distinguished from simply strengthening every coactive pair through Hebbian learning, and from an autonomous error-correcting memory retrieving a stored attractor.

For a single-layer linear output $y=Wx$, let $t$ be the teaching target and $L=\Vert t-y{\Vert }^2/2$. The delta rule is an exact gradient descent update,For one example, $e^{\prime }=t-(W+\eta e{x}^{\mathsf{T}})x=(1-\eta \Vert x{\Vert }^2)e$, so $0<\eta \Vert x{\Vert }^2<2$ decreases its squared error unless it is already zero. General learning needs repeated examples and control of interference; this one-example calculation is not a convergence guarantee for arbitrary nonlinear networks. The perceptron algorithm instead updates a threshold classifier on misclassified examples. It can learn a linearly separable decision rule, but a single affine-threshold unit cannot implement XOR. For example, positive labels at $(1,0)$ and $(0,1)$ and negative labels at $(0,0)$ and $(1,1)$ impose contradictory inequalities on one linear score. More layers are needed to learn a suitable feature representation.

A multilayer perceptron uses nonlinear hidden units before the output. For squared error, write $h=\sigma (Ux)$ and $y=\sigma (Vh)$. Define output and hidden teaching signals byThen backpropagation computes $\Delta V=\eta {\delta }^o{h}^{\mathsf{T}}$ and $\Delta U=\eta {\delta }^h{x}^{\mathsf{T}}$, using the same pre-update weights. The chain rule makes these exact negative gradients. Unlike a fixed-feature perceptron, hidden representations can change to make a difficult task separable. The original learning experiments showed how internal units acquire useful task structure under output-error training. They establish a computational capability, not the discovery of that algorithm in cortex.^[ref]

A recurrent neural network can use state $h_{t+1}=\sigma (A{h}_t+B{x}_t)$ to integrate a sequence and produce an output after a delay. Error correction must now assign responsibility to earlier states as well as earlier layers. Applying the chain rule through the unrolled recurrence solves the algorithmic problem, but storing the required history and transporting a late teaching signal to an earlier synapse is biologically demanding. Repeated multiplication by the recurrent Jacobian matrix can also create the vanishing gradient problem or the exploding gradient problem. A local eligibility trace can retain a record of recent synaptic participation for modulation by a later error signal, although that is not generally an exact replacement for the full recurrent gradient.

A biologically motivated comparison is the cerebellum. A broad input representation can be expanded by granule cells; parallel fibers carry the resulting activity to Purkinje cells, while a climbing fiber provides a separate instructive input. Such a circuit resembles a supervised adaptive filter: an active input is modified in a manner depending on a teaching signal, with Purkinje output affecting downstream motor control. The correspondence is a circuit hypothesis, not a claim that the climbing-fiber event equals the signed scalar $t-y$ in every task.

An instructive experiment recorded Purkinje cells in monkeys tracking a moving visual target. A change in target direction supplied a learning instruction, and subsequent eye velocity and simple-spike activity measured trial-over-trial adaptation. Longer complex spikes were associated with larger subsequent simple-spike depression and stronger behavioural learning. Comparing trials matched for preceding simple-spike activity helped rule out that activity alone as the explanation. This connects a separable teaching-related event to later plasticity during behaviour, but extracellular recordings do not directly reveal the numerical update at every parallel fiber synapse, and the finding does not demonstrate multilayer backpropagation.^[ref]

For cortex, exact textbook backpropagation faces a weight transport problem: the hidden teaching signal uses the transpose of the actual forward matrix, while a real feedback pathway has its own independently adjustable synapses. It also needs a way to deliver a target or prediction error, keep learning signals distinct from ordinary activation, and convert them to local plasticity under spiking, delays and sign constraints. The mere presence of anatomical feedback does not establish this computation.

Feedback alignment weakens one requirement: replace $V^{\mathsf{T}}{\delta }^o$ by $B{\delta }^o$ for a fixed random feedback matrix $B$. Simulations showed that changing forward weights can make these approximate teaching directions useful, even without exact reciprocal weights. This is evidence that the weight transport problem need not forbid useful deep error correction; it is not evidence that arbitrary feedback always converges, that the updates remain exact gradient descent, or that this precise mechanism has been recorded in the brain. The work explicitly leaves the physiological implementation and the interaction between feedback activation and learning unresolved.^[ref]

Local supervised error correction has a plausible circuit substrate and direct behavioural-physiological support. Multilayer and recurrent error correction are powerful explanatory possibilities, but their teaching signals, temporal credit assignment and feedback pathways must be established experimentally. Different architectures should be compared by held-out learning behaviour, representational changes and pathway-specific intervention, rather than by labelling all feedback as backpropagation.

Named for Jan Evangelista Purkyně, a cerebellar neuron receiving many parallel fiber inputs and a powerful climbing fiber input. Simple-spike and complex-spike responses provide distinct physiological readouts in studies of motor learning.