flâneur

Unlimiformer: Long-Range Transformers with Unlimited Length Input

arxiv.org · 7,395 words · saved by 1 readers

Transformer-based models typically have a predefined bound to their input length, because of their need to potentially attend to every token in the input. In this work, we propose Unlimiformer: a general approach that can wrap any existing pretrained encoder-decoder transformer, and offload the attention computation across all layers to a single $k$-nearest-neighbor index; this index can be kept on either the GPU or CPU memory and queried in sub-linear time. This way, we can index extremely long input sequences, while every attention head in every decoder layer retrieves its top-$k$ keys, instead of attending to every key. We demonstrate Unlimiformers's efficacy on several long-document and multi-document summarization benchmarks, showing that it can summarize even 350k token-long inputs from the BookSum dataset, without any input truncation at test time. Unlimiformer improves pretrained models such as BART and Longformer by extending them to unlimited inputs without additional learned weights and without modifying their code. We make our code and models publicly available at this https URL .

Unlimiformer: Long-Range Transformers with Unlimited Length Input Amanda Bertsch Uri Alon∗ Graham Neubig Matthew R. Gormley Carnegie Mellon University, USA arXiv:2305.01625v3 [cs.CL] 30 Oct 2023 {abertsch,ualon,gneubig,mgormley}@cs.cmu.edu…

related reading