LGOct 17, 2024

Reducing the Transformer Architecture to a Minimum

arXiv:2410.13732v22 citationsh-index: 11KDIR
Originality Incremental advance
AI Analysis

This work addresses the computational efficiency problem for researchers and practitioners using transformers, but it is incremental as it builds on existing architectures with modifications.

The paper tackles the problem of reducing the parameter size of transformer architectures by hypothesizing that the attention mechanism's nonlinearity is sufficient, allowing removal of MLPs and collapsing matrices. The result shows that simplified transformers achieve similar performance on CV benchmarks like MNIST and CIFAR-10, saving up to 90% of parameters without hurting classification.

Transformers are a widespread and successful model architecture, particularly in Natural Language Processing (NLP) and Computer Vision (CV). The essential innovation of this architecture is the Attention Mechanism, which solves the problem of extracting relevant context information from long sequences in NLP and realistic scenes in CV. A classical neural network component, a Multi-Layer Perceptron (MLP), complements the attention mechanism. Its necessity is frequently justified by its capability of modeling nonlinear relationships. However, the attention mechanism itself is nonlinear through its internal use of similarity measures. A possible hypothesis is that this nonlinearity is sufficient for modeling typical application problems. As the MLPs usually contain the most trainable parameters of the whole model, their omission would substantially reduce the parameter set size. Further components can also be reorganized to reduce the number of parameters. Under some conditions, query and key matrices can be collapsed into a single matrix of the same size. The same is true about value and projection matrices, which can also be omitted without eliminating the substance of the attention mechanism. Initially, the similarity measure was defined asymmetrically, with peculiar properties such as that a token is possibly dissimilar to itself. A possible symmetric definition requires only half of the parameters. We have laid the groundwork by testing widespread CV benchmarks: MNIST and CIFAR-10. The tests have shown that simplified transformer architectures (a) without MLP, (b) with collapsed matrices, and (c) symmetric similarity matrices exhibit similar performance as the original architecture, saving up to 90% of parameters without hurting the classification performance.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes