Drawing the map…
Drawing the map…
Fetching the papers and their links…
85 papers grouped into meanings · 287 typed relationships (286 verified, 1 inferred)
Every paper and every typed relationship, with the evidence behind each. For the readable account, go back to the map. This page is long on purpose: nothing is hidden, so your browser’s find will search every quote on it. To go straight to one paper, jump to a paper.
Ranked by how often later work cites each paper for this term, not by how often it is cited overall. The first list is what the field built on. The second is where the meaning changed, and those papers are usually missing from the first list, because a paper that moves a term gets cited by the field it moved into, not by the one it left.
Proposes the Transformer, the first transduction model relying entirely on self-attention to compute representations of its input and output without using sequence-aligned RNNs or convolution.
Proposes a novel encoder-decoder extension that jointly learns to align and translate, using an attention/alignment mechanism instead of encoding the whole source sentence into a single fixed-length vector.
Develops a novel framework for attention-based task-driven visual processing with neural networks, formulated as a control problem general enough for static images, videos, or dynamic interactive environments
Introduces sparse factorizations of the attention matrix which reduce quadratic cost to O(n√n)
Generalizes self-attention (previously applied to text) to image generation as a sequence modeling problem with tractable likelihood.
Introduces two attention-based image caption generators under a common framework: a soft deterministic attention mechanism trainable by standard back-propagation and a hard stochastic attention mechanism trainable by maximizing a variational lower bound or via REINFORCE.
SE blocks intrinsically introduce dynamics conditioned on the input, which can be regarded as a self-attention function on channels whose relationships are not confined to the local receptive field the convolutional filters are responsive to.
This paper examines two simple and effective classes of attentional mechanism: a global approach which always attends to all source words and a local one that only looks at a subset of source words at a time.
This makes it suitable for handwriting synthesis, where a human user inputs a text and the algorithm generates a handwritten version of it.
We show that this reliance on CNNs is not necessary and a pure transformer applied directly to sequences of image patches can perform very well on image classification tasks.
The attention model in DRAW is fully differentiable, making it possible to train with standard backpropagation, unlike reinforcement-learning-based attention approaches.
Each row is a typed relationship between two papers. Click a row to see the evidence.
The same three marks stand beside each paper’s own passage, where they are about that passage alone: a passage marked ● can sit above a relationship marked ○.
“Section […] introduces an extension to the prediction network that allows it to condition its outputs on a short annotation sequence whose alignment with the predictions is unknown.”
“The context is a weighted sum of annotations: c_o = ∑_i=1^I α_o,i h_i, where α_o,i is a normalized weight for each annotation h_i. This effectively means that the decoder selects each annotation h_i with a certainty α_o,i.”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“Instead humans focus attention selectively on parts of the visual space to acquire information when and where it is needed, and combine information from different fixations over time to build up an internal representation of the scene […], guiding future eye movements and decision making.”
“We are developing an attention-based model that jointly learns to align parts of captions to images and use these alignments to determine where to attend next, thus dynamically modifying the vectors used for conditioning the decoder.”
“A similar issue in machine translation inspired […] to instead utilize an attention-based contextual encoder that constructs a representation based on the generation context.”
“An attention-based recurrent sequence generator (ARSG) is a recurrent neural network that stochastically generates an output sequence (y_1, …, y_T) from an input x.”
“Specifically, the saliency value of the red flower in Figure […](a) is higher than the yellow one, which is consistent with human perception (paying more attention to the objects with red bright colors […]).”
“Unlike the aforementioned works, we consider an explicitly two-dimensional form of attention, where an array of 2D Gaussian filters is applied to the image, yielding an image `patch' of smoothly varying location and zoom.”
“The idea of a global attentional model is to consider all the hidden states of the encoder when deriving the context vector c_t.”
“Recently there has been a resurgence in models of computation using explicit storage and a notion of attention […]; manipulating such a storage offers an approach to both of these challenges.”
“We further merge RPN and Fast R-CNN into a single network by sharing their convolutional features—using the recently popular terminology of neural networks with “attention” mechanisms, the RPN component tells the unified network where to look.”
“Attention mechanisms allow for a more direct dependence between the state of the model at different points in time. Following the definition from […], given a model which produces a hidden state h_t at each time step, attention-based models compute a “context” vector c_t as the weighted mean of the state sequence h by”
“Rather than compress an entire image into a static representation, attention allows for salient features to dynamically come to the forefront as needed.”
“The representation r of the document d is formed by a weighted sum of these output vectors. These weights are interpreted as the degree to which the network attends to a particular token in the document when answering the query”
“Interest points allow for focusing attention to the most salient and distinctive locations in an image, greatly reducing computation for subsequent tasks such as classification, retrieval, matching, and detection.”
“With a soft attention mechanism, each joint within a frame is assigned a spatial attention weight based on the joint-selection gates. This enables our model to adaptively focus more on those discriminative joints.”
“One of the key factors to the advancement has been the use of neural attention mechanism, which enables the system to focus on a targeted area within a context paragraph (for MC) or within an image (for Visual QA), that is most relevant to answer the question […].”
“In […]'s […] model, the (bidirectional) LSTM's recurrent output vector for each word is concatenated with each possible head's recurrent vector, and the result is used as input to an MLP that scores each resulting arc.”
“We implement this attention by associating a single scalar value, the attention gate g^t_i, with each fact f_i during pass t.”
“Briefly, similar to human visual processing, attention-based algorithms tend to selectively concentrate on a part of the information, and at the same time ignore other perceived information. Such a mechanism is usually called attention and can be employed to adaptively localize discriminative parts or regions of person images.”
“Our attention module is similar to […]. More specifically, let 𝐲_i-1 be the decoder-RNN output from the past decoding time step (in our implementation, we use the output from the bottom decoder layer). Attention context 𝐚_i for the current time step is computed according to the following formulas:”
“So far, all attention models for VQA in literature have focused on the problem of identifying “where to look” or visual attention. In this paper, we argue that the problem of identifying “which words to listen to” or question attention is equally important.”
“This enables adaptive memory usage during recurrence with neural attention, offering a way to weakly induce relations among tokens.”
“To that end, here we consider attention as a set of spatial maps that essentially try to encode on which spatial areas of the input the network focuses most for taking its output decision (e.g., for classifying an image), where, furthermore, these maps can be defined w.r.t. various layers of the network so that they are able to capture both low-, mid-, and high-level representation information.”
“Models with soft attention or memory components have been proposed to help deal with this challenge, aiming to allow for the retrieval and use of relevant previous hidden states, in effect increasing hidden state capacity and providing a path for gradients not tied to timesteps.”
“At each decoding step t, we use an intra-temporal attention function to attend over specific parts of the encoded input sequence in addition to the decoder's own hidden state and the previously-generated word […].”
“Our aim is to encode a variable length sentence into a fixed size embedding. We achieve that by choosing a linear combination of the n LSTM hidden vectors in H. Computing the linear combination requires the self-attention mechanism. The attention mechanism takes the whole LSTM hidden states H as input, and outputs a vector of weights 𝐚:”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“We introduce a separate attention mechanism for each decoder layer.”
“One of the benefits of attention mechanisms is that they allow for dealing with variable sized inputs, focusing on the most relevant parts of the input to make decisions.”
“The attention mechanism is a technique often used in neural translation of text, where a context vector C is conditioned on the target sequence y. As discussed in Bahdanau et al. […], the context vector c_i depends on a sequence of annotations (h_1,..., h_T_x) to which an encoder maps the input sequence.”
“The proposed network thus takes advantage of this attention mechanism to adaptively locate and align pedestrians within a bounding box.”
“Attention can be interpreted as a means of biasing the allocation of available computational resources towards the most informative components of a signal […].”
“Saliency detection has been extensively studied in computer vision, and saliency models in general can be categorized into visual attention prediction or salient object detection. The former methods […] try to predict scene locations where a human observer may fixate.”
“Attention coefficients, α_i ∈ [0,1], identify salient image regions and prune feature responses to preserve only the activations relevant to the specific task as shown in Figure […].”
“Interestingly, the proposed MIL pooling corresponds to a version of the attention mechanism […]. The main difference is that typically in the attention mechanism all instances are sequentially dependent while here we assume that all instances are independent.”
“An attention model works in conjunction with the original DNN and calculates a scalar score e_t for each frame-level feature”
“the architecture incorporates a novel dual attention mechanism that can operate over visual input only, audio input only, or both.”
This map holds no defining passage for this paper. The quotes behind each relationship below are unaffected.
Longformer generalizes self-attention mechanisms used in downstream models by proposing a scalable variant applicable to long-document transfer learning settings like ELMo's.
“Each self-attention layer computes a d-dimensional representation for each position, that is, each channel of each pixel. To recompute the representation for a given position, it first compares the position's current representation to other positions' representations, obtaining an attention distribution over the other positions. This distribution is then used to weight the contribution of the other positions' representations to the next representation for the position at hand.”
“The original idea of attention is that different parts of a model can contribute (i.e., attend) differently for the final prediction […].”
“The self-attention scheme […] calculates the context at one position as a aggregation of all positions in a sentence (at the encoder stage).”
“For the self-attention-layer, we adopt the multi-head attention mechanism defined in […] which, for each position in the input, called the query, computes a weighted sum of all positions, or keys, in the input based on the similarity between the query and key as measured by the dot product.”
“The self-attention module calculates response at a position as a weighted sum of the features at all positions, where the weights – or attention vectors – are calculated with only a small computational cost.”
“Each attention head operates on an input sequence, x = (x_1, …, x_n) of n elements where x_i ∈ℝ^d_x, and computes a new sequence z = (z_1, …, z_n) of the same length where z_i ∈ℝ^d_z.”
“Designing of new blocks is one of the growing areas of research in CNN, where generic blocks are used to assign attention to spatial and feature-map (channel) information (Wang et al. 2017a; Roy et al. 2018; Woo et al. 2018).”
“The multi-head attention mechanism obtains h (i.e. one per head) different representations of (Q, K, V), computes scaled dot-product attention for each representation, concatenates the results, and projects the concatenation through a feed-forward layer.”
“Attention mechanisms […] induce conditional distributions over input units to compose a weighted context vector for downstream modules.”
“Self-attention is a neural network operation that is able to transform a sequence y_1, …, y_N into a sequence y'_1, …, y'_N, where each y'_i depends on all y_i by way of a single vectorizable computation […].”
“They have proved to be effective for guiding the model to attend on less discriminative parts of objects ( leg as opposed to head of a person), thereby letting the network generalize better and have better object localization capabilities.”
“After these linear projections, the scaled dot-product attention computes a sequence of vector outputs: 𝐎_h = Attention(𝐐_h, 𝐊_h, 𝐕_h)= softmax(𝐐_h𝐊_h^T/√(d_k)·𝐌)𝐕_h.”
“Self-attention is a variant of attention […] that processes a sequence by replacing each element by a weighted average of the rest of the sequence.”
“A self-attention layer maps a matrix of input embeddings X to an output matrix and is parameterized by a connectivity pattern S = {S_1,..., S_n}, where S_i denotes the set of indices of the input vectors to which the ith output vector attends.”
“employs the neural attention mechanism […] to learn the weight of each neighbor during a propagation, such that the attention weights of cascaded propagations can reveal the importance of a high-order connectivity.”
“As shown in Figure […]b, for the self attention block we exploit inherent parallelism in the multihead attention operation, partitioning the GEMMs associated with key (K), query (Q), and value (V) in a column parallel fashion such that the matrix multiply corresponding to each attention head is done locally on one GPU.”
“In each Transformer block, multiple self-attention heads are used to aggregate the output vectors of the previous layer.”
“VisualBERT consists of a stack of Transformer layers that implicitly align elements of an input text and regions in an associated input image with self-attention.”
“For each element in an input sequence 𝐳∈ℝ^N × D, we compute a weighted sum over all values 𝐯 in the sequence. The attention weights A_ij are based on the pairwise similarity between two elements of the sequence and their respective query 𝐪^i and key 𝐤^j representations.”
“Here, each token's representation is updated by attending to all other tokens in the previous layer. This operation is key for retaining long-term information, giving Transformers the edge over recurrent models on long sequences. However, attending to all tokens at each layer incurs a complexity of O(n^2) with respect to sequence length.”
“Given a query element (e.g., a target word in the output sentence) and a set of key elements (e.g., source words in the input sentence), the multi-head attention module adaptively aggregates the key contents according to the attention weights that measure the compatibility of query-key pairs.”
“To be specific, […] derived an “attention map" from the original feature maps to express knowledge.”
“We use the same model and architecture as GPT-2 […], including the modified initialization, pre-normalization, and reversible tokenization described therein, with the exception that we use alternating dense and locally banded sparse attention patterns in the layers of the transformer, similar to the Sparse Transformer […].”
“To address this challenge, we sparsify the full self-attention matrix according to an “attention pattern” specifying pairs of input locations attending to one another.”
“The attention mechanism […] has been a highly successful neural network component for NLP tasks, which is also crucial for pre-trained LMs.”
“The standard attention used in the Transformer is the scaled dot-product attention […]. The input consists of queries and keys of dimension d_k, and values of dimension d_v. The dot products of the query with all keys are computed, scaled by √(d_k), and a softmax function is applied to obtain the weights on the values.”
“The fundamental role of dot product self-attention is to learn self-alignment, i.e., to determine the relative importance of a single token with respect to all other tokens in the sequence.”
“Multi-head Self Attention layers (MSA). The attention mechanism is based on a trainable associative memory with (key, value) vector pairs.”
“Critically, our Visual Transformer operates in a semantic token space, judiciously attending to different image parts based on context.”
“In computer vision, {the} attention mechanism can be regarded as a dynamic weight recalibration process based on the input features.”
“In comparison, self-attention allows the receptive field to be the entire spatial locations and computes the weights based on the re-normalized pairwise similarity between the pair (x_i, x_j):”
“The goal of the proposed Convolutional Projection layer is to achieve additional modeling of local spatial context, and to provide efficiency benefits by permitting the undersampling of K and V matrices.”
“The computational cost of self-attention in vision transformers is O(N^2d).”
“Different from SRA […] which uses convolutions for spatial reduction, linear SRA uses average pooling to reduce the spatial dimension (i.e., h× w) to a fixed size (i.e., P× P) before the attention operation.”
“Whereas in self-attention the weights to aggregate information from other patches are data dependent through queries and keys, in ResMLPthe weights are not data dependent and only based on absolute positions of patches.”
“Recently more advanced models emerge with cross-modal attention layers […] and show superior performance in image-text matching tasks. However, they are orders of magnitudes slower and hence impractical for image-text retrieval systems in the real world.”
“Attention(Q, K, V) = Softmax(QK^𝖳/√(d_head))V.”
“The scaled dot-product attention is applied on Q,K,V: Attention(Q,K,V) = softmax(QK^T/√(d_k))V.”
“Transformers, designed for sequence-to-sequence prediction, have emerged as alternative architectures with innate global self-attention mechanisms, but can result in limited localization abilities due to insufficient low-level details.”
Introduces an attention mechanism that scales linearly with sequence length as a drop-in replacement for standard self-attention.
Introduces graph attention networks (GATs), which apply masked self-attentional layers to graph-structured data, allowing nodes to attend over their neighborhoods' features and implicitly assign different weights to different neighbors without costly matrix operations or upfront knowledge of graph structure.
Replacing dot-product attention with LSH-based attention changes its complexity from O(L^2) to O(L log L)
The Gaussian window alignment mechanism for handwriting synthesis is generalized into self-attention and applied to a new domain, time-series forecasting.— the tool’s reading
“To tackle the aforementioned challenges, deep neural networks [3, 4, 5, 6] have been proposed as an alternative solution, where Recurrent Neural Network (RNN) [7, 8, 9] has been employed to model time series in an autoregressive fashion.”
“Section <ref> introduces an extension to the prediction network that allows it to condition its outputs on a short annotation sequence whose alignment with the predictions is unknown.”
“After these linear projections, the scaled dot-product attention computes a sequence of vector outputs: 𝐎_h = Attention(𝐐_h, 𝐊_h, 𝐕_h)= softmax(𝐐_h𝐊_h^T/√(d_k)·𝐌)𝐕_h.”
The newer paper generalizes soft alignment into a broader softmax-based attention/memory mechanism, citing the earlier work mainly for architectural techniques like skip-connections and stacking.— the tool’s reading
“It is possible to construct deep LSTMNs by stacking multiple memory and hidden layers in an alternating fashion, resembling a stacked LSTM (Graves, 2013) or a multi-hop memory network (Sukhbaatar et al.”
“The attention at the (k + 1)th layer is computed as: ati,k+1 = v T tanh(Whhk+1i +Wlh k t +Wh̃h̃ k+1 t 1 ) (10) Skip-connections (Graves, 2013) can be applied to feed xt to upper layers as well.”
“We apply skip-connections (Graves, 2013) across layers (inputk+1 = inputk + outputk).”
“Section <ref> introduces an extension to the prediction network that allows it to condition its outputs on a short annotation sequence whose alignment with the predictions is unknown.”
“This enables adaptive memory usage during recurrence with neural attention, offering a way to weakly induce relations among tokens.”
The Gaussian window alignment for handwriting text is adapted into an image-captioning context, applying soft attention over spatial visual features instead of text sequences.'— the tool’s reading
“Section <ref> introduces an extension to the prediction network that allows it to condition its outputs on a short annotation sequence whose alignment with the predictions is unknown.”
“Rather than compress an entire image into a static representation, attention allows for salient features to dynamically come to the forefront as needed.”
Both use content-based weighting to focus on relevant input parts, but softmax over memory generalizes the Gaussian window into a broader, reusable multi-hop attention mechanism.— the tool’s reading
“A number of recent efforts have explored ways to capture long-term structure within sequences using RNNs or LSTM-based models (Chung et al., 2014; Graves, 2013; Koutn´ık et al., 2014; Mikolov et al., 2014; Hochreiter & Schmidhuber, 1997; Atkeson & Schaal, 1995).”
“Section <ref> introduces an extension to the prediction network that allows it to condition its outputs on a short annotation sequence whose alignment with the predictions is unknown.”
“Recently there has been a resurgence in models of computation using explicit storage and a notion of attention <cit.>; manipulating such a storage offers an approach to both of these challenges.”
The Gaussian-window alignment for handwriting synthesis is carried into a new modality/task—encoder-decoder speech recognition—adapting soft alignment via score-based context vectors with monotonic gating.— the tool’s reading
“The attention mechanism in this respect was first used by Graves (2013) to build a neural network that generates convincing handwriting from a given text.”
“Accessing the input sequence through a context vector is related to the model that generates hand-written characters, proposed recently by Graves (2013).”
“Section <ref> introduces an extension to the prediction network that allows it to condition its outputs on a short annotation sequence whose alignment with the predictions is unknown.”
“The context is a weighted sum of annotations: c_o = ∑_i=1^I α_o,i h_i, where α_o,i is a normalized weight for each annotation h_i. This effectively means that the decoder selects each annotation h_i with a certainty α_o,i.”
Transformer generalizes Graves' Gaussian-window soft alignment into a formal query-key-value attention framework applicable broadly, not just handwriting synthesis conditioning.'— the tool’s reading
“At each step the model is auto-regressive [9], consuming the previously generated symbols as additional input when generating the next.”
“Section <ref> introduces an extension to the prediction network that allows it to condition its outputs on a short annotation sequence whose alignment with the predictions is unknown.”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
The newer paper generalizes Graves' unidirectional Gaussian alignment into a flexible, bidirectional soft-attention weighting over encoder states for translation.— the tool’s reading
“A similar approach of aligning an output symbol with an input symbol was proposed recently by Graves (2013) in the context of handwriting synthesis.”
“The main difference from our approach is that, in (Graves, 2013), the modes of the weights of the annotations only move in one direction.”
“Section <ref> introduces an extension to the prediction network that allows it to condition its outputs on a short annotation sequence whose alignment with the predictions is unknown.”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
Newer paper generalizes soft-alignment attention into a simplified, recurrence-free softmax-weighted context vector mechanism applicable broadly across sequence tasks.— the tool’s reading
“The use of gating architectures [3, 5], sophisticated optimization techniques [6, 7], gradient clipping [2, 8], and/or careful initialization [7, 9, 10, 11] can help mitigate this issue and has facilitated the success of RNNs in a variety of fields (see e.”
“Section <ref> introduces an extension to the prediction network that allows it to condition its outputs on a short annotation sequence whose alignment with the predictions is unknown.”
“Attention mechanisms allow for a more direct dependence between the state of the model at different points in time. Following the definition from <cit.>, given a model which produces a hidden state h_t at each time step, attention-based models compute a “context” vector c_t as the weighted mean of the state sequence h by”
The Gaussian-based alignment mechanism from 1D handwriting synthesis is adapted into a 2D image read/write attention for visual generation, extending it to a new modality.— the tool’s reading
“We favour LSTM due to its proven track record for handling long-range dependencies in real sequential data (Graves, 2013; Sutskever et al., 2014).”
“To endow the network with selective attention without sac-rificing the benefits of gradient descent training, we take in-spiration from the differentiable attention mechanisms recently used in handwriting synthesis (Graves, 2013) and Neural Turing Machines (Graves et al., 2014).”
“Section <ref> introduces an extension to the prediction network that allows it to condition its outputs on a short annotation sequence whose alignment with the predictions is unknown.”
“Unlike the aforementioned works, we consider an explicitly two-dimensional form of attention, where an array of 2D Gaussian filters is applied to the image, yielding an image `patch' of smoothly varying location and zoom.”
The newer paper generalizes Graves' Gaussian mixture location-based alignment into a broader ARSG framework, combining content and location-based attention into a hybrid mechanism.— the tool’s reading
“From this perspective it is similar to machine translation and handwriting synthesis tasks, for which attention-based methods have been found suitable [2, 1].”
“Recently, attention-based recurrent networks have been successfully applied to a wide variety of tasks, such as handwriting synthesis [1], machine translation [2], image caption generation [3] and visual object classification [4].”
“For instance, Graves [1] used the location-based attention mechanism using a Gaussian mixture model in his handwriting synthesis model.”
“Section <ref> introduces an extension to the prediction network that allows it to condition its outputs on a short annotation sequence whose alignment with the predictions is unknown.”
“An attention-based recurrent sequence generator (ARSG) is a recurrent neural network that stochastically generates an output sequence (y_1, …, y_T) from an input x.”
Transformer self-attention generalizes the earlier Gaussian window alignment into a fully learned query-key-value weighting mechanism applicable more broadly.— the tool’s reading
“Self-attention is a variant of attention [Graves, 2013; Bahdanau et al., 2015] that processes a sequence by replacing each element by a weighted average of the rest of the sequence.”
“Language models are typically used for compression or sequence generation [Graves, 2013].”
“Section <ref> introduces an extension to the prediction network that allows it to condition its outputs on a short annotation sequence whose alignment with the predictions is unknown.”
“Self-attention is a variant of attention <cit.> that processes a sequence by replacing each element by a weighted average of the rest of the sequence.”
The Gaussian window alignment for handwriting synthesis is carried into a new domain and modality: image-text co-attention for visual question answering.— the tool’s reading
“LSTMs have been used to achieve state-of-the-art performance in several tasks such as handwriting recognition [31], sequence generation [32] speech recognition [33] and machine translation [11] among others.”
“Section <ref> introduces an extension to the prediction network that allows it to condition its outputs on a short annotation sequence whose alignment with the predictions is unknown.”
“We are developing an attention-based model that jointly learns to align parts of captions to images and use these alignments to determine where to attend next, thus dynamically modifying the vectors used for conditioning the decoder.”
The newer paper generalizes soft alignment attention into multi-head self-attention and extends it to dual modality encoders, building on the original mechanism's core idea.— the tool’s reading
“The context is a weighted sum of annotations: c_o = ∑_i=1^I α_o,i h_i, where α_o,i is a normalized weight for each annotation h_i. This effectively means that the decoder selects each annotation h_i with a certainty α_o,i.”
“the architecture incorporates a novel dual attention mechanism that can operate over visual input only, audio input only, or both.”
The newer paper applies the same soft-alignment attention mechanism from speech recognition to a new domain, neural machine translation, citing it alongside other cross-domain uses.— the tool’s reading
“…image objects and agent actions in the dynamic control problem (Mnih et al., 2014), between speech frames and text in the speech recognition task (Chorowski et al., 2014), or between visual features of a picture and its text description in the image caption generation task (Xu et al., 2015).”
“, 2014), between speech frames and text in the speech recognition task (Chorowski et al., 2014), or between visual features of a picture and its text description in the image caption generation task (Xu et al.”
“The context is a weighted sum of annotations: c_o = ∑_i=1^I α_o,i h_i, where α_o,i is a normalized weight for each annotation h_i. This effectively means that the decoder selects each annotation h_i with a certainty α_o,i.”
“The idea of a global attentional model is to consider all the hidden states of the encoder when deriving the context vector c_t.”
The newer paper generalizes Bahdanau's soft attention to a broader framework with multiple similarity functions and critically examines its interpretability as feature importance.— the tool’s reading
“Attention mechanisms (Bahdanau et al., 2014) induce conditional distributions over input units to compose a weighted context vector for down-stream modules.”
“In this work we consider two common similarity functions: Additive φ(h,Q) = vT tanh(W1h + W2Q) (Bahdanau et al., 2014) and Scaled Dot-Product φ(h,Q) =”
“Attention mechanisms (Bahdanau et al., 2014) induce conditional distributions over input units to compose a weighted context vector for downstream modules.”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“Attention mechanisms <cit.> induce conditional distributions over input units to compose a weighted context vector for downstream modules.”
Same soft-alignment attention mechanism is carried from neural machine translation into abstractive summarization, a new task/field.— the tool’s reading
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“A similar issue in machine translation inspired <cit.> to instead utilize an attention-based contextual encoder that constructs a representation based on the generation context.”
The soft attention mechanism from NMT is carried into a new modality (visual/image recognition) as recurrent glimpse-based spatial attention for person re-identification.— the tool’s reading
“…Networks (RNNs) based on Long Short-Term Memory (LSTM) [18], the attention based models have demonstrated outstanding performance on several challenging sequential data recognition and modeling tasks, including caption generation [19], machine translation [20], as well as action recognition [21].”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“Briefly, similar to human visual processing, attention-based algorithms tend to selectively concentrate on a part of the information, and at the same time ignore other perceived information. Such a mechanism is usually called attention and can be employed to adaptively localize discriminative parts or regions of person images.”
The biaffine attention mechanism carries the soft-attention idea from machine translation into a new task/domain, dependency parsing, adapting it via bilinear scoring.— the tool’s reading
“Kiperwasser & Goldberg (2016) present a neural graph-based parser (in addition to a transition-based one) that uses the same kind of attention mechanism as Bahdanau et al. (2014) for machine translation.”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“In <cit.>'s <cit.> model, the (bidirectional) LSTM's recurrent output vector for each word is concatenated with each possible head's recurrent vector, and the result is used as input to an MLP that scores each resulting arc.”
The newer paper generalizes soft encoder-decoder attention into intra- and inter-attention over stored hidden states, extending it beyond MT alignment to general sequence relations.— the tool’s reading
“In the encoder-decoder architecture, this problem can be sidestepped with an attention mechanism to learn a soft alignment between the encoding and decoding states (Bahdanau et al., 2014).”
“Meanwhile, we apply inter attention between them at every time step when the target sequence is analyzed, same as the RNNSearch (Bahdanau et al., 2014).”
“cent works leverage recurrent neural networks to understand text from scratch (Mikolov et al., 2010; Bahdanau et al., 2014).”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“This enables adaptive memory usage during recurrence with neural attention, offering a way to weakly induce relations among tokens.”
The soft attention mechanism from NMT decoders is carried into computer vision, reinterpreted as feature recalibration across channel/spatial dimensions in CNNs.— the tool’s reading
“Transformers have had great success in natural language processing [33], [38], [149], [150], [152], [161].”
“Self-attention was proposed and has had great success in the field of natural language processing (NLP) [33], [38], [39], [149], [150], [151], [152].”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“In computer vision, {the} attention mechanism can be regarded as a dynamic weight recalibration process based on the input features.”
The soft attention mechanism from neural machine translation is carried into a new domain and modality: skeleton-based action recognition over joints and frames.— the tool’s reading
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“With a soft attention mechanism, each joint within a frame is assigned a spatial attention weight based on the joint-selection gates. This enables our model to adaptively focus more on those discriminative joints.”
The soft attention mechanism from sequence-to-sequence translation is carried into a new modality—graph-structured data—applied over node neighborhoods instead of encoder sequences.— the tool’s reading
“Properly interpreting these coefficients (as performed by e.g. Bahdanau et al. (2015)) will require further domain knowledge about the dataset under study, and is left for future work.”
“Furthermore, analyzing the learned attentional weights may lead to benefits in interpretability, as was the case in the machine translation domain (e.g. the qualitative analysis of Bahdanau et al. (2015)).”
“The particular attentional setup utilized by us closely follows the work of Bahdanau et al. (2015)—but the framework is agnostic to the particular choice of attention mechanism.”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“One of the benefits of attention mechanisms is that they allow for dealing with variable sized inputs, focusing on the most relevant parts of the input to make decisions.”
The soft attention mechanism from NMT decoders is carried into a new domain (episodic memory/QA) with a new architecture, an attention-based GRU gate over facts.— the tool’s reading
“Attention mechanisms have been successful components in both machine translation (Bahdanau et al., 2015; Luong module and memory module, to improve question answering.”
“They can benefit image classification (Stollenga et al., 2014), generating captions for images (Xu et al., 2015), among others mentioned below, and machine translation (Cho et al., 2014; Bahdanau et al., 2015; Luong et al., 2015).”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“We implement this attention by associating a single scalar value, the attention gate g^t_i, with each fact f_i during pass t.”
Self-attention generalizes soft encoder-decoder attention to token-to-token query-key interactions across all positions, extending the original mechanism's scope.— the tool’s reading
“To do so, we develop a sequence-to-sequence (seq2seq) version of ResMLP, where both encoder and decoders are based on ResMLP with across-attention between the encoder and decoder [7].”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“Whereas in self-attention the weights to aggregate information from other patches are data dependent through queries and keys, in ResMLPthe weights are not data dependent and only based on absolute positions of patches.”
The Transformer generalizes encoder-decoder soft attention into self-attention with query-key-value formalism, removing recurrence while building on the same weighting mechanism.— the tool’s reading
“, 2017), or a combination of recurrence and attention (Bahdanau et al., 2014; Cho et al., 2014; Luong et al., 2015; Wu et al., 2016) as basic building blocks.”
“…leverage recurrence (Sutskever et al., 2014), convolution (Gehring et al., 2017; Kalch-brenner et al., 2016), attention (Vaswani et al., 2017), or a combination of recurrence and attention (Bahdanau et al., 2014; Cho et al., 2014; Lu-ong et al., 2015; Wu et al., 2016) as basic building blocks.”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“Each attention head operates on an input sequence, x = (x_1, …, x_n) of n elements where x_i ∈ℝ^d_x, and computes a new sequence z = (z_1, …, z_n) of the same length where z_i ∈ℝ^d_z.”
The soft-attention alignment mechanism from NMT is carried into a new modality (vision-language VQA) and extended into symmetric co-attention, combining migration with extension.— the tool’s reading
“[3] propose RNNSearch to learn an alignment over the input sentences.”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“So far, all attention models for VQA in literature have focused on the problem of identifying “where to look” or visual attention. In this paper, we argue that the problem of identifying “which words to listen to” or question attention is equally important.”
The soft-attention mechanism from sequence-to-sequence translation is carried into image feature maps to model long-range spatial dependencies, a new modality/domain.— the tool’s reading
“Recently, attention mechanisms have become an integral part of models that must capture global dependencies [2, 34, 36, 6].”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“The self-attention module calculates response at a position as a weighted sum of the features at all positions, where the weights – or attention vectors – are calculated with only a small computational cost.”
The softmax attention mechanism is carried from NMT decoding over encoder positions into a memory network context performing multi-hop reasoning over multiple memory items, a new task/domain.'— the tool’s reading
“Other recently proposed forms of memory or attention take this approach, notably Graves et al. (2014) and Bahdanau et al. (2015).”
“Our model is also related to Bahdanau et al. (2015).”
“Our “memory” is analogous to their attention mechanism, both using weak supervision during training, although Bahdanau et al. (2015) is only a single sentence rather than many, as in our case.”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“Recently there has been a resurgence in models of computation using explicit storage and a notion of attention <cit.>; manipulating such a storage offers an approach to both of these challenges.”
The newer paper adapts the same soft-attention alignment mechanism from neural machine translation to speech recognition, adding location-based monotonicity constraints for the new domain.— the tool’s reading
“In (b), we observe how the absence of the learned preference for monotonicity makes the model confused by the repeated occurrence of the phonemes “cl k”, and to a lesser degree, by the repetition of “w”. sequence with elements of the output sequence (Bahdanau et al. , 2014).”
“sequence with elements of the output sequence (Bahdanau et al., 2014).”
“The proposed model (a variant of RNN Encoder–Decoder (Cho et al. , 2014; Bahdanau et al. , 2014)) instead uses the scores as an explicit alignment which is used to compute a context vector.”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“The context is a weighted sum of annotations: c_o = ∑_i=1^I α_o,i h_i, where α_o,i is a normalized weight for each annotation h_i. This effectively means that the decoder selects each annotation h_i with a certainty α_o,i.”
BiDAF builds on Bahdanau's dynamic soft attention by adding bidirectional, unsummarized, memory-less-at-each-step attention flow rather than compressing context into a single vector.— the tool’s reading
“The first group (largely inspired by Bahdanau et al. (2015)) uses a dynamic attention mechanism, in which the attention weights are updated dynamically given the query and the context as well as the previous attention.”
“Attention mechanisms in previous works typically have one or more of the following characteristics.”
“That is, while we iteratively compute attention through time as in Bahdanau et al. (2015), the attention at each time step is a function of only the query and the context para-graph at the current time step and does not directly depend on the attention at the previous time step.”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“One of the key factors to the advancement has been the use of neural attention mechanism, which enables the system to focus on a targeted area within a context paragraph (for MC) or within an image (for Visual QA), that is most relevant to answer the question <cit.>.”
The newer paper builds on soft attention/context vectors by generalizing to self-attention and dual encoder-decoder attention over separate video and audio modalities.— the tool’s reading
“speech recognition and machine translation [5], [7], [22], [23], [46].”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“the architecture incorporates a novel dual attention mechanism that can operate over visual input only, audio input only, or both.”
The newer paper adopts Bahdanau's context-vector definition then generalizes it into a feed-forward, non-recurrent attention mechanism applicable without RNNs.— the tool’s reading
“Following the definition from [15], given a model which produces a hidden state ht at each time step, attention-based models compute a “context” vector ct as the weighted mean of the state sequence h by”
“They also provide an alternate argument for the claim made by Bahdanau et al. (2014) that attention helps models handle very long and widely variable-length sequences.”
“Attention-based RNNs have proven effective in a variety of sequence transduction tasks, including machine translation [15], image captioning [16], and speech recognition [17, 18].”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“Attention mechanisms allow for a more direct dependence between the state of the model at different points in time. Following the definition from <cit.>, given a model which produces a hidden state h_t at each time step, attention-based models compute a “context” vector c_t as the weighted mean of the state sequence h by”
The additive soft attention mechanism from NMT is carried into CNN-based image analysis for spatial feature recalibration, adapting it to a new modality and task.— the tool’s reading
“For instance, additive soft attention is used in sentence-to-sentence translation [2, 29] and more recently applied to image classification [11, 32].”
“Attention Gates: AGs are commonly used in natural image analysis, knowledge graphs, and language processing (NLP) for image captioning [1], machine translation [2, 30], and classification [11, 31, 32] tasks.”
“We use additive attention [2] to obtain the gating coefficient.”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“Attention coefficients, α_i ∈ [0,1], identify salient image regions and prune feature responses to preserve only the activations relevant to the specific task as shown in Figure <ref>.”
The attention mechanism from NMT encoder-decoder translation is carried into a new domain, time-series classification via an Attention LSTM, for visualization purposes.— the tool’s reading
“The attention mechanism proposed by Bahdanau et al. [18] can help the LSTM RNN learn these dependencies.”
“Bahdanau et al. [18] parametrize the alignment model a as a feedforward neural network which is jointly trained with all the other components of the model.”
“As discussed in Bahdanau et al. [18], the context vector c i depends on a sequence of annotations ( h 1 , ..., h T x ) to which an encoder maps the input sequence.”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“The attention mechanism is a technique often used in neural translation of text, where a context vector C is conditioned on the target sequence y. As discussed in Bahdanau et al.<cit.>, the context vector c_i depends on a sequence of annotations (h_1,..., h_T_x) to which an encoder maps the input sequence.”
Self-attention generalizes the encoder-decoder soft attention mechanism into scaled dot-product queries/keys applied within Transformers, building on the original concept.— the tool’s reading
“The attention mechanism (Bahdanau et al., 2015) has been a highly successful neural network component for NLP tasks, which is also crucial for pre-trained LMs.”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“The attention mechanism <cit.> has been a highly successful neural network component for NLP tasks, which is also crucial for pre-trained LMs.”
Transformer generalizes soft encoder-decoder attention into a self-attention QKV formulation applied globally, building on Bahdanau's original mechanism.— the tool’s reading
“Then we learn the interactions between context and question by standard attentions (Xiong et al., 2016; Seo et al., 2016; Bahdanau et al., 2015).”
“In this work, we consider attention-based neural machine translation (NMT) models Bahdanau et al. (2015); Luong et al. (2015), which have demonstrated excellent translation quality Wu et al. (2016), as the core models of our data augmentation pipeline.”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“For the self-attention-layer, we adopt the multi-head attention mechanism defined in <cit.> which, for each position in the input, called the query, computes a weighted sum of all positions, or keys, in the input based on the similarity between the query and key as measured by the dot product.”
The newer paper generalizes soft attention into a broader scoring/query-key framework and applies it to new architectures like pointer networks beyond translation.— the tool’s reading
“…to increase capacity and minimize the impact of vanishing gradients, some language and translation mod-Pointer els have also added a soft attention or memory component (Bahdanau et al., 2015; Sukhbaatar et al., 2015; Cheng et al., 2016; Kumar et al., 2016; Xiong et al., 2016; Ahn et al., 2016).”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“Models with soft attention or memory components have been proposed to help deal with this challenge, aiming to allow for the retrieval and use of relevant previous hidden states, in effect increasing hidden state capacity and providing a path for gradients not tied to timesteps.”
The newer paper generalizes single-step attention to multi-layer, multi-hop attention modules within a convolutional decoder architecture.— the tool’s reading
“The dominant approach to date encodes the input sequence with a series of bi-directional recurrent neural networks (RNN) and generates a variable length output with another set of decoder RNNs, both of which interface via a soft-attention mechanism (Bahdanau et al., 2014; Luong et al., 2015).”
“, 2015) compared to single step attention (Bahdanau et al., 2014; Luong et al., 2015; Zhou et al., 2016; Wu et al., 2016).”
“Their model implements the attention-based sequence to sequence architecture of Bahdanau et al. (2014) and uses GRU cells both in the encoder and decoder.”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“We introduce a separate attention mechanism for each decoder layer.”
The newer paper builds on Bahdanau's soft attention baseline, generalizing it into a hybrid content+location-based ARSG mechanism for speech recognition.— the tool’s reading
“Often this issue is partially alleviated by an encoder such as e.g. a BiRNN [2] or a deep convolutional network [3] that encode contextual information into every element of h .”
“We start with a model proposed in [2] for the machine translation task as the baseline.”
“We show that while an adaptation of the model used for machine translation in [2] reaches a competitive 18.”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“An attention-based recurrent sequence generator (ARSG) is a recurrent neural network that stochastically generates an output sequence (y_1, …, y_T) from an input x.”
The Transformer generalizes soft encoder-decoder attention into self-attention with query-key-value formalism and multi-head structure, explicitly citing it as the origin variant.— the tool’s reading
“Self-attention is a variant of attention [Graves, 2013; Bahdanau et al., 2015] that processes a sequence by replacing each element by a weighted average of the rest of the sequence.”
“Similar arguments have been made against using a unidirectional recurrent neural network encoder in sequence-to-sequence models [Bahdanau et al., 2015].”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“Self-attention is a variant of attention <cit.> that processes a sequence by replacing each element by a weighted average of the rest of the sequence.”
The soft attention mechanism from NMT decoding is carried into a new domain—recommendation systems—to weight historical items rather than source sentence positions.— the tool’s reading
“design of neural attention network [15], [16], [17], [19] did not work well for item-based CF, due to the large variances of the lengths of user histories.”
“The two choices of attention function differ in the construction of input: the first choice fconcat simply concatenates pi and qj to learn the attention weight wij [19], while second choice fprod feeds the element-wise product of pi and qj into the attention network [15].”
“Note that setting b to 1 means using softmax to normalize the attention weights, a standard setting for neural attention networks [15], [16], [19].”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“The original idea of attention is that different parts of a model can contribute (i.e., attend) differently for the final prediction <cit.>.”
The newer paper adopts standard encoder-decoder attention and adds novel intra-temporal and intra-decoder attention mechanisms building on the original soft attention idea.— the tool’s reading
“Attention mechanisms (Bahdanau et al., 2014) make these models more performant and scalable, allowing them to look back at parts of the encoded input sequence while the output is generated.”
“Recently, neural network models (Nallapati et al., 2016; Zeng et al., 2016), based on the attentional encoder-decoder model for machine translation (Bahdanau et al., 2014), were able to generate abstractive summaries with high ROUGE scores.”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“At each decoding step t, we use an intra-temporal attention function to attend over specific parts of the encoded input sequence in addition to the decoder's own hidden state and the previously-generated word <cit.>.”
The newer paper adapts the soft attention mechanism from NMT decoding into a document-query QA setting, applying the same weighting idea to a new task domain.'— the tool’s reading
“These models draw on recent developments for incorporating attention mechanisms into recurrent neural network architectures [6, 7, 8].”
“The fixed width hidden vector forms a bottleneck for this information flow that we propose to circumvent using an attention mechanism inspired by recent results in translation and image recognition [6, 7].”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“The representation r of the document d is formed by a weighted sum of these output vectors. These weights are interpreted as the degree to which the network attends to a particular token in the document when answering the query”
The newer paper carries the attention concept from NMT's soft encoder-weighting into CNN spatial maps, a new field and modality (vision, knowledge transfer).— the tool’s reading
“It was recently adapted for neural machine translation with recurrent neural networks, e.g. Bahdanau et al. (2014) as well as in several other NLP-related tasks.”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“To that end, here we consider attention as a set of spatial maps that essentially try to encode on which spatial areas of the input the network focuses most for taking its output decision (e.g., for classifying an image), where, furthermore, these maps can be defined w.r.t. various layers of the network so that they are able to capture both low-, mid-, and h…”
The soft attention mechanism from NMT is carried into a new modality/task—visual question answering with image-caption alignment—rather than being contested or merely renamed.— the tool’s reading
“Current methods include using a convolutional encoder and RNN decoder [8], RNN encoder and RNN decoder [9, 10] and LSTM encoder with LSTM decoder [11].”
“Furthermore, our method builds on analogous approaches being used in machine translation [8, 9, 10, 11].”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“We are developing an attention-based model that jointly learns to align parts of captions to images and use these alignments to determine where to attend next, thus dynamically modifying the vectors used for conditioning the decoder.”
The newer paper generalizes Bahdanau's soft attention into global/local variants with multiple alignment functions, explicitly comparing and simplifying architecture while broadening scope.— the tool’s reading
“On the other hand, in (Bahdanau et al., 2015; Jean et al., 2015) and this work, s, in fact, implies a set of source hidden states which are consulted throughout the entire course of the translation process.”
“Comparison to other work – Bahdanau et al. (2015) use context vectors, similar to our ct, in building subsequent hidden states, which can also achieve the “coverage” effect.”
“…part of at and for long sentences, we ignore words near the end. goes through a deep-output and a maxout layer before making predictions.7 Lastly, Bahdanau et al. (2015) only experimented with one alignment function, the concat product; whereas we show later that the other alternatives are…”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“The idea of a global attentional model is to consider all the hidden states of the encoder when deriving the context vector c_t.”
The Transformer generalizes soft encoder-decoder attention into a self-attention QKV mechanism applicable within a single sequence, building on the original alignment idea.— the tool’s reading
“Attention models can be traced back to the machine translation models of (Bahdanau et al., 2014) and (Luong et al., 2015), where attention is employed to learn soft word alignments between language pairs.”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“The fundamental role of dot product self-attention is to learn self-alignment, i.e., to determine the relative importance of a single token with respect to all other tokens in the sequence.”
The attention weighting mechanism is carried from sequential NMT decoding into a new domain—permutation-invariant pooling for multiple instance learning.— the tool’s reading
“The attention mechanism is widely used in deep learning for image captioning (Xu et al., 2015) or text analysis (Bahdanau et al., 2014; Lin et al., 2017).”
“The two-layered neural network corre-1 According to the European Union General Data Protection Regulation (taking effect 2018), a user should have the right to obtain an explanation of the decision reached. sponds to the attention mechanism (Bahdanau et al., 2014; Raffel & Ellis, 2015).”
“sponds to the attention mechanism (Bahdanau et al., 2014; Raffel & Ellis, 2015).”
“Intuitively, this implements a mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.”
“Interestingly, the proposed MIL pooling corresponds to a version of the attention mechanism <cit.>. The main difference is that typically in the attention mechanism all instances are sequentially dependent while here we assume that all instances are independent.”
The survey generalizes RAM's sequential RL-based glimpse selection into a broader taxonomy of feature recalibration mechanisms, treating it as an early instance within an expanded attention framework.— the tool’s reading
“[88] proposed a deep recurrent network, similar to RAM [31], capable of processing a multi-resolution crop of the input image, called a glimpse, for multiple object recognition task.”
“Category Method Publication Tasks g(x) f(g(x), x) Ranges S or H Goals RNN-based methods RAM [31] NIPS2014 Cls use RNN to recurrently predict important regions (A) (0,1) H (I), (II).”
“[8], [9], [15], [21], [31], [32], [34], [35] , [22], [26], [62], [63], [64], [65], [66], [67] , [41], [68], [69], [70], [71], [72], [73], [74] , [8], [34], [42], [43], [75], [76], [77], [78] , [27], [44], [45], [46], [79], [80], [81], [82] , [61], [83], [84], [85], [86], [87], [88], [89] , [47], [90], [91], [92], [93], [94], [95], [96] , [97], [98], [99], [1…”
“Instead humans focus attention selectively on parts of the visual space to acquire information when and where it is needed, and combine information from different fixations over time to build up an internal representation of the scene <cit.>, guiding future eye movements and decision making.”
“In computer vision, {the} attention mechanism can be regarded as a dynamic weight recalibration process based on the input features.”
The newer paper generalizes hard attention's REINFORCE-based glimpse selection and adds a differentiable soft-attention variant for encoder-decoder captioning, building directly on the earlier mechanism.— the tool’s reading
“, 2014) and object recognition (Ba et al., 2014; Mnih et al., 2014), we investigate models that can attend to salient part of an image while generating its caption.”
“…by recent advances in caption generation and inspired by recent success in employing attention in machine translation (Bahdanau et al., 2014) and object recognition (Ba et al., 2014; Mnih et al., 2014), we investigate models that can attend to salient part of an image while generating its caption.”
“As pointed out and used in Ba et al. (2014) and Mnih et al. (2014), this is formulation is equivalent to the REINFORCE learning rule (Williams, 1992), where the reward for the attention choosing a sequence of actions is a real value proportional to the log likelihood of the target sentence under…”
“Instead humans focus attention selectively on parts of the visual space to acquire information when and where it is needed, and combine information from different fixations over time to build up an internal representation of the scene <cit.>, guiding future eye movements and decision making.”
“Rather than compress an entire image into a static representation, attention allows for salient features to dynamically come to the forefront as needed.”
The newer paper explicitly contrasts its differentiable, gate-based attention with the earlier hard, RL-trained glimpse attention, framing it as easier to train instead.— the tool’s reading
“Hard attention [21], e.g. iterative region proposal and cropping, is often non-differentiable and relies on reinforcement learning for parameter updates, which makes model training more difficult.”
“Lastly, we would like to note that AG parameters can be trained with the standard back-propagation updates without a need for sampling based update methods used in hard-attention [21].”
“Instead humans focus attention selectively on parts of the visual space to acquire information when and where it is needed, and combine information from different fixations over time to build up an internal representation of the scene <cit.>, guiding future eye movements and decision making.”
“Attention coefficients, α_i ∈ [0,1], identify salient image regions and prune feature responses to preserve only the activations relevant to the specific task as shown in Figure <ref>.”
DRAW replaces RAM's REINFORCE-trained discrete glimpse policy with a fully differentiable Gaussian-filter attention, explicitly built as an improved variant termed 'Differentiable RAM'.— the tool’s reading
“The network is similar to the recently introduced Recurrent Attention Model (RAM) (Mnih et al., 2014), except that our attention method is differentiable; we therefore refer to it as “Differ-entiable RAM”.”
“…structure can be better captured by a sequence of partial glimpses, or foveations, than by a single sweep through the entire image (Larochelle & Hinton, 2010; Denil et al., 2012; Tang et al., 2013; Ranzato, 2014; Zheng et al., 2014; Mnih et al., 2014; Ba et al., 2014; Ser-manet et al., 2014).”
“To test the classification efficacy of the DRAW attention mechanism (as opposed to its ability to aid in image generation), we evaluate its performance on the 100 × 100 clut-tered translated MNIST task (Mnih et al., 2014).”
“Instead humans focus attention selectively on parts of the visual space to acquire information when and where it is needed, and combine information from different fixations over time to build up an internal representation of the scene <cit.>, guiding future eye movements and decision making.”
“Unlike the aforementioned works, we consider an explicitly two-dimensional form of attention, where an array of 2D Gaussian filters is applied to the image, yielding an image `patch' of smoothly varying location and zoom.”
The discrete, RL-based glimpse selection for vision is carried into sequence generation as a differentiable soft alignment mechanism, shifting domain and modality.— the tool’s reading
“Instead humans focus attention selectively on parts of the visual space to acquire information when and where it is needed, and combine information from different fixations over time to build up an internal representation of the scene <cit.>, guiding future eye movements and decision making.”
“An attention-based recurrent sequence generator (ARSG) is a recurrent neural network that stochastically generates an output sequence (y_1, …, y_T) from an input x.”
The newer paper carries the attention concept from recurrent visual glimpse selection into a differentiable, query-based weighting mechanism for document reading, a new modality and formulation.— the tool’s reading
“These models draw on recent developments for incorporating attention mechanisms into recurrent neural network architectures [6, 7, 8].”
“The fixed width hidden vector forms a bottleneck for this information flow that we propose to circumvent using an attention mechanism inspired by recent results in translation and image recognition [6, 7].”
“Instead humans focus attention selectively on parts of the visual space to acquire information when and where it is needed, and combine information from different fixations over time to build up an internal representation of the scene <cit.>, guiding future eye movements and decision making.”
“The representation r of the document d is formed by a weighted sum of these output vectors. These weights are interpreted as the degree to which the network attends to a particular token in the document when answering the query”
The newer paper reframes sequential glimpse-based attention as static spatial activation/gradient maps for CNN knowledge transfer, carrying the concept into a different mechanism and application.— the tool’s reading
“It was also exploited in computer-vision-related tasks such as image captioning Xu et al. (2015), visual question answering Yang et al. (2015), as well as in weakly-supervised object localization Oquab et al. (2015) and classification Mnih et al. (2014), to mention a few characteristic examples.”
“Instead humans focus attention selectively on parts of the visual space to acquire information when and where it is needed, and combine information from different fixations over time to build up an internal representation of the scene <cit.>, guiding future eye movements and decision making.”
“To that end, here we consider attention as a set of spatial maps that essentially try to encode on which spatial areas of the input the network focuses most for taking its output decision (e.g., for classifying an image), where, furthermore, these maps can be defined w.r.t. various layers of the network so that they are able to capture both low-, mid-, and h…”
The newer paper carries the general attention concept from sequential spatial glimpse selection into a channel-wise feature recalibration mechanism within CNNs, a different modality/domain.— the tool’s reading
“Attention can be viewed, broadly, as a tool to bias the allocation of available processing resources towards the most informative components of an input signal [17, 18, 22, 29, 32].”
“Instead humans focus attention selectively on parts of the visual space to acquire information when and where it is needed, and combine information from different fixations over time to build up an internal representation of the scene <cit.>, guiding future eye movements and decision making.”
“Attention can be interpreted as a means of biasing the allocation of available computational resources towards the most informative components of a signal <cit.>.”
The discrete, RL-based glimpse attention for visual control is carried into a new modality/domain (NMT) and reformulated as a differentiable softmax-weighted alignment mechanism.— the tool’s reading
“…allowing models to learn alignments between different modalities, e.g., between image objects and agent actions in the dynamic control problem (Mnih et al., 2014), between speech frames and text in the speech recognition task (Chorowski et al., 2014), or between visual features of a picture…”
“, between image objects and agent actions in the dynamic control problem (Mnih et al., 2014), between speech frames and text in the speech recognition task (Chorowski et al.”
“Instead humans focus attention selectively on parts of the visual space to acquire information when and where it is needed, and combine information from different fixations over time to build up an internal representation of the scene <cit.>, guiding future eye movements and decision making.”
“The idea of a global attentional model is to consider all the hidden states of the encoder when deriving the context vector c_t.”
The newer paper implements the earlier proposed future direction of dynamic image-caption alignment as a concrete soft/hard attention mechanism over encoder features.— the tool’s reading
“This work was later followed by Kiros et al. (2014b) whose method was designed to explicitly allow a natural way of doing both ranking and generation.”
“Unlike Kiros et al. (2014a) and Mao et al. (2014) whose models see the image at each time step of the output word sequence, Vinyals et al. (2014) only show the image to the RNN at the beginning.”
“The first approach to use neural networks for caption generation was Kiros et al. (2014a), who proposed a multimodal log-bilinear model that was biased by features from the image.”
“We are developing an attention-based model that jointly learns to align parts of captions to images and use these alignments to determine where to attend next, thus dynamically modifying the vectors used for conditioning the decoder.”
“Rather than compress an entire image into a static representation, attention allows for salient features to dynamically come to the forefront as needed.”
The co-attention alignment idea for captioning is carried into the image-text matching field as cross-modal attention layers in vision-language models.— the tool’s reading
“We are developing an attention-based model that jointly learns to align parts of captions to images and use these alignments to determine where to attend next, thus dynamically modifying the vectors used for conditioning the decoder.”
“Recently more advanced models emerge with cross-modal attention layers <cit.> and show superior performance in image-text matching tasks. However, they are orders of magnitudes slower and hence impractical for image-text retrieval systems in the real world.”
The newer paper generalizes soft alignment attention into intra- and inter-sequence memory addressing, broadening its scope beyond encoder-decoder alignment.— the tool’s reading
“A similar issue in machine translation inspired <cit.> to instead utilize an attention-based contextual encoder that constructs a representation based on the generation context.”
“This enables adaptive memory usage during recurrence with neural attention, offering a way to weakly induce relations among tokens.”
Self-attention generalizes soft alignment from cross-sequence encoder-decoder attention to a unified query-key-value mechanism applicable within and across sequences.','citation itself is only a dataset reference— the tool’s reading
“We use the non-anonymized version of the CNN/DailyMail dataset [37] and Gigaword [36] for model fine-tuning and evaluation.”
“A similar issue in machine translation inspired <cit.> to instead utilize an attention-based contextual encoder that constructs a representation based on the generation context.”
“In each Transformer block, multiple self-attention heads are used to aggregate the output vectors of the previous layer.”
The newer paper generalizes soft alignment into a multi-layer convolutional attention mechanism with per-layer context vectors, building directly on the earlier encoder-decoder alignment idea.— the tool’s reading
“We also evaluate on a Gigaword test set of 2000 pairs which is identical to the one used by Rush et al. (2015) and we report F1 ROUGE similar to prior work.”
“We train on the Gigaword corpus (Graff et al., 2003) and pre-process it identically to Rush et al. (2015) resulting in 3.8M training examples and 190K for validation.”
“Sequence to sequence learning has been successful in many tasks such as machine translation, speech recognition (Sutskever et al., 2014; Chorowski et al., 2015) and text summarization (Rush et al., 2015; Nallapati et al., 2016; Shen et al., 2016) amongst others.”
“A similar issue in machine translation inspired <cit.> to instead utilize an attention-based contextual encoder that constructs a representation based on the generation context.”
“We introduce a separate attention mechanism for each decoder layer.”
The newer paper carries the attention alignment concept from single-modality sequence generation into a multimodal Transformer setting with separate video/audio attention heads.— the tool’s reading
“A number of papers have adopted this approach for speech recognition [10], [11]: for”
“An attention-based recurrent sequence generator (ARSG) is a recurrent neural network that stochastically generates an output sequence (y_1, …, y_T) from an input x.”
“the architecture incorporates a novel dual attention mechanism that can operate over visual input only, audio input only, or both.”
The newer paper reuses the same weighted-context-vector attention concept but generalizes it to a multi-layer convolutional decoder with per-layer attention modules.— the tool’s reading
“Sequence to sequence learning has been successful in many tasks such as machine translation, speech recognition (Sutskever et al., 2014; Chorowski et al., 2015) and text summarization (Rush et al.”
“Sequence to sequence learning has been successful in many tasks such as machine translation, speech recognition (Sutskever et al., 2014; Chorowski et al., 2015) and text summarization (Rush et al., 2015; Nallapati et al., 2016; Shen et al., 2016) amongst others.”
“An attention-based recurrent sequence generator (ARSG) is a recurrent neural network that stochastically generates an output sequence (y_1, …, y_T) from an input x.”
“We introduce a separate attention mechanism for each decoder layer.”
The newer paper borrows the attention terminology from sequence-to-sequence models and applies it to object detection's RPN mechanism, a new modality/domain.— the tool’s reading
“terminology of neural networks with ‘attention’ [31] mechanisms, the RPN module tells the Fast R-CNNmodule where to look.”
“An attention-based recurrent sequence generator (ARSG) is a recurrent neural network that stochastically generates an output sequence (y_1, …, y_T) from an input x.”
“We further merge RPN and Fast R-CNN into a single network by sharing their convolutional features—using the recently popular terminology of neural networks with “attention” mechanisms, the RPN component tells the unified network where to look.”
The newer survey generalizes the earlier Gaussian-filter read/write attention into a broader family of adaptive feature-recalibration mechanisms across many vision tasks, building on it as a pioneering RNN-based approach.— the tool’s reading
“RAM pioneered the use of RNNs for visual attention, and was followed by many other RNN-based methods [21], [35], [88].”
“Later, various works [21], [35] adopted a similar strategy for attention in”
“image classification [5], [6], object detection [7], [8], semantic segmentation [9], [10], face recognition [11], [12], person re-identification [13], [14], action recognition [15], [16], few-show learning [17], [18], medical image processing [19], [20], image generation [21], [22], pose estimation [23], super resolution [24], [25], 3D vision [26], [27], and…”
“Unlike the aforementioned works, we consider an explicitly two-dimensional form of attention, where an array of 2D Gaussian filters is applied to the image, yielding an image `patch' of smoothly varying location and zoom.”
“In computer vision, {the} attention mechanism can be regarded as a dynamic weight recalibration process based on the input features.”
Both use dynamic attention to capture dependencies across spatial locations, but the newer replaces Gaussian-filter foveation with a generalized query-key-value softmax mechanism.— the tool’s reading
“Recently, attention mechanisms have become an integral part of models that must capture global dependencies [2, 34, 36, 6].”
“Unlike the aforementioned works, we consider an explicitly two-dimensional form of attention, where an array of 2D Gaussian filters is applied to the image, yielding an image `patch' of smoothly varying location and zoom.”
“The self-attention module calculates response at a position as a weighted sum of the features at all positions, where the weights – or attention vectors – are calculated with only a small computational cost.”
Both implement dynamic, differentiable spatial attention over images, but the newer paper generalizes Gaussian-filter foveation into flexible weighted attention over encoder feature vectors for captioning.— the tool’s reading
“Unlike the aforementioned works, we consider an explicitly two-dimensional form of attention, where an array of 2D Gaussian filters is applied to the image, yielding an image `patch' of smoothly varying location and zoom.”
“Rather than compress an entire image into a static representation, attention allows for salient features to dynamically come to the forefront as needed.”
The Gaussian-filter visual attention is carried into the text/QA domain as query-based softmax weighting over document tokens, a new modality rather than a direct extension or dispute.— the tool’s reading
“These models draw on recent developments for incorporating attention mechanisms into recurrent neural network architectures [6, 7, 8].”
“Unlike the aforementioned works, we consider an explicitly two-dimensional form of attention, where an array of 2D Gaussian filters is applied to the image, yielding an image `patch' of smoothly varying location and zoom.”
“The representation r of the document d is formed by a weighted sum of these output vectors. These weights are interpreted as the degree to which the network attends to a particular token in the document when answering the query”
The softmax context-vector attention adapts the earlier Gaussian-filter selective attention idea from image generation into the new domain of neural machine translation.— the tool’s reading
“It is important to note that pt is a real nummber; whereas s is an integer within the window centered at pt.10 Comparison to (Gregor et al., 2015) – have proposed a selective attention mechanism, very similar to our local attention, for the image generation task.”
“…log p (yj|y<j , s) (1) A natural choice to model such a decomposition in the decoder is to use a recurrent neural network (RNN) architecture, which most of the re- 2There is a recent work by Gregor et al. (2015), which is very similar to our local attention and applied to the image generation task.”
“Comparison to (Gregor et al., 2015) – have proposed a selective attention mechanism, very similar to our local attention, for the image generation task.”
“Unlike the aforementioned works, we consider an explicitly two-dimensional form of attention, where an array of 2D Gaussian filters is applied to the image, yielding an image `patch' of smoothly varying location and zoom.”
“The idea of a global attentional model is to consider all the hidden states of the encoder when deriving the context vector c_t.”
The newer paper carries the attention mechanism from machine translation into a different task and modality, dependency parsing, using biaffine scoring instead of source-context weighting.— the tool’s reading
“The idea of a global attentional model is to consider all the hidden states of the encoder when deriving the context vector c_t.”
“In <cit.>'s <cit.> model, the (bidirectional) LSTM's recurrent output vector for each word is concatenated with each possible head's recurrent vector, and the result is used as input to an MLP that scores each resulting arc.”
The attention mechanism is carried from sequence-to-sequence translation into a QA memory network, adapted as a gate over facts rather than source words.— the tool’s reading
“Attention mechanisms have been successful components in both machine translation (Bahdanau et al., 2015; Luong module and memory module, to improve question answering.”
“They can benefit image classification (Stollenga et al., 2014), generating captions for images (Xu et al., 2015), among others mentioned below, and machine translation (Cho et al., 2014; Bahdanau et al., 2015; Luong et al., 2015).”
“The idea of a global attentional model is to consider all the hidden states of the encoder when deriving the context vector c_t.”
“We implement this attention by associating a single scalar value, the attention gate g^t_i, with each fact f_i during pass t.”
Transformer self-attention generalizes softmax-weighted context vector attention into a query-key-value formulation applied within sequences, adding relative position encodings.— the tool’s reading
“The idea of a global attentional model is to consider all the hidden states of the encoder when deriving the context vector c_t.”
“Each attention head operates on an input sequence, x = (x_1, …, x_n) of n elements where x_i ∈ℝ^d_x, and computes a new sequence z = (z_1, …, z_n) of the same length where z_i ∈ℝ^d_z.”
Both describe the same softmax-normalized weighted-sum alignment mechanism over encoder states, with newer paper reframing it as a generic soft attention alignment function without altering the core computation.— the tool’s reading
“…alignment model [31], or by using the attention mechanism to copy rare words [37], these approaches are both unreliable at scale, since the quality of the alignments varies across languages, and the latent alignments produced by the attention mechanism are unstable when the network is deep.”
“The idea of a global attentional model is to consider all the hidden states of the encoder when deriving the context vector c_t.”
“Our attention module is similar to <cit.>. More specifically, let 𝐲_i-1 be the decoder-RNN output from the past decoding time step (in our implementation, we use the output from the bottom decoder layer). Attention context 𝐚_i for the current time step is computed according to the following formulas:”
Transformer generalizes softmax-weighted context vector attention into an abstract query-key-value framework, adding self-attention and multi-head variants beyond the original NMT mechanism.— the tool’s reading
“Numerous efforts have since continued to push the boundaries of recurrent language models and encoder-decoder architectures [38, 24, 15].”
“The idea of a global attentional model is to consider all the hidden states of the encoder when deriving the context vector c_t.”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
The softmax-weighted attention mechanism from sequence-based NMT is carried into a new modality—CNN feature maps for spatial/pixel-wise gating in image processing.— the tool’s reading
“Although this is computationally more expensive, it has experimentally shown to achieve higher accuracy than multiplicative attention [19].”
“The idea of a global attentional model is to consider all the hidden states of the encoder when deriving the context vector c_t.”
“Attention coefficients, α_i ∈ [0,1], identify salient image regions and prune feature responses to preserve only the activations relevant to the specific task as shown in Figure <ref>.”
Self-attention generalizes the earlier encoder-decoder attention mechanism to a scaled dot-product query-key-value form applied globally within a single sequence.— the tool’s reading
“In this work, we consider attention-based neural machine translation (NMT) models Bahdanau et al. (2015); Luong et al. (2015), which have demonstrated excellent translation quality Wu et al. (2016), as the core models of our data augmentation pipeline.”
“The idea of a global attentional model is to consider all the hidden states of the encoder when deriving the context vector c_t.”
“For the self-attention-layer, we adopt the multi-head attention mechanism defined in <cit.> which, for each position in the input, called the query, computes a weighted sum of all positions, or keys, in the input based on the similarity between the query and key as measured by the dot product.”
The newer paper keeps the same context-vector attention mechanism but generalizes it to multi-layer, multi-hop convolutional decoders with per-layer attention modules.— the tool’s reading
“The dominant approach to date encodes the input sequence with a series of bi-directional recurrent neural networks (RNN) and generates a variable length output with another set of decoder RNNs, both of which interface via a soft-attention mechanism (Bahdanau et al., 2014; Luong et al., 2015).”
“On WMT’14 English to German translation we compare to the following prior work: Luong et al. (2015) is based on a four layer LSTM attention model, ByteNet (Kalchbrenner et al., 2016) propose a convolutional model based on characters without attention, with 30 layers in the encoder and 30 layers in…”
“, 2015) compared to single step attention (Bahdanau et al., 2014; Luong et al., 2015; Zhou et al., 2016; Wu et al., 2016).”
“The idea of a global attentional model is to consider all the hidden states of the encoder when deriving the context vector c_t.”
“We introduce a separate attention mechanism for each decoder layer.”
Self-attention generalizes the encoder-decoder alignment mechanism into token-token query-key-value interactions, building on the original soft-alignment concept.— the tool’s reading
“Attention models can be traced back to the machine translation models of (Bahdanau et al., 2014) and (Luong et al., 2015), where attention is employed to learn soft word alignments between language pairs.”
“The idea of a global attentional model is to consider all the hidden states of the encoder when deriving the context vector c_t.”
“The fundamental role of dot product self-attention is to learn self-alignment, i.e., to determine the relative importance of a single token with respect to all other tokens in the sequence.”
The newer paper generalizes softmax attention over memory into a broader alignment framework, adding location-based and hybrid mechanisms akin to the cited hop-based hybrid attention.— the tool’s reading
“[18] describes a similar hybrid attention mechanism, where location embeddings are used as input to the attention model.”
“Recently there has been a resurgence in models of computation using explicit storage and a notion of attention <cit.>; manipulating such a storage offers an approach to both of these challenges.”
“An attention-based recurrent sequence generator (ARSG) is a recurrent neural network that stochastically generates an output sequence (y_1, …, y_T) from an input x.”
The newer paper applies the same softmax-weighted attention mechanism to a single-step query-document scoring task, restricting the multi-hop memory reasoning to one focused application domain.— the tool’s reading
“Recently there has been a resurgence in models of computation using explicit storage and a notion of attention <cit.>; manipulating such a storage offers an approach to both of these challenges.”
“The representation r of the document d is formed by a weighted sum of these output vectors. These weights are interpreted as the degree to which the network attends to a particular token in the document when answering the query”
The RPN's region-proposal attention is repurposed as visual input to a Transformer self-attention model, carrying attention-like mechanisms into multimodal vision-language processing.— the tool’s reading
“VisualBERT integrates BERT (Devlin et al., 2019), a recent Transformer-based model (Vaswani et al., 2017) for natural language processing, and pre-trained object proposals systems such as Faster-RCNN (Ren et al., 2015) and it can be applied to a variety of vision-and-language tasks.”
“We further merge RPN and Fast R-CNN into a single network by sharing their convolutional features—using the recently popular terminology of neural networks with “attention” mechanisms, the RPN component tells the unified network where to look.”
“VisualBERT consists of a stack of Transformer layers that implicitly align elements of an input text and regions in an associated input image with self-attention.”
The newer paper moves attention from RPN's region-proposal 'where to look' mechanism into Transformer self-attention over multimodal tokens, a different modeling paradigm and domain.— the tool’s reading
“As a general backbone network, TNT can also be applied with multi-scale vision models like Faster RCNN [29].”
“We further merge RPN and Fast R-CNN into a single network by sharing their convolutional features—using the recently popular terminology of neural networks with “attention” mechanisms, the RPN component tells the unified network where to look.”
“The scaled dot-product attention is applied on Q,K,V: Attention(Q,K,V) = softmax(QK^T/√(d_k))V.”
The newer paper shifts 'attention' from a computational RPN mechanism directing detection to human visual fixation behavior, applying the concept to a different domain (perceptual/cognitive modeling).— the tool’s reading
“Designing deep architectures for joint tasks is popular and effective, which has been used for several vision tasks [38]–[41].”
“All of the methods in [39]–[41] solve a common problem with”
“We further merge RPN and Fast R-CNN into a single network by sharing their convolutional features—using the recently popular terminology of neural networks with “attention” mechanisms, the RPN component tells the unified network where to look.”
“Specifically, the saliency value of the red flower in Figure <ref>(a) is higher than the yellow one, which is consistent with human perception (paying more attention to the objects with red bright colors <cit.>).”
The citation only uses Faster-RCNN as a detection benchmark, while the newer paper repurposes the informal 'attention' notion from region-proposal guidance to describe classifier focus in a different task (classification/localization).}— the tool’s reading
“However, the pre-training with CutMix improves the performance of both SSD and Faster-RCNN.”
“Transferring to Pascal VOC object detection: Two pop- ular detection models, SSD [23] and Faster RCNN [29], are considered.”
“Detection Image Captioning SSD [23] (mAP) Faster-RCNN [29] (mAP) NIC [42] (BLEU-1) NIC [42] (BLEU-4) ResNet-50 (Baseline) 23.68 76.7 (+0.0) 75.6 (+0.0) 61.4 (+0.0) 22.9 (+0.0) Mixup-trained 22.58 76.6 (-0.1) 73.9 (-1.7) 61.6 (+0.2) 23.2 (+0.3) Cutout-trained 22.93 76.8 (+0.1) 75.0 (-0.6) 63.0 (+1.6) 24.0 (+1.1) CutMix-trained 21.40 77.6 (+0.9) 76.7 (+1.1) 64…”
“We further merge RPN and Fast R-CNN into a single network by sharing their convolutional features—using the recently popular terminology of neural networks with “attention” mechanisms, the RPN component tells the unified network where to look.”
“They have proved to be effective for guiding the model to attend on less discriminative parts of objects ( leg as opposed to head of a person), thereby letting the network generalize better and have better object localization capabilities.”
The newer paper reframes 'attention' from a learned RPN mechanism into an analogy with classical human visual saliency/fixation, shifting the concept into a different domain.— the tool’s reading
“Indeed, there has been some very recent work in this space [60], [61], [62] that shows promising”
“We further merge RPN and Fast R-CNN into a single network by sharing their convolutional features—using the recently popular terminology of neural networks with “attention” mechanisms, the RPN component tells the unified network where to look.”
“Interest points allow for focusing attention to the most salient and distinctive locations in an image, greatly reducing computation for subsequent tasks such as classification, retrieval, matching, and detection.”
The newer paper shifts 'attention' from a neural network region-proposal mechanism to modeling human visual fixation, applying the concept in a different domain.— the tool’s reading
“We further merge RPN and Fast R-CNN into a single network by sharing their convolutional features—using the recently popular terminology of neural networks with “attention” mechanisms, the RPN component tells the unified network where to look.”
“Saliency detection has been extensively studied in computer vision, and saliency models in general can be categorized into visual attention prediction or salient object detection. The former methods <cit.> try to predict scene locations where a human observer may fixate.”
The attention idea moves from RPN's region-proposal guidance in object detection into generic feature-recalibration blocks embedded throughout CNN architectures for broader representation learning.— the tool’s reading
“We further merge RPN and Fast R-CNN into a single network by sharing their convolutional features—using the recently popular terminology of neural networks with “attention” mechanisms, the RPN component tells the unified network where to look.”
“Designing of new blocks is one of the growing areas of research in CNN, where generic blocks are used to assign attention to spatial and feature-map (channel) information (Wang et al. 2017a; Roy et al. 2018; Woo et al. 2018).”
SE-Net shifts attention from spatial region-proposal guidance in Faster R-CNN to channel-wise feature recalibration, applying the concept in a new representational domain.— the tool’s reading
“We use Faster R-CNN [33] as the detection method and follow the basic implementation in [10].”
“Convolutional neural networks (CNNs) have proven to be effective models for tackling a variety of visual tasks [21, 27, 33, 45].”
“We further merge RPN and Fast R-CNN into a single network by sharing their convolutional features—using the recently popular terminology of neural networks with “attention” mechanisms, the RPN component tells the unified network where to look.”
“Attention can be interpreted as a means of biasing the allocation of available computational resources towards the most informative components of a signal <cit.>.”
Deformable attention restricts full self-attention to sparse learned sampling points, analogous conceptually to RPN's region proposal focusing, though citation context is mainly about efficiency comparison rather than direct conceptual descent.— the tool’s reading
“For example, on the COCO (Lin et al., 2014) benchmark, DETR needs 500 epochs to converge, which is around 10 to 20 times slower than Faster R-CNN (Ren et al., 2015).”
“, 2014) benchmark, DETR needs 500 epochs to converge, which is around 10 to 20 times slower than Faster R-CNN (Ren et al., 2015).”
“Our proposed Deformable DETR has on par FLOPs with Faster R-CNN + FPN and DETR-DC5.”
“We further merge RPN and Fast R-CNN into a single network by sharing their convolutional features—using the recently popular terminology of neural networks with “attention” mechanisms, the RPN component tells the unified network where to look.”
“Given a query element (e.g., a target word in the output sentence) and a set of key elements (e.g., source words in the input sentence), the multi-head attention module adaptively aggregates the key contents according to the attention weights that measure the compatibility of query-key pairs.”
The newer paper applies the same softmax-weighted context vector idea to speaker embeddings, adding weighted standard deviations beyond just weighted means for pooling.— the tool’s reading
“Attention mechanisms allow for a more direct dependence between the state of the model at different points in time. Following the definition from <cit.>, given a model which produces a hidden state h_t at each time step, attention-based models compute a “context” vector c_t as the weighted mean of the state sequence h by”
“An attention model works in conjunction with the original DNN and calculates a scalar score e_t for each frame-level feature”
The newer paper carries the feed-forward attention/context-vector idea into a new domain (multiple instance learning with independent instances) rather than sequential data.— the tool’s reading
“Interestingly, the proposed MIL pooling corresponds to a version of the attention mechanism (Lin et al., 2017; Raffel & Ellis, 2015).”
“The two-layered neural network corre-1 According to the European Union General Data Protection Regulation (taking effect 2018), a user should have the right to obtain an explanation of the decision reached. sponds to the attention mechanism (Bahdanau et al., 2014; Raffel & Ellis, 2015).”
“Attention mechanisms allow for a more direct dependence between the state of the model at different points in time. Following the definition from <cit.>, given a model which produces a hidden state h_t at each time step, attention-based models compute a “context” vector c_t as the weighted mean of the state sequence h by”
“Interestingly, the proposed MIL pooling corresponds to a version of the attention mechanism <cit.>. The main difference is that typically in the attention mechanism all instances are sequentially dependent while here we assume that all instances are independent.”
The newer paper critically examines whether attention weights meaningfully explain outputs, directly challenging interpretability claims exemplified by the earlier soft-attention work.— the tool’s reading
“Indeed, claims that attention provides interpretability are common in the literature, e.g., (Xu et al., 2015; Choi et al., 2016; Lei et al., 2017; Martins and Astudillo, 2016; Xie et al., 2017).”
“Rather than compress an entire image into a static representation, attention allows for salient features to dynamically come to the forefront as needed.”
“Attention mechanisms <cit.> induce conditional distributions over input units to compose a weighted context vector for downstream modules.”
The newer paper builds on soft/hard spatial attention with a recurrent glimpse mechanism and further generalizes it to comparative attention over image triplets.— the tool’s reading
“3, introduced in [27], [19] and [21].”
“Recently, LSTMs have shown good performance in the domain of speech recognition [23] and image description [19].”
“…Networks (RNNs) based on Long Short-Term Memory (LSTM) [18], the attention based models have demonstrated outstanding performance on several challenging sequential data recognition and modeling tasks, including caption generation [19], machine translation [20], as well as action recognition [21].”
“Rather than compress an entire image into a static representation, attention allows for salient features to dynamically come to the forefront as needed.”
“Briefly, similar to human visual processing, attention-based algorithms tend to selectively concentrate on a part of the information, and at the same time ignore other perceived information. Such a mechanism is usually called attention and can be employed to adaptively localize discriminative parts or regions of person images.”
The newer paper generalizes soft attention's spatial weighting idea into a broader recalibration mechanism across channel, spatial, temporal, and branch dimensions in CNNs.— the tool’s reading
“Rather than compress an entire image into a static representation, attention allows for salient features to dynamically come to the forefront as needed.”
“In computer vision, {the} attention mechanism can be regarded as a dynamic weight recalibration process based on the input features.”
The soft attention mechanism from image captioning is carried into a new domain, skeleton-based action recognition, applying analogous weighting to joints and frames.— the tool’s reading
“has attracted increasing interest in various fields, such as machine translation (Bahdanau, Cho, and Bengio 2014), image caption generation (Xu et al. 2015), and image recognition (Ba, Mnih, and Kavukcuoglu 2014).”
“Rather than compress an entire image into a static representation, attention allows for salient features to dynamically come to the forefront as needed.”
“With a soft attention mechanism, each joint within a frame is assigned a spatial attention weight based on the joint-selection gates. This enables our model to adaptively focus more on those discriminative joints.”
Soft attention over image features is carried into a new domain—text-based question answering with GRU-based episodic memory using gated attention over facts.— the tool’s reading
“They can benefit image classification (Stollenga et al., 2014), generating captions for images (Xu et al., 2015), among others mentioned below, and machine translation (Cho et al., 2014; Bahdanau et al., 2015; Luong et al., 2015).”
“Shortly thereafter, recurrent neural networks were used to generate often novel sentences based on images (Karpathy & Fei-Fei, 2015; Chen & Zitnick, 2014; Fang et al., 2015; Xu et al., 2015).”
“Rather than compress an entire image into a static representation, attention allows for salient features to dynamically come to the forefront as needed.”
“We implement this attention by associating a single scalar value, the attention gate g^t_i, with each fact f_i during pass t.”
The newer paper generalizes soft attention into a learned query-key-value self-attention formulation for global dependency modeling, building on the earlier encoder-decoder attention idea.— the tool’s reading
“Recently, attention mechanisms have become an integral part of models that must capture global dependencies [2, 34, 36, 6].”
“Rather than compress an entire image into a static representation, attention allows for salient features to dynamically come to the forefront as needed.”
“The self-attention module calculates response at a position as a weighted sum of the features at all positions, where the weights – or attention vectors – are calculated with only a small computational cost.”
Softmax attention over image features is carried into memory-based reasoning over textual memory vectors with multi-hop application, a new domain/modality.— the tool’s reading
“Rather than compress an entire image into a static representation, attention allows for salient features to dynamically come to the forefront as needed.”
“Recently there has been a resurgence in models of computation using explicit storage and a notion of attention <cit.>; manipulating such a storage offers an approach to both of these challenges.”
The newer paper strips attention from recurrent, image-conditioned soft/hard mechanisms to a simplified feed-forward weighted-average context vector applicable without recurrence.— the tool’s reading
“…more direct access to the entire state sequence h. Attention-based RNNs have proven effective in a variety of sequence transduction tasks, including machine translation (Bahdanau et al., 2014), image captioning (Xu et al., 2015), and speech recognition (Chan et al., 2015; Bahdanau et al., 2015).”
“Very long sequences can also make training computationally inefficient due to the fact that RNNs must be evaluated sequentially and cannot be fully parallelized.”
“Rather than compress an entire image into a static representation, attention allows for salient features to dynamically come to the forefront as needed.”
“Attention mechanisms allow for a more direct dependence between the state of the model at different points in time. Following the definition from <cit.>, given a model which produces a hidden state h_t at each time step, attention-based models compute a “context” vector c_t as the weighted mean of the state sequence h by”
The newer paper generalizes soft attention into a hybrid content/location-based ARSG framework, adding convolutional alignment features beyond simple weighted averaging.— the tool’s reading
“Rather than compress an entire image into a static representation, attention allows for salient features to dynamically come to the forefront as needed.”
“An attention-based recurrent sequence generator (ARSG) is a recurrent neural network that stochastically generates an output sequence (y_1, …, y_T) from an input x.”
Soft attention for sequence decoding is carried into CNN architecture design as spatial/channel recalibration blocks, applying the idea to a new modality/task.— the tool’s reading
“Rather than compress an entire image into a static representation, attention allows for salient features to dynamically come to the forefront as needed.”
“Designing of new blocks is one of the growing areas of research in CNN, where generic blocks are used to assign attention to spatial and feature-map (channel) information (Wang et al. 2017a; Roy et al. 2018; Woo et al. 2018).”
The newer paper carries the attention concept from sequence-based image captioning into a new modality: internal CNN feature/gradient maps for knowledge transfer.— the tool’s reading
“It was also exploited in computer-vision-related tasks such as image captioning Xu et al. (2015), visual question answering Yang et al. (2015), as well as in weakly-supervised object localization Oquab et al. (2015) and classification Mnih et al. (2014), to mention a few characteristic examples.”
“Rather than compress an entire image into a static representation, attention allows for salient features to dynamically come to the forefront as needed.”
“To that end, here we consider attention as a set of spatial maps that essentially try to encode on which spatial areas of the input the network focuses most for taking its output decision (e.g., for classifying an image), where, furthermore, these maps can be defined w.r.t. various layers of the network so that they are able to capture both low-, mid-, and h…”
Attention shifts from spatial image-caption alignment to channel-wise feature recalibration within CNN architecture, applying the concept in a new modality/domain.— the tool’s reading
“Rather than compress an entire image into a static representation, attention allows for salient features to dynamically come to the forefront as needed.”
“Attention can be interpreted as a means of biasing the allocation of available computational resources towards the most informative components of a signal <cit.>.”
The newer paper adapts the image-captioning attention mechanism from Xu et al. into neural machine translation, applying it to source hidden states over text sequences instead of image regions.— the tool’s reading
“The latter can be viewed as an interesting blend between the hard and soft attention models proposed in (Xu et al., 2015): it is computationally less expensive than the global model or the soft attention; at the same time, unlike the hard attention, the local attention is differentiable, making it…”
“Xu et al. (2015) propose a doubly attentional approach with an additional constraint added to the training objective to make sure the model pays equal attention to all parts of the image during the caption generation process.”
“, 2014), or between visual features of a picture and its text description in the image caption generation task (Xu et al., 2015).”
“Rather than compress an entire image into a static representation, attention allows for salient features to dynamically come to the forefront as needed.”
“The idea of a global attentional model is to consider all the hidden states of the encoder when deriving the context vector c_t.”
The attention pooling mechanism is carried from image captioning/sequence generation into a new domain—multiple instance learning with permutation-invariant instance aggregation.— the tool’s reading
“The attention mechanism is widely used in deep learning for image captioning (Xu et al., 2015) or text analysis (Bahdanau et al., 2014; Lin et al., 2017).”
“MIL and attention The attention mechanism is widely used in deep learning for image captioning (Xu et al., 2015) or text analysis (Bahdanau et al.”
“Rather than compress an entire image into a static representation, attention allows for salient features to dynamically come to the forefront as needed.”
“Interestingly, the proposed MIL pooling corresponds to a version of the attention mechanism <cit.>. The main difference is that typically in the attention mechanism all instances are sequentially dependent while here we assume that all instances are independent.”
The newer paper generalizes the same softmax-weighted attention mechanism to broader input encodings and adds critical analysis of its interpretability as feature importance.— the tool’s reading
“For Question Answering (QA): CNN News Articles (Hermann et al., 2015).”
“For Question Answering (QA) : CNN News Articles (Hermann et al., 2015).”
“The representation r of the document d is formed by a weighted sum of these output vectors. These weights are interpreted as the degree to which the network attends to a particular token in the document when answering the query”
“Attention mechanisms <cit.> induce conditional distributions over input units to compose a weighted context vector for downstream modules.”
The newer paper generalizes softmax-weighted attention from query-document scoring to intra- and inter-sequence memory addressing, broadening its applicability beyond the original setup.— the tool’s reading
“The representation r of the document d is formed by a weighted sum of these output vectors. These weights are interpreted as the degree to which the network attends to a particular token in the document when answering the query”
“This enables adaptive memory usage during recurrence with neural attention, offering a way to weakly induce relations among tokens.”
Attention moves from text reading/query-document weighting to visual question answering, extended into joint image-question co-attention across modalities.— the tool’s reading
“In [8], the authors propose an attention model to circumvent the bottleneck caused by fixed width hidden vector in text reading and comprehension.”
“The representation r of the document d is formed by a weighted sum of these output vectors. These weights are interpreted as the degree to which the network attends to a particular token in the document when answering the query”
“So far, all attention models for VQA in literature have focused on the problem of identifying “where to look” or visual attention. In this paper, we argue that the problem of identifying “which words to listen to” or question attention is equally important.”
BiDAF generalizes the earlier query-weighted document attention into a bidirectional, multi-layer flow that avoids fixed-size summarization, building on the same core focus mechanism.— the tool’s reading
“We also evaluate our model on the task of cloze-style reading comprehension using the CNN and Daily Mail datasets (Hermann et al., 2015).”
“Massive cloze test datasets (CNN/DailyMail by Hermann et al. (2015) and Childrens Book Test by Hill et al. (2016)), enabled the application of deep neural architectures to this task.”
“Hermann et al. (2015) have recently compiled a massive Cloze-style comprehension dataset, consisting of 300k/4k/3k and 879k/65k/53k (train/dev/test) examples from CNN and DailyMail news articles, respectively.”
“The representation r of the document d is formed by a weighted sum of these output vectors. These weights are interpreted as the degree to which the network attends to a particular token in the document when answering the query”
“One of the key factors to the advancement has been the use of neural attention mechanism, which enables the system to focus on a targeted area within a context paragraph (for MC) or within an image (for Visual QA), that is most relevant to answer the question <cit.>.”
Self-attention generalizes query-based weighted attention into a query-key-value scaled dot-product mechanism applied globally across positions, broadening the original document-focused mechanism.'— the tool’s reading
“, 2017), CNN/Daily News (Hermann et al., 2015), WikiReading (Hewlett et al.”
“Their popularity can be attributed to an increase in publicly available annotated datasets, such as SQuAD (Rajpurkar et al., 2016), TriviaQA (Joshi et al., 2017), CNN/Daily News (Hermann et al., 2015), WikiReading (Hewlett et al., 2016), Children Book Test (Hill et al., 2015), etc.”
“The representation r of the document d is formed by a weighted sum of these output vectors. These weights are interpreted as the degree to which the network attends to a particular token in the document when answering the query”
“For the self-attention-layer, we adopt the multi-head attention mechanism defined in <cit.> which, for each position in the input, called the query, computes a weighted sum of all positions, or keys, in the input based on the similarity between the query and key as measured by the dot product.”
Self-attention generalizes query-based weighted document attention into a broader, multi-head mechanism applicable to any sequence, though citation context only concerns dataset use, not attention itself.— the tool’s reading
“The CNN/Daily Mail [Hermann et al., 2015] dataset was introduced as a question-answering task but was adapted for text summarization by Nallapati et al.”
“Furthermore, while CNN/Daily Mail is posed as an abstractive summarization benchmark, purely extractive approaches have been shown to work well [Liu, 2019].”
“For CNN/Daily Mail, we use the standard test set distributed with the dataset.”
“The representation r of the document d is formed by a weighted sum of these output vectors. These weights are interpreted as the degree to which the network attends to a particular token in the document when answering the query”
“Self-attention is a variant of attention <cit.> that processes a sequence by replacing each element by a weighted average of the rest of the sequence.”
The newer paper generalizes query-based document attention into encoder-decoder soft alignment, adding intra-temporal and intra-decoder attention mechanisms building on the earlier weighted-sum idea.— the tool’s reading
“Nallapati et al. (2016) also applied their abstrac-tive summarization model on the CNN/Daily Mail dataset (Hermann et al., 2015), which contains input sequences of up to 800 tokens and multi-sentence summaries of up to 100 tokens.”
“Neural encoder-decoder models are widely used in NLP applications such as machine translation (Sutskever et al., 2014), summarization (Chopra et al., 2016; Nallapati et al., 2016), and question answering (Hermann et al., 2015).”
“We evaluate our model on a modified version of the CNN/Daily Mail dataset (Hermann et al., 2015), following the same pre-processing steps described in Nallapati et al. (2016).”
“The representation r of the document d is formed by a weighted sum of these output vectors. These weights are interpreted as the degree to which the network attends to a particular token in the document when answering the query”
“At each decoding step t, we use an intra-temporal attention function to attend over specific parts of the encoded input sequence in addition to the decoder's own hidden state and the previously-generated word <cit.>.”
The newer paper carries the attention/saliency notion from human visual fixation into neural network object detection, reframing RPN proposals as an attention mechanism guiding detection.— the tool’s reading
“In the following, we train Fast R-CNN using 2k RPN proposals, but evaluate different numbers of proposals at test-time.”
“Interest points allow for focusing attention to the most salient and distinctive locations in an image, greatly reducing computation for subsequent tasks such as classification, retrieval, matching, and detection.”
“We further merge RPN and Fast R-CNN into a single network by sharing their convolutional features—using the recently popular terminology of neural networks with “attention” mechanisms, the RPN component tells the unified network where to look.”
The newer survey generalizes the earlier LSTM-based joint/frame attention into a broader recalibration framework covering channel, spatial, temporal, and branch dimensions across CNN architectures.— the tool’s reading
“[130], [132], [133], [134], [135], [136], [137], [138], [139]”
“In human action recognition, each type of action generally only depends on a few specific kinematic joints [130].”
“[130] proposed a joint spatial and temporal attention network based on LSTM [147], to adaptively find discriminative features and keyframes.”
“With a soft attention mechanism, each joint within a frame is assigned a spatial attention weight based on the joint-selection gates. This enables our model to adaptively focus more on those discriminative joints.”
“In computer vision, {the} attention mechanism can be regarded as a dynamic weight recalibration process based on the input features.”
The newer paper reduces attention from a central, defined mechanism to a reused architectural component within downstream task models, not elaborating its own conception.— the tool’s reading
“Our baseline model (Clark and Gardner, 2017) is an improved version of the Bidirectional Attention Flow model in Seo et al. (BiDAF; 2017).”
“The token embeddings are passed through a shared bi-directional GRU, and then the bi-directional attention mechanism from BiDAF (Seo et al., 2017).”
“One of the key factors to the advancement has been the use of neural attention mechanism, which enables the system to focus on a targeted area within a context paragraph (for MC) or within an image (for Visual QA), that is most relevant to answer the question <cit.>.”
“For example, see the SNLI experiments in Sec. <ref> where a bi-attention layer follows the biLSTMs, or the coreference resolution experiments where a clustering model is layered on top of the biLSTMs.”
Transformer self-attention generalizes the query-key context weighting idea from BiDAF's context-to-query attention into a unified, multi-head, global similarity mechanism.— the tool’s reading
“Table 4: Speed comparison between our model and BiDAF (Seo et al., 2016) on SQuAD dataset.”
“We adopt the strategy of Seo et al. (2016) to predict the probability of each position in the context being the start or end of an answer span.”
“Most high performing models additionally use some form of query-to-context attention, such as BiDaF (Seo et al., 2016) and DCN (Xiong et al.”
“One of the key factors to the advancement has been the use of neural attention mechanism, which enables the system to focus on a targeted area within a context paragraph (for MC) or within an image (for Visual QA), that is most relevant to answer the question <cit.>.”
“For the self-attention-layer, we adopt the multi-head attention mechanism defined in <cit.> which, for each position in the input, called the query, computes a weighted sum of all positions, or keys, in the input based on the similarity between the query and key as measured by the dot product.”
The newer paper adopts attention-based dependency parsing merely as an evaluation tool while migrating attention mechanisms into multimodal Transformer self-attention over text and image tokens.— the tool’s reading
“To evaluate such syntactic sensitivity in VisualBERT, we first parse all sentences in Flickr30K us-ing AllenNLP’s dependency parser (Dozat & Manning, 2017; Gardner et al., 2018).”
“In <cit.>'s <cit.> model, the (bidirectional) LSTM's recurrent output vector for each word is concatenated with each possible head's recurrent vector, and the result is used as input to an MLP that scores each resulting arc.”
“VisualBERT consists of a stack of Transformer layers that implicitly align elements of an input text and regions in an associated input image with self-attention.”
Both use gated/softmax attention over stored representations to selectively combine information, but the newer paper generalizes it into intra/inter-sequence attention for relation induction.— the tool’s reading
“(2016) employ a structured neural network with episodic memory modules for natural language and also visual question answering (Xiong et al., 2016).”
“We implement this attention by associating a single scalar value, the attention gate g^t_i, with each fact f_i during pass t.”
“This enables adaptive memory usage during recurrence with neural attention, offering a way to weakly induce relations among tokens.”
The newer paper builds on attention-gate mechanisms by generalizing to symmetric co-attention over both image and question, extending applicability beyond single-modality attention gating.— the tool’s reading
“We can see that image-attention-alone does improve performance over the holistic image feature (deeper LSTM Q + norm I), which is consistent with findings of previous attention models for VQA [21, 23].”
“[21] augments dynamic memory network with a new input fusion module and retrieves an answer from an attention based GRU.”
“For open-ended test scenario, we compare our method with the recent proposed SMem [22], SAN [23], FDA [10] and DMN+ [21].”
“We implement this attention by associating a single scalar value, the attention gate g^t_i, with each fact f_i during pass t.”
“So far, all attention models for VQA in literature have focused on the problem of identifying “where to look” or visual attention. In this paper, we argue that the problem of identifying “which words to listen to” or question attention is equally important.”
BiDAF explicitly rejects temporally dynamic, summarized attention (like the earlier attention-GRU) in favor of unsummarized, non-temporally-coupled context-to-query attention passed to later layers.— the tool’s reading
“At the coarse level of granularity, the question attends to different patches in the image (Zhu et al., 2016; Xiong et al., 2016a).”
“…the advancement has been the use of neural attention mechanism, which enables the system to focus on a targeted area within a context paragraph (for MC) or within an image (for Visual QA), that is most relevant to answer the question (Weston et al., 2015; Antol et al., 2015; Xiong et al., 2016a).”
“Second, in the text domain, they are often temporally dynamic, whereby the attention weights at the current time step are a function of the attended vector at the previous time step.”
“We implement this attention by associating a single scalar value, the attention gate g^t_i, with each fact f_i during pass t.”
“One of the key factors to the advancement has been the use of neural attention mechanism, which enables the system to focus on a targeted area within a context paragraph (for MC) or within an image (for Visual QA), that is most relevant to answer the question <cit.>.”
Both use attention as a relevance-weighting mechanism over inputs, but the newer paper generalizes it into a softmax-scored query-key formulation applicable broadly, including pointer networks.— the tool’s reading
“…to increase capacity and minimize the impact of vanishing gradients, some language and translation mod-Pointer els have also added a soft attention or memory component (Bahdanau et al., 2015; Sukhbaatar et al., 2015; Cheng et al., 2016; Kumar et al., 2016; Xiong et al., 2016; Ahn et al., 2016).”
“We implement this attention by associating a single scalar value, the attention gate g^t_i, with each fact f_i during pass t.”
“Models with soft attention or memory components have been proposed to help deal with this challenge, aiming to allow for the retrieval and use of relevant previous hidden states, in effect increasing hidden state capacity and providing a path for gradients not tied to timesteps.”
Newer paper explicitly critiques the recurrent LSTM-based attention as computationally inefficient, replacing it with a simpler emergent CNN-activation attention for localization.— the tool’s reading
“Similarly, [Liu et al., 2016a] propose a soft attention-based model to focus on parts and combine CNN with LSTM components selectively; its limitation also consists of the computation inefficiency.”
“This setting uses a larger testing gallery and is different from the papers published earlier than [Zhong et al., 2017], such as [Liu et al., 2016a] and [Varior et al., 2016b].”
“Aside from us-ing STN, Liu et al. use reinforcement learning to detect parts and assemble a strong model for fine-grained recognition [Liu et al., 2016c].”
“Briefly, similar to human visual processing, attention-based algorithms tend to selectively concentrate on a part of the information, and at the same time ignore other perceived information. Such a mechanism is usually called attention and can be employed to adaptively localize discriminative parts or regions of person images.”
“The proposed network thus takes advantage of this attention mechanism to adaptively locate and align pedestrians within a bounding box.”
The newer paper generalizes the earlier recurrent glimpse-based spatial attention into a broader survey framework of adaptive feature recalibration across multiple dimensions.— the tool’s reading
“[8], [9], [15], [21], [31], [32], [34], [35] , [22], [26], [62], [63], [64], [65], [66], [67] , [41], [68], [69], [70], [71], [72], [73], [74] , [8], [34], [42], [43], [75], [76], [77], [78] , [27], [44], [45], [46], [79], [80], [81], [82] , [61], [83], [84], [85], [86], [87], [88], [89] , [47], [90], [91], [92], [93], [94], [95], [96] , [97], [98], [99], [1…”
“Briefly, similar to human visual processing, attention-based algorithms tend to selectively concentrate on a part of the information, and at the same time ignore other perceived information. Such a mechanism is usually called attention and can be employed to adaptively localize discriminative parts or regions of person images.”
“In computer vision, {the} attention mechanism can be regarded as a dynamic weight recalibration process based on the input features.”
The attention mechanism moves from encoder-decoder sequence alignment into a multimodal Transformer setting, applying self-attention to jointly ground text and image tokens.— the tool’s reading
“BERT (Devlin et al., 2019) is a Transformer (Vaswani et al., 2017) with subwords (Wu et al., 2016) as input and trained using language modeling objectives.”
“Our attention module is similar to <cit.>. More specifically, let 𝐲_i-1 be the decoder-RNN output from the past decoding time step (in our implementation, we use the output from the bottom decoder layer). Attention context 𝐚_i for the current time step is computed according to the following formulas:”
“VisualBERT consists of a stack of Transformer layers that implicitly align elements of an input text and regions in an associated input image with self-attention.”
Self-attention generalizes encoder-decoder attention by applying query-key scoring within a single sequence/set of tokens rather than across separate encoder-decoder states.— the tool’s reading
“Our attention module is similar to <cit.>. More specifically, let 𝐲_i-1 be the decoder-RNN output from the past decoding time step (in our implementation, we use the output from the bottom decoder layer). Attention context 𝐚_i for the current time step is computed according to the following formulas:”
“Whereas in self-attention the weights to aggregate information from other patches are data dependent through queries and keys, in ResMLPthe weights are not data dependent and only based on absolute positions of patches.”
Newer paper generalizes soft attention into self-attention with query-key-value formulation and adds relative position representations, building on the original alignment mechanism.— the tool’s reading
“Our attention module is similar to <cit.>. More specifically, let 𝐲_i-1 be the decoder-RNN output from the past decoding time step (in our implementation, we use the output from the bottom decoder layer). Attention context 𝐚_i for the current time step is computed according to the following formulas:”
“Each attention head operates on an input sequence, x = (x_1, …, x_n) of n elements where x_i ∈ℝ^d_x, and computes a new sequence z = (z_1, …, z_n) of the same length where z_i ∈ℝ^d_z.”
The newer paper builds on the softmax-weighted encoder-decoder attention by adopting self-attention and adding a dual-modality context mechanism for video and audio.— the tool’s reading
“Our attention module is similar to <cit.>. More specifically, let 𝐲_i-1 be the decoder-RNN output from the past decoding time step (in our implementation, we use the output from the bottom decoder layer). Attention context 𝐚_i for the current time step is computed according to the following formulas:”
“the architecture incorporates a novel dual attention mechanism that can operate over visual input only, audio input only, or both.”
Self-attention generalizes the encoder-decoder alignment mechanism into QKV projections with masking, extending soft attention's core scoring-weighting idea to a broader architecture.— the tool’s reading
“In a cloze task, we mask some percentage of input to-kens at random, and predict only those masked tokens using U NI LM. Specifically, we randomly choose some WordPiece tokens in the input, and replace them with special token [MASK] .”
“We used documents of English Wikipedia 2 and BookCorpus (Zhu et al., 2015) for the pre-training data, following the preprocess and the WordPiece tokenization of Devlin et al. (2018).”
“Texts are tokenized to subword units by WordPiece (Wu et al., 2016).”
“Our attention module is similar to <cit.>. More specifically, let 𝐲_i-1 be the decoder-RNN output from the past decoding time step (in our implementation, we use the output from the bottom decoder layer). Attention context 𝐚_i for the current time step is computed according to the following formulas:”
“In each Transformer block, multiple self-attention heads are used to aggregate the output vectors of the previous layer.”
Self-attention generalizes encoder-decoder soft attention into intra-sequence query-key-value scoring, extending the alignment mechanism into the Transformer's core building block.— the tool’s reading
“We use documents of English Wikipedia 2 and BookCorpus (Zhu et al., 2015) for the pre-training data, following the preprocess and the WordPiece tokenization 2 Wikipedia version: enwiki-20181101. of Devlin et al. (2018).”
“Texts are tokenized to subword units by WordPiece (Wu et al., 2016) in BERT (Devlin et al., 2018).”
“The length penalty (Wu et al., 2016) is 1 .”
“Our attention module is similar to <cit.>. More specifically, let 𝐲_i-1 be the decoder-RNN output from the past decoding time step (in our implementation, we use the output from the bottom decoder layer). Attention context 𝐚_i for the current time step is computed according to the following formulas:”
“The attention mechanism <cit.> has been a highly successful neural network component for NLP tasks, which is also crucial for pre-trained LMs.”
Self-attention generalizes encoder-decoder attention into query-key-value dot-product form applied across all positions, extending the original alignment mechanism's scope and formulation.— the tool’s reading
“In this work, we consider attention-based neural machine translation (NMT) models Bahdanau et al. (2015); Luong et al. (2015), which have demonstrated excellent translation quality Wu et al. (2016), as the core models of our data augmentation pipeline.”
“Specifically, we utilize the publicly available codebase 3 provided by Luong et al. (2017), which replicates the Google’s NMT (GNMT) systems Wu et al. (2016).”
“Our attention module is similar to <cit.>. More specifically, let 𝐲_i-1 be the decoder-RNN output from the past decoding time step (in our implementation, we use the output from the bottom decoder layer). Attention context 𝐚_i for the current time step is computed according to the following formulas:”
“For the self-attention-layer, we adopt the multi-head attention mechanism defined in <cit.> which, for each position in the input, called the query, computes a weighted sum of all positions, or keys, in the input based on the similarity between the query and key as measured by the dot product.”
The newer paper generalizes the same context-vector attention mechanism to a multi-layer convolutional decoder with per-layer attention modules, building on the original alignment idea.— the tool’s reading
“…et al., 2016) propose a convolutional model based on characters without attention, with 30 layers in the encoder and 30 layers in the decoder, GNMT (Wu et al., 2016) represents the state of the art on this dataset and they use eight encoder LSTMs as well as eight decoder LSTMs, we quote their…”
“Models with many layers often rely on shortcut or residual connections (He et al., 2015a; Zhou et al., 2016; Wu et al., 2016).”
“Finally, we train on the much larger WMT’14 English-French task where we compare to the state of the art result of GNMT (Wu et al., 2016).”
“Our attention module is similar to <cit.>. More specifically, let 𝐲_i-1 be the decoder-RNN output from the past decoding time step (in our implementation, we use the output from the bottom decoder layer). Attention context 𝐚_i for the current time step is computed according to the following formulas:”
“We introduce a separate attention mechanism for each decoder layer.”
Transformer generalizes encoder-decoder attention into a query-key-value self-attention mechanism usable throughout the network, building on the earlier alignment concept.— the tool’s reading
“6 [Wu et al., 2016] for the WMT translation and CNN/DM summarization tasks.”
“Specifically, we use a beam width of 4 and a length penalty of α = 0.6 [Wu et al., 2016] for the WMT translation and CNN/DM summarization tasks.”
“Our attention module is similar to <cit.>. More specifically, let 𝐲_i-1 be the decoder-RNN output from the past decoding time step (in our implementation, we use the output from the bottom decoder layer). Attention context 𝐚_i for the current time step is computed according to the following formulas:”
“Self-attention is a variant of attention <cit.> that processes a sequence by replacing each element by a weighted average of the rest of the sequence.”
Newer paper keeps standard encoder-decoder attention but adds novel intra-temporal and intra-decoder attention mechanisms, generalizing the original alignment concept.— the tool’s reading
“This phenomenon has been observed with similar sequence generation tasks like image captioning with CIDEr (Ren-nie et al., 2016) and machine translation with BLEU (Wu et al., 2016; Norouzi et al., 2016).”
“A similar mixed-objective learning function has been used by Wu et al. (2016) for machine translation on short sequences, but this is its first use in combination with self-critical policy learning for long summarization to explicitly improve readability in addition to evaluation metrics.”
“This is applicable to sequence generation tasks, because many of the metrics used to evaluate these tasks (like BLEU, ROUGE or METEOR) are not differentiable.”
“Our attention module is similar to <cit.>. More specifically, let 𝐲_i-1 be the decoder-RNN output from the past decoding time step (in our implementation, we use the output from the bottom decoder layer). Attention context 𝐚_i for the current time step is computed according to the following formulas:”
“At each decoding step t, we use an intra-temporal attention function to attend over specific parts of the encoded input sequence in addition to the decoder's own hidden state and the previously-generated word <cit.>.”
BiDAF builds on co-attention's bidirectional idea but generalizes it to reading comprehension with memory-less, layered attention flow instead of summarized vectors.— the tool’s reading
“We conjecture that separating out the attention layer results in a richer set of features computed in the first 4 layers which are then incorporated by the modeling layer.”
“Lu et al. (2016) have recently shown that in addition to attending from the question to image patches, attending from the image back to the question words provides an improvement on the VQA task.”
“So far, all attention models for VQA in literature have focused on the problem of identifying “where to look” or visual attention. In this paper, we argue that the problem of identifying “which words to listen to” or question attention is equally important.”
“One of the key factors to the advancement has been the use of neural attention mechanism, which enables the system to focus on a targeted area within a context paragraph (for MC) or within an image (for Visual QA), that is most relevant to answer the question <cit.>.”
The newer paper carries the softmax-weighted attention mechanism from sequence/token modeling into a new domain—graph-structured data with node neighborhoods.— the tool’s reading
“Together with Recurrent Neural Networks (RNNs) or convolutions, self-attention has proven to be useful for tasks such as machine reading (Cheng et al., 2016) and learning sentence representations (Lin et al., 2017).”
“Together with Recurrent Neural Networks (RNNs) or convolutions, self-attention has proven to be useful for tasks such as machine reading (Cheng et al., 2016) and learning sentence representations (Lin et al.”
“This enables adaptive memory usage during recurrence with neural attention, offering a way to weakly induce relations among tokens.”
“One of the benefits of attention mechanisms is that they allow for dealing with variable sized inputs, focusing on the most relevant parts of the input to make decisions.”
The newer paper adopts the same query-based attention mechanism but restricts it to local neighborhoods for image generation, specializing the general soft-attention idea.— the tool’s reading
“In this work we show that self-attention (Cheng et al., 2016; Parikh et al., 2016; Vaswani et al., 2017) can achieve a better balance in the trade-off between the virtually unlimited receptive field of the necessarily sequential PixelRNN and the limited receptive field of the much more parallelizable PixelCNN and its various extensions.”
“In this work we show that self-attention (Cheng et al., 2016; Parikh et al., 2016; Vaswani et al., 2017) can achieve a better balance in the trade-off between the virtually unlimited receptive field of the necessarily sequential PixelRNN and the limited receptive field of the much more parallelizable…”
“This enables adaptive memory usage during recurrence with neural attention, offering a way to weakly induce relations among tokens.”
“Each self-attention layer computes a d-dimensional representation for each position, that is, each channel of each pixel. To recompute the representation for a given position, it first compares the position's current representation to other positions' representations, obtaining an attention distribution over the other positions. This distribution is then use…”
The earlier sequence-based intra-attention mechanism is carried into image feature maps to model spatial long-range dependencies, applying the concept in a new modality.— the tool’s reading
“Self-attention [4, 20, 32], on the other hand, exhibits a better balance between ability to model long-range dependencies and computational and statistical efficiency.”
“In particular, self-attention [4, 20], also called intra-attention, calculates the response at a position in a sequence by attending to all positions within the same sequence.”
“This enables adaptive memory usage during recurrence with neural attention, offering a way to weakly induce relations among tokens.”
“The self-attention module calculates response at a position as a weighted sum of the features at all positions, where the weights – or attention vectors – are calculated with only a small computational cost.”
The Transformer generalizes softmax-weighted attention into a formal query-key-value framework, introducing scaled dot-product and multi-head variants while replacing recurrence entirely.— the tool’s reading
“Self-attention has been used successfully in a variety of tasks including reading comprehension, abstractive summarization, textual entailment and learning task-independent sentence representations [4, 22, 23, 19].”
“This enables adaptive memory usage during recurrence with neural attention, offering a way to weakly induce relations among tokens.”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
The newer paper builds on the earlier intra-attention mechanism, generalizing it into multiple 'hops' producing a matrix sentence embedding rather than a single vector.— the tool’s reading
“The LSTMN model (Cheng et al., 2016) also proposed a very successful intra-sentence level attention mechanism, which is later used by Parikh et al. (2016).”
“ention produces a matrix representation instead, with a specially designed penalty term. We applied the model for sentiment anaysis and entailment, and their model is for factoid QA. The LSTMN model (Cheng et al., 2016) also proposed a very successful intra-sentence level attention mechanism, which is later used by Parikh et al. (2016). We see our attention …”
“This enables adaptive memory usage during recurrence with neural attention, offering a way to weakly induce relations among tokens.”
“Our aim is to encode a variable length sentence into a fixed size embedding. We achieve that by choosing a linear combination of the n LSTM hidden vectors in H. Computing the linear combination requires the self-attention mechanism. The attention mechanism takes the whole LSTM hidden states H as input, and outputs a vector of weights 𝐚:”
Transformer formalizes and generalizes the earlier soft attention/intra-attention mechanism into a scaled dot-product multi-head query-key-value framework as its core building block.— the tool’s reading
“The primary building block of the Transformer is self-attention [Cheng et al., 2016].”
“This enables adaptive memory usage during recurrence with neural attention, offering a way to weakly induce relations among tokens.”
“Self-attention is a variant of attention <cit.> that processes a sequence by replacing each element by a weighted average of the rest of the sequence.”
The newer paper builds on soft attention/context-vector mechanisms by adding novel intra-temporal and intra-decoder attention variants for summarization.— the tool’s reading
“This enables adaptive memory usage during recurrence with neural attention, offering a way to weakly induce relations among tokens.”
“At each decoding step t, we use an intra-temporal attention function to attend over specific parts of the encoded input sequence in addition to the decoder's own hidden state and the previously-generated word <cit.>.”
The newer paper formalizes the earlier soft attention/intra-attention idea into the standardized query-key-value dot-product mechanism, generalizing it within the Transformer framework.— the tool’s reading
“This technical narrative has also been explored by a number of other recent studies, including those on intra-attention (Parikh et al., 2016), self-matching networks (Wang et al., 2017), and LSTMN (Cheng et al., 2016).”
“This enables adaptive memory usage during recurrence with neural attention, offering a way to weakly induce relations among tokens.”
“The fundamental role of dot product self-attention is to learn self-alignment, i.e., to determine the relative importance of a single token with respect to all other tokens in the sequence.”
The attention-map knowledge transfer idea from CNN spatial maps is carried into Transformer self-attention distillation, a new architecture/modality.— the tool’s reading
“Knowledge of the attention maps (Zagoruyko & Komodakis, 2017; Hu et al., 2018) is also introduced to help the training.”
“To that end, here we consider attention as a set of spatial maps that essentially try to encode on which spatial areas of the input the network focuses most for taking its output decision (e.g., for classifying an image), where, furthermore, these maps can be defined w.r.t. various layers of the network so that they are able to capture both low-, mid-, and h…”
“The attention mechanism <cit.> has been a highly successful neural network component for NLP tasks, which is also crucial for pre-trained LMs.”
Multi-head self-attention with parallel projections generalizes and scales the earlier softmax-weighted single-query attention mechanism into a core, parallelizable transformer building block.— the tool’s reading
“To avoid training set leakage into our downstream tasks we remove the Wikipedia articles present in the WikiText103 test set (Merity et al., 2016).”
“In this section we detail our evaluation methodology for the WikiText103 dataset (Merity et al., 2016) and cloze-style prediction accuracy on the LAMBADA dataset(Paperno et al., 2016).”
“Models with soft attention or memory components have been proposed to help deal with this challenge, aiming to allow for the retrieval and use of relevant previous hidden states, in effect increasing hidden state capacity and providing a path for gradients not tied to timesteps.”
“As shown in Figure <ref>b, for the self attention block we exploit inherent parallelism in the multihead attention operation, partitioning the GEMMs associated with key (K), query (Q), and value (V) in a column parallel fashion such that the matrix multiply corresponding to each attention head is done locally on one GPU.”
The newer paper generalizes softmax-weighted attention into scaled dot-product self-attention with query-key-value projections, building directly on the earlier scoring-based mechanism.— the tool’s reading
“We use two pretrained trans-former models, RoBERTa-base (12-layer stacked transformer) and RoBERTa-large (24-layer stacked transformer) (Liu et al., 2019) on two tasks: masked-language-modeling task on Wiki103 (Merity et al., 2016) and classification task on IMDB (Maas et al., 2011).”
“Models with soft attention or memory components have been proposed to help deal with this challenge, aiming to allow for the retrieval and use of relevant previous hidden states, in effect increasing hidden state capacity and providing a path for gradients not tied to timesteps.”
“Here, each token's representation is updated by attending to all other tokens in the previous layer. This operation is key for retaining long-term information, giving Transformers the edge over recurrent models on long sequences. However, attending to all tokens at each layer incurs a complexity of O(n^2) with respect to sequence length.”
The newer paper builds on standard softmax attention by adding intra-temporal and intra-decoder attention mechanisms to address repetition, generalizing the original context-vector approach.— the tool’s reading
“Gulcehre et al. (2016) and Merity et al. (2016) combine this pointer mechanism with the original word generation layer in the decoder to allow the model to use either method at each decoding step.”
“Models with soft attention or memory components have been proposed to help deal with this challenge, aiming to allow for the retrieval and use of relevant previous hidden states, in effect increasing hidden state capacity and providing a path for gradients not tied to timesteps.”
“At each decoding step t, we use an intra-temporal attention function to attend over specific parts of the encoded input sequence in addition to the decoder's own hidden state and the previously-generated word <cit.>.”
Transformer generalizes soft encoder-decoder and self-attention into a formal query-key-value framework, replacing recurrence entirely with attention mechanisms.— the tool’s reading
“Self-attention has been used successfully in a variety of tasks including reading comprehension, abstractive summarization, textual entailment and learning task-independent sentence representations [4, 22, 23, 19].”
“At each decoding step t, we use an intra-temporal attention function to attend over specific parts of the encoded input sequence in addition to the decoder's own hidden state and the previously-generated word <cit.>.”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
Newer paper generalizes soft alignment attention into Transformer self-attention with QKV projections, building on the earlier encoder-decoder attention mechanism.'— the tool’s reading
“We remove duplicated trigrams in beam search, and tweak the maximum summary length on the development set (Paulus et al., 2018; Edunov et al., 2019).”
“At each decoding step t, we use an intra-temporal attention function to attend over specific parts of the encoded input sequence in addition to the decoder's own hidden state and the previously-generated word <cit.>.”
“In each Transformer block, multiple self-attention heads are used to aggregate the output vectors of the previous layer.”
Both use encoder-style attention over sequence states, with Transformer generalizing intra-attention into multi-head scaled dot-product self-attention despite the citation being unrelated to attention itself.— the tool’s reading
“It has been shown that improvements to the ROUGE score do not necessarily correspond to more coherent summaries [Paulus et al., 2017].”
“At each decoding step t, we use an intra-temporal attention function to attend over specific parts of the encoded input sequence in addition to the decoder's own hidden state and the previously-generated word <cit.>.”
“Self-attention is a variant of attention <cit.> that processes a sequence by replacing each element by a weighted average of the rest of the sequence.”
The newer paper carries the self-attention weighting concept from NLP/LSTM sentence embeddings into computer vision, applying it to CNN feature recalibration.— the tool’s reading
“Transformers have had great success in natural language processing [33], [38], [149], [150], [152], [161].”
“Self-attention was proposed and has had great success in the field of natural language processing (NLP) [33], [38], [39], [149], [150], [151], [152].”
“Our aim is to encode a variable length sentence into a fixed size embedding. We achieve that by choosing a linear combination of the n LSTM hidden vectors in H. Computing the linear combination requires the self-attention mechanism. The attention mechanism takes the whole LSTM hidden states H as input, and outputs a vector of weights 𝐚:”
“In computer vision, {the} attention mechanism can be regarded as a dynamic weight recalibration process based on the input features.”
The self-attention mechanism for sentence embeddings is carried into a new domain—graph-structured data—to weight neighboring node features instead of sequence hidden states.— the tool’s reading
“Together with Recurrent Neural Networks (RNNs) or convolutions, self-attention has proven to be useful for tasks such as machine reading (Cheng et al., 2016) and learning sentence representations (Lin et al., 2017).”
“Our aim is to encode a variable length sentence into a fixed size embedding. We achieve that by choosing a linear combination of the n LSTM hidden vectors in H. Computing the linear combination requires the self-attention mechanism. The attention mechanism takes the whole LSTM hidden states H as input, and outputs a vector of weights 𝐚:”
“One of the benefits of attention mechanisms is that they allow for dealing with variable sized inputs, focusing on the most relevant parts of the input to make decisions.”
The newer paper adapts the sentence-based self-attention weighted-sum mechanism into the image domain, computing pixel-wise dense relations for segmentation rather than NLP embeddings.— the tool’s reading
“everal examples of object context map. We exploit the object context to update the representation for each pixel. The implementation of object context pooling, inspired by the self-attention approach [14,23], computes the weighted summation of the representations of all the pixels contained in the object context, with the weights from the object context map.…”
“pixels belonging to the same object category. Attention. Attention is widely used for various tasks such as machine translation, visual question answering and video classification. The self-attention [14,23] method calculates the context at one position as a weighted sum of all positions in a sentence. Wang et al. further proposed the non-local neural network…”
“lying in the object that belongs to the same category. The key component of object context module is the object context pooling (OCP), and the design of OCP is inspired by the self-attention approach [14,23]. The object context pooling includes two main steps: object context estimation and object context aggregation. Object context pooling. (i) Object contex…”
“Our aim is to encode a variable length sentence into a fixed size embedding. We achieve that by choosing a linear combination of the n LSTM hidden vectors in H. Computing the linear combination requires the self-attention mechanism. The attention mechanism takes the whole LSTM hidden states H as input, and outputs a vector of weights 𝐚:”
“The self-attention scheme <cit.> calculates the context at one position as a aggregation of all positions in a sentence (at the encoder stage).”
The newer paper generalizes self-attention into a formal query-key-value framework and builds an entire architecture from it, extending the earlier LSTM-based attention mechanism.— the tool’s reading
“Self-attention has been used successfully in a variety of tasks including reading comprehension, abstractive summarization, textual entailment and learning task-independent sentence representations [4, 22, 23, 19].”
“Our aim is to encode a variable length sentence into a fixed size embedding. We achieve that by choosing a linear combination of the n LSTM hidden vectors in H. Computing the linear combination requires the self-attention mechanism. The attention mechanism takes the whole LSTM hidden states H as input, and outputs a vector of weights 𝐚:”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
The attention pooling idea is carried from sequential sentence embedding into the new domain of multiple instance learning with independent instances, per the paper's own framing.— the tool’s reading
“The attention mechanism is widely used in deep learning for image captioning (Xu et al., 2015) or text analysis (Bahdanau et al., 2014; Lin et al., 2017).”
“Interestingly, the proposed MIL pooling corresponds to a version of the attention mechanism (Lin et al., 2017; Raffel & Ellis, 2015).”
“Our aim is to encode a variable length sentence into a fixed size embedding. We achieve that by choosing a linear combination of the n LSTM hidden vectors in H. Computing the linear combination requires the self-attention mechanism. The attention mechanism takes the whole LSTM hidden states H as input, and outputs a vector of weights 𝐚:”
“Interestingly, the proposed MIL pooling corresponds to a version of the attention mechanism <cit.>. The main difference is that typically in the attention mechanism all instances are sequentially dependent while here we assume that all instances are independent.”
The newer paper adopts the earlier attention formulation but critically interrogates whether its weights genuinely explain feature importance, disputing an implicit interpretive claim.— the tool’s reading
“hQ √ m (Vaswani et al., 2017), where v,W1,W2 are model parameters.”
“In this work we consider two common similarity functions: Additive et al., 2014) and Scaled Dot-Product φ ( h , Q ) = hQ √ m (Vaswani et al., 2017), where v , W 1 , W 2 are model parameters.”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“Attention mechanisms <cit.> induce conditional distributions over input units to compose a weighted context vector for downstream modules.”
LSH attention restricts full scaled dot-product attention to keys within the same hash bucket, a special-case approximation for efficiency.— the tool’s reading
“In the two plots on the right in Figure 3, we compare a regular Trans-former per Vaswani et al. (2017) with the reversible one describe in Section 3.”
“We also evaluate on the WMT 2014 English-to-German translation task, following the hyperparameters of Vaswani et al. (2017).”
“The Transformer architecture (Vaswani et al., 2017) is widely used in natural language processing and yields state-of-the-art results on a number of tasks.”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“The standard attention used in the Transformer is the scaled dot-product attention <cit.>. The input consists of queries and keys of dimension d_k, and values of dimension d_v. The dot products of the query with all keys are computed, scaled by √(d_k), and a softmax function is applied to obtain the weights on the values.”
The newer paper applies the Transformer's self-attention mechanism to a new domain (time-series forecasting) while introducing convolutional and sparse variants as modifications.— the tool’s reading
“We briefly introduce its architecture here and refer readers to [1] for more details.”
“In this paper, we propose to tackle such forecasting problem with Transformer [1].”
“The well-known self-attention based Transformer [1] has recently been proposed for sequence modeling and has achieved great success.”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“After these linear projections, the scaled dot-product attention computes a sequence of vector outputs: 𝐎_h = Attention(𝐐_h, 𝐊_h, 𝐕_h)= softmax(𝐐_h𝐊_h^T/√(d_k)·𝐌)𝐕_h.”
Longformer restricts full quadratic self-attention to a sparse local+global pattern, trading generality for linear scaling while keeping the same core mechanism.— the tool’s reading
“Transformers (Vaswani et al., 2017) have achieved state-of-the-art results in a wide range of natu-ral language tasks including generative language modeling (Dai et al., 2019; Radford et al., 2019) and discriminative language understanding (De-vlin et al., 2019).”
“Linear Projections for Global Attention Re-call that given the linear projections Q , K , V , the Transformer model (Vaswani et al., 2017) computes attention scores as follows: We use two sets of projections, Q s , K s , V s to compute attention scores of sliding window attention, and Q g , K g , V…”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“To address this challenge, we sparsify the full self-attention matrix according to an “attention pattern” specifying pairs of input locations attending to one another.”
The newer paper adopts the same Transformer attention mechanism but focuses specifically on analyzing individual heads' confidence and interpretable roles, a special-case study rather than a generalization.— the tool’s reading
“We use regularization as described in (Vaswani et al., 2017).”
“We follow the setup of Transformer base model (Vaswani et al., 2017).”
“In this section, we briefly describe the Transformer architecture (Vaswani et al., 2017) introducing the terminology used in the rest of the paper.”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“The multi-head attention mechanism obtains h (i.e. one per head) different representations of (Q, K, V), computes scaled dot-product attention for each representation, concatenates the results, and projects the concatenation through a feed-forward layer.”
The newer paper restricts the general attention mechanism to Transformer self-attention and proposes a pooled, linear-complexity variant tailored to spatial resolution constraints.— the tool’s reading
“We scale up PVT v2 from B0 to B5 By changing the hyper-parameters, which are as follows for Stage i: Si: stride of the overlapping patch embedding Ci: number of channels of output Li: number of encoder layers Ri: reduction ratio of the SRA Pi: adaptive average pooling size of the linear SRA Ni: number of heads of the efficient self-attention Ei: expansion ra…”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“Different from SRA <cit.> which uses convolutions for spatial reduction, linear SRA uses average pooling to reduce the spatial dimension (i.e., h× w) to a fixed size (i.e., P× P) before the attention operation.”
The newer paper adopts the same multi-head self-attention mechanism unchanged but restricts focus to its model-parallel GPU implementation for training efficiency, a specialized engineering case.— the tool’s reading
“Current work in NLP trends towards using transformer models (Vaswani et al., 2017) due to their superior accuracy and compute efficiency.”
“…GPT-2 and BERT use GeLU (Hendrycks & Gimpel, 2016) nonlinearities and layer normalization (Ba et al., 2016) to the input of the multi-head attention and feed forward layers, whereas the original transformer (Vaswani et al., 2017) uses ReLU nonlinearities and applies layer normalization to outputs.”
“We refer the reader to prior work for a detailed description of the model architecture (Vaswani et al., 2017; Devlin et al., 2018; Radford et al., 2019).”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“As shown in Figure <ref>b, for the self attention block we exploit inherent parallelism in the multihead attention operation, partitioning the GEMMs associated with key (K), query (Q), and value (V) in a column parallel fashion such that the matrix multiply corresponding to each attention head is done locally on one GPU.”
VisualBERT applies the Transformer's self-attention mechanism, originally for text sequences, to jointly process multimodal image-text tokens for vision-and-language tasks.— the tool’s reading
“BERT (Devlin et al., 2019) is a Transformer (Vaswani et al., 2017) with subwords (Wu et al., 2016) as input and trained using language modeling objectives.”
“VisualBERT integrates BERT (Devlin et al., 2019), a recent Transformer-based model (Vaswani et al., 2017) for natural language processing, and pre-trained object proposals systems such as Faster-RCNN (Ren et al., 2015) and it can be applied to a variety of vision-and-language tasks.”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“VisualBERT consists of a stack of Transformer layers that implicitly align elements of an input text and regions in an associated input image with self-attention.”
The newer paper carries self-attention, originally proposed for NLP sequence modeling, into computer vision as feature recalibration mechanisms in CNNs, citing it as the origin of self-attention across domains.— the tool’s reading
“Transformers have had great success in natural language processing [33], [38], [149], [150], [152], [161].”
“Phase 4 used self-attention methods [15], [33], [34].”
“Self-attention was firstly proposed in [33] and rapidly provided great advances in the field of natural language processing [33], [38], [39].”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“In computer vision, {the} attention mechanism can be regarded as a dynamic weight recalibration process based on the input features.”
The paper adapts self-attention and multi-head attention from sequence/Transformer models to a new modality—graph-structured data over node neighborhoods—citing Vaswani et al. directly for inspiration.— the tool’s reading
“However, Vaswani et al. (2017) showed that not only self-attention can improve a method based on RNNs or convolutions, but also that it is sufficient for constructing a powerful model obtaining state-of-the-art performance on the machine translation task.”
“…corresponding to them, to serve as the final output features for every node (after potentially applying a nonlinearity, σ ): To stabilize the learning process of self-attention, we have found extending our mechanism to employ multi-head attention to be beneficial, similarly to Vaswani et al. (2017).”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“One of the benefits of attention mechanisms is that they allow for dealing with variable sized inputs, focusing on the most relevant parts of the input to make decisions.”
The newer paper adopts the Transformer's scaled dot-product multi-head self-attention and extends it with a distillation token for vision transformers, building directly on the original mechanism.— the tool’s reading
“To get a full transformer block as in [49], we add a Feed-Forward Network (FFN) on top of the MSA layer.”
“The positional information is incorporated as fixed [49] or trainable [16] positional embeddings.”
“[15], which is very close to the original token-based transformer architecture [49] where word embeddings are replaced with patch embeddings.”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“Multi-head Self Attention layers (MSA). The attention mechanism is based on a trainable associative memory with (key, value) vector pairs.”
The newer paper reframes self-attention as data-dependent mixing and proposes replacing it with a fixed-weight linear layer, implicitly challenging its necessity.— the tool’s reading
“RECENTLY, the transformer architecture [1], adapted from its original use in natural language processing with only minor changes, has achieved performance competitive with the state of the art on ImageNet-1k [2] when pre-trained with a sufficiently large amount of data [3].”
“[1], where we replace the self-attention sublayers by the residual multi-perceptron layer.”
“[1], which serves as a baseline, along with pre-transformer architectures such as recurrent and convolutional neural networks.”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“Whereas in self-attention the weights to aggregate information from other patches are data dependent through queries and keys, in ResMLPthe weights are not data dependent and only based on absolute positions of patches.”
The newer paper restricts full dense self-attention to sparse factorized connectivity patterns, reducing computation while preserving the core query-key-value mechanism.— the tool’s reading
“To simplify our implementation, we do not apply dropout within the attention blocks, as in (Vaswani et al., 2017), and instead only apply it at the end of each residual addition, as seen in Figure 4.”
“Separately, the Transformer (Vaswani et al., 2017) has been shown to excel on many natural language tasks, which may be in part due to its ability to model arbitrary dependencies in a constant number of layers.”
“A third approach is to use multi-head attention (Vaswani et al., 2017), where n h attention products are computed in parallel, then concatenated along the feature dimension: Here, the A can be the separate attention patterns, the merged patterns, or interleaved as in Eq.”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“A self-attention layer maps a matrix of input embeddings X to an output matrix and is parameterized by a connectivity pattern S = {S_1,..., S_n}, where S_i denotes the set of indices of the input vectors to which the ith output vector attends.”
The newer paper builds directly on Transformer self-attention, adding learned relative position representations to the compatibility and value computations.— the tool’s reading
“We compared our model using only relative position representations to the baseline Transformer (Vaswani et al., 2017) with sinusoidal position encodings.”
“, 2016), attention (Vaswani et al., 2017), or a combination of recurrence and attention (Bahdanau et al.”
“The Transformer computes self-attention efficiently for all sequences, heads, and positions in a batch using parallel matrix multiplication operations (Vaswani et al., 2017).”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“Each attention head operates on an input sequence, x = (x_1, …, x_n) of n elements where x_i ∈ℝ^d_x, and computes a new sequence z = (z_1, …, z_n) of the same length where z_i ∈ℝ^d_z.”
The Transformer's attention mechanism is carried from sequence modeling into graph neighborhood aggregation, adapting the same weighted-sum concept to a new domain and modality.— the tool’s reading
“Specifically, we propose a new method named Knowledge Graph Attention Network (KGAT), which is equipped with two designs to correspondingly address the challenges in high-order relation modeling: 1) recursive embedding propagation, which updates a node’s embedding based on the embeddings of its neighbors, and recursively performs such embedding propagation t…”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“employs the neural attention mechanism <cit.> to learn the weight of each neighbor during a propagation, such that the attention weights of cascaded propagations can reveal the importance of a high-order connectivity.”
The newer paper builds on Transformer self-attention by adding sequence reduction for efficiency and applying it to a segmentation-specific hierarchical encoder architecture.— the tool’s reading
“In summary, the hyper-parameters of our MiT are listed as follows: • Ki: the patch size of the overlapping patch embedding in Stage i; • Si: the stride of the overlapping patch embedding in Stage i; • Pi: the padding size of the overlapping patch embedding in Stage i; • Ci: the channel number of the output of Stage i; • Li: the number of encoder layers in St…”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“Attention(Q, K, V) = Softmax(QK^𝖳/√(d_head))V.”
The newer paper adopts the Transformer's scaled dot-product self-attention but restricts it to local 1D/2D neighborhoods for image generation scalability, a specialized domain-specific case.— the tool’s reading
“We trained the class-conditioned Image Transformer on CIFAR-10, achieving very similar log-likelihoods as in un-conditioned generation.”
“For both the encoder and decoder, the Image Transformer uses stacks of self-attention and position-wise feed-forward layers, similar to (Vaswani et al., 2017).”
“A slice of one layer of the Image Transformer, recomputing the representation q (cid:48) of a single channel of one pixel q by attending to a memory of previously generated pixels m 1 , m 2 , . . . .”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“Each self-attention layer computes a d-dimensional representation for each position, that is, each channel of each pixel. To recompute the representation for a given position, it first compares the position's current representation to other positions' representations, obtaining an attention distribution over the other positions. This distribution is then use…”
The newer paper applies standard Transformer self-attention to multimodal visual tokens with a nested inner/outer structure, carrying the mechanism into a new domain.— the tool’s reading
“The effect of #heads in standard transformer has been investigated in multiple works [21, 35] and a head width of 64 is recommended for visual tasks [9, 31].”
“We first briefly describe the basic components in transformer [35], including MSA (Multi-head Self-Attention), MLP (Multi-Layer Perceptron) and LN (Layer Normalization).”
“Differently, transformer is a type of neural network mainly based on self-attention mechanism [35], which can provide the relationships between different features.”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“The scaled dot-product attention is applied on Q,K,V: Attention(Q,K,V) = softmax(QK^T/√(d_k))V.”
The newer paper applies the transformer's query-key-value self-attention mechanism to image feature maps, moving it from NLP sequences into the visual domain alongside convolution.— the tool’s reading
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“The self-attention module calculates response at a position as a weighted sum of the features at all positions, where the weights – or attention vectors – are calculated with only a small computational cost.”
The newer paper applies the original sequence-based self-attention formulation to a new modality—image pixels for semantic segmentation—rather than altering its core definition.— the tool’s reading
“We employ the absolute position representations [15] to study the influence of the position information while the PSANet considers the relative position information by employing over over-completed attention maps.”
“The self-attention [15] proposed by Vaswanni et al.”
“We construct P with sine and cosine functions by following the methods proposed in self-attention [15] and imagetransformer [12], where pi represents the position feature associated with xi.”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“The self-attention scheme <cit.> calculates the context at one position as a aggregation of all positions in a sentence (at the encoder stage).”
The Transformer self-attention mechanism is carried into a new multimodal video-audio domain with dual attention heads, extending its application beyond text.— the tool’s reading
“ginal paper with two variants of a Transformer-based model [49].”
“former self-attention architecture [49], so that the advantages and disadvantages of the two losses can be compared head-to-head, with as much of the rest of the architecture in common as possible.”
“model [49]: i) an encoder-decoder attention structure for training in a seq2seq manner and ii) a stack of self-attention blocks for training with CTC loss.”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“the architecture incorporates a novel dual attention mechanism that can operate over visual input only, audio input only, or both.”
The newer paper keeps the standard scaled dot-product attention definition but augments it with a convolutional projection step, building on rather than redefining or contesting it.— the tool’s reading
“Transformers that exclusively rely on the self-attention mechanism to capture global dependencies have dominated in natural language modelling [31, 10, 25].”
“Transformers [31, 10] have recently dominated a wide range of tasks in natural language processing (NLP) [32].”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“The goal of the proposed Convolutional Projection layer is to achieve additional modeling of local spatial context, and to provide efficiency benefits by permitting the undersampling of K and V matrices.”
The newer paper takes the general attention definition and focuses specifically on the scaled dot-product self-attention matrix, showing it is low-rank for efficient approximation.— the tool’s reading
“Transformer models (Vaswani et al., 2017) have become ubiquitous for wide variety of problems in natural language processing (NLP), including translation (Ott et al., 2018), text classification, question answering, among others (Raffel et al., 2019; Mohamed et al., 2019).”
“Complexity per Layer Sequential Operation (Vaswani et al., 2017) O ( n 2 ) O (1) Sparse Tansformer, (Child et al., 2019) O ( n √ n ) O (1) Reformer, (Kitaev et al., 2020) 2 Backgrounds and Related works”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“Here, each token's representation is updated by attending to all other tokens in the previous layer. This operation is key for retaining long-term information, giving Transformers the edge over recurrent models on long sequences. However, attending to all tokens at each layer incurs a complexity of O(n^2) with respect to sequence length.”
The newer paper carries the attention concept from sequence/language transformer contexts into CNN-based spatial feature recalibration for image segmentation.— the tool’s reading
“Attention Gates: AGs are commonly used in natural image analysis, knowledge graphs, and language processing (NLP) for image captioning [1], machine translation [2, 30], and classification [11, 31, 32] tasks.”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“Attention coefficients, α_i ∈ [0,1], identify salient image regions and prune feature responses to preserve only the activations relevant to the specific task as shown in Figure <ref>.”
The newer paper reuses the exact Transformer self-attention mechanism but adds masking strategies to unify unidirectional, bidirectional, and seq2seq objectives.— the tool’s reading
“The source sequence is encoded by a bidirectional Transformer, and the target sequence is generated by an unidirectional decoder from left to right, word-by-word.”
“Similar to the pre-training procedure, we use the pre-trained model as a bidirectional Transformer encoder by setting the self-attention mask M to a 0 matrix.”
“Given the input vectors { x i } | x | i =1 , we first pack them together into Then, an L -layer Transformer is used to encode the input: where l ∈ [1 , L ] , and .”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“In each Transformer block, multiple self-attention heads are used to aggregate the output vectors of the previous layer.”
The newer paper carries the Transformer's self-/multi-head attention mechanism from NLP into computer vision for visual token processing and feature modulation.— the tool’s reading
“We then apply a cascaded set of transformers, a self-attention module widely used in natural language processing [1] to process visual tokens, capture interactions, and compute output tokens.”
“Following previous work [1, 18], we use multi-head attention in the tokenizer, transformer, and projector.”
“It has been widely used in natural language processing [1, 6] and is gaining popularity in computer vision [7–18].”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“Critically, our Visual Transformer operates in a semantic token space, judiciously attending to different image parts based on context.”
The newer paper builds on Transformer self-attention by adding a new value-relation component for knowledge distillation, extending rather than contesting or renaming it.— the tool’s reading
“Multi-layer Transformers (Vaswani et al., 2017) have been the most widely-used network structures in state-of-the-art pre-trained models.”
“Transformer (Vaswani et al., 2017) is used to encode contextual information for input tokens.”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“The attention mechanism <cit.> has been a highly successful neural network component for NLP tasks, which is also crucial for pre-trained LMs.”
The newer paper adopts the exact multi-head self-attention mechanism from the earlier Transformer paper, applying it specifically to model global word interactions versus convolution's local ones.'— the tool’s reading
“For the self-attention-layer, we adopt the multi-head attention mechanism defined in (Vaswani et al., 2017a) which, for each position in the input, called the query, computes a weighted sum of all positions, or keys, in the input based on the similarity between the query and key as measured by the…”
“…(one of convolution, self-attention, or feed-forward-net) inside the encoder structure is wrapped inside a residual block. used extensively in Vaswani et al. (2017a), the combination of convolutions and self-attention is novel, and is significantly better than self-attention alone and gives…”
“A positional encoding is added to the input at the beginning of each encoder layer consisting of sin and cos functions at varying wavelengths, as defined in (Vaswani et al., 2017a).”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“For the self-attention-layer, we adopt the multi-head attention mechanism defined in <cit.> which, for each position in the input, called the query, computes a weighted sum of all positions, or keys, in the input based on the similarity between the query and key as measured by the dot product.”
The newer paper applies the same Transformer self-attention mechanism from NLP to a new domain—tokenized image patches for vision tasks.— the tool’s reading
“The success has been widely witnessed in the field of machine translation and natural language processing (NLP) [3,15].”
“On the other hand, Transformers, designed for sequence-to-sequence prediction, have emerged as alternative architectures which dispense convolution operators entirely and solely rely on attention mechanisms instead [15].”
“Transformers were first proposed by [15] for machine translation and established state-of-the-arts in many NLP tasks.”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“Transformers, designed for sequence-to-sequence prediction, have emerged as alternative architectures with innate global self-attention mechanisms, but can result in limited localization abilities due to insufficient low-level details.”
The newer paper describes the same scaled dot-product multi-head attention mechanism from Vaswani et al. using slightly different descriptive language, without extending or contesting it.— the tool’s reading
“Early results on transfer learning for NLP leveraged recurrent neural networks [Peters et al., 2018; Howard and Ruder, 2018], but it has recently become more common to use models based on the “Transformer” architecture [Vaswani et al., 2017].”
“For WMT English to German, we use the same training data as [Vaswani et al., 2017] (i.e. News Commentary v13, Common Crawl, Europarl v7) and newstest2013 as a validation set [Bojar et al., 2014].”
“For WMT English to German, we use the same training data as [Vaswani et al., 2017] (i.”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“Self-attention is a variant of attention <cit.> that processes a sequence by replacing each element by a weighted average of the rest of the sequence.”
SE-blocks apply self-attention specifically to channel-wise recalibration in CNNs, restricting the general query-key-value attention idea to a specific spatial/channel domain.— the tool’s reading
“Attention can be interpreted as a means of biasing the allocation of available computational resources towards the most informative components of a signal [46]–[51].”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“Attention can be interpreted as a means of biasing the allocation of available computational resources towards the most informative components of a signal <cit.>.”
The newer paper reframes Transformer self-attention within computer vision, contrasting it with convolution, carrying the mechanism into a new modality/domain.— the tool’s reading
“Meanwhile, with the success of self-attention models like Transformers [6] in natural language processing [7, 8], many previous works have attempted to bring in the power of attention into computer vision [9, 10, 11, 12].”
“With the key ingredients of self-attention, Transformers have been widely adopted for neural language processing and speech understanding.”
“For a more comprehensive review of vision Transformers, we refer readers to the dedicated surveys [36, 37].”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“In comparison, self-attention allows the receptive field to be the entire spatial locations and computes the weights based on the re-normalized pairwise similarity between the pair (x_i, x_j):”
Axial attention generalizes standard scaled dot-product attention by applying it along single tensor axes, building directly on Vaswani et al.'s formulation.— the tool’s reading
“We use these to define ResNet axial attention blocks operating on tensors of D-dimensional embeddings (Vaswani et al., 2017; Child et al., 2019):”
“, y ′ N , where each y ′ i depends on all yi by way of a single vectorizable computation (Vaswani et al., 2017).”
“We call Attention We use these to define ResNet axial attention blocks operating on tensors of D -dimensional embed-dings (Vaswani et al., 2017; Child et al., 2019): D (cid:48) is chosen to be some constant factor larger than D , from 1 to 4 (Vaswani et al., 2017).”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“Self-attention is a neural network operation that is able to transform a sequence y_1, …, y_N into a sequence y'_1, …, y'_N, where each y'_i depends on all y_i by way of a single vectorizable computation <cit.>.”
The newer paper applies the Transformer's self-attention mechanism from NLP to vision transformers, adapting it to image patches as a new modality.— the tool’s reading
“We set the output dimension of the first feed-forward layer in a transformer layer as 2 d instead of 4 d , a default value in the standard transformer block of Vaswani et al. (2017).”
“Dosovitskiy et al. (2021) apply transformers of Vaswani et al. (2017) for large-scale image recognition and showed that with extremely large-scale datasets (e.g., JFT-300M), ViTs can achieve CNN-level accuracy without image-specific inductive bias.”
“Briefly, ViT divides an image into a sequence of non-overlapping patches and then learns inter-patch representations using multi-headed self-attention in transformers (Vaswani et al., 2017).”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“The computational cost of self-attention in vision transformers is O(N^2d).”
Deformable attention restricts full key attendance to a small set of learned sampling points, specializing the original all-keys attention mechanism for efficiency.— the tool’s reading
“DETR utilizes a simple architecture, by combining convolutional neural networks (CNNs) and Transformer (Vaswani et al., 2017) encoder-decoders.”
“Transformers (Vaswani et al., 2017) involve both self-attention and cross-attention mechanisms.”
“Transformers (Vaswani et al., 2017) are of a network architecture based on attention mechanisms for machine translation.”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“Given a query element (e.g., a target word in the output sentence) and a set of key elements (e.g., source words in the input sentence), the multi-head attention module adaptively aggregates the key contents according to the attention weights that measure the compatibility of query-key pairs.”
GPT-3 applies the Transformer's attention mechanism with specific sparse/dense patterns and fixed hyperparameters, specializing rather than generalizing the original concept.— the tool’s reading
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“We use the same model and architecture as GPT-2 <cit.>, including the modified initialization, pre-normalization, and reversible tokenization described therein, with the exception that we use alternating dense and locally banded sparse attention patterns in the layers of the transformer, similar to the Sparse Transformer <cit.>.”
The newer paper questions whether token-token dot-product attention is necessary, proposing Synthetic Attention as an alternative, directly challenging the earlier mechanism's premise.— the tool’s reading
“The paradigm of learning self-alignments, also known as self-attention, has been largely popularized by Transformer models (Vaswani et al., 2017).”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
“The fundamental role of dot product self-attention is to learn self-alignment, i.e., to determine the relative importance of a single token with respect to all other tokens in the sequence.”
The newer paper generalizes context-vector attention into a query-key-value self-attention mechanism usable across layers and tokens, building on the earlier weighting concept.— the tool’s reading
“The positional information is incorporated as fixed [49] or trainable [16] positional embeddings.”
“We introduce a separate attention mechanism for each decoder layer.”
“Multi-head Self Attention layers (MSA). The attention mechanism is based on a trainable associative memory with (key, value) vector pairs.”
Self-attention generalizes encoder-decoder attention by applying query-key weighting within a single sequence/token set rather than across separate encoder-decoder states, expanding its scope to token mixing.— the tool’s reading
“We introduce a separate attention mechanism for each decoder layer.”
“Whereas in self-attention the weights to aggregate information from other patches are data dependent through queries and keys, in ResMLPthe weights are not data dependent and only based on absolute positions of patches.”
The newer paper generalizes context-vector attention into self-attention with scaled dot-product QKV computations and sparse factorizations, building on multi-hop attention ideas.— the tool’s reading
“Other works have investigated attention with multiple ”hops”, such as (Sukhbaatar et al., 2015) and (Gehring et al., 2017).”
“In addition to the embedding of input symbols, positional embeddings are typically used in Transformers and other location-agnostic architectures to encode the spatial relationships of data (Gehring et al., 2017), (Parmar et al., 2018).”
“We introduce a separate attention mechanism for each decoder layer.”
“A self-attention layer maps a matrix of input embeddings X to an output matrix and is parameterized by a connectivity pattern S = {S_1,..., S_n}, where S_i denotes the set of indices of the input vectors to which the ith output vector attends.”
Self-attention generalizes context-vector weighting into a query-key-value dot-product formulation applicable across layers, extending the earlier encoder-decoder attention concept.— the tool’s reading
“They have been shown to still benefit from position encodings (Gehring et al., 2017), however.”
“Recent approaches to sequence to sequence learning typically leverage recurrence (Sutskever et al., 2014), convolution (Gehring et al., 2017; Kalch-brenner et al., 2016), attention (Vaswani et al., 2017), or a combination of recurrence and attention (Bahdanau et al., 2014; Cho et al., 2014; Lu-ong…”
“, 2014), convolution (Gehring et al., 2017; Kalchbrenner et al., 2016), attention (Vaswani et al.”
“We introduce a separate attention mechanism for each decoder layer.”
“Each attention head operates on an input sequence, x = (x_1, …, x_n) of n elements where x_i ∈ℝ^d_x, and computes a new sequence z = (z_1, …, z_n) of the same length where z_i ∈ℝ^d_z.”
The Transformer generalizes attention into a query-key-value formalism with self-attention and multi-head variants, building beyond ConvS2S's decoder-side context vector attention.— the tool’s reading
“We also experimented with using learned positional embeddings [8] instead, and found that the two versions produced nearly identical results (see Table 3 row (E)).”
“The goal of reducing sequential computation also forms the foundation of the Extended Neural GPU [20], ByteNet [15] and ConvS2S [8], all of which use convolutional neural networks as basic building block, computing hidden representations in parallel for all input and output positions.”
“There are many choices of positional encodings, learned and fixed [8].”
“We introduce a separate attention mechanism for each decoder layer.”
“An attention function can be described as mapping a query and a set of key-value pairs to an output, where the query, keys, values, and output are all vectors. The output is computed as a weighted sum of the values, where the weight assigned to each value is computed by a compatibility function of the query with the corresponding key.”
Transformer generalizes encoder-decoder attention into self-attention with query-key-value dot-product scoring, applying it globally within a sequence rather than just decoder-to-encoder.— the tool’s reading
“Recently, attempts have been made to replace the recurrent networks by full convolution or full attention architectures (Kim, 2014; Gehring et al., 2017; Vaswani et al., 2017b; Shen et al., 2017a).”
“We introduce a separate attention mechanism for each decoder layer.”
“For the self-attention-layer, we adopt the multi-head attention mechanism defined in <cit.> which, for each position in the input, called the query, computes a weighted sum of all positions, or keys, in the input based on the similarity between the query and key as measured by the dot product.”
Attention weighting shifts from graph-neighborhood aggregation to sequence-based query-key-value self-attention, applying the concept in a new modality/domain.— the tool’s reading
“One of the benefits of attention mechanisms is that they allow for dealing with variable sized inputs, focusing on the most relevant parts of the input to make decisions.”
“Each attention head operates on an input sequence, x = (x_1, …, x_n) of n elements where x_i ∈ℝ^d_x, and computes a new sequence z = (z_1, …, z_n) of the same length where z_i ∈ℝ^d_z.”
The attention mechanism moves from weighting graph node neighborhoods to spatially gating CNN feature maps, applying the concept in a new modality/domain.— the tool’s reading
“One of the benefits of attention mechanisms is that they allow for dealing with variable sized inputs, focusing on the most relevant parts of the input to make decisions.”
“Attention coefficients, α_i ∈ [0,1], identify salient image regions and prune feature responses to preserve only the activations relevant to the specific task as shown in Figure <ref>.”
The newer survey generalizes the earlier CNN body-localization attention into a broader adaptive feature-recalibration framework spanning multiple dimensions and tasks.}— the tool’s reading
“[97, 46, 139, 70, 128, 36, 11, 156] , [137, 143, 63, 161, 159, 6, 177, 80] , [67, 180, 10, 23, 24, 163, 155, 151] , [44, 49, 106, 64, 168, 18, 11, 36] , [48, 16, 169, 153, 174, 127, 53, 92] , [89, 21, 5, 134, 65, 171, 2, 109] , [45, 82, 157, 91, 100, 129, 146, 131] , [138, 85, 175, 76, 166, 133, 167, 172] , [41, 1, 173, 74, 47]”
“The proposed network thus takes advantage of this attention mechanism to adaptively locate and align pedestrians within a bounding box.”
“In computer vision, {the} attention mechanism can be regarded as a dynamic weight recalibration process based on the input features.”
Attention shifts from channel-wise feature recalibration in CNNs to token-based query-key-value mechanisms in transformers, a distinct architectural and modality context.— the tool’s reading
“Attention can be interpreted as a means of biasing the allocation of available computational resources towards the most informative components of a signal <cit.>.”
“Multi-head Self Attention layers (MSA). The attention mechanism is based on a trainable associative memory with (key, value) vector pairs.”
The newer paper carries channel-wise SE-style attention from CNN feature recalibration into the Transformer token-based multimodal architecture, adapting it to a new modality/framework.— the tool’s reading
“Inspired by squeeze-and-excitation (SE) network for CNNs [16], we propose to explore channel-wise attention for transformers.”
“Attention can be interpreted as a means of biasing the allocation of available computational resources towards the most informative components of a signal <cit.>.”
“The scaled dot-product attention is applied on Q,K,V: Attention(Q,K,V) = softmax(QK^T/√(d_k))V.”
CutMix paper positions itself as an alternative, data-level solution achieving better results without architectural attention modules like SE, implicitly contesting their necessity.— the tool’s reading
“to architectural improvements (e.g. greater depth or additional modules). We observe that CutMix improves the performance by +2.08% while increased depth (ResNet-50 !ResNet-152) boosts +1:99% and SE [14] and GE [13] boosts +1:56% and +1:80%, respectively. The improvement due to CutMix is more impressive, since it does not require additional parameters or mor…”
“t [33], and Batch Normalization [17] are widely used to train more generalizable deep networks. Recently, methods adding noises to internal features [16,7,44] or adding extra path to the architecture [14,13] have been proposed. CutMix is complementary to the above methods because it operates on the data level, without changing internal representations or arc…”
“x can avoid overfitting problem and achieves lower test errors than the baseline at the end of training. Model # Params Top-1 Err (%) Top-5 Err (%) ResNet-152* 60.3 M 21.69 5.94 ResNet-101 + SE Layer* [14] 49.4 M 20.94 5.50 ResNet-101 + GE Layer* [13] 58.4 M 20.74 5.29 ResNet-50 + SE Layer* [14] 28.1 M 22.12 5.99 ResNet-50 + GE Layer* [13] 33.7 M 21.88 5.80 R…”
“Attention can be interpreted as a means of biasing the allocation of available computational resources towards the most informative components of a signal <cit.>.”
“They have proved to be effective for guiding the model to attend on less discriminative parts of objects ( leg as opposed to head of a person), thereby letting the network generalize better and have better object localization capabilities.”
The newer paper positions dynamic pairwise self-attention as distinct from and superior to SE's channel recalibration, framing SE as a mere add-on rather than true self-attention.— the tool’s reading
“While self-attention usually improves the accuracy, they often come with extra computational cost and hence are often regarded as an add-on to the ConvNets, similar to squeeze-and-excitation [42] module.”
“Attention can be interpreted as a means of biasing the allocation of available computational resources towards the most informative components of a signal <cit.>.”
“In comparison, self-attention allows the receptive field to be the entire spatial locations and computes the weights based on the re-normalized pairwise similarity between the pair (x_i, x_j):”
The newer paper contrasts SE's channel-recalibration attention with query-key-value self-attention modeling long-range spatial dependencies, implicitly critiquing its limited scope as a baseline comparison.— the tool’s reading
“, 2017), ResNet-SE (Hu et al., 2018), and EfficientNet (Tan & Le, 2019a)).”
“Attention can be interpreted as a means of biasing the allocation of available computational resources towards the most informative components of a signal <cit.>.”
“The computational cost of self-attention in vision transformers is O(N^2d).”
TransUNet compares against AttnUNet as a baseline, showing CNN-based gating attention under/over-segments, arguing transformer self-attention's global context modeling is superior.— the tool’s reading
“We conduct main experiments on Synapse multi-organ segmentation dataset by comparing our TransUNet with four previous state-of-the-arts: 1) V-Net [10]; 2) DARR [5]; 3) U-Net [13] and 4) AttnUNet [14].”
“It can be seen that: 1) pure CNN-based methods U-Net and AttnUNet are more likely to over-segment or under-segment the organs (e.g., in the second row, the spleen is over-segmented by AttnUNet while under-segmented by UNet), which shows that Transformer-based models, e.g., our TransUNet or R50-ViT-CUP have stronger power to encode global contexts and disting…”
“On the other hand, combining Transformers with CNN, i.e., R50-ViTCUP, outperforms V-Net and DARR but still yield inferior results than pure CNN-based R50-U-Net and R50-AttnUNet.”
“Attention coefficients, α_i ∈ [0,1], identify salient image regions and prune feature responses to preserve only the activations relevant to the specific task as shown in Figure <ref>.”
“Transformers, designed for sequence-to-sequence prediction, have emerged as alternative architectures with innate global self-attention mechanisms, but can result in limited localization abilities due to insufficient low-level details.”
“However, they primarily focus on autoregressive language modeling, while the application of long document transformers to document-level NLP tasks in the transfer learning setting (Dai and Le, 2015; Peters et al., 2018; Howard and Ruder, 2018; Devlin et al., 2019) has remained largely unexplored.”
“For example, see the SNLI experiments in Sec. <ref> where a bi-attention layer follows the biLSTMs, or the coreference resolution experiments where a clustering model is layered on top of the biLSTMs.”
“This success is partly due to the self-attention component which enables the network to capture contextual information from the entire sequence. While powerful, the memory and computational requirements of self-attention grow quadratically with sequence length, making it infeasible (or very expensive) to process long sequences.”
The newer paper generalizes attention from a downstream architectural component into the core, scalable transformer building block via model-parallel multi-head self-attention.— the tool’s reading
“Later work advanced research in this area by learning and transferring neural models that capture contextual representations of words (Melamud et al., 2016; Mc-Cann et al., 2017; Peters et al., 2018; Radford et al., 2017; 2019).”
“…language models on downstream natural language tasks, one can achieve state of the art results as shown in recent work (Devlin et al., 2018; Peters et al., 2018; Howard & Ruder, 2018; Radford et al., 2018; 2017; Ramachandran et al., 2016; Liu et al., 2019b; Dai et al., 2019; Yang et al.,…”
“For example, see the SNLI experiments in Sec. <ref> where a bi-attention layer follows the biLSTMs, or the coreference resolution experiments where a clustering model is layered on top of the biLSTMs.”
“As shown in Figure <ref>b, for the self attention block we exploit inherent parallelism in the multihead attention operation, partitioning the GEMMs associated with key (K), query (Q), and value (V) in a column parallel fashion such that the matrix multiply corresponding to each attention head is done locally on one GPU.”
Attention moves from a generic downstream architectural component in ELMo-based models to the core cross-modal alignment mechanism in a multimodal vision-language transformer.of new domain.— the tool’s reading
“It falls into a line of works (Peters et al., 2018; Radford et al., 2018; 2019) that learn a universal language encoder by pre-training with language modeling objective (i.e., predicting words that are masked out from the input based on the remaining context).”
“For example, see the SNLI experiments in Sec. <ref> where a bi-attention layer follows the biLSTMs, or the coreference resolution experiments where a clustering model is layered on top of the biLSTMs.”
“VisualBERT consists of a stack of Transformer layers that implicitly align elements of an input text and regions in an associated input image with self-attention.”
The newer paper builds pretraining/attention mechanisms further, elevating attention from an ancillary downstream component to the core contextualization mechanism, generalizing prior LM pretraining approaches.— the tool’s reading
“ELMo (Peters et al., 2018) learns two unidirectional LMs based on long short-term memory networks (Hochreiter and Schmidhuber, 1997).”
“Language model (LM) pre-training has substantially advanced the state of the art across a variety of natural language processing tasks (Dai and Le, 2015; Peters et al., 2018; Howard and Ruder, 2018; Radford et al., 2018; Devlin et al., 2018; Baevski et al., 2019).”
“For example, see the SNLI experiments in Sec. <ref> where a bi-attention layer follows the biLSTMs, or the coreference resolution experiments where a clustering model is layered on top of the biLSTMs.”
“In each Transformer block, multiple self-attention heads are used to aggregate the output vectors of the previous layer.”
The citation is only contextual (pretraining lineage), while attention shifts from a peripheral downstream component in ELMo-era work to the core Transformer mechanism, reflecting migration into a new architectural role rather than direct extension.— the tool’s reading
“Pre-trained Language Models Unsupervised pre-training of language models (Peters et al., 2018; Howard & Ruder, 2018; Radford et al., 2018; Devlin et al., 2018; Baevski et al., 2019; Song et al., 2019; Dong et al., 2019; Yang et al., 2019; Joshi et al., 2019; Liu et al., 2019; Lewis et al., 2019a;…”
“Unsupervised pre-training of language models (Peters et al., 2018; Howard & Ruder, 2018; Radford et al., 2018; Devlin et al., 2018; Baevski et al., 2019; Song et al., 2019; Dong et al., 2019; Yang et al., 2019; Joshi et al., 2019; Liu et al., 2019; Lewis et al., 2019; Raffel et al., 2019) has achieved significant improvements for a wide range of NLP tasks.”
“Early methods for pre-training (Peters et al., 2018; Radford et al., 2018) were based on standard language models.”
“For example, see the SNLI experiments in Sec. <ref> where a bi-attention layer follows the biLSTMs, or the coreference resolution experiments where a clustering model is layered on top of the biLSTMs.”
“𝐀_l,a = (𝐐_l,a𝐊_l,a^⊺/√(d_k)) 𝐀𝐎_l,a = 𝐀_l,a𝐕_l,a”
○ The check ran against the text this system pulled out of the papers and could not find one of these quotes, so this relationship is shown as inferred, never as verified.
The newer paper shifts from attention as an auxiliary component in RNN-based ELMo models to attention as the core mechanism in a new Transformer-based architecture paradigm.— the tool’s reading
“Early results on transfer learning for NLP leveraged recurrent neural networks [Peters et al., 2018; Howard and Ruder, 2018], but it has recently become more common to use models based on the “Transformer” architecture [Vaswani et al., 2017].”
“We include the language modeling objective due to its historic use as a pre-training objective [Dai and Le, 2015; Ramachandran et al., 2016; Howard and Ruder, 2018; Radford et al., 2018; Peters et al., 2018] as well as its natural fit for the language model architectures we consider.”
“Early results on transfer learning for NLP leveraged recurrent neural networks [Peters et al., 2018; Howard and Ruder, 2018], but it has recently become more common to use models based on the “Transformer” architecture [Vaswani et al.”
“For example, see the SNLI experiments in Sec. <ref> where a bi-attention layer follows the biLSTMs, or the coreference resolution experiments where a clustering model is layered on top of the biLSTMs.”
“Self-attention is a variant of attention <cit.> that processes a sequence by replacing each element by a weighted average of the rest of the sequence.”
The newer paper generalizes scaled dot-product attention with LSH-based approximation to reduce complexity, building on the earlier local-attention restriction for scalability.— the tool’s reading
“Up to 11 thousand tokens of text in a single example were processed in (Liu et al., 2018) and when processing other modalities, like music (Huang et al., 2018) and images (Parmar et al., 2018), even longer sequences are commonplace.”
“The Transformer model introduced in (Vaswani et al., 2017) has been used widely in natural language tasks and further extended to model diverse data such as music scores (Huang et al., 2018), and images (Parmar et al., 2018; Ramachandran et al., 2019).”
“Each self-attention layer computes a d-dimensional representation for each position, that is, each channel of each pixel. To recompute the representation for a given position, it first compares the position's current representation to other positions' representations, obtaining an attention distribution over the other positions. This distribution is then use…”
“The standard attention used in the Transformer is the scaled dot-product attention <cit.>. The input consists of queries and keys of dimension d_k, and values of dimension d_v. The dot products of the query with all keys are computed, scaled by √(d_k), and a softmax function is applied to obtain the weights on the values.”
The newer paper carries the same self-attention mechanism from image/sequence generation into a new domain—time-series forecasting—while adapting it with convolutional and sparse variants.rec— the tool’s reading
“Several recent works apply it to translation, speech, music and image generation [1, 21, 22, 23].”
“Each self-attention layer computes a d-dimensional representation for each position, that is, each channel of each pixel. To recompute the representation for a given position, it first compares the position's current representation to other positions' representations, obtaining an attention distribution over the other positions. This distribution is then use…”
“After these linear projections, the scaled dot-product attention computes a sequence of vector outputs: 𝐎_h = Attention(𝐐_h, 𝐊_h, 𝐕_h)= softmax(𝐐_h𝐊_h^T/√(d_k)·𝐌)𝐕_h.”
The newer paper generalizes local self-attention back to global self-attention across all patches, extending the earlier restricted mechanism into ViT's encoder.— the tool’s reading
“Parmar et al. (2018) applied the self-attention only in local neighborhoods for each query pixel instead of globally.”
“Each self-attention layer computes a d-dimensional representation for each position, that is, each channel of each pixel. To recompute the representation for a given position, it first compares the position's current representation to other positions' representations, obtaining an attention distribution over the other positions. This distribution is then use…”
“For each element in an input sequence 𝐳∈ℝ^N × D, we compute a weighted sum over all values 𝐯 in the sequence. The attention weights A_ij are based on the pairwise similarity between two elements of the sequence and their respective query 𝐪^i and key 𝐤^j representations.”
The newer paper reframes the same query-key attention mechanism using new terminology, 'data-dependent token mixing,' to contrast with fixed-weight alternatives.— the tool’s reading
“More recently, transformers have emerged as a promising architecture for computer vision [4], [56], [57], [58], [59].”
“Each self-attention layer computes a d-dimensional representation for each position, that is, each channel of each pixel. To recompute the representation for a given position, it first compares the position's current representation to other positions' representations, obtaining an attention distribution over the other positions. This distribution is then use…”
“Whereas in self-attention the weights to aggregate information from other patches are data dependent through queries and keys, in ResMLPthe weights are not data dependent and only based on absolute positions of patches.”
The newer paper generalizes local, position-restricted self-attention to dense, full-image relation aggregation while borrowing the positional encoding scheme from the earlier work.— the tool’s reading
“We construct P with sine and cosine functions by following the methods proposed in self-attention [15] and imagetransformer [12], where pi represents the position feature associated with xi.”
“Each self-attention layer computes a d-dimensional representation for each position, that is, each channel of each pixel. To recompute the representation for a given position, it first compares the position's current representation to other positions' representations, obtaining an attention distribution over the other positions. This distribution is then use…”
“The self-attention scheme <cit.> calculates the context at one position as a aggregation of all positions in a sentence (at the encoder stage).”
The newer paper generalizes local self-attention into a broader visual attention framework combining spatial tokenization and transformer-based token relation, building on the earlier restricted mechanism.— the tool’s reading
“[18, 13, 21, 17, 15] on the other hand restrict receptive field of self-attention and use it in a convolutional manner.”
“Each self-attention layer computes a d-dimensional representation for each position, that is, each channel of each pixel. To recompute the representation for a given position, it first compares the position's current representation to other positions' representations, obtaining an attention distribution over the other positions. This distribution is then use…”
“Critically, our Visual Transformer operates in a semantic token space, judiciously attending to different image parts based on context.”
Deformable attention restricts full key aggregation to a small set of learned sampling points, narrowing the earlier local-attention mechanism for greater efficiency.— the tool’s reading
“In the image domain, the designs of efficient attention mechanism (e.g., Parmar et al. (2018) 2019) admit such approaches are much slower in implementation than traditional convolution with the same FLOPs (at least 3 × slower), due to the intrinsic limitation in memory access patterns.”
“Most works (Liu et al., 2018a; Parmar et al., 2018; Child et al., 2019; Huang et al., 2019; Ho et al., 2019; Hu et al., 2019; Parmar et al., 2019; Qiu et al., 2019; Beltagy et al., 2020; Ainslie et al., 2020; Zaheer et al., 2020) follow this paradigm.”
“Each self-attention layer computes a d-dimensional representation for each position, that is, each channel of each pixel. To recompute the representation for a given position, it first compares the position's current representation to other positions' representations, obtaining an attention distribution over the other positions. This distribution is then use…”
“Given a query element (e.g., a target word in the output sentence) and a set of key elements (e.g., source words in the input sentence), the multi-head attention module adaptively aggregates the key contents according to the attention weights that measure the compatibility of query-key pairs.”
The weighted-item-aggregation attention mechanism is carried from user-item recommendation profiles into graph-structured neighbor aggregation within a knowledge graph context.}— the tool’s reading
“The original idea of attention is that different parts of a model can contribute (i.e., attend) differently for the final prediction <cit.>.”
“employs the neural attention mechanism <cit.> to learn the weight of each neighbor during a propagation, such that the attention weights of cascaded propagations can reveal the importance of a high-order connectivity.”
The survey generalizes self-attention's dense relation aggregation into a broader unifying framework of adaptive feature recalibration across multiple dimensions and tasks.— the tool’s reading
“[97, 46, 139, 70, 128, 36, 11, 156] , [137, 143, 63, 161, 159, 6, 177, 80] , [67, 180, 10, 23, 24, 163, 155, 151] , [44, 49, 106, 64, 168, 18, 11, 36] , [48, 16, 169, 153, 174, 127, 53, 92] , [89, 21, 5, 134, 65, 171, 2, 109] , [45, 82, 157, 91, 100, 129, 146, 131] , [138, 85, 175, 76, 166, 133, 167, 172] , [41, 1, 173, 74, 47]”
“segmentation [156, 40], face recognition [145, 126], person re-identification [78, 14], action recognition [128, 37], few-show learning [103, 58], medical image processing [99, 47], image generation [46, 159], pose estimation [27], super resolution [30, 164], 3D vision [137, 48], and multi-modal task [116, 141].”
“Self-attention is a powerful tool to model global information and is useful in many visual tasks [156, 137, 143, 63, 161, 159, 6, 177, 80].”
“The self-attention scheme <cit.> calculates the context at one position as a aggregation of all positions in a sentence (at the encoder stage).”
“In computer vision, {the} attention mechanism can be regarded as a dynamic weight recalibration process based on the input features.”
The newer paper moves self-attention from dense pixel-relation aggregation in segmentation-specific modules into the Transformer encoder architecture as a general vision backbone mechanism.— the tool’s reading
“After that, researchers focused on improving FCN from different aspects such as: enlarging the receptive field [17–19, 5, 2, 4, 20]; refining the contextual information [21–”
“[43] ResNet-101 IM-1K 80.1 CCNet [41] ResNet-101 IM-1K 81.9 OCNet [21] ResNet-101 IM-1K 80.1 Axial-DeepLab [74] AxiaiResNet-XL IM-1K 79.9 SETR [7] ViT IM-22K 81.0 SETR [7] ViT IM-22K, Coarse 81.”
“The self-attention scheme <cit.> calculates the context at one position as a aggregation of all positions in a sentence (at the encoder stage).”
“Attention(Q, K, V) = Softmax(QK^𝖳/√(d_head))V.”
The newer paper generalizes self-attention into a broader family of feature recalibration mechanisms (channel, spatial, temporal), extending the query-key-value concept to diverse attention forms across vision tasks.— the tool’s reading
“, image classification [5, 6], object detection [7, 8], semantic segmentation [9, 10], face recognition [11, 12], person re-identification [13, 14], action recognition [15, 16], few-shot learning [17, 18], medical image processing [19, 20], image generation [21, 22], pose estimation [23], super resolution [24, 25], 3D vision [26, 27], and multi-modal task [2…”
“The self-attention module calculates response at a position as a weighted sum of the features at all positions, where the weights – or attention vectors – are calculated with only a small computational cost.”
“In computer vision, {the} attention mechanism can be regarded as a dynamic weight recalibration process based on the input features.”
The newer paper reframes Transformer-style attention into CNN feature recalibration across vision modalities, adapting the mechanism to a new domain rather than extending or contesting it directly.ed.— the tool’s reading
“They also explore the behavior of positional embedding and show that relative positional embeddings [161] are suitable.”
“Each attention head operates on an input sequence, x = (x_1, …, x_n) of n elements where x_i ∈ℝ^d_x, and computes a new sequence z = (z_1, …, z_n) of the same length where z_i ∈ℝ^d_z.”
“In computer vision, {the} attention mechanism can be regarded as a dynamic weight recalibration process based on the input features.”
The self-attention mechanism analyzed for syntactic/positional roles in text-only Transformers is carried into a multimodal setting to ground language with image regions.— the tool’s reading
“Syntactic Grounding Given that many have observed that the attention heads of BERT can discover syntactic relationships (Voita et al., 2019; Clark et al., 2019), we also analyze how grounding information is passed through syntactic relationships that VisualBERT may have discovered.”
“The multi-head attention mechanism obtains h (i.e. one per head) different representations of (Q, K, V), computes scaled dot-product attention for each representation, concatenates the results, and projects the concatenation through a feed-forward layer.”
“VisualBERT consists of a stack of Transformer layers that implicitly align elements of an input text and regions in an associated input image with self-attention.”
The newer paper applies standard full multi-head self-attention to image patches, citing axial attention only as an alternative scaling approach it does not adopt, effectively treating full attention as the special case discussed.— the tool’s reading
“An alternative way to scale attention is to apply it in blocks of varying sizes (Weissenborn et al., 2019), in the extreme case only along individual axes (Ho et al., 2019; Wang et al., 2020a).”
“Self-attention is a neural network operation that is able to transform a sequence y_1, …, y_N into a sequence y'_1, …, y'_N, where each y'_i depends on all y_i by way of a single vectorizable computation <cit.>.”
“For each element in an input sequence 𝐳∈ℝ^N × D, we compute a weighted sum over all values 𝐯 in the sequence. The attention weights A_ij are based on the pairwise similarity between two elements of the sequence and their respective query 𝐪^i and key 𝐤^j representations.”
Deformable attention restricts full key attention to a small set of learned sampling points, a special-case efficiency variant analogous to axial attention's fixed-interval restriction.— the tool’s reading
“To compensate, Child et al. (2019); Huang et al. (2019); Ho et al. (2019) attend key elements at fixed intervals to significantly increase the receptive field on keys.”
“Most works (Liu et al., 2018a; Parmar et al., 2018; Child et al., 2019; Huang et al., 2019; Ho et al., 2019; Hu et al., 2019; Parmar et al., 2019; Qiu et al., 2019; Beltagy et al., 2020; Ainslie et al., 2020; Zaheer et al., 2020) follow this paradigm.”
“Self-attention is a neural network operation that is able to transform a sequence y_1, …, y_N into a sequence y'_1, …, y'_N, where each y'_i depends on all y_i by way of a single vectorizable computation <cit.>.”
“Given a query element (e.g., a target word in the output sentence) and a set of key elements (e.g., source words in the input sentence), the multi-head attention module adaptively aggregates the key contents according to the attention weights that measure the compatibility of query-key pairs.”
The two use 'attention' in unrelated senses; newer paper merely cites CutMix as a regularization baseline, not building on its notion of attention, so no real genealogical link exists.— the tool’s reading
“Regularization like Mixup [57] and Cutmix [56] improve performance.”
“They have proved to be effective for guiding the model to attend on less discriminative parts of objects ( leg as opposed to head of a person), thereby letting the network generalize better and have better object localization capabilities.”
“Multi-head Self Attention layers (MSA). The attention mechanism is based on a trainable associative memory with (key, value) vector pairs.”
The informal notion of model focus on image regions is carried into a formal self-attention mechanism in Transformers, a different architectural context and modality of use.— the tool’s reading
“They have proved to be effective for guiding the model to attend on less discriminative parts of objects ( leg as opposed to head of a person), thereby letting the network generalize better and have better object localization capabilities.”
“Whereas in self-attention the weights to aggregate information from other patches are data dependent through queries and keys, in ResMLPthe weights are not data dependent and only based on absolute positions of patches.”
The newer paper cites the earlier one only for its CutMix augmentation, while using an unrelated Transformer self-attention concept, showing the earlier informal 'attention' idea migrating into a different technical context.— the tool’s reading
“We adopt the same data augmentation strategy as that in DeiT [31] including random crop, random clip, Rand-Augment [7], Random Erasing [44], Mixup [42] and CutMix [41].”
“They have proved to be effective for guiding the model to attend on less discriminative parts of objects ( leg as opposed to head of a person), thereby letting the network generalize better and have better object localization capabilities.”
“The scaled dot-product attention is applied on Q,K,V: Attention(Q,K,V) = softmax(QK^T/√(d_k))V.”
The newer paper restricts the same multi-head attention mechanism to a specific engineering context—parallelizing computation across GPUs for model-parallel training—rather than altering the core mechanism itself.— the tool’s reading
“Empirical evidence indicates that larger language models are dramatically more useful for NLP tasks such as article completion, question answering, and natural language inference (Lan et al., 2019; Raffel et al., 2019).”
“Self-attention is a variant of attention <cit.> that processes a sequence by replacing each element by a weighted average of the rest of the sequence.”
“As shown in Figure <ref>b, for the self attention block we exploit inherent parallelism in the multihead attention operation, partitioning the GEMMs associated with key (K), query (Q), and value (V) in a column parallel fashion such that the matrix multiply corresponding to each attention head is done locally on one GPU.”
The newer paper applies the self-attention mechanism across image and text modalities for cross-modal matching, extending it beyond the original single-modality sequence context.— the tool’s reading
“This is at least an order of magnitude smaller than their counterparts in the vision domain, and much smaller than large corpora of text from the internet for NLP pre-training (e.g., Devlin et al. (2019); Radford et al. (2019); Yang et al. (2019); Liu et al. (2019b); Raffel et al. (2020)).”
“Self-attention is a variant of attention <cit.> that processes a sequence by replacing each element by a weighted average of the rest of the sequence.”
“Recently more advanced models emerge with cross-modal attention layers <cit.> and show superior performance in image-text matching tasks. However, they are orders of magnitudes slower and hence impractical for image-text retrieval systems in the real world.”
The newer paper reuses the same self-attention mechanism but adds a novel value-relation component for knowledge distillation, building on the original concept.— the tool’s reading
“…2018; Howard & Ruder, 2018; Radford et al., 2018; Devlin et al., 2018; Baevski et al., 2019; Song et al., 2019; Dong et al., 2019; Yang et al., 2019; Joshi et al., 2019; Liu et al., 2019; Lewis et al., 2019a; Raffel et al., 2019) has achieved significant improvements for a wide range of NLP tasks.”
“Unsupervised pre-training of language models (Peters et al., 2018; Howard & Ruder, 2018; Radford et al., 2018; Devlin et al., 2018; Baevski et al., 2019; Song et al., 2019; Dong et al., 2019; Yang et al., 2019; Joshi et al., 2019; Liu et al., 2019; Lewis et al., 2019; Raffel et al., 2019) has achieved significant improvements for a wide range of NLP tasks.”
“Self-attention is a variant of attention <cit.> that processes a sequence by replacing each element by a weighted average of the rest of the sequence.”
“The attention mechanism <cit.> has been a highly successful neural network component for NLP tasks, which is also crucial for pre-trained LMs.”
GPT-3 applies standard transformer attention but restricts it to specific alternating dense/sparse patterns, a special-case architectural variant rather than a generalization.— the tool’s reading
“Self-attention is a variant of attention <cit.> that processes a sequence by replacing each element by a weighted average of the rest of the sequence.”
“We use the same model and architecture as GPT-2 <cit.>, including the modified initialization, pre-normalization, and reversible tokenization described therein, with the exception that we use alternating dense and locally banded sparse attention patterns in the layers of the transformer, similar to the Sparse Transformer <cit.>.”
Both approximate full attention for efficiency, but LSH attention restricts queries to hash-bucket neighbors, a different special-case sparsification than factorized sparse attention.— the tool’s reading
“OpenAI introduced the sparse Transformer (Child et al., 2019) which exploits a factorized sparse representation of attention.”
“Most notably, this model class has been applied successfully in the self-supervised training of extremely large language models (Devlin et al., 2018; Radford et al., 2019).”
“A self-attention layer maps a matrix of input embeddings X to an output matrix and is parameterized by a connectivity pattern S = {S_1,..., S_n}, where S_i denotes the set of indices of the input vectors to which the ith output vector attends.”
“The standard attention used in the Transformer is the scaled dot-product attention <cit.>. The input consists of queries and keys of dimension d_k, and values of dimension d_v. The dot products of the query with all keys are computed, scaled by √(d_k), and a softmax function is applied to obtain the weights on the values.”
The newer paper carries Transformer self-attention with sparse factorization into the new domain of time-series forecasting, adapting it with convolutional queries/keys.— the tool’s reading
“A self-attention layer maps a matrix of input embeddings X to an output matrix and is parameterized by a connectivity pattern S = {S_1,..., S_n}, where S_i denotes the set of indices of the input vectors to which the ith output vector attends.”
“After these linear projections, the scaled dot-product attention computes a sequence of vector outputs: 𝐎_h = Attention(𝐐_h, 𝐊_h, 𝐕_h)= softmax(𝐐_h𝐊_h^T/√(d_k)·𝐌)𝐕_h.”
The newer paper takes the standard self-attention mechanism and moves it into a new engineering context—model-parallel GPU training—rather than altering its mathematical formulation.— the tool’s reading
“Since the vocabulary size is on the order of tens of thousands of tokens for modern language models (for example, GPT-2 used a vocabulary size of 50,257), it is beneficial to parallelize the output embedding GEMM.”
“To ensure we do not train on any data found in our test sets, we calculate the percentage of test set 8-grams that also appear in our training set as done in previous work (Radford et al., 2019b).”
“To train our model we follow a procedure largely based on the training procedures described in (Radford et al., 2018; 2019b;a) with a few additions.”
“A self-attention layer maps a matrix of input embeddings X to an output matrix and is parameterized by a connectivity pattern S = {S_1,..., S_n}, where S_i denotes the set of indices of the input vectors to which the ith output vector attends.”
“As shown in Figure <ref>b, for the self attention block we exploit inherent parallelism in the multihead attention operation, partitioning the GEMMs associated with key (K), query (Q), and value (V) in a column parallel fashion such that the matrix multiply corresponding to each attention head is done locally on one GPU.”
The newer paper applies standard Transformer self-attention to a new modality (image patches via ViT) rather than the sparse approximation itself, citing it as related prior work in vision applications.— the tool’s reading
“In a different line of work, Sparse Transformers (Child et al., 2019) employ scalable approximations to global self-attention in order to be applicable to images.”
“A self-attention layer maps a matrix of input embeddings X to an output matrix and is parameterized by a connectivity pattern S = {S_1,..., S_n}, where S_i denotes the set of indices of the input vectors to which the ith output vector attends.”
“For each element in an input sequence 𝐳∈ℝ^N × D, we compute a weighted sum over all values 𝐯 in the sequence. The attention weights A_ij are based on the pairwise similarity between two elements of the sequence and their respective query 𝐪^i and key 𝐤^j representations.”
The newer paper reframes attention as data-dependent token mixing mainly to contrast it unfavorably with a simpler fixed-weight linear alternative, implicitly disputing its necessity.— the tool’s reading
“More recently, transformers have emerged as a promising architecture for computer vision [4], [56], [57], [58], [59].”
“A self-attention layer maps a matrix of input embeddings X to an output matrix and is parameterized by a connectivity pattern S = {S_1,..., S_n}, where S_i denotes the set of indices of the input vectors to which the ith output vector attends.”
“Whereas in self-attention the weights to aggregate information from other patches are data dependent through queries and keys, in ResMLPthe weights are not data dependent and only based on absolute positions of patches.”
The newer paper applies self-attention/sparse variants from sequential text/audio domains to dense 2D image pixel relations for semantic segmentation.— the tool’s reading
“The concurrent sparse transformer (Child et al., 2019) also apply the similar mechanism on one dimensional text/audio related tasks that require sequential masked inputs.”
“A self-attention layer maps a matrix of input embeddings X to an output matrix and is parameterized by a connectivity pattern S = {S_1,..., S_n}, where S_i denotes the set of indices of the input vectors to which the ith output vector attends.”
“The self-attention scheme <cit.> calculates the context at one position as a aggregation of all positions in a sentence (at the encoder stage).”
The newer paper restricts full attention over all keys to a small set of learned sampling points, following the fixed-interval sparse attention paradigm the earlier paper established.— the tool’s reading
“To compensate, Child et al. (2019); Huang et al. (2019); Ho et al. (2019) attend key elements at fixed intervals to significantly increase the receptive field on keys.”
“Most works (Liu et al., 2018a; Parmar et al., 2018; Child et al., 2019; Huang et al., 2019; Ho et al., 2019; Hu et al., 2019; Parmar et al., 2019; Qiu et al., 2019; Beltagy et al., 2020; Ainslie et al., 2020; Zaheer et al., 2020) follow this paradigm.”
“A self-attention layer maps a matrix of input embeddings X to an output matrix and is parameterized by a connectivity pattern S = {S_1,..., S_n}, where S_i denotes the set of indices of the input vectors to which the ith output vector attends.”
“Given a query element (e.g., a target word in the output sentence) and a set of key elements (e.g., source words in the input sentence), the multi-head attention module adaptively aggregates the key contents according to the attention weights that measure the compatibility of query-key pairs.”
GPT-3 adopts and applies the earlier sparse attention pattern architecture at larger scale, building directly on its defined mechanism without contesting or renaming it.— the tool’s reading
“A self-attention layer maps a matrix of input embeddings X to an output matrix and is parameterized by a connectivity pattern S = {S_1,..., S_n}, where S_i denotes the set of indices of the input vectors to which the ith output vector attends.”
“We use the same model and architecture as GPT-2 <cit.>, including the modified initialization, pre-normalization, and reversible tokenization described therein, with the exception that we use alternating dense and locally banded sparse attention patterns in the layers of the transformer, similar to the Sparse Transformer <cit.>.”
The newer paper carries self-attention from model-parallel GPU training of language transformers into vision transformers, applying it to image patch dependencies.— the tool’s reading
“First, dedicated CUDA kernels exist for transformers on GPUs, which are used out-of-the-box in ViTs to improve their scalability and efficiency on GPUs (e.g., Shoeybi et al., 2019; Lepikhin et al., 2021).”
“As shown in Figure <ref>b, for the self attention block we exploit inherent parallelism in the multihead attention operation, partitioning the GEMMs associated with key (K), query (Q), and value (V) in a column parallel fashion such that the matrix multiply corresponding to each attention head is done locally on one GPU.”
“The computational cost of self-attention in vision transformers is O(N^2d).”
GPT-3 builds on standard multi-head attention by introducing alternating dense and locally banded sparse attention patterns as an architectural extension.— the tool’s reading
“As shown in Figure <ref>b, for the self attention block we exploit inherent parallelism in the multihead attention operation, partitioning the GEMMs associated with key (K), query (Q), and value (V) in a column parallel fashion such that the matrix multiply corresponding to each attention head is done locally on one GPU.”
“We use the same model and architecture as GPT-2 <cit.>, including the modified initialization, pre-normalization, and reversible tokenization described therein, with the exception that we use alternating dense and locally banded sparse attention patterns in the layers of the transformer, similar to the Sparse Transformer <cit.>.”
The newer paper builds on the same scaled dot-product self-attention mechanism, adding a novel value-relation component for knowledge distillation purposes.— the tool’s reading
“In each Transformer block, multiple self-attention heads are used to aggregate the output vectors of the previous layer.”
“The attention mechanism <cit.> has been a highly successful neural network component for NLP tasks, which is also crucial for pre-trained LMs.”
The newer paper applies Transformer self-attention to pure image patches for classification, moving it from the earlier multimodal text-vision grounding domain into a purely visual modality.— the tool’s reading
“…for object detection (Hu et al., 2018; Carion et al., 2020), video processing (Wang et al., 2018; Sun et al., 2019), image classification (Wu et al., 2020), unsupervised object discovery (Locatello et al., 2020), or unified text-vision tasks (Chen et al., 2020c; Lu et al., 2019; Li et al., 2019).”
“VisualBERT consists of a stack of Transformer layers that implicitly align elements of an input text and regions in an associated input image with self-attention.”
“For each element in an input sequence 𝐳∈ℝ^N × D, we compute a weighted sum over all values 𝐯 in the sequence. The attention weights A_ij are based on the pairwise similarity between two elements of the sequence and their respective query 𝐪^i and key 𝐤^j representations.”
The newer paper reuses self-attention's core QKV mechanism for image classification via distillation, moving it from the multimodal vision-language grounding context into a new domain.— the tool’s reading
“Nevertheless hybrid architectures that combine convnets and transformers, including the self-attention mechanism, have recently exhibited competitive results in image classification [53], detection [6, 26], video processing [42, 50], unsupervised object discovery [33], and unified text-vision tasks [8, 31, 35].”
“VisualBERT consists of a stack of Transformer layers that implicitly align elements of an input text and regions in an associated input image with self-attention.”
“Multi-head Self Attention layers (MSA). The attention mechanism is based on a trainable associative memory with (key, value) vector pairs.”
The newer paper restricts standard self-attention to a linear-complexity pooled variant to address quadratic cost, specializing rather than generalizing the original mechanism.— the tool’s reading
“The growth rate of GFLOPs: ViT-Small/16 [8]>ViT-Small/32 [8]>PVTv1Small [33]>ResNet50 [14]>PVTv2-B2-Li (ours).”
“Compared to original feed-forward network (FFN) [8], our CFFN contains a zero-padding convolutional layer.”
“For example, Vision Transformer (ViT) [8] first proves that a pure Transformer can archive state-of-the-art performance in image classification.”
“For each element in an input sequence 𝐳∈ℝ^N × D, we compute a weighted sum over all values 𝐯 in the sequence. The attention weights A_ij are based on the pairwise similarity between two elements of the sequence and their respective query 𝐪^i and key 𝐤^j representations.”
“Different from SRA <cit.> which uses convolutions for spatial reduction, linear SRA uses average pooling to reduce the spatial dimension (i.e., h× w) to a fixed size (i.e., P× P) before the attention operation.”
The newer survey reframes attention as feature recalibration in CNNs, treating ViT's self-attention as one specific phase/method within a broader taxonomy rather than generalizing it.dimensional— the tool’s reading
“ViT [34] ICLR2021 Cls divide the feature map into multiple groups > Dot product between query and key -> softmax.”
“Phase 4 used self-attention methods [15], [33], [34].”
“ViT demonstrates that a pure attention-based network can achieve better results than a convolutional neural network especially for large datasets such as JFT-300 [164] and ImageNet-21K [165].”
“For each element in an input sequence 𝐳∈ℝ^N × D, we compute a weighted sum over all values 𝐯 in the sequence. The attention weights A_ij are based on the pairwise similarity between two elements of the sequence and their respective query 𝐪^i and key 𝐤^j representations.”
“In computer vision, {the} attention mechanism can be regarded as a dynamic weight recalibration process based on the input features.”
DeiT adopts ViT's identical scaled dot-product multi-head self-attention mechanism unchanged, but extends its training with distillation tokens and data-efficient strategies.— the tool’s reading
“By default and similar to ViT [15] we train DeiT models at resolution 224× 224 and we fine-tune at resolution 384×384.”
“The parameters of ViT-B (and therefore of DeiT-B) are fixed as D = 768, h = 12 and d = D/h = 64.”
“Nevertheless, according to this study [15], a pre-training phase on a large volume of curated data is required for the learned transformer to be effective.”
“For each element in an input sequence 𝐳∈ℝ^N × D, we compute a weighted sum over all values 𝐯 in the sequence. The attention weights A_ij are based on the pairwise similarity between two elements of the sequence and their respective query 𝐪^i and key 𝐤^j representations.”
“Multi-head Self Attention layers (MSA). The attention mechanism is based on a trainable associative memory with (key, value) vector pairs.”
The newer paper reframes self-attention as data-dependent token mixing and replaces it with a fixed linear layer, arguing attention is unnecessary for competitive performance.— the tool’s reading
“has been fueled by better training schemes [3], [4], and, in this paper, we push this trend further by showing that a purely multi-layer perceptron (MLP) based architecture, called Residual Multi-Layer Perceptrons (ResMLP), is competitive on image classi-”
“The ResMLP architecture is strongly inspired by the vision transformers (ViT) [3], yet it is much simpler in several ways: we replace the self-attention sublayer by a linear layer, resulting in an architecture with only linear layers and GELU non-linearity [5].”
“Our architecture is closely related to the ViT model [3].”
“For each element in an input sequence 𝐳∈ℝ^N × D, we compute a weighted sum over all values 𝐯 in the sequence. The attention weights A_ij are based on the pairwise similarity between two elements of the sequence and their respective query 𝐪^i and key 𝐤^j representations.”
“Whereas in self-attention the weights to aggregate information from other patches are data dependent through queries and keys, in ResMLPthe weights are not data dependent and only based on absolute positions of patches.”
The newer paper builds on ViT's self-attention by introducing an efficient variant with sequence reduction and analyzing local/global attention behavior for segmentation.— the tool’s reading
“Similar to the original patch embedding in ViT [6], this operation can be implemented by “nn.”
“We select 2 representative Transformer encoders, ViT [6] and Swin [9] and compare with our MiT encoder.”
“ViT [6] is the first work to prove that a pure Transformer can achieve state-of-the-art performance in image classification.”
“For each element in an input sequence 𝐳∈ℝ^N × D, we compute a weighted sum over all values 𝐯 in the sequence. The attention weights A_ij are based on the pairwise similarity between two elements of the sequence and their respective query 𝐪^i and key 𝐤^j representations.”
“Attention(Q, K, V) = Softmax(QK^𝖳/√(d_head))V.”
The newer paper builds on ViT's standard self-attention by adding a nested inner/outer attention structure for visual words and sentences, generalizing the mechanism.— the tool’s reading
“The recent transformerbased models like ViT [9] and DeiT [31] are compared.”
“ViT [9] just utilizes a standard transformer to process the sequence of patches which corrupts the local structure of a patch, as shown in Fig.”
“develop the ViT [9], which paves the way for transferring the success of transformer based NLP models.”
“For each element in an input sequence 𝐳∈ℝ^N × D, we compute a weighted sum over all values 𝐯 in the sequence. The attention weights A_ij are based on the pairwise similarity between two elements of the sequence and their respective query 𝐪^i and key 𝐤^j representations.”
“The scaled dot-product attention is applied on Q,K,V: Attention(Q,K,V) = softmax(QK^T/√(d_k))V.”
Self-attention within a single modality (image patches) is carried into a new cross-modal setting, applying attention between image and text representations.— the tool’s reading
“For each element in an input sequence 𝐳∈ℝ^N × D, we compute a weighted sum over all values 𝐯 in the sequence. The attention weights A_ij are based on the pairwise similarity between two elements of the sequence and their respective query 𝐪^i and key 𝐤^j representations.”
“Recently more advanced models emerge with cross-modal attention layers <cit.> and show superior performance in image-text matching tasks. However, they are orders of magnitudes slower and hence impractical for image-text retrieval systems in the real world.”
The newer paper keeps the same self-attention mechanism but modifies the Q/K/V projection with convolution, building on ViT's attention formulation rather than contesting or narrowing it.— the tool’s reading
“We further transfer the models pretrained on ImageNet-22k to downstream tasks, including CIFAR-10/100 [19], Oxford-IIIT-Pet [23], Oxford-IIIT-Flower [22], following [18, 11].”
“Figure 3 (a) shows the original position-wise linear projection used in ViT [11] and Figure 3 (b) shows our proposed s × s Convolutional Projection .”
“When we replace the Convolutional Token Embed-ding with non-overlapping Patch Embedding [11], the performance drops 0.8% (Table 6a v.s. Table 6d).”
“For each element in an input sequence 𝐳∈ℝ^N × D, we compute a weighted sum over all values 𝐯 in the sequence. The attention weights A_ij are based on the pairwise similarity between two elements of the sequence and their respective query 𝐪^i and key 𝐤^j representations.”
“The goal of the proposed Convolutional Projection layer is to achieve additional modeling of local spatial context, and to provide efficiency benefits by permitting the undersampling of K and V matrices.”
The newer paper builds on transformer self-attention, generalizing it into a broader vision framework combining spatial tokenization and feature recalibration.— the tool’s reading
“For each element in an input sequence 𝐳∈ℝ^N × D, we compute a weighted sum over all values 𝐯 in the sequence. The attention weights A_ij are based on the pairwise similarity between two elements of the sequence and their respective query 𝐪^i and key 𝐤^j representations.”
“Critically, our Visual Transformer operates in a semantic token space, judiciously attending to different image parts based on context.”
The newer paper adopts ViT's self-attention mechanism unchanged but applies it within a medical image segmentation architecture, carrying the idea into a new task domain.— the tool’s reading
“Following [4], we first perform tokenization by re-”
“For pure Transformer-based encoder, we simply adopt ViT [4] with 12 Transformer layers.”
“More recently, attempts have also matched or even exceeded stateof-the-art performances for various image recognition tasks [4, 19].”
“For each element in an input sequence 𝐳∈ℝ^N × D, we compute a weighted sum over all values 𝐯 in the sequence. The attention weights A_ij are based on the pairwise similarity between two elements of the sequence and their respective query 𝐪^i and key 𝐤^j representations.”
“Transformers, designed for sequence-to-sequence prediction, have emerged as alternative architectures with innate global self-attention mechanisms, but can result in limited localization abilities due to insufficient low-level details.”
The newer paper builds on ViT's self-attention formulation, generalizing/contrasting it with convolution to design a hybrid architecture combining both mechanisms.— the tool’s reading
“More recently, Vision Transformer (ViT) [13] has shown that with almost1 only vanilla Transformer layers, one could obtain reasonable performance on ImageNet-1K [14] alone.”
“Recently, ViT [13] applies a vanilla Transformer to ImageNet classification, and achieves impressive results after pre-training on a large-scale JFT dataset.”
“Therefore, compared to models that simply use an off-the-shelf ConvNet as the stem layer, such as ResNet-ViT [13], CoAtNet also scales the Convolution stage (S2) when the overall size increases.”
“For each element in an input sequence 𝐳∈ℝ^N × D, we compute a weighted sum over all values 𝐯 in the sequence. The attention weights A_ij are based on the pairwise similarity between two elements of the sequence and their respective query 𝐪^i and key 𝐤^j representations.”
“In comparison, self-attention allows the receptive field to be the entire spatial locations and computes the weights based on the re-normalized pairwise similarity between the pair (x_i, x_j):”
The newer paper focuses specifically on self-attention's computational cost as a design constraint for light-weight models, narrowing the earlier general ViT attention analysis to efficiency concerns.— the tool’s reading
“Self-attention-based models, especially vision transformers (ViTs; Figure 1a; Dosovitskiy et al., 2021), are an alternative to convolutional neural networks (CNNs) to learn visual representations.”
“For instance, DPT (Dosovitskiy et al., 2021), a ViT-based network, learns 6 × more parameters as compared to DeepLabv3 (Chen et al., 2017), a CNN-based network, to deliver similar segmentation performance (DPT vs. DeepLabv3: 345 M vs. 59 M).”
“Unlike CNNs, ViT models are sensitive to weight decay (Dosovitskiy et al., 2021; Touvron et al., 2021a; Xiao et al., 2021).”
“For each element in an input sequence 𝐳∈ℝ^N × D, we compute a weighted sum over all values 𝐯 in the sequence. The attention weights A_ij are based on the pairwise similarity between two elements of the sequence and their respective query 𝐪^i and key 𝐤^j representations.”
“The computational cost of self-attention in vision transformers is O(N^2d).”
The newer paper restricts attention to a small set of learned sampling points instead of the earlier low-rank global approximation, narrowing scope for efficiency.— the tool’s reading
“Wang et al. (2020) reduces the number of key elements through a linear projection on the size dimension instead of the channel dimension.”
“Here, each token's representation is updated by attending to all other tokens in the previous layer. This operation is key for retaining long-term information, giving Transformers the edge over recurrent models on long sequences. However, attending to all tokens at each layer incurs a complexity of O(n^2) with respect to sequence length.”
“Given a query element (e.g., a target word in the output sentence) and a set of key elements (e.g., source words in the input sentence), the multi-head attention module adaptively aggregates the key contents according to the attention weights that measure the compatibility of query-key pairs.”
The newer paper restricts the general adaptive-aggregation notion of attention to a narrower recalibration/reweighting mechanism over feature dimensions in CNNs, rather than full query-key aggregation.— the tool’s reading
“Given a query element (e.g., a target word in the output sentence) and a set of key elements (e.g., source words in the input sentence), the multi-head attention module adaptively aggregates the key contents according to the attention weights that measure the compatibility of query-key pairs.”
“In computer vision, {the} attention mechanism can be regarded as a dynamic weight recalibration process based on the input features.”
Newer paper builds on standard Transformer self-attention, adding a nested inner/outer structure over multimodal tokens rather than the deformable sampling restriction of the earlier paper.— the tool’s reading
“Nowadays, transformer architectures have been used in a growing number of computer vision tasks [10] such as image recognition [6, 40, 29], object detection [46], and segmentation [43, 38].”
“Given a query element (e.g., a target word in the output sentence) and a set of key elements (e.g., source words in the input sentence), the multi-head attention module adaptively aggregates the key contents according to the attention weights that measure the compatibility of query-key pairs.”
“The scaled dot-product attention is applied on Q,K,V: Attention(Q,K,V) = softmax(QK^T/√(d_k))V.”
The newer paper reverts to standard global scaled dot-product self-attention, a special/simpler case relative to the earlier deformable sparse-sampling attention variant, while focusing changes elsewhere on projections.— the tool’s reading
“…a viable alternative to the convolutional neural networks (CNNs) in visual recognition tasks, such as classification [11, 30], object detection [3, 45, 43, 8, 28], segmentation [33, 36], image enhancement [4, 40], image generation [24], video processing [42, 44] and 3D point cloud processing [12].”
“Given a query element (e.g., a target word in the output sentence) and a set of key elements (e.g., source words in the input sentence), the multi-head attention module adaptively aggregates the key contents according to the attention weights that measure the compatibility of query-key pairs.”
“The goal of the proposed Convolutional Projection layer is to achieve additional modeling of local spatial context, and to provide efficiency benefits by permitting the undersampling of K and V matrices.”
The newer paper carries the attention concept from NLP transformer architectures into computer vision, applying it as feature recalibration in CNNs.— the tool’s reading
“Large-scale attention-based pre-trained models have had great success in natural language processing [85], [179].”
“We use the same model and architecture as GPT-2 <cit.>, including the modified initialization, pre-normalization, and reversible tokenization described therein, with the exception that we use alternating dense and locally banded sparse attention patterns in the layers of the transformer, similar to the Sparse Transformer <cit.>.”
“In computer vision, {the} attention mechanism can be regarded as a dynamic weight recalibration process based on the input features.”
The newer paper applies the same self-attention/transformer mechanism, originally used for language (GPT-3), to image patches, extending it into vision.— the tool’s reading
“…models are often pre-trained on large corpora and then fine-tuned for the task at hand: BERT (Devlin et al., 2019) uses a denoising self-supervised pre-training task, while the GPT line of work uses language modeling as its pre-training task (Radford et al., 2018; 2019; Brown et al., 2020).”
“Thanks to Transformers’ computational efficiency and scalability, it has become possible to train models of unprecedented size, with over 100B parameters (Brown et al., 2020; Lepikhin et al., 2020).”
“We use the same model and architecture as GPT-2 <cit.>, including the modified initialization, pre-normalization, and reversible tokenization described therein, with the exception that we use alternating dense and locally banded sparse attention patterns in the layers of the transformer, similar to the Sparse Transformer <cit.>.”
“For each element in an input sequence 𝐳∈ℝ^N × D, we compute a weighted sum over all values 𝐯 in the sequence. The attention weights A_ij are based on the pairwise similarity between two elements of the sequence and their respective query 𝐪^i and key 𝐤^j representations.”
The newer paper carries standard transformer self-attention from NLP (GPT-3) into a multimodal/visual domain with nested inner/outer attention structure.— the tool’s reading
“, the famous BERT [8] and GPT-3 [2] models.”
“Transformer is widely used in the field of natural language processing (NLP), e.g., the famous BERT [8] and GPT-3 [2] models.”
“We use the same model and architecture as GPT-2 <cit.>, including the modified initialization, pre-normalization, and reversible tokenization described therein, with the exception that we use alternating dense and locally banded sparse attention patterns in the layers of the transformer, similar to the Sparse Transformer <cit.>.”
“The scaled dot-product attention is applied on Q,K,V: Attention(Q,K,V) = softmax(QK^T/√(d_k))V.”
The newer paper formalizes standard transformer attention as a low-rank scaled dot-product mechanism, restricting the general architectural notion to a specific mathematical characterization for efficiency gains.— the tool’s reading
“For example, the original BERT-Large model (Devlin et al., 2019) takes four days to train on 16 Cloud TPUs, and the recent GPT-3 (Brown et al., 2020) consumed orders of magnitude more petaflops / day to train compared to its predecessor, GPT-2 (Radford et al., 2019).”
“Over the last couple of years, the number of parameters in state-of-the-art NLP transformers has grown drastically, from the original 3 billion introduced in BERT-Large to 175 billion in GPT-3 (Brown et al., 2020).”
“We use the same model and architecture as GPT-2 <cit.>, including the modified initialization, pre-normalization, and reversible tokenization described therein, with the exception that we use alternating dense and locally banded sparse attention patterns in the layers of the transformer, similar to the Sparse Transformer <cit.>.”
“Here, each token's representation is updated by attending to all other tokens in the previous layer. This operation is key for retaining long-term information, giving Transformers the edge over recurrent models on long sequences. However, attending to all tokens at each layer incurs a complexity of O(n^2) with respect to sequence length.”
The newer paper carries the transformer self-attention mechanism from its NLP origins into computer vision, framing it against convolution's static weights.markdown.— the tool’s reading
“Meanwhile, with the success of self-attention models like Transformers [6] in natural language processing [7, 8], many previous works have attempted to bring in the power of attention into computer vision [9, 10, 11, 12].”
“We use the same model and architecture as GPT-2 <cit.>, including the modified initialization, pre-normalization, and reversible tokenization described therein, with the exception that we use alternating dense and locally banded sparse attention patterns in the layers of the transformer, similar to the Sparse Transformer <cit.>.”
“In comparison, self-attention allows the receptive field to be the entire spatial locations and computes the weights based on the re-normalized pairwise similarity between the pair (x_i, x_j):”
Deformable attention restricts attention to a small set of learned sampling points, similar to how Longformer restricts attention to local/global patterns, both limiting full quadratic attention scope.— the tool’s reading
“Beltagy et al. (2020); Ainslie et al. (2020); Zaheer et al. (2020) allow a small number of special tokens having access to all key elements.”
“Most works (Liu et al., 2018a; Parmar et al., 2018; Child et al., 2019; Huang et al., 2019; Ho et al., 2019; Hu et al., 2019; Parmar et al., 2019; Qiu et al., 2019; Beltagy et al., 2020; Ainslie et al., 2020; Zaheer et al., 2020) follow this paradigm.”
“To address this challenge, we sparsify the full self-attention matrix according to an “attention pattern” specifying pairs of input locations attending to one another.”
“Given a query element (e.g., a target word in the output sentence) and a set of key elements (e.g., source words in the input sentence), the multi-head attention module adaptively aggregates the key contents according to the attention weights that measure the compatibility of query-key pairs.”
The newer paper restricts the general Transformer self-attention distillation idea to a specific CNN feature-map attention type used for spatial highlighting, a narrower domain application.— the tool’s reading
“To address this problem, several lightweight variations of BERT (called BERT model compression) using knowledge distillation are proposed (Sun et al. 2019; Jiao et al. 2020; Tang et al. 2019; Sanh et al. 2019; Wang et al. 2020a; Liu et al. 2020b; Fu et al. 2021).”
“…Kong et al. 2019; Yan et al. 2019; Ge et al. 2018; Wang et al. 2018b, 2019c; Duong et al. 2019; Wu et al. 2020; Wang et al. 2017; Zhang et al. 2020b; Wang et al. 2020b), image/video segmentation (He et al. 2019; Mullapudi et al. 2019; Dou et al. 2020; Liu et al. 2019h; Siam et al. 2019; Hou et…”
“…et al. 2016), Existing KD-based face recognition methods focus on not only efficient deployment but also competitive recognition accuracy (Luo et al. 2016; Kong et al. 2019; Yan et al. 2019; Ge et al. 2018; Wang et al. 2018b, 2019c; Duong et al. 2019; Wang et al. 2017, 2020b; Zhang et al. 2020b).”
“The attention mechanism <cit.> has been a highly successful neural network component for NLP tasks, which is also crucial for pre-trained LMs.”
“To be specific, <cit.> derived an “attention map" from the original feature maps to express knowledge.”
Both address quadratic self-attention cost with an efficient variant; Longformer generalizes the idea with a different linear-scaling sparsification approach building on prior efficient-attention work.— the tool’s reading
“06 Reformer (Kitaev et al., 2020) - - 1.”
“For large models, given how expensive these experiments are, and following recent work (Kitaev et al., 2020; Rae et al., 2020), we are only 4https://github.com/NVIDIA/apex 5We found that using fp16 in attention operation results in floating point overflow and NaNs in later stages of…”
“experiments are, and following recent work (Kitaev et al., 2020; Rae et al., 2020), we are only evaluating on enwik8.”
“The standard attention used in the Transformer is the scaled dot-product attention <cit.>. The input consists of queries and keys of dimension d_k, and values of dimension d_v. The dot products of the query with all keys are computed, scaled by √(d_k), and a softmax function is applied to obtain the weights on the values.”
“To address this challenge, we sparsify the full self-attention matrix according to an “attention pattern” specifying pairs of input locations attending to one another.”
The newer paper (Linformer) critiques Reformer's LSH attention efficiency claims and offers an alternative low-rank linear approximation as superior.— the tool’s reading
“More recently, the Reformer (Kitaev et al., 2020) used locally-sensitive hashing (LSH) to reduce the self-attention complexity to O(n log(n)).”
“Furthermore, the Reformer’s multi-round hashing approach actually increases the number of sequential operations, which further undermines their final efficiency gains.”
“However, in practice, the Reformer’s efficiency gains only appear on sequences with length > 2048 (Figure 5 in Kitaev et al. (2020)).”
“The standard attention used in the Transformer is the scaled dot-product attention <cit.>. The input consists of queries and keys of dimension d_k, and values of dimension d_v. The dot products of the query with all keys are computed, scaled by √(d_k), and a softmax function is applied to obtain the weights on the values.”
“Here, each token's representation is updated by attending to all other tokens in the previous layer. This operation is key for retaining long-term information, giving Transformers the edge over recurrent models on long sequences. However, attending to all tokens at each layer incurs a complexity of O(n^2) with respect to sequence length.”
The newer paper questions whether token-token dot-product attention (as in LSH attention) is even necessary, proposing Synthetic Attention as an alternative.— the tool’s reading
“For example, recent studies have investigated improving the layer’s overall efficiency via sparsification and reducing the complexity of computing the alignment matrix (Child et al., 2019; Kitaev et al., 2020; Huang et al., 2018; Tay et al., 2020; Beltagy et al., 2020).”
“The standard attention used in the Transformer is the scaled dot-product attention <cit.>. The input consists of queries and keys of dimension d_k, and values of dimension d_v. The dot products of the query with all keys are computed, scaled by √(d_k), and a softmax function is applied to obtain the weights on the values.”
“The fundamental role of dot product self-attention is to learn self-alignment, i.e., to determine the relative importance of a single token with respect to all other tokens in the sequence.”
The newer paper cites Synthesizer's finding that token-token dot-product interaction can be replaced, then contrasts its own fixed-weight approach, disputing necessity of query-key interaction.— the tool’s reading
“Notably, Synthesizer [54] shows that dot-product self-attention can be replaced by a feedforward network, with competitive performance on sentence representation benchmarks.”
“Notably, Synthesizer [62] shows that dot-product self-attention can be replaced by a feedforward network, with competitive performance on sentence representation benchmarks.”
“As opposed to our work, Synthesizer does use data dependent weights, but in contrast to transformers the weights are determined from the queries only.”
“The fundamental role of dot product self-attention is to learn self-alignment, i.e., to determine the relative importance of a single token with respect to all other tokens in the sequence.”
“Whereas in self-attention the weights to aggregate information from other patches are data dependent through queries and keys, in ResMLPthe weights are not data dependent and only based on absolute positions of patches.”
The newer paper reframes self-attention as data-dependent token mixing to contrast it against their proposed fixed-weight linear layer, challenging the necessity of query-key attention.— the tool’s reading
“This evolution toward less hard-coded prior in the architecture has been fueled by better training schemes [16, 56], and, in this paper, we push this trend further by showing that a purely multi-layer perceptron (MLP) based architecture, called Residual Multi-Layer Perceptrons (ResMLP), is…”
“More recently, transformers have emerged as a promising architecture for computer vision [10, 17, 46, 56, 67].”
“The rest of the hyper-parameters follow the default setting used in DeiT [56].”
“Multi-head Self Attention layers (MSA). The attention mechanism is based on a trainable associative memory with (key, value) vector pairs.”
“Whereas in self-attention the weights to aggregate information from other patches are data dependent through queries and keys, in ResMLPthe weights are not data dependent and only based on absolute positions of patches.”
The newer paper applies the same self-attention mechanism to multimodal visual tokens with nested inner/outer structure, carrying the idea into a new domain rather than disputing or merely renaming it.— the tool’s reading
“Transformer-based DeiT-Ti [31] 224×224 5.”
“We utilize the training strategy provided in DeiT [31].”
“The recent transformerbased models like ViT [9] and DeiT [31] are compared.”
“Multi-head Self Attention layers (MSA). The attention mechanism is based on a trainable associative memory with (key, value) vector pairs.”
“The scaled dot-product attention is applied on Q,K,V: Attention(Q,K,V) = softmax(QK^T/√(d_k))V.”
The newer paper restricts the broader survey of attention mechanisms to a specific self-attention formulation within a Transformer encoder applied to image patches.— the tool’s reading
“…e.g. for object detection (Hu et al., 2018; Carion et al., 2020), video processing (Wang et al., 2018; Sun et al., 2019), image classification (Wu et al., 2020), unsupervised object discovery (Locatello et al., 2020), or unified text-vision tasks (Chen et al., 2020c; Lu et al., 2019; Li et…”
“Critically, our Visual Transformer operates in a semantic token space, judiciously attending to different image parts based on context.”
“For each element in an input sequence 𝐳∈ℝ^N × D, we compute a weighted sum over all values 𝐯 in the sequence. The attention weights A_ij are based on the pairwise similarity between two elements of the sequence and their respective query 𝐪^i and key 𝐤^j representations.”
Newer paper focuses specifically on the scaled dot-product QKV self-attention formalism, a special case within the earlier paper's broader survey of attention mechanisms in vision.— the tool’s reading
“Critically, our Visual Transformer operates in a semantic token space, judiciously attending to different image parts based on context.”
“Multi-head Self Attention layers (MSA). The attention mechanism is based on a trainable associative memory with (key, value) vector pairs.”
The newer paper carries the dynamic-weighting attention idea from transformer self-attention into CNN-based feature recalibration across channel/spatial/temporal dimensions in vision.— the tool’s reading
“Recently, various pure deep self-attention networks (visual transformers) [27], [34], [44], [45], [46], [47], [48], [49] have appeared, showing the huge potential of attention-based models.”
“In comparison, self-attention allows the receptive field to be the entire spatial locations and computes the weights based on the re-normalized pairwise similarity between the pair (x_i, x_j):”
“In computer vision, {the} attention mechanism can be regarded as a dynamic weight recalibration process based on the input features.”
The newer survey treats Transformer self-attention as one instance within a broader CNN-focused taxonomy of attention as feature recalibration, effectively narrowing its scope to spatial/channel reweighting mechanisms.— the tool’s reading
“[97, 46, 139, 70, 128, 36, 11, 156] , [137, 143, 63, 161, 159, 6, 177, 80] , [67, 180, 10, 23, 24, 163, 155, 151] , [44, 49, 106, 64, 168, 18, 11, 36] , [48, 16, 169, 153, 174, 127, 53, 92] , [89, 21, 5, 134, 65, 171, 2, 109] , [45, 82, 157, 91, 100, 129, 146, 131] , [138, 85, 175, 76, 166, 133, 167, 172] , [41, 1, 173, 74, 47]”
“Recently, various pure deep self-attention networks (visual transformers) [36, 153, 127, 92, 131, 48, 154, 31] have appeared, showing the huge potential of attention-based models.”
“Nevertheless, experiments in [92, 131, 154] show that attention-based models provide better results than convolutional neural networks, so it is worth trying to find simple, efficient and effective attention-based models which can be widely deployed.”
“The goal of the proposed Convolutional Projection layer is to achieve additional modeling of local spatial context, and to provide efficiency benefits by permitting the undersampling of K and V matrices.”
“In computer vision, {the} attention mechanism can be regarded as a dynamic weight recalibration process based on the input features.”
The newer paper subsumes self-attention's data-dependent token mixing under a broader CNN-focused feature recalibration framework, treating it as one special case among many attention forms.— the tool’s reading
“A similar idea can be found in LatentGNN [72], MLP-Mixer [159], and ResMLP [160].”
“A similar idea can be found in LatentGNN [72], MLP-Mixer [158] and ResMLP [159].”
“Whereas in self-attention the weights to aggregate information from other patches are data dependent through queries and keys, in ResMLPthe weights are not data dependent and only based on absolute positions of patches.”
“In computer vision, {the} attention mechanism can be regarded as a dynamic weight recalibration process based on the input features.”
The newer survey reframes attention as a general feature-recalibration mechanism in CNNs, treating Transformer self-attention as one specific instance among many attention variants rather than extending its core mechanism.— the tool’s reading
“[8], [9], [15], [21], [31], [32], [34], [35] , [22], [26], [62], [63], [64], [65], [66], [67] , [41], [68], [69], [70], [71], [72], [73], [74] , [8], [34], [42], [43], [75], [76], [77], [78] , [27], [44], [45], [46], [79], [80], [81], [82] , [61], [83], [84], [85], [86], [87], [88], [89] , [47], [90], [91], [92], [93], [94], [95], [96] , [97], [98], [99], [1…”
“Following ViT, many transformer-based architectures such as PCT [27], IPT [79], T2T-ViT [44], DeepViT [166], SETR [81], PVT [45], CaiT [167], TNT [82], Swintransformer [46], Query2Label [83], MoCoV3 [84], BEiT [85], SegFormer [86], FuseFormer [168] and MAE [169] have appeared, with excellent results for many kind of visual tasks including image classificatio…”
“Attention(Q, K, V) = Softmax(QK^𝖳/√(d_head))V.”
“In computer vision, {the} attention mechanism can be regarded as a dynamic weight recalibration process based on the input features.”
The newer paper cites TNT's inner/outer attention as a comparative baseline while restricting its own attention to a linear-complexity variant applied to spatial resolution reduction, a specific efficiency-focused case.— the tool’s reading
“TNT [11] utilizes inner and outer Transformer blocks to generate pixel and patch embed-dings respectively.”
“…83.8% ImageNet top-1 accuracy, which is 0.5% higher than Swin [35] 25.0 4.3 77.6 RegNetY-4G [26] 21.0 4.0 80.0 DeiT-Small/16 [31] 22.1 4.6 79.9 T2T-ViT t -14 [37] 22.0 6.1 80.7 PVTv1-Small [33] 24.5 3.8 79.8 TNT-S [11] 23 Transformer [23] and Twins [5], while our parameters and FLOPS are fewer.”
“The scaled dot-product attention is applied on Q,K,V: Attention(Q,K,V) = softmax(QK^T/√(d_k))V.”
“Different from SRA <cit.> which uses convolutions for spatial reduction, linear SRA uses average pooling to reduce the spatial dimension (i.e., h× w) to a fixed size (i.e., P× P) before the attention operation.”
The newer survey treats attention broadly as feature recalibration/selection, positioning transformer self-attention as one specific instantiation among many attention mechanisms in vision.— the tool’s reading
“[8], [9], [15], [21], [31], [32], [34], [35] , [22], [26], [62], [63], [64], [65], [66], [67] , [41], [68], [69], [70], [71], [72], [73], [74] , [8], [34], [42], [43], [75], [76], [77], [78] , [27], [44], [45], [46], [79], [80], [81], [82] , [61], [83], [84], [85], [86], [87], [88], [89] , [47], [90], [91], [92], [93], [94], [95], [96] , [97], [98], [99], [1…”
“Following ViT, many transformer-based architectures such as PCT [27], IPT [79], T2T-ViT [44], DeepViT [166], SETR [81], PVT [45], CaiT [167], TNT [82], Swintransformer [46], Query2Label [83], MoCoV3 [84], BEiT [85], SegFormer [86], FuseFormer [168] and MAE [169] have appeared, with excellent results for many kind of visual tasks including image classificatio…”
“The scaled dot-product attention is applied on Q,K,V: Attention(Q,K,V) = softmax(QK^T/√(d_k))V.”
“In computer vision, {the} attention mechanism can be regarded as a dynamic weight recalibration process based on the input features.”
The newer paper adopts standard Transformer self-attention as a baseline mechanism and applies efficiency modifications, treating the earlier nested inner/outer attention as one of several tailored variants rather than building on its specific structure.— the tool’s reading
“More recent methods such as T2T ViT [53], CPVT [54], TNT [55], CrossViT [56] and LocalViT [57] introduce tailored changes to ViT to further improve image classification performance.”
“The scaled dot-product attention is applied on Q,K,V: Attention(Q,K,V) = softmax(QK^T/√(d_k))V.”
“Attention(Q, K, V) = Softmax(QK^𝖳/√(d_head))V.”
CvT keeps standard self-attention but restricts/modifies only the Q/K/V projection step, treating attention itself as unchanged, unlike TNT's nested inner/outer structure.— the tool’s reading
“With fewer paramerters, CvT-13 achieves a 81.6% ImageNet Top-1 accuracy, outperforming PVT-Small [34], T2T-ViT t -14 [41], TNT-S [14] by 1.7%, 0.8%, 0.2% respectively.”
“(b) Comparison to concurrent works: DeiT [30], T2T [41], PVT [34], TNT [14] when pretrained on ImageNet-1k. architectures [10] from language understanding with minimal modifications.”
“Transformer-iN-Transformer (TNT) [14] utilizes both an outer Transformer block that processes the patch embed-dings, and an inner Transformer block that models the relation among pixel embeddings, to model both patch-level and pixel-level representation.”
“The scaled dot-product attention is applied on Q,K,V: Attention(Q,K,V) = softmax(QK^T/√(d_k))V.”
“The goal of the proposed Convolutional Projection layer is to achieve additional modeling of local spatial context, and to provide efficiency benefits by permitting the undersampling of K and V matrices.”