LGAICLDec 31, 2024

Titans: Learning to Memorize at Test Time

arXiv:2501.00663v1244 citationsh-index: 61
Originality Highly original
AI Analysis

This addresses the quadratic cost and fixed-length context limitations in attention mechanisms for applications like language modeling and genomics, offering a scalable solution for long-context tasks.

The paper tackles the problem of limited context length in attention-based models by introducing a neural long-term memory module that learns to memorize historical context, enabling effective scaling to over 2M context windows with higher accuracy in tasks like needle-in-haystack compared to Transformers and linear recurrent models.

Over more than a decade there has been an extensive research effort on how to effectively utilize recurrent models and attention. While recurrent models aim to compress the data into a fixed-size memory (called hidden state), attention allows attending to the entire context window, capturing the direct dependencies of all tokens. This more accurate modeling of dependencies, however, comes with a quadratic cost, limiting the model to a fixed-length context. We present a new neural long-term memory module that learns to memorize historical context and helps attention to attend to the current context while utilizing long past information. We show that this neural memory has the advantage of fast parallelizable training while maintaining a fast inference. From a memory perspective, we argue that attention due to its limited context but accurate dependency modeling performs as a short-term memory, while neural memory due to its ability to memorize the data, acts as a long-term, more persistent, memory. Based on these two modules, we introduce a new family of architectures, called Titans, and present three variants to address how one can effectively incorporate memory into this architecture. Our experimental results on language modeling, common-sense reasoning, genomics, and time series tasks show that Titans are more effective than Transformers and recent modern linear recurrent models. They further can effectively scale to larger than 2M context window size with higher accuracy in needle-in-haystack tasks compared to baselines.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes