cosFormer: Rethinking Softmax In Attention

Qin Zhen · Weixuan Sun · Hui Deng · DONGXU LI · Yunshen Wei · Baohong Lv · Junjie Yan · Lingpeng Kong · Yiran Zhong

[ Abstract ]
[ Visit Poster at Spot C3 in Virtual World ] [ OpenReview
Wed 27 Apr 2:30 a.m. PDT — 4:30 a.m. PDT


Transformer has shown great successes in natural language processing, computer vision, and audio processing. As one of its core components, the softmax attention helps to capture long-range dependencies yet prohibits its scale-up due to the quadratic space and time complexity to the sequence length. Kernel methods are often adopted to reduce the complexity by approximating the softmax operator. Nevertheless, due to the approximation errors, their performances vary in different tasks/corpus and suffer crucial performance drops when compared with the vanilla softmax attention. In this paper, we propose a linear transformer called cosFormer that can achieve comparable or better accuracy to the vanilla transformer in both casual and cross attentions. cosFormer is based on two key properties of softmax attention: i). non-negativeness of the attention matrix; ii). a non-linear re-weighting scheme that can concentrate the distribution of the attention matrix. As its linear substitute, cosFormer fulfills these properties with a linear operator and a cosine-based distance re-weighting mechanism. Extensive experiments on language modeling and text understanding tasks demonstrate the effectiveness of our method. We further examine our method on long sequences and achieve state-of-the-art performance on the Long-Range Arena benchmark. The source code is available at

Chat is not available.