Title: No title found

Abstract: Existing attention mechanisms, are mostly item-based in that a model is trained to attend to individual items in a collection (the memory) where each item has a predefined, fixed granularity, e.g., a character or a word. Intuitively, an area in the memory consisting of multiple items can be worth attending to as a whole. We propose area attention: a way to attend to an area of the memory, where each area contains a group of items that are either spatially adjacent when the memory has a 2-dimensional structure, such as images, or temporally adjacent for 1-dimensional memory, such as natural language sentences. Importantly, the size of an area, i.e., the number of items in an area or the level of aggregation, is dynamically determined via learning, which can vary depending on the learned coherence of the adjacent items. By giving the model the option to attend to an area of items, instead of only individual items, a model can attend to information with varying granularity. Area attention can work along multi-head attention for attending to multiple areas in the memory. We evaluate area attention on two tasks: neural machine translation (both character and token-level) and image captioning, and improve upon strong (state-of-the-art) baselines in all the cases. These improvements are obtainable with a basic form of area attention that is parameter free. In addition to proposing the novel concept of area attention, we contribute an efficient way for computing it by leveraging the technique of summed area tables.

1. INTRODUCTION:

Attentional mechanisms have significantly boosted the accuracy on a variety of deep learning tasks (Bahdanau et al., 2014; Luong et al., 2015; Xu et al., 2015) . They allow the model to selectively focus on specific pieces of information, which can be a word in a sentence for neural machine translation (Bahdanau et al., 2014; Luong et al., 2015) or a region of pixels in image captioning (Xu et al., 2015; Sharma et al., 2018) .

An attentional mechanism typically follows a memory-query paradigm, where the memory M contains a collection of items of information from a source modality such as the embeddings of an image or the hidden states of encoding an input sentence, and the query q comes from a target modality such as the hidden state of a decoder model. In recent architectures such as Transformer (Vaswani et al., 2017) , self-attention involves queries and memory from the same modality for either encoder or decoder. Each item in the memory has a key and value (k i , v i ), where the key is used to compute the probability a i regarding how well the query matches the item (see Equation 1).

a i = exp(f att (q, k i )) |M |

j=1 exp(f att (q, k j ))

(1)

The typical choices for f att include dot products qk i (Luong et al., 2015) and a multilayer perceptron (Bahdanau et al., 2014) . The output O M q from querying the memory M with q is then calculated as the sum of all the values in the memory weighted by their probabilities (see Equation 2), which can be fed to other parts of the model for further calculation. During training, the model learns to attend to specific piece of information, e.g., the correspondance between a word in the target sentence and a word in the source sentence for translation tasks.

EQUATION

Attention mechanisms are typically designed to focus on individual items in the entire memory, where each item defines the granularity of what the model can attend to. For example, it can be a character for a character-level translation model, a word for a word-level model or a grid cell for an image-based model. Such a construction of attention granularity is predetermined rather than learned. While this kind of item-based attention has been helpful for many tasks, it can be fundamentally limited for modeling complex attention distribution that might be involved in a task.

In this paper, we propose area attention, as a general mechanism for the model to attend to a group of items in the memory that are structurally adjacent. In area attention, each unit for attention calculation is an area that can contain one or more than one item. Each of these areas can aggregate a varying number of items and the granularity of attention is thus learned from the data rather than predetermined. Note that area attention subsumes item-based attention because when an area contains a single item, it is equivalent to regular attention mechanisms. Area attention can be used along multi-head attention (Vaswani et al., 2017) . With each head using area attention, multi-head area attention allows the model to attend to multiple areas in the memory. As we show in the experiments, the combination of both achieved the best results.

Extensive experiments with area attention indicate that area attention outperforms regular attention on a number of recent models for two popular tasks: machine translation (both token and character-level translation on , and image captioning (trained on COCO and tested for both in-domain with COCO40 and out-of-domain captioning with Flickr 1K). These models involve several distinct architectures, such as the canonical LSTM seq2seq with attention (Luong et al., 2015) and the encoder-decoder Transformer (Vaswani et al., 2017; Sharma et al., 2018) .

2. RELATED WORK:

Item-grouping has been brought up in a number of language-specific tasks. Ranges or segments of a sentence, beyond individual tokens, have been often considered for problems such as dependency parsing or constituency parsing in natural language processing. Recent works (Wang & Chang, 2016; Stern et al., 2017; Kitaev & Klein, 2018) represent a sentence segment by subtracting the encoding of the first token from that of the last token in the segment, assuming the encoder captures contextual dependency of tokens. The popular choices of the encoder are LSTM (Wang & Chang, 2016; Stern et al., 2017) or Transformer (Kitaev & Klein, 2018) . In contrast, the representation of an area (or a segment) in area attention, for its basic form, is defined as the mean of all the vectors in the segment where each vector does not need to carry contextual dependency. We calculate the mean of each area of vectors using subtraction operation over a summed area table (Viola & Jones, 2001) that is fundamentally different from the subtraction applied in these previous works.

Lee et al. proposed a rich representation for a segment in coreference resolution tasks (Lee et al., 2017) , where each span (segment) in a document is represented as a concatenation of the encodings of the first and last words in the span, the size of the span and an attention-weighted sum of the word embeddings within the span. Again, this approach operates on encodings that have already captured contextual dependency between tokens, while area attention we propose does not require each item to carry contextual or dependency information. In addition, the concept of range, segment or span that is proposed in all the above works addresses their specific task, rather than aiming for improving general attentional mechanisms.

Previous work have proposed several methods for capturing structures in attention calculation. For example, Kim et al. used a conditional random field to directly model the dependency between items, which allows multiple "cliques" of items to be attended to at the same time (Kim et al., 2017) . Niculae and Blondel approached the problem, from a different angle, by using regularizers to encourage attention to be placed onto contiguous segments (Niculae & Blondel, 2017) . In image captioning tasks, Pedersoli et al. enabled a model to attend to object proposals on an image (Pedersoli et al., 2016) while You et al. applied attention to semantic concepts and visual attributes that are extracted from an image (You et al., 2016) .

Compared to these previous works, area attention we propose here does not require to train a special network or sub-network, or use an additional loss (regularizer) to capture structures. It allows a model to attend to information at a varying granularity, which can be at the input layer where each item might lack contextual information, or in the latent space. It is easy to apply area attention to existing single or multi-head attention mechanisms. By enhancing Transformer, an attention-based architecture, (Vaswani et al., 2017) with area attention, we achieved state-of-art results on a number of tasks.

3. AREA-BASED ATTENTION MECHANISMS:

An area is a group of structurally adjacent items in the memory. When the memory consists of a sequence of items, a 1-dimensional structure, an area is a range of items that are sequentially (or temporally) adjacent and the number of items in the area can be one or multiple. Many language-related tasks are categorized in the 1-dimensional case, e.g., machine translation or sequence prediction tasks. In Figure 1 , the original memory is a 4-item sequence. By combining the adjacent items in the sequence, we form area memory where each item is a combination of multiple adjacent items in the original memory. We can limit the maximum area size to consider for a task. In Figure 1 , the maximum area size is 3.

original memory area memory query 1-item areas 2-item areas 3-item area3

Figure 1 : An illustration of area attention for the 1-dimensional case. In this example, the memory is a 4-item sequence and the maximum size of an area allowed is 3.

When the memory contains a grid of items, a 2-dimensional structure, an area can be any rectangular region in the grid (see Figure 2 ). This resembles many image-related tasks, e.g., image captioning. Again, we can limit the maximum size allowed for an area. For a 2-dimensional area, we can set the maximum height and width for each area. In this example, the original memory is a 3x3 grid of items and the maximum height and width allowed for each area is 2.

As we can see, many areas can be generated by combining adjacent items. For the 1-dimensional case, the number of areas that can be generated is |R| = (L -S)S + (S + 1)S/2 where S is the maximum size of an area and L is the length of the sequence. For the 2-dimensional case, there are an quadratic number of areas can be generated from the original memory:

|R| = |R v ||R h |. |R v | = (L v -H)H + (H + 1)H/2 and |R h | = (L h -W )W + (W + 1)W/2

where L v and L h are the height and width of the memory grid and H and W are the maximum height and width allowed for a rectangular area.

To be able to attend to each area, we need to define the key and value for each area that contains one or multiple items in the original memory. As the first step to explore area attention, we define the key of an area, µ i , simply as the mean vector of the key of each item in the area. where |r i | is the size of the area r i . For the value of an area, we simply define it as the the sum of all the value vectors in the area.

EQUATION

EQUATION

With the keys and values defined, we can use the standard way for calculating attention as discussed in Equation 1 and Equation 2. Note that this basic form of area attention (Eq.3 and Eq.4) is parameterfree-it does not introduce any parameters to be learned.

3.1. COMBINING AREA FEATURES:

Alternatively, we can derive a richer representation of each area by using features other than the mean of the key vectors of the area. For example, we can consider the standard deviation of the key vectors within each area.

σ i = 1 |r i | |ri| l=1 (k i,l -µ i ) 2

(5)

We can also consider the height and width of each area, h i ,1 ≤ h i ≤ H and w i ,1 ≤ w i ≤ W , as the features of the area. To combine these features, we use a multi-layer perceptron. To do so, we treat h i and w i as discrete values and project them onto a vector space using embedding (see Equation 6and 7).

e h i = 1(h i )E h (6) e w i = 1(w i )E w (7)

where 1(h i ) and 1(w i ) are the one-hot encoding of h i and w i , and E h ∈ R H×S and E w ∈ R W ×S are the embedding matrices. S is the depth of the embedding. We concatenate them to form the representation of the shape of an area.

EQUATION

We then combine them using a single-layer perceptron followed by a linear transformation (see Equation 9).

k r i = φ(µ i W µ + σ i W σ + e i W e )W d (9)

where φ is a nonlinear transformation such as ReLU, and

W µ ∈ R D×D , W σ ∈ R D×D , W e ∈ R 2S×D and W d ∈ R D×D . W µ , W σ

, W e and W d are trainable parameters.

3.2. FAST COMPUTATION USING SUMMED AREA TABLE:

If we naively compute µ i , σ i and v ri i , the time complexity for computing attention will be O(|M |A2 ) where |M | is the size of the memory that is L for a 1-dimensional sequence or L v L h for a 2dimensional memory. A is the maximum size of an area, which is S in the one dimensional case and W H in the 2-dimensional case. This is computationally expensive in comparison to the attention computed on the original memory, which is O(|M |). To address the issue, we use summed area table, an optimization technique that has been used in computer vision for computing features on image areas (Viola & Jones, 2001) . It allows constant time to calculate a summation-based feature in each rectangular area, which allows us to bring down the time complexity to O(|M |A)-We will report on the actual time cost in our experimental section.

Summed area table is based on a pre-computed integral image, I, which can be computed in a single pass of the memory (see Equation 10). Here let us focus on the area value calculation for a 2-dimensional memory because a 1-dimensional memory is just a special case with the height of the memory grid as 1.

EQUATION

where x and y are the coordinates of the item in the memory. With the integral image, we can calculate the key and value of each area in constant time. The sum of all the vectors in a rectangular area can be easily computed as the following (Equation 11).

EQUATION

where v x1,y1,x2,y2 is the value for the area located with the top-left corner at (x 1 , y 1 ) and the bottomright corner at (x 2 , y 2 ). By dividing v x1,y1,x2,y2 with the size of the area, we can easily compute µ x1,y1,x2,y2 . Based on the summed area table, σ 2 x1,y1,x2,y2 (thus σ x1,y1,x2,y2 ) can also be computed at constant time for each area (see Equation 12), where I 2

x,y = v 2 x,y + I 2 x,y-1 + I 2

x-1,y , which is the integral image of the element-wise squared memory.

EQUATION

The core component for computing these quantities is to be able to quickly compute the sum of vectors in each area after we obtain the integral image table I for each coordinate [x, y], as shown in Equation 10 and 11. We present the Pseudo code for performing Equation 10 and Equation 11 as well as the shape size of each area in Algorithm (1) and the code for computing the mean, sum and standard deviation (Equation 12) in Algorithm (2). These Pseudo code are designed based on Tensor operations, which can be implemented efficiently using libraries such as TensorFlow1 and PyTorch 2 .

Algorithm 1: Compute the vector sum and the size of each area, for all the qualified rectangular areas on a given grid.

Input: A tensor G in shape of [H, W, D] that represents a grid with height H and width W where each item is a vector of depth D. Output: Sum of vectors of each area, U , and height and width of each area, S h and S w . Hyperparameter: maximum area width W a and height H a allowed. 1 Compute horizontal integral image I h by cumulative sum along horizontal direction over G; 2 Compute integral image I hv by cumulative sum along vertical directions over I h ; 3 Acquire I by padding all-zero vectors to the left and top of I hv ; -w) ; Fill tensor with value h for the height of each area; 12 Sw ← [w] (H-h)×(W -w) ; Fill tensor with value w for the width of each area; Algorithm 2: Compute the vector mean, standard deviation, and sum as well as the size of each area, for all the qualified rectangular areas on a grid. Input: A tensor G in shape of [H, W, D] that represents a grid with height H and width W where each item is a vector of depth D. Output: Vector mean µ, standard deviation σ and sum U as well as height S h and width S w of each area. 1 Acquire U , S h and S w using Algorithm 1 with input G; 2 Acquire U using Algorithm 1 with input G G where is for element-wise multiplication; 3 µ ← U S where is for element-wise division; 4 µ ← U S ;

4 for h = 1, • • • , H a do 5 for w = 1, • • • , W a do 6 I 1 ← I[h + 1 :, w + 1 :, :] ; 7 I 2 ← I[: -h -1, : -w -1, :] ; 8 I 3 ← I[h + 1 :, : -w -1, :] ; 9 I 4 ← I[: -h -1, w + 1 :, :] ; 10 Ū = I 1 + I 2 -I 3 -I 4 ; 11 Sh ← [h] (H-h)×(W

5 σ ← µ -µ µ ; 6 return µ, σ, U , as well as S h and S w .

4. EXPERIMENTS:

We experimented with area attention on two important tasks: neural machine translation (including both token and character-level translation) and image captioning, where attention mechanisms have been a common component in model architectures for these tasks. The architectures we investigate involves several popular encoder and decoder choices, such as LSTM (Hochreiter & Schmidhuber, 1997) and Transformer (Vaswani et al., 2017) . The attention mechansims in these tasks include both self attention and encoder-decoder attention.

4.1. TOKEN-LEVEL NEURAL MACHINE TRANSLATION:

Transformer has recently (Vaswani et al., 2017) established the state of art performance on WMT 2014 English-to-German and English-to-French tasks, while LSTM with encoder-decoder attention has been a popular choice for neural machine translation tasks. We use the same dataset as the one used in (Vaswani et al., 2017) in which the WMT 2014 English-German dataset contains about 4.5 million English-German sentence pairs, and the English-French dataset has about 36 million English-French sentence pairs (Wu et al., 2016) . A token is either a byte pair (Britz et al., 2017) or a word piece (Wu et al., 2016) as in the original Transformer experiments.

4.1.1. TRANSFORMER TOKEN-LEVEL MT EXPERIMENTS:

Transformer heavily uses attentional mechanisms, including both self-attention in the encoder and the decoder, and attention from the decoder to the encoder. We vary the configuration of Transformer to investigate how area attention impacts the model. In particular, we investigated the following variations of Transformer: Tiny (#hidden layers=2, hidden size=128, filter size=512, #attention heads=4), Small (#hidden layers=2, hidden size=256, filter size=1024, #attention heads=4), Base (#hidden layers=6, hidden size=512, filter size=2048, #attention heads=8) and Big (#hidden layers=6, hidden size=1024, filter size=4096, #attention heads=16).

During training, sentence pairs were batched together based on their approximate sequence lengths.

All the model variations except Big uses a training batch contained a set of sentence pairs that amount to approximately 32,000 source and target tokens and were trained on one machine with 8 NVIDIA P100 GPUs for a total of 250,000 steps. Given the batch size, each training step for the Transformer Base model, on 8 NVIDIA P100 GPUs, took 0.4 seconds for Regular Attention, 0.5 seconds for the basic form of Area Attention (Eq.3 and Eq.4), 0.8 seconds for Area Attention using multiple features (Eq.9 and Eq.4).

For Big, due to the memory constraint, we had to use a smaller batch size that amounts to roughly 16,000 source and target tokens and trained the model for 600,000 steps. Each training step took 0.5 seconds for Regular Attention, 0.6 seconds for the basic form of Area Attention (Eq.3 and 4), 1.0 seconds for Area Attention using multiple features (Eq.9 and 4). Similar to previous work, we used the Adam optimizer with a varying learning rate over the course of training-see (Vaswani et al., 2017) for details. We applied area attention to each of the Transformer variation, with the maximum area size of 5 to both encoder and decoder self-attention, and the encoder-decoder attention in the first two layers. We found area attention consistently improved Transformer on all the model variations (see Table 1 ), even with the basic form of area attention where no additional parameters are used (Eq.3 and Eq.4). For Transformer Base, area attention achieved BLEU scores (EN-DE: 28.52 and EN-FR: 39.28) that surpassed the previous results for both EN-DE and EN-FR. In particular, Transformer Base with area attention even outperformed the result of Transformer Big with regular attention reported previously (Vaswani et al., 2017) on EN-DE.

For EN-FR, the performance of Transformer Big with regular attention-a baseline-does not match what was reported in the Transformer paper (Vaswani et al., 2017) , largely due to a different batch size and the different number of training steps used, although area attention still outperformed the baseline consistently. On the other hand, area attention with Transformer Big achieved BLEU 29.68 on EN-DE that improved upon the state-of-art result of 28.4 reported in (Vaswani et al., 2017) with a significant margin.

4.1.2. LSTM TOKEN-LEVEL MT EXPERIMENTS:

We used a 2-layer LSTM for both encoder and decoder. The encoder-decoder attention is based on multiplicative attention where the alignment of a query and a memory key is computed as their dot product (Luong et al., 2015) . We vary the size of LSTM and the number of attention heads to investigate how area attention can improve LSTM with varying capacity on translation tasks. The purpose is to observe the impact of area attention on each LSTM configuration, rather than for a comparison with Transformer.

Because LSTM requires sequential computation along a sequence, it trains rather slow compared to Transformer. To improve GPU utilization we increased data parallelism by using a much larger batch size than training Transformer. We trained each LSTM model on one machine with 8 NVIDIA P100. For a model has 256 or 512 LSTM cells, we trained it for 50,000 steps using a batch size that amounts to approximately 160,000 source and target tokens. When the number of cells is 1024, we had to use a smaller batch size with roughly 128,000 tokens, due to the memory constraint, and trained the model for 625,000 steps.

In these experiments, we used the maximum area size of 2 and the attention is computed from the output of the decoder's top layer to that of the encoder. Similar to what we observed with Transformer, area attention consistently improves LSTM architectures in all the conditions (see Table 2 ). Compared to token-level translation, character-level translation requires the model to address significantly longer sequences, which are a more difficult task and often less studied. We speculate that the ability to combine adjacent characters, as enabled by area attention, is likely useful to improve a regular attentional mechanisms. Likewise, we experimented with both Transformer and LSTM-based architectures for this task. We here used the same dataset, and the batching and training strategies as the ones used in the token-level translation experiments.

Transformer has not been used for character-level translation tasks. We found area attention consistently improved Transformer across all the model configurations. The best result we found in the literature is BLEU = 22.62 reported by (Wu et al., 2016) . We achieved BLEU = 26.65 for the English-to-German character-level translation task and BLEU = 34.81 on the English-to-French character-level translation task. Note that these accuracy gains are based on the basic form of area attention (see Eq.3 and Eq.4), which does not add any additional trainable parameters to the model.

Similarly, we tested LSTM architectures on the character-level translation tasks. We found area attention outperformed the baselines in most conditions (see Table 4 ). The improvement seems more substantial when a model is relatively small.

4.3. IMAGE CAPTIONING:

Image captioning is the task to generate natural language description of an image that reflects the visual content of an image. This task has been addressed previously using a deep architecture that features an image encoder and a language decoder (Xu et al., 2015; Sharma et al., 2018) . The image encoder typically employs a convolutional net such as ResNet (He et al., 2015) to embed the images and then uses a recurrent net such as LSTM or Transformer (Sharma et al., 2018) to encode the image based on these embeddings. For the decoder, either LSTM (Xu et al., 2015) or Transformer (Sharma et al., 2018) has been used for generating natural language descriptions. In many of these designs, attention mechanisms have been an important component that allows the decoder to selectively focus on a specific part of the image at each step of decoding, which often leads to better captioning quality.

In this experiment, we follow a champion condition in the experimental setup of (Sharma et al., 2018) that achieved state-of-the-art results. It uses a pre-trained Inception-ResNet to generate 8 × 8 image embeddings, a 6-layer Transformer for image encoding and a 6-layer Transformer for decoding. The dimension of Transformer is 512 and the number of heads is 8. We intend to investigate how area attention improves the captioning accuracy, particularly regarding self-attention and encoder-decoder attention computed off the image, which resembles a 2-dimensional case for using area attention. We also vary the maximum area size allowed to examine the impact.

Similar to (Sharma et al., 2018) , we trained each model based on the training & development sets provided by the COCO dataset (Lin et al., 2014) , which as 82K images for training and 40K for validation. Each of these images have at least 5 groudtruth captions. The training was conducted on a distributed learning infrastructure (Dean et al., 2012) with 10 GPU cores where updates are applied asynchronously across multiple replicas. We then tested each model on the COCO40 (Lin et al., 2014) and the Flickr 1K (Young et al., 2014) test sets. Flickr 1K is out-of-domain for the trained model. For each experiment, we report CIDEr (Vedantam et al., 2014) and ROUGE-L (Lin & Och, 2004) metrics. For both metrics, higher number means better captioning accuracy-the closer distances between the predicted and the groundtruth captions. Similar to the previous work (Sharma et al., 2018) , we report the numerical values returned by the COCO online evaluation server3 for the COCO C40 test set (see Table 5 ),

In the benchmark model, a regular multi-head attention is used. We then experimented with several variations by adding area attention with different maximum area sizes to the first 2 layers of the image encoder self-attention and encoder-decoder (caption-to-image) attention, which both are a 2-dimensional area attention case. 2 × 2 stands for the maximum area size 2 by 2 and 3 × 3 for 3 by 3. For the 2 × 2 case, an area can be 1 by 1, 2 by 1, 1 by 2, and 2 by 2 as illustrated in Figure 2 . 3 × 3 allows more area shapes.

We found models with area attention outperformed the benchmark on both CIDEr and ROUGE-L metrics with a large margin. The models with 2 × 2 Eq.3 and 3 × 3 Eq.3 are parameter free-they do not use any additional parameters beyond the benchmark model. 3 × 3 achieved the best results overall. 3 × 3 Eq. 9 adds a small fraction of the number of parameters to the benchmark model and did not seem to improve on the parameter-free version of area attention, although it still outperformed the benchmark.

5. CONCLUSIONS:

In this paper, we present a novel attentional mechanism by allowing the model to attend to areas as a whole. An area contains one or a group of items in the memory to be attended. The items in the area are either spatially adjacent when the memory has 2-dimensional structure, such as images, or temporally adjacent for 1-dimensional memory, such as natural language sentences. Importantly, the size of an area, i.e., the number of items in an area or the level of aggregation, can vary depending on the learned coherence of the adjacent items, which gives the model the ability to attend to information at varying granularity. Area attention contrasts with the existing attentional mechanisms that are itembased. We evaluated area attention on two tasks: neural machine translation and image captioning, based on model architectures such as Transformer and LSTM. On both tasks, we obtained new state-of-the-art results using area attention.

:

https://github.com/tensorflow/tensorflow

https://github.com/pytorch/pytorch

http://mscoco.org/dataset/captions-eval

Figures and Tables:

Figure2: An illustration of area attention for the 2-dimensional case. In this example, the memory is a 3x3 grid and the dimension allowed for an area is 2x2.

13S h ← [S h Sh ], reshape Sh to [-1, 1] and concatenate on the first dimension; 14 S w ← [S w Sw ], reshape Sw to [-1, 1] and concatenate on the first dimension; 15 U ← [U Ū ], reshape Ū to [-1, D] and concatenate on the first dimension; 16 return U , S h and S w .

The BLEU scores on token-level translation tasks for the variations of the Transformer-based architecture.

Table content: <table><tr><td>Model</td><td colspan="2">Regular Attention EN-DE EN-FR</td><td colspan="2">Area Attention (Eq.3 and 4) EN-DE EN-FR</td><td colspan="2">Area Attention (Eq.9 and 4) EN-DE EN-FR</td></tr><tr><td>Tiny</td><td>18.60</td><td>27.07</td><td>19.30</td><td>27.39</td><td>19.45</td><td>27.79</td></tr><tr><td colspan="2">Small 22.80</td><td>31.91</td><td>22.86</td><td>32.47</td><td>23.19</td><td>32.97</td></tr><tr><td>Base</td><td>27.96</td><td>39.10</td><td>28.17</td><td>39.22</td><td>28.52</td><td>39.28</td></tr><tr><td>Big</td><td>29.43</td><td>40.88</td><td>29.48</td><td>41.06</td><td>29.68</td><td>41.03</td></tr></table>

The BLEU scores on token-level translation tasks for the LSTM-based architecture with varying model capacities.

Table content: <table><tr><td colspan="2">#Cells #Heads</td><td colspan="2">Regular Attention EN-DE EN-FR</td><td colspan="2">Area Attention (Eq.3,4) EN-DE EN-FR</td><td colspan="2">Area Attention (Eq.9,4) EN-DE EN-FR</td></tr><tr><td>256</td><td>1</td><td>19.05</td><td>28.51</td><td>19.08</td><td>28.39</td><td>19.60</td><td>28.61</td></tr><tr><td>256</td><td>4</td><td>19.92</td><td>29</td><td>20.21</td><td>29.45</td><td>20.64</td><td>30.39</td></tr><tr><td>512</td><td>1</td><td>22.13</td><td>31.95</td><td>22.14</td><td>32.08</td><td>22.02</td><td>31.73</td></tr><tr><td>512</td><td>4</td><td>22.78</td><td>33.2</td><td>22.73</td><td>33.05</td><td>23.18</td><td>33.44</td></tr><tr><td>1024</td><td>1</td><td>23.8</td><td>31.66</td><td>24</td><td>34.57</td><td>23.39</td><td>34.70</td></tr><tr><td>1024</td><td>4</td><td>20.06</td><td>32.82</td><td>24.48</td><td>35.54</td><td>24.95</td><td>36.02</td></tr><tr><td colspan="6">4.2 CHARACTER-LEVEL NEURAL MACHINE TRANSLATION</td><td/><td/></tr></table>

The BLEU scores on character-level translation tasks for the Transformer-based architecture with varying model capacities.

Table content: <table><tr><td>Model</td><td colspan="2">Regular Attention EN-DE EN-FR</td><td colspan="2">Area Attention (Eq.3 and 4) EN-DE EN-FR</td></tr><tr><td>Tiny</td><td>6.97</td><td>9.47</td><td>7.39</td><td>11.79</td></tr><tr><td colspan="2">Small 12.18</td><td>18.75</td><td>13.44</td><td>21.24</td></tr><tr><td>Base</td><td>24.65</td><td>32.80</td><td>25.03</td><td>33.69</td></tr><tr><td>Big</td><td>25.24</td><td>33.82</td><td>26.65</td><td>34.81</td></tr></table>

The BLEU scores on character-level translation tasks for the LSTM-based architecture with varying model capacities.

Table content: <table><tr><td colspan="2">#Cells #Heads</td><td colspan="2">Regular Attention EN-DE EN-FR</td><td colspan="2">Area Attention (Eq.3 and 4) EN-DE EN-FR</td></tr><tr><td>256</td><td>1</td><td>9.96</td><td>16.5</td><td>11.17</td><td>17.14</td></tr><tr><td>256</td><td>4</td><td>11.43</td><td>17.86</td><td>12.48</td><td>19.06</td></tr><tr><td>512</td><td>1</td><td>16.31</td><td>23.51</td><td>16.55</td><td>24.05</td></tr><tr><td>512</td><td>4</td><td>17.5</td><td>25.01</td><td>17.28</td><td>24.97</td></tr><tr><td>1024</td><td>1</td><td>20.45</td><td>28.7</td><td>21.17</td><td>28.99</td></tr><tr><td>1024</td><td>4</td><td>21.28</td><td>30.11</td><td>21.53</td><td>30.28</td></tr></table>

Test accuracy of image captioning models on COCO40 (in-domain) and Flickr 1K (out-ofdomain) tasks.

Table content: <table><tr><td>Model</td><td colspan="2">COCO40 CIDEr ROUGE-L</td><td colspan="2">Flickr 1K CIDEr ROUGE-L</td></tr><tr><td colspan="2">Benchmark (Sharma et al., 2018) 1.032</td><td>0.700</td><td>0.359</td><td>0.416</td></tr><tr><td>Benchmark Replicate</td><td>1.034</td><td>0.701</td><td>0.355</td><td>0.409</td></tr><tr><td>2 × 2 Eq.3 &amp; 4</td><td>1.060</td><td>0.704</td><td>0.364</td><td>0.420</td></tr><tr><td>3 × 3 Eq.3 &amp; 4</td><td>1.060</td><td>0.706</td><td>0.377</td><td>0.419</td></tr><tr><td>3 × 3 Eq.9 &amp; 4</td><td>1.045</td><td>0.707</td><td>0.372</td><td>0.420</td></tr></table>

Peer review (iclr2019):
 I have several concerns about this paper. [originality] Some important related studies are missing. # Related studies about the perspective of “area”. The consecutive position in sequence is often referred to as “span” in NLP filed, which is identical to what the authors call “area” in this paper. Then, the idea of utilizing spans currently becomes a very popular in NLP field. We can find several papers, e.g., Wenhui Wang, Baobao Chang, “Graph-based dependency parsing with bidirectional lstm”, ACL-2016. Mitchell Stern, Jacob Andreas, Dan Klein, “A Minimal Span-Based Neural Constituency Parser”, ACL-2017. Kenton Lee, Luheng He, Mike Lewis, Luke Zettlemoyer, “End-to-end Neural Coreference Resolution”, EMNLP-2017. Nikita Kitaev, Dan Klein, “Constituency Parsing with a Self-Attentive Encoder”, ACL-2018. Similarly, there are several related studies in image processing field, e,g., Marco Pedersoli, Thomas Lucas, Cordelia Schmid, Jakob Verbeek, “Areas of Attention for image captioning”, ICCV-2017 Quanzeng You, Hailin Jin, Zhaowen Wang, Chen Fang, and Jiebo Luo, “Image Captioning with Semantic Attention”, CVPR-2016. # Related studies about the perspective of “structured attention”. Several papers about structured attention have already been proposed, e.g., Yoon Kim, Carl Denton, Luong Hoang, Alexander M. Rush. “Structured Attention Networks”, ICLR-2017. Vlad Niculae, Mathieu Blondel. “A Regularized Framework for Sparse and Structured Neural Attention”, NIPS-2017. I think the authors should explain the relations between their method and the methods proposed in the above listed papers. [significance] # Concern about experimental settings The experimental setting for NMT looks unnormal in the community. Currently, most of papers use sentences split in subword units rather than character units. I cannot find a reason to select the character units. I think the authors should report the effectiveness of the proposed method on the widely-used settings. # computational cost The authors should report the actual calculation speed by comparing with the baseline method and the proposed method. In Sec. 2.2, the authors provided the computational cost. I feel that the cost of O(|M|A) is still enough large and that can unacceptably damage the actual calculation speed of the proposed method. Overall, the proposed method itself seems to be novel and interesting. However, in my opinion, writing and organization of this paper should be much improved as a conference paper. I feel like the current status of this paper is still ongoing to write. Thus, it is a bit hard for me to strongly recommend this paper to be accepted.