Hierarchical Attention Networks

Classification Comments

Paper Link



Hierarchical Attention Network Architecture


A quick refresher on GRU’s here -

From the above equation, the hidden representation of a time-step is a linear interpolation of the previous state and the current new state based on the value of the update gate. The value of the update gate is calculated based on this -

The current state is a mix of the input and the previous state and the proportion is decided by the rest gate -

And the value of the rest gate is calculated similar to the update gate (all the weight matrices are learned) -

Word Attention

We concatenate the forward and backward hidden states to get the representation of every token. Now, in order to calculate the sentence level representation, instead of taking the final hidden state, we compute a weighted average of the hidden states based on attention mechanism. We do this in 3 steps -

Project the hidden state onto a smaller dimension -

Next, we compute the attention for each of the time-step based on similarity to the context vector.

Now, we get a representation of the sentence by doing a weighted average -

Sentence Attention

The sentence attention is calculated in a very similar way to form a vector representation of a document. This representation is then followed by a dense layer and then a softmax to do the classification.


Paper Yelp’13 Yelp’14 Yelp’15 IMDB Yahoo Answers Amazon
Tang et al. 2015 LSTM-GRNN 65.1 67.1 67.6 45.3 - -
HN-ATT 68.2 70.5 71.0 49.4 75.8 63.6

Kaushik Rangadurai

Code. Learn. Explore

Share this post