Memory Augmentation › Comparing Memory Augmentation Approaches
Language AI HandbookAll chapters Memory Augmentation › Comparing Memory Augmentation ApproachesOne section · Sections in this chapter8 / 12 ↓
Reading tools Definitions & inline links
Choose your expertise level to adjust how many terms are explained. Beginners see more tooltips, experts see fewer to maintain reading flow. Hover over underlined terms for instant definitions.
Article links
Make inline references clickable
Different memory architectures suit different use cases. Let's compare the key tradeoffs.

Memory Augmentation Approaches: Summary ====================================================================== Memorizing Transformer kNN retrieval from stored KV pairs + Precise retrieval, very long context - High storage cost, retrieval overhead Recurrent Memory Compressed state passed between segments + Fixed memory size, fast inference - Information compression, recency bias Hierarchical Memory Multiple levels of granularity + Balanced precision/efficiency - Complex architecture, tuning difficulty Compressed Memory Learned compression of older entries + Scalable, bounded memory - Lossy, compression training needed
Each approach occupies a different point in the design space. Memorizing Transformers offer the best retrieval precision and effective context but require substantial storage. Recurrent memory sits at the opposite extreme with excellent storage efficiency but limited retrieval precision. Hierarchical and compressed approaches attempt to balance these tradeoffs by combining multiple memory types or using learned compression.