Skip to content
aiqbench takeAI Research

aiqbench analysis

This research investigates how transformer models handle distance generalization, specifically analyzing the efficacy of positional encodings like RoPE and ALiBi when inter-token distances vary between training and inference. The study highlights that understanding these underlying mechanisms is critical for improving model robustness in scenarios where token spacing differs from the training distribution. By examining synthetic delay copy tasks, the authors provide empirical insights into how data diversity influences performance on unseen distance patterns.
Sources coveringarXiv, AI Alignment Forum, Latent Space, InfoQ
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Distance generalization in transformers: why bother with positional encoding?

arXiv2 min read

arXiv:2609.11913v1 Announce Type: new Abstract: Out-of-distribution length generalization, namely to extrapolate a task from short to longer context, has been studied intensively for transformers. Here we focus on distance generalization, which probes performance when inter-token distances are changed between training and inference, while keeping a fixed context length. We construct two synthetic delay copy tasks, both involving finite distances between source and recall, where tokens are copied either fully or selectively, and test models on delays unseen during training. We address three questions: (A) Do positional encoding schemes such as RoPE and ALiBi improve distance resolution relative to no positional encoding (NoPE)? (B) How does data diversity, the number of inter-token distances seen in training, affect performance? (C) When is distance transfer learning positive or negative? We present a thorough investigation, finding that it is paramount to improve our understanding of the underlying mechanisms.

Title:Distance generalization in transformers: why bother with positional encoding?

Abstract:Out-of-distribution length generalization, namely to extrapolate a task from short to longer context, has been studied intensively for transformers. Here we focus on distance generalization, which probes performance when inter-token distances are changed between training and inference, while keeping a fixed context length. We construct two synthetic delay copy tasks, both involving finite distances between source and recall, where tokens are copied either fully or selectively, and test models on delays unseen during training. We address three questions: (A) Do positional encoding schemes such as RoPE and ALiBi improve distance resolution relative to no positional encoding (NoPE)? (B) How does data diversity, the number of inter-token distances seen in training, affect performance? (C) When is distance transfer learning positive or negative? We present a thorough investigation, finding that it is paramount to improve our understanding of the underlying mechanisms.

Computation and Language (cs.CL)

arXiv:2609.11913 [cs.CL]

(or arXiv:2609.11913v1 [cs.CL] for this version)

https://doi.org/10.48550/arXiv.2609.11913 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 243 words

Related coverage