Predictive Associative Memory (PAM)

• Predictive Associative Memory (PAM) is a family of architectures integrating content-addressable memory with prediction mechanisms via temporal co-occurrence for dynamic, context-aware retrieval.
• It spans diverse approaches such as predictive coding, Bayesian continual learning, and variational inference, all emphasizing structured, episodic recall over mere similarity.
• Empirical results show PAM models achieve high retrieval precision and effective sequence modeling, with applications ranging from image reconstruction to corpus-scale concept discovery.

Predictive Associative Memory (PAM) is a label used in recent arXiv literature for several related but non-identical approaches to associative memory, prediction, and sequence modeling. In the most explicit current usage, PAM denotes a memory architecture that retrieves by temporal co-occurrence rather than by representational similarity (Dury, 11 Feb 2026). Closely related work formulates associative recall through predictive coding, Bayesian continual learning, or variational inference with memory-dependent priors (Salvatori et al., 2021, Yoo et al., 2022, Annabi et al., 2022). The acronym is also used for distinct models such as “Predictive Attractor Models” (Mounir et al., 2024) and “Phase-Associative Memory” (Vishwakarma et al., 6 Apr 2026). This suggests that PAM is best understood as a family of associative-memory ideas centered on predictive completion, structured recall, and context-sensitive retrieval rather than as a single canonical architecture.

1. Terminological scope and historical antecedents

The literature does not present a single universally accepted definition of PAM. Instead, several papers use the term, or a close variant, for architectures that combine content-addressable memory with predictive structure.

Usage	Core mechanism	Representative paper
Predictive coding associative memory	Hierarchical generative network with attractor retrieval	(Salvatori et al., 2021)
Predictive Associative Memory	JEPA-style retrieval via temporal co-occurrence	(Dury, 11 Feb 2026)
Predictive Attractor Models	Online sequence memory with sparse distributed representations and attractors	(Mounir et al., 2024)
Phase-Associative Memory	Complex-valued recurrent associative matrix state	(Vishwakarma et al., 6 Apr 2026)

An early antecedent is “An associative memory for the on-line recognition and prediction of temporal sequences,” which presented an associative memory with feedback for on-line temporal sequence learning, proposed a framework for on-line sequence learning, used a separate store for the sequence context of a symbol, adopted a sparse distributed memory for scalability, and made sensitivity to sequence context controllable [0611020]. Even at that stage, the essential ingredients already included online storage, contextual state, prediction, and sequence-sensitive recall.

A plausible implication is that the later PAM literature inherits two distinct lineages from earlier associative-memory research. One lineage emphasizes pattern completion from corrupted cues; the other emphasizes temporal sequencing, contextual prediction, and online memory updates.

2. Predictive-coding and variational formulations

A major PAM-associated line treats associative memory as inference in a hierarchical generative model. “Associative Memories via Predictive Coding” formulates memory storage and retrieval through a predictive coding network with sensory and memory layers, local prediction errors, and an energy

$$E_t=\frac{1}{2}\sum_{i,l}\left(\varepsilon^l_{i,t}\right)^2.$$

Stored items become attractors of the energy dynamics, corrupted inputs are denoised by iterative inference, and partial inputs are completed by clamping observed coordinates while inferring the missing ones (Salvatori et al., 2021). In the reported experiments, deeper networks increased capacity; a 10-layer network reconstructed more than 98% of Tiny ImageNet images when given half the pixels and 74% when given $1/4$, compared with autoencoders at 72% and 48%, and the same paper reported perfect reconstructions of stored ImageNet training images from only $1/8$ of the pixels (Salvatori et al., 2021).

BayesPCN extends this predictive-coding view into a continual-learning regime. It defines a hierarchical associative memory in which read is inference over activations, write is a Bayesian posterior update over weights, and forget diffuses the posterior back toward the prior to free capacity (Yoo et al., 2022). The paper states that BayesPCN performs continual one-shot memory writes without meta-learning and can recall corrupted i.i.d. high-dimensional data observed hundreds to a thousand “timesteps” ago without a large drop in recall ability compared to state-of-the-art offline-learned parametric memory models (Yoo et al., 2022). This turns PAM from a static attractor memory into a continually learnable memory process.

A third formulation recasts auto-associative memory as variational inference with a memory-dependent prior,

$$p(\mathbf{x},\mathbf{z})=p(\mathbf{x}\mid \mathbf{z})\,p(\mathbf{z};\mathbf{M}),$$

so that perceptual inference and memory retrieval become the same optimization problem (Annabi et al., 2022). In that formulation, the prior over latent representations pulls inference toward previously stored patterns, and the paper explicitly compares amortized inference, predictive coding, and hybrid schemes on CIFAR10 and CLEVR (Annabi et al., 2022).

Related multimodal work with Willshaw-style memory is not always named PAM, but it is explicitly PAM-like in function. “Classification and Generation of real-world data with an Associative Memory Model” stores concatenated image and label modalities in a Multiple-Modality Willshaw Network and uses completion of missing modalities to perform classification and generation on MNIST (Simas et al., 2022). The paper reports perfect auto-association accuracy as the memory fills, a peak test classification accuracy of 84.04%, and an iterative retrieve-and-sparsify procedure for generation (Simas et al., 2022). This supports a broad usage in which predictive associative memory means inference by completion from partial evidence.

3. Retrieval beyond similarity: temporal co-occurrence as the defining signal

The most explicit recent formulation, “Predictive Associative Memory: Retrieval Beyond Similarity Through Temporal Co-occurrence,” argues that useful memories are not necessarily the most representationally similar ones, but rather those that were experienced together (Dury, 11 Feb 2026). The architecture pairs an Outward JEPA, which predicts future sensory states, with an Inward JEPA, which predicts associatively reachable past states in a shared latent space.

The formal setup defines a composite state

$s(t)=f_\theta(x_v(t),x_a(t),x_p(t),x_c(t)),$

a temporal co-occurrence neighborhood

$$\mathcal{N}_\tau(t)=\{s(t'):\lvert t-t'\rvert\leq \tau,\; t'\in \mathcal{H}\},$$

an inward predictor

$\hat{z}(t)=g_\phi(s(t)),$

and an association objective that contrasts temporally co-occurring positives against non-co-occurring negatives:

$$\mathcal{L}_{\text{assoc}}=\sum_{t^+\in \mathcal{N}_\tau(t)} d(\hat{z}(t),\bar{s}(t^+))-\lambda\sum_{t^-\notin \mathcal{N}_\tau(t)} d(\hat{z}(t),\bar{s}(t^-)).$$

Retrieval is then performed around the predicted association point rather than around the query itself:

$$\mathcal{R}=\{s_i\in \mathcal{M}:d(\hat{z},\bar{s}_i)<\epsilon\}.$$

The synthetic benchmark was designed so that similarity and association diverge: 20 rooms, a 128-dimensional embedding space, 50 objects, 500 trajectories, 100 timesteps each, 50,000 total states, $\tau=5$, and 242,264 total associations (Dury, 11 Feb 2026). On this benchmark, the predictor’s top retrieval is a true temporal associate 97% of the time, with Association Precision@1 $1/4$0; it achieves cross-boundary Recall@20 $1/4$1 where cosine similarity scores zero; and it separates experienced-together from never-experienced-together states with discrimination AUC $1/4$2, compared with cosine $1/4$3 (Dury, 11 Feb 2026). Even on cross-room pairs where embedding similarity is uninformative, PAM achieves AUC $1/4$4, while cosine is $1/4$5, i.e. chance (Dury, 11 Feb 2026).

The paper also reports strong controls. A temporal shuffle that preserves embeddings but destroys temporal order collapses cross-boundary Recall@20 from 0.421 to 0.044, about a 90% collapse, replicated across training seeds (Dury, 11 Feb 2026). Held-out query-state evaluation yields zero cross-boundary recall, and an edge-disjoint train/test split yields train associations R@20 $1/4$6 but held-out associations R@20 $1/4$7 (Dury, 11 Feb 2026). The authors interpret this not as failure, but as evidence that the model is behaving as an episodic recall system rather than as a generalizer to unseen associations.

A common misconception is therefore addressed directly by this line of work: high-quality associative memory need not be synonymous with generalization to unseen pairings. In this formulation, “faithful episodic recall” is the target behavior.

4. From episodic recall to corpus-scale concept formation

“From Topic to Transition Structure: Unsupervised Concept Discovery at Corpus Scale via Predictive Associative Memory” extends the same co-occurrence logic from episodic recall to concept formation under compression (Dury, 19 Mar 2026). The model maps pre-trained passage embeddings into an “association space” where passages with similar transition structure cluster together. It uses a 4-layer MLP with GELU activations, LayerNorm, and a learned residual connection

$1/4$8

with $1/4$9 reported to converge to 0.756 (Dury, 19 Mar 2026).

The training corpus comprises 9,766 Project Gutenberg texts and 24.96 million passages, producing 373,296,555 co-occurrence pairs; the model has 29.4M parameters and reaches 42.75% training accuracy at epoch 150 under symmetric contrastive training with in-batch negatives (Dury, 19 Mar 2026). The paper’s central claim is that, under this capacity constraint, the model must compress across recurring patterns rather than memorize individual co-occurrences. Clustering is then performed at six granularities, $1/8$0, yielding a multi-resolution concept map (Dury, 19 Mar 2026).

At $1/8$1, all 100 clusters pass the diversity filter, mean cosine similarity is 0.378, mean books per cluster is 4,508, and mean dominance is 4.0% (Dury, 19 Mar 2026). The paper argues that raw embedding clustering groups passages by topic, whereas association-space clustering groups them by function, register, and literary tradition. Unseen novels are assigned to existing clusters without retraining; the association model concentrates each novel into a selective subset of coherent clusters, while raw embedding assignment saturates nearly all clusters (Dury, 19 Mar 2026).

This extension clarifies a major conceptual distinction within PAM research. In the original episodic-recall setting, memorization is appropriate; in the corpus-scale text setting, repeated replay plus capacity pressure turns the same associative objective into a concept-discovery mechanism. The paper explicitly frames this as the difference between recalling specific associations and extracting recurring transition-structure concepts (Dury, 19 Mar 2026).

5. Sequence memory and recurrent variants sharing the PAM label

A separate but related sequence-modeling line uses the PAM acronym for “Predictive Attractor Models.” This architecture is a streaming model that learns sequences in an online, continuous manner by observing each input only once, uses sparse distributed representations in cortical minicolumns, avoids catastrophic forgetting through lateral inhibition, and generates future predictions by sampling from a union set of predicted possibilities realized through an attractor model trained alongside the predictor (Mounir et al., 2024). The model employs local Hebbian rules such as

$1/8$2

for transition learning, and iterative attractor refinement

$1/8$3

for recall (Mounir et al., 2024). In the reported sequence-forgetting experiments, PAM with $1/8$4 achieves normalized IoU of 1.000 across previously learned sequences in the 10-sequence table, and the paper reports that 2-layer temporal predictive coding takes two to three orders of magnitude more time in their experiments (Mounir et al., 2024).

Another distinct usage is “Phase-Associative Memory: Sequence Modeling in Complex Hilbert Space,” which introduces a recurrent sequence model in which all representations are complex-valued, associations accumulate in a matrix state $1/8$5 via outer products, and retrieval operates through the conjugate inner product $1/8$6 (Vishwakarma et al., 6 Apr 2026). The core update is

$1/8$7

and retrieval is

$1/8$8

The paper argues that vector-state holographic binding fails because of the $1/8$9 capacity degradation of superposed associations, and that the matrix state resolves this limitation (Vishwakarma et al., 6 Apr 2026). At approximately 100M parameters on WikiText-103, the model reaches validation perplexity 30.0, within approximately 10% of a matched transformer at 27.1 trained under identical conditions, despite $$p(\mathbf{x},\mathbf{z})=p(\mathbf{x}\mid \mathbf{z})\,p(\mathbf{z};\mathbf{M}),$$0 arithmetic overhead from complex computation and no custom kernels (Vishwakarma et al., 6 Apr 2026).

These recurrent and sequence-modeling variants do not use PAM in exactly the same sense as the temporal-co-occurrence JEPA model. Nonetheless, they preserve a shared structural theme: recall is not a static nearest-neighbor lookup, but a predictive or dynamical process defined over contextual state.

6. Theoretical foundations, neighboring models, and unresolved issues

Broader associative-memory theory provides the background against which PAM claims are made. “Maximum Likelihood Associative Memories” formalizes associative memory as an algorithm that, given a set $$p(\mathbf{x},\mathbf{z})=p(\mathbf{x}\mid \mathbf{z})\,p(\mathbf{z};\mathbf{M}),$$1, learns a retrieval rule $$p(\mathbf{x},\mathbf{z})=p(\mathbf{x}\mid \mathbf{z})\,p(\mathbf{z};\mathbf{M}),$$2, derives minimum residual error rates, gives the entropy lower bound $$p(\mathbf{x},\mathbf{z})=p(\mathbf{x}\mid \mathbf{z})\,p(\mathbf{z};\mathbf{M}),$$3, and shows that exact universal retrieval has a lower bound of $$p(\mathbf{x},\mathbf{z})=p(\mathbf{x}\mid \mathbf{z})\,p(\mathbf{z};\mathbf{M}),$$4 operations while a trie-based method achieves $$p(\mathbf{x},\mathbf{z})=p(\mathbf{x}\mid \mathbf{z})\,p(\mathbf{z};\mathbf{M}),$$5 retrieval (Gripon et al., 2013). “Associative Memory using Dictionary Learning and Expander Decoding” studies a model that can store dataset containing $$p(\mathbf{x},\mathbf{z})=p(\mathbf{x}\mid \mathbf{z})\,p(\mathbf{z};\mathbf{M}),$$6 $$p(\mathbf{x},\mathbf{z})=p(\mathbf{x}\mid \mathbf{z})\,p(\mathbf{z};\mathbf{M}),$$7-length message vectors over a network with $$p(\mathbf{x},\mathbf{z})=p(\mathbf{x}\mid \mathbf{z})\,p(\mathbf{z};\mathbf{M}),$$8 nodes and can tolerate $$p(\mathbf{x},\mathbf{z})=p(\mathbf{x}\mid \mathbf{z})\,p(\mathbf{z};\mathbf{M}),$$9 adversarial errors, by mapping learning to square dictionary learning and recall to expander decoding (Mazumdar et al., 2016).

Several papers expose the representation problem underlying practical PAM systems. Willshaw-style associative memory works best with sparse distributed representations, and “Competitive learning to generate sparse representations for associative memory” addresses this by proposing a biologically plausible winner-takes-all encoder that beats sparse coding baselines and comes close to the performance achieved using optimal random codes on MNIST and Fashion-MNIST (Sacouto et al., 2023). Likewise, the multimodal Willshaw model on MNIST depends on sparse encoders such as the What-Where encoder for images and Noisy X-Hot for labels (Simas et al., 2022). A plausible implication is that many PAM architectures inherit a hidden dependence on representation engineering even when the retrieval rule itself is theoretically elegant.

The literature also contains an explicit debate over what associative retrieval should optimize. The temporal-co-occurrence PAM paper opposes similarity-based retrieval and argues for retrieval by experience (Dury, 11 Feb 2026). “Adaptive Hopfield Network: Rethinking Similarities in Associative Memory” sharpens the critique by arguing that proximity cannot guarantee correctness, reframes retrieval as maximum a posteriori inference over candidate memory origins, and introduces adaptive similarity to approximate the likelihood $s(t)=f_\theta(x_v(t),x_a(t),x_p(t),x_c(t)),$0 under a variant distribution (Wang et al., 25 Nov 2025). In parallel, “Bridging Associative Memory and Probabilistic Modeling” argues that associative-memory dynamics can be interpreted as gradient descent on an energy function and that probabilistic models provide a complementary language for denoising, completion, assignment, and memory creation (Schaeffer et al., 2024).

Several limitations recur across PAM variants. The predictive-coding formulation is iterative and therefore slower than one-shot retrieval (Salvatori et al., 2021). BayesPCN can degrade sharply at very long sequences around 1024 writes without forget, due to memory overload (Yoo et al., 2022). The temporal-co-occurrence JEPA formulation shows little generalization to unseen associations by design (Dury, 11 Feb 2026). Predictive Attractor Models assume sparse binary representations and therefore require an SDR front end for raw sensory domains such as images (Mounir et al., 2024). Phase-Associative Memory pays a $s(t)=f_\theta(x_v(t),x_a(t),x_p(t),x_c(t)),$1 arithmetic overhead from complex computation in its reported implementation (Vishwakarma et al., 6 Apr 2026). These are not mutually exclusive objections; they describe different trade-offs between exactness, robustness, continual write capacity, generative flexibility, and computational cost.

Taken together, the PAM literature does not converge on a single mechanism. It instead delineates a technical design space: attractor inference versus explicit prediction, similarity versus temporal association, vector memories versus matrix memories, fixed memories versus continual Bayesian writes, and semantic grouping versus transition-structure discovery. That diversity is not a terminological accident alone; it reflects an unresolved question about what associative memory should retrieve—what looks similar, what was experienced together, what best explains the cue, or what the current dynamical context predicts next.