Name
Abstract | ||
|---|---|---|
Multi-head attention is appealing for its ability to jointly extract different types of information from multiple representation subspaces. Concerning the information aggregation, a common practice is to use a concatenation followed by a linear transformation, which may not fully exploit the expressiveness of multi-head attention. In this work, we propose to improve the information aggregation for multi-head attention with a more powerful routing-by-agreement algorithm. Specifically, the routing algorithm iteratively updates the proportion of how much a part (i.e. the distinct information learned from a specific subspace) should be assigned to a whole (i.e. the final output representation), based on the agreement between parts and wholes. Experimental results on linguistic probing tasks and machine translation tasks prove the superiority of the advanced information aggregation over the standard linear transformation. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.18653/v1/n19-1359 | North American Chapter of the Association for Computational Linguistics |
Field | DocType | Volume |
Subspace topology,Computer science,Machine translation,Linear subspace,Theoretical computer science,Exploit,Concatenation,Artificial intelligence,Linear map,Information aggregation,Machine learning,Expressivity | Journal | abs/1904.03100 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jian Li | 1 | 4 | 1.38 |
| Baosong Yang | 2 | 21 | 5.00 |
| Zi-Yi Dou | 3 | 20 | 7.01 |
| Xing Wang | 4 | 58 | 10.07 |
| Michael R. Lyu | 5 | 10985 | 529.03 |
| Zhaopeng Tu | 6 | 518 | 39.95 |