paper-with-me

홈 › Papers

Predicting Attention Sparsity in Transformers

2021-09-24 · spnlp (ACL) 2022 5 · Marcos Treviso, António Góis, Patrick Fernandes, Erick Fonseca, André F. T. Martins

Transformers' quadratic complexity with respect to the input sequence length has motivated a body of work on efficient sparse approximations to softmax. An alternative path, used by entmax transformers, consists of having built-in exact sparse attention; however this approach still requires quadratic computation. In this paper, we propose Sparsefinder, a simple model trained to identify the sparsity pattern of entmax attention before computing it. We experiment with three variants of our method, based on distances, quantization, and clustering, on two tasks: machine translation (attention in the decoder) and masked language modeling (encoder-only). Our work provides a new angle to study model efficiency by doing extensive analysis of the tradeoff between the sparsity and recall of the predicted attention graph. This allows for detailed comparison between different models along their Pareto curves, important to guide future benchmarks for sparse attention models.

📄 PDF Abstract BibTeX arXiv:2109.12188

Code (0)

등록된 구현이 없습니다.

Tasks

DecoderLanguage ModelingLanguage ModellingMachine TranslationMasked Language ModelingQuantizationTranslation

Similar Papers 제목 키워드 기반

Predicting Attention Sparsity in Transformers

2021-11-16 · ACL ARR November 2021 11 · Anonymous

Transformers' quadratic complexity with respect to the input sequence length has motivated a body of work on efficient sparse approximations to softmax. An alternative path, used by entmax transformers, consists of havin…

DecoderLanguage ModelingLanguage ModellingMachine Translation+3

ESACT: An End-to-End Sparse Accelerator for Compute-Intensive Transformers via Local Similarity

2025-12-02 · Hongxiang Liu, Zhifang Deng, Tong Pu, Shengli Lu arxiv

Transformers, composed of QKV generation, attention computation, and FFNs, have become the dominant model across various domains due to their outstanding performance. However, their high computational cost hinders effici…

Adaptively Sparse Transformers

2019-08-30 · IJCNLP 2019 11 · Gonçalo M. Correia, Vlad Niculae, André F. T. Martins

Attention mechanisms have become ubiquitous in NLP. Recent architectures, notably the Transformer, learn powerful context-aware word representations through layered, multi-headed attention. The multiple heads learn diver…

DiversityMachine TranslationTranslation

Analysis of Attention in Video Diffusion Transformers

2025-04-14 · Yuxin Wen, Jim Wu, Ajay Jain, Tom Goldstein 외

We conduct an in-depth analysis of attention in video diffusion transformers (VDiTs) and report a number of novel findings. We identify three key properties of attention in VDiTs: Structure, Sparsity, and Sinks. Structur…

Video Editing

O(n) Connections are Expressive Enough: Universal Approximability of Sparse Transformers

2020-12-01 · NeurIPS 2020 12 · Chulhee Yun, Yin-Wen Chang, Srinadh Bhojanapalli, Ankit Singh Rawat 외

Recently, Transformer networks have redefined the state of the art in many NLP tasks. However, these models suffer from quadratic computational cost in the input sequence length $n$ to compute pairwise attention in each …