mlsanityData to 14 Oct 2026

Predictive Associative Memory: Retrieval Beyond Similarity Through Temporal Co-occurrence

arXiv 2602.11322 ↗First posted 11 Feb 2026cs.LG cs.AI cs.IRcited by 3

Not on the map. Why?

Abstract (arXiv)

Current approaches to memory in neural systems rely on similarity-based retrieval: given a query, find the most representationally similar stored state. This assumption -- that useful memories are similar memories -- fails to capture a fundamental property of biological memory: association through temporal co-occurrence. We propose Predictive Associative Memory (PAM), an architecture in which a JEPA-style predictor, trained on temporal co-occurrence within a continuous experience stream, learns to navigate the associative structure of an embedding space. We introduce an Inward JEPA that operates over stored experience (predicting associatively reachable past states) as the complement to the standard Outward JEPA that operates over incoming sensory data (predicting future states). We evaluate PAM as an associative recall system -- testing faithfulness of recall for experienced associations -- rather than as a retrieval system evaluated on generalisation to unseen associations. On a synthetic benchmark, the predictor's top retrieval is a true temporal associate 97% of the time (Association Precision@1 = 0.970); it achieves cross-boundary Recall@20 = 0.421 where cosine similarity scores zero; and it separates experienced-together from never-experienced-together states with a discrimination AUC of 0.916 (cosine: 0.789). Even restricted to cross-room pairs where embedding similarity is uninformative, the predictor achieves AUC = 0.849 (cosine: 0.503, chance). A temporal shuffle control confirms the signal is genuine temporal co-occurrence structure, not embedding geometry: shuffling collapses cross-boundary recall by 90%, replicated across training seeds. All results are stable across seeds (SD < 0.006) and query selections (SD ≤ 0.012).

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 21 of its 47 references that are in the map. First posted on arXiv 11 Feb 2026.

Builds on

21 of 47 references.

References · 21

  1. 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,297
  2. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
  3. 2017Billion-scale similarity search with GPUscited by 2,497
  4. 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,694
  5. 2024From Local to Global: A Graph RAG Approach to Query-Focused Summarizationcited by 1,453
  6. 2021Improving language models by retrieving from trillions of tokenscited by 1,293
  7. 2021Unsupervised Dense Information Retrieval with Contrastive Learningcited by 1,216
  8. 2023Self-Supervised Learning from Images with a Joint-Embedding Predictive Architecturecited by 1,039
  9. 2019RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Spacecited by 898
  10. 2023In-Context Retrieval-Augmented Language Modelscited by 702
  11. 2014Neural Turing Machinescited by 644
  12. 2020A Survey on Knowledge Graphs: Representation, Acquisition and Applicationscited by 643
9 more
  1. 2022Precise Zero-Shot Dense Retrieval without Relevance Labelscited by 517
  2. 2020Hopfield Networks is All You Needcited by 475
  3. 2014Memory Networkscited by 363
  4. 2016Successor Features for Transfer in Reinforcement Learningcited by 340
  5. 2016Dense Associative Memory for Pattern Recognitioncited by 236
  6. 2023Query Rewriting for Retrieval-Augmented Large Language Modelscited by 213
  7. 2020Large Associative Memory Problem in Neurobiology and Machine Learningcited by 112
  8. 2016Deep Successor Reinforcement Learningcited by 72
  9. 2026Large Language Model Reasoning Failurescited by 21

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 3.

3 papers.