paper-with-me

홈 › Papers

Low Rank Factorization for Compact Multi-Head Self-Attention

2019-11-26 · Sneha Mehta, Huzefa Rangwala, Naren Ramakrishnan

Effective representation learning from text has been an active area of research in the fields of NLP and text mining. Attention mechanisms have been at the forefront in order to learn contextual sentence representations. Current state-of-the-art approaches for many NLP tasks use large pre-trained language models such as BERT, XLNet and so on for learning representations. These models are based on the Transformer architecture that involves recurrent blocks of computation consisting of multi-head self-attention and feedforward networks. One of the major bottlenecks largely contributing to the computational complexity of the Transformer models is the self-attention layer, that is both computationally expensive and parameter intensive. In this work, we introduce a novel multi-head self-attention mechanism operating on GRUs that is shown to be computationally cheaper and more parameter efficient than self-attention mechanism proposed in Transformers for text classification tasks. The efficiency of our approach mainly stems from two optimizations; 1) we use low-rank matrix factorization of the affinity matrix to efficiently get multiple attention distributions instead of having separate parameters for each head 2) attention scores are obtained by querying a global context vector instead of densely querying all the words in the sentence. We evaluate the performance of the proposed model on tasks such as sentiment analysis from movie reviews, predicting business ratings from reviews and classifying news articles into topics. We find that the proposed approach matches or outperforms a series of strong baselines and is more parameter efficient than comparable multi-head approaches. We also perform qualitative analyses to verify that the proposed approach is interpretable and captures context-dependent word importance.

📄 PDF Abstract BibTeX arXiv:1912.00835

Code (1)

JohnGiorgi/compact-multi-head-self-attention-pytorch pytorch

Tasks

ArticlesGeneral ClassificationRepresentation LearningSentenceSentiment Analysistext-classificationText Classification

Methods 이 논문이 사용한 방법론

Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
Absolute Position Encodings Absolute Position Encodings are a type of position embeddings for [Transformer-based models] where positional encodings are…
Position-Wise Feed-Forward Layer 설명 없음
WordPiece 설명 없음
BPE Byte Pair Encoding, or BPE, is a subword segmentation algorithm that encodes rare and unknown words as sequences of subword units. The intuition is that various word…
Label Smoothing Label Smoothing is a regularization technique that introduces noise for the labels. This accounts for the fact that datasets may have mistakes in them, so maximizing the…
Weight Decay 설명 없음
Attention Dropout Attention Dropout is a type of dropout used in attention-based architectures, where elements are randomly dropped out of the…

Similar Papers 제목 키워드 기반

IRS Phase-Shift Feedback Overhead-Aware Model Based on Rank-One Tensor Approximation

2022-05-24 · Bruno Sokal, Paulo R. B. Gomes, André L. F. de Almeida, Behrooz Makki 외

In this paper, we propose a rank-one tensor modeling approach that yields a compact representation of the optimum IRS phase-shift vector for reducing the feedback overhead. The main idea consists of factorizing the IRS p…

Tucker Attention: A generalization of approximate attention mechanisms

2026-03-31 · Timon Klein, Jonas Kusch, Sebastian Sager, Stefan Schnake 외 arxiv

The pursuit of reducing the memory footprint of the self-attention mechanism in multi-headed self attention (MHA) spawned a rich portfolio of methods, e.g., group-query attention (GQA) and multi-head latent attention (ML…

Compact Factorization of Matrices Using Generalized Round-Rank

2018-05-01 · Pouya Pezeshkpour, Carlos Guestrin, Sameer Singh

Matrix factorization is a well-studied task in machine learning for compactly representing large, noisy data. In our approach, instead of using the traditional concept of matrix rank, we define a new notion of link-rank …

Adaptive Mixture of Low-Rank Factorizations for Compact Neural Modeling

2018-09-27 · NIPS Workshop CDNNRIA 2018 · Ting Chen, Ji Lin, Tian Lin, Song Han 외

Modern deep neural networks have a large amount of weights, which make them difficult to deploy on computation constrained devices such as mobile phones. One common approach to reduce the model size and computational cos…

image-classificationImage ClassificationLanguage ModelingLanguage Modelling

Compact Matrix Factorization With Dependent Subspaces

2017-07-01 · CVPR 2017 7 · Viktor Larsson, Carl Olsson

Traditional matrix factorization methods approximate high dimensional data with a low dimensional subspace. This imposes constraints on the matrix elements which allow for estimation of missing entries. A lower rank prov…