Pith. sign in

REVIEW 1 cited by

On the Long Range Abilities of Transformers

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.16620 v1 pith:47Q6YNVT submitted 2023-11-28 cs.LG cs.CL

classification cs.LGcs.CL
keywords layerslong-rangeperformancetasksadditionalidentifylongrange
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Despite their dominance in modern DL and, especially, NLP domains, transformer architectures exhibit sub-optimal performance on long-range tasks compared to recent layers that are specifically designed for this purpose. In this work, drawing inspiration from key attributes of long-range layers, such as state-space layers, linear RNN layers, and global convolution layers, we demonstrate that minimal modifications to the transformer architecture can significantly enhance performance on the Long Range Arena (LRA) benchmark, thus narrowing the gap with these specialized layers. We identify that two key principles for long-range tasks are (i) incorporating an inductive bias towards smoothness, and (ii) locality. As we show, integrating these ideas into the attention mechanism improves results with a negligible amount of additional computation and without any additional trainable parameters. Our theory and experiments also shed light on the reasons for the inferior performance of transformers on long-range tasks and identify critical properties that are essential for successfully capturing long-range dependencies.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On the Expressivity of Selective State-Space Layers: A Multivariate Polynomial Approach

    cs.LG 2025-02 conditional novelty 7.0 of 10

    A simplified selective state-space layer expresses polynomials whose degree grows with sequence length, exceeding the fixed per-layer degree of linear attention.

Pith tools