RecallM: An Adaptable Memory Mechanism with Temporal Understanding for Large Language Models
Not on the map. Why?
Abstract (arXiv)
Large Language Models (LLMs) have made extraordinary progress in the field of Artificial Intelligence and have demonstrated remarkable capabilities across a large variety of tasks and domains. However, as we venture closer to creating Artificial General Intelligence (AGI) systems, we recognize the need to supplement LLMs with long-term memory to overcome the context window limitation and more importantly, to create a foundation for sustained reasoning, cumulative learning and long-term user interaction. In this paper we propose RecallM, a novel architecture for providing LLMs with an adaptable and updatable long-term memory mechanism. Unlike previous methods, the RecallM architecture is particularly effective at belief updating and maintaining a temporal understanding of the knowledge provided to it. We demonstrate through various experiments the effectiveness of this architecture. Furthermore, through our own temporal understanding and belief updating experiments, we show that RecallM is four times more effective than using a vector database for updating knowledge previously stored in long-term memory. We also demonstrate that RecallM shows competitive performance on general question-answering and in-context learning tasks.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 13 of its 17 references that are in the map. First posted on arXiv 6 Jul 2023.
Builds on
13 of 17 references.
References · 13
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2023GPT-4 Technical Reportcited by 18,132
- 2021TruthfulQA: Measuring How Models Mimic Human Falsehoodscited by 2,919
- 2023Sparks of Artificial General Intelligence: Early experiments with GPT-4cited by 2,579
- 2023MemoryBank: Enhancing Large Language Models with Long-Term Memorycited by 539
- 2021Time-Aware Language Models as Temporal Knowledge Basescited by 290
- 2016Bidirectional Attention Flow for Machine Comprehensioncited by 278
- 2022Memorizing Transformerscited by 219
- 2023Augmenting Language Models with Long-Term Memorycited by 186
- 2023Scaling Transformer to 1M tokens and beyond with RMTcited by 97
- 2018DuoRC: Towards Complex Language Understanding with Paraphrased Reading Comprehensioncited by 70
- 2023RET-LLM: Towards a General Read-Write Memory for Large Language Modelscited by 64
Built on by
Citing papers per year: 2024: 2; 2025: 0; 2026: 3.
5 papers.
- 2024LLM Inference Unveiled: Survey and Roofline Model Insightscited by 147
- 2024AriGraph: Learning Knowledge Graph World Models with Episodic Memory for LLM Agentscited by 100
- 2026Graph-based Agent Memory: Taxonomy, Techniques, and Applicationscited by 22
- 2026MemQ: Integrating Q-Learning into Self-Evolving Memory Agents over Provenance DAGscited by 4
- 2026Keep It InMind: Benchmarking the Implicit-Association Blind Spot in Agent Memorycited by 1
- 2026Keep It InMind: Benchmarking the Implicit-Association Blind Spot in Agent Memory27 Jul 2026
- 2026MemQ: Integrating Q-Learning into Self-Evolving Memory Agents over Provenance DAGs8 May 2026
- 2026Graph-based Agent Memory: Taxonomy, Techniques, and Applications5 Feb 2026
- 2024AriGraph: Learning Knowledge Graph World Models with Episodic Memory for LLM Agents5 Jul 2024
- 2024LLM Inference Unveiled: Survey and Roofline Model Insights26 Feb 2024