= Solution
\b[A two-layer <heteroassociative memory> can retrieve one activity pattern from a different associated cue through learned feedforward <synapses>.] Let $x^\mu\in\mathbb R^n$ represent a cue and $t^\mu\in\mathbb R^m$ its associate. An input population projects to an output population through $W$, with retrieval $y=\phi(Wx-\theta)$. The output <activation function> can be linear for an analysis or thresholded with <synaptic competition> for a sparse categorical response. This is <pattern association>: the output need not reproduce the input, unlike an <autoassociative memory>.
During storage, the cue and its desired associate must be coactive. A local <Hebbian learning> rule, $\Delta W_{ij}=\eta t_i x_j$, strengthens the connection from an active cue <neuron> to an active target <neuron>. With normalized inputs, the idealized batch weights are
$$
W=\sum_{\mu=1}^{P}t^\mu(x^\mu)^{\mathsf T}.
$$
Presenting cue $x^\nu$ gives
$$
Wx^\nu=t^\nu\|x^\nu\|^2+\sum_{\mu\ne\nu}t^\mu\bigl((x^\mu)^{\mathsf T}x^\nu\bigr).
$$
The first term is the desired association; the second is interference from overlapping cues. Thus retrieval follows exactly for orthonormal cue patterns, while <sparse coding>, centring, <synaptic normalization> and a competitive output can reduce interference for realistic overlapping inputs. These devices have distinct roles: <synaptic normalization> prevents unlimited weight growth, and <synaptic competition> separates competing associates. Signed, centred model weights should not be identified literally with negative excitatory <synapses>; biological inhibition and baseline subtraction need an explicit circuit implementation.
As an exact illustrative calculation, take $x^1=(1,0)^{\mathsf T}$, $x^2=(0,1)^{\mathsf T}$, $t^1=(1,1,0)^{\mathsf T}$ and $t^2=(0,0,1)^{\mathsf T}$. Then
$$
W=\begin{pmatrix}1&0\\1&0\\0&1\end{pmatrix},\qquad Wx^1=t^1,\qquad Wx^2=t^2.
$$
A cue $(0.8,0.1)^{\mathsf T}$ produces $(0.8,0.8,0.1)^{\mathsf T}$, so threshold $0.5$ retrieves the first associate. These are chosen model values, not recorded firing rates. If two genuinely different associates share an identical cue, a deterministic feedforward map cannot choose between them without additional context; adding capacity alone does not solve that ambiguity. A cue-to-associate map also need not provide the reverse association unless the reverse pathway is separately learned.
The <hippocampus> provides a plausible anatomical setting. In a <hippocampal episodic memory model>, a retrieved <hippocampal CA3> event pattern can project through the <hippocampal CA1> output pathway to reinstate associated cortical content. The feedforward CA3-to-CA1 and hippocampal-to-cortical links can provide <heteroassociation>, while recurrent <CA3> connectivity provides <autoassociation>. The <entorhinal cortex> supplies converging information and routes cortical communication. This is a computational assignment to pathways; anatomical connectivity alone does not prove that their weights implement the displayed rule.
An especially direct physiological test comes from trained visual pairs. Monkeys learned arbitrary associations between computer-generated pictures and then selected the associated picture after a delay. <Extracellular single-unit recording> in anterior temporal cortex found both <neurons> responding to the two members of a learned pair and <neurons> whose delay activity anticipated the appropriate associate. The preparation therefore links an experimentally controlled cue–associate relation to neural responses, rather than merely showing visual selectivity. However, the recordings do not identify the individual modified <synapses>, establish one-way connectivity, or exclude recurrent retrieval. They support an associative representation in temporal cortex, not a unique proof of a two-layer implementation.<Neural organization for the long-term memory of paired associates by Kuniyoshi Sakai and others>[Abstract; pp. 152–155, pair-association task and cue/delay responses]{ref}
The rapid-learning requirement is relevant to the <hippocampal> implementation: CA3-restricted <NMDA receptor> deletion impaired learning of a newly located hidden platform in a delayed matching-to-place task while sparing performance with previously experienced locations. This supports rapid <hippocampal> storage, but does not by itself identify a specific feedforward association matrix.<Hippocampal CA3 NMDA receptors are crucial for memory acquisition of one-time experience by Kazu Nakazawa and others>[Abstract; pp. 305–315, delayed matching-to-place and novel versus familiar platform locations]{ref}
A decisive model test would measure cue and associate representations before learning, after learning, and during partial-cue retrieval, while selectively disrupting the proposed connecting pathway. Correct associate decoding with unrelated-cue and familiar-visual-response controls would be stronger evidence than activity during successful recall alone. \b[The architecture is a plausible component of temporal and <hippocampal> memory circuits; its local learning rule, interference properties and pathway-specific causal predictions make it testable.]
Back to article page
