A Formal Framework for Understanding Length Generalization in Transformers
Xinting Huang Andy Yang Satwik Bhattamishra Yash Sarrof Andreas Krebs Hattie Zhou Preetum Nakkiran Michael Hahn
A major challenge for transformers is generalizing to sequences longer than those observed during training. While previous works have empirically shown that transformers can either succeed or fail at length generalization depending on the task, theoretical understanding of this phenomenon remains limited. In this work, we introduce a rigorous theoretical framework to analyze length generalization in causal transformers with learnable absolute positional encodings. In particular, we characterize those functions that are identifiable in the limit from sufficiently long inputs with absolute positional encodings under an idealized inference scheme using a norm-based regularizer. This enables us to prove the possibility of length generalization for a rich family of problems. We experimentally validate the theory as a predictor of success and failure of length generalization across a range of algorithmic and formal language tasks. Our theory not only explains a broad set of empirical observations but also opens the way to provably predicting length generalization capabilities in transformers.
transformers, theory, length generalization, expressivity, analysis, algorithmic reasoning, systematic generalization, formal languages
We introduce a theoretical framework for understanding which problems transformers length-generalize on.