File size: 118,151 Bytes
6fa4bc9 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 | {
"paper_id": "2020",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T13:27:23.078277Z"
},
"title": "Do We Really Need That Many Parameters In Transformer For Extractive Summarization? Discourse Can Help !",
"authors": [
{
"first": "Wen",
"middle": [],
"last": "Xiao",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of British Columbia Vancouver",
"location": {
"postCode": "V6T 1Z4",
"region": "BC",
"country": "Canada"
}
},
"email": "xiaowen3@cs.ubc.ca"
},
{
"first": "Patrick",
"middle": [],
"last": "Huber",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of British Columbia Vancouver",
"location": {
"postCode": "V6T 1Z4",
"region": "BC",
"country": "Canada"
}
},
"email": "huberpat@cs.ubc.ca"
},
{
"first": "Giuseppe",
"middle": [],
"last": "Carenini",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of British Columbia Vancouver",
"location": {
"postCode": "V6T 1Z4",
"region": "BC",
"country": "Canada"
}
},
"email": "carenini@cs.ubc.ca"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "The multi-head self-attention of popular transformer models is widely used within Natural Language Processing (NLP), including for the task of extractive summarization. With the goal of analyzing and pruning the parameterheavy self-attention mechanism, there are multiple approaches proposing more parameterlight self-attention alternatives. In this paper, we present a novel parameter-lean self-attention mechanism using discourse priors. Our new tree self-attention is based on document-level discourse information, extending the recently proposed \"Synthesizer\" framework with another lightweight alternative. We show empirical results that our tree self-attention approach achieves competitive ROUGE-scores on the task of extractive summarization. When compared to the original single-head transformer model, the tree attention approach reaches similar performance on both, EDU and sentence level, despite the significant reduction of parameters in the attention component. We further significantly outperform the 8-head transformer model on sentence level when applying a more balanced hyper-parameter setting, requiring an order of magnitude less parameters 1 .",
"pdf_parse": {
"paper_id": "2020",
"_pdf_hash": "",
"abstract": [
{
"text": "The multi-head self-attention of popular transformer models is widely used within Natural Language Processing (NLP), including for the task of extractive summarization. With the goal of analyzing and pruning the parameterheavy self-attention mechanism, there are multiple approaches proposing more parameterlight self-attention alternatives. In this paper, we present a novel parameter-lean self-attention mechanism using discourse priors. Our new tree self-attention is based on document-level discourse information, extending the recently proposed \"Synthesizer\" framework with another lightweight alternative. We show empirical results that our tree self-attention approach achieves competitive ROUGE-scores on the task of extractive summarization. When compared to the original single-head transformer model, the tree attention approach reaches similar performance on both, EDU and sentence level, despite the significant reduction of parameters in the attention component. We further significantly outperform the 8-head transformer model on sentence level when applying a more balanced hyper-parameter setting, requiring an order of magnitude less parameters 1 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "The task of extractive summarization aims to generate summaries for multi-sentential documents by selecting a subset of text units in the source document that most accurately cover the authors communicative goal (as shown in red in Figure 1 ). As such, extractive summarization has been a long standing research question with direct practical implications. The main objective for the task is to determine whether a given text unit in the document is important, generally implied by multiple Figure 1 : News document (4 sentences / 6 EDUs), with both its discourse tree (top) and possible extractive summaries at the sentence/EDU level (extracted sentences and EDUs shown in boxes and red respectively).",
"cite_spans": [],
"ref_spans": [
{
"start": 232,
"end": 240,
"text": "Figure 1",
"ref_id": null
},
{
"start": 491,
"end": 499,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "factors, such as position, stance, semantic meaning and discourse. Marcu (1999) already showed early on that discourse information, as defined in the Rhetorical Structure Theory (RST) (Mann and Thompson, 1988) , are a good indicator of the importance of a text unit in the given context. The RST framework, one of the most elaborate and widely used theories of discourse, represents a coherent document (a discourse) as a constituency tree. The leaves are thereby called Elementary Discourse Units (EDUs), clause-like sentence fragments corresponding to minimal units of content (i.e. propositions). Internal tree nodes, comprising document sub-trees, represent hierarchically compound text spans (or constituents). An additional nuclearity attribute is assigned to each child, representing the importance of the subtree in the local constituent, i.e. the 'Nucleus' child plays a more important role than the 'Satellite' child in the parent's relation. Alternatively, if both children are equally important, both are represented as Nuclei.",
"cite_spans": [
{
"start": 67,
"end": 79,
"text": "Marcu (1999)",
"ref_id": "BIBREF17"
},
{
"start": 184,
"end": 209,
"text": "(Mann and Thompson, 1988)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "While other popular theories of discourse exist (most notably PDTB (Prasad et al., 2008) ), RST along with its human-annotated RST-DT treebank (Carlson et al., 2002) have been leveraged in the past to improve extractive summarizations, with either unsupervised (Hirao et al., 2013; Kikuchi et al., 2014) , or supervised (Xu et al., 2020) methods.",
"cite_spans": [
{
"start": 67,
"end": 88,
"text": "(Prasad et al., 2008)",
"ref_id": null
},
{
"start": 143,
"end": 165,
"text": "(Carlson et al., 2002)",
"ref_id": "BIBREF1"
},
{
"start": 261,
"end": 281,
"text": "(Hirao et al., 2013;",
"ref_id": "BIBREF5"
},
{
"start": 282,
"end": 303,
"text": "Kikuchi et al., 2014)",
"ref_id": "BIBREF10"
},
{
"start": 320,
"end": 337,
"text": "(Xu et al., 2020)",
"ref_id": "BIBREF31"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In this paper, we explore a novel, equally important application for discourse information in extractive summarization, namely to reduce the number of parameters. Instead of exploiting discourse trees as an additional source of information on top of neural models, we use the information as a prior to reduce the number of parameters of existing neural models. This is critical not only to reduce the risk of over-fitting but also to create smaller models that are easier to interpret and deploy.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Not surprisingly, reducing the number of parameters has become increasingly important in the last years, due to the deep-learning revolution. Generally speaking, the objective of reducing neural network parameters involves addressing two central questions: (1) What do these models really learn? Such that better priors can be provided and less parameters are required and (2) Are all the model parameters necessary? To identify which parameters can be safely removed.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Recently, researchers have explored these questions especially in the context of transformer models. With respect to what is learned in such models, several experiments reveal that the information captured by the multi-head self-attention in the popular BERT model (i.e., the learned attention weights) generally align well with syntactic and semantic relations within sentences (Vig and Belinkov, 2019; Kovaleva et al., 2019) . Regarding the second question, building on previous work exploring how to prune large neural models while keeping the performance comparable to the original model (Michel et al., 2019) , very recently Tay et al. (2020) has proposed the \"Synthesizer\" framework, comparing the performance when replacing the dot-product selfattention in the original transformer model with other, less parameterized, attention types.",
"cite_spans": [
{
"start": 379,
"end": 403,
"text": "(Vig and Belinkov, 2019;",
"ref_id": "BIBREF27"
},
{
"start": 404,
"end": 426,
"text": "Kovaleva et al., 2019)",
"ref_id": "BIBREF12"
},
{
"start": 592,
"end": 613,
"text": "(Michel et al., 2019)",
"ref_id": "BIBREF18"
},
{
"start": 630,
"end": 647,
"text": "Tay et al. (2020)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Inspired by these two lines of research on transformer-based models, namely the identification of a close connection between learned attention weights and linguistic structures, and the potential for safely reducing attention parameters, we propose a document-level discourse-based attention method for extractive summarization. With this new, discourse-inspired approach, we reduce the size of the attention module, the core component of the transformer model, while keeping the modelperformance competitive to comparable, fully parameterized models on both EDU and sentence level.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Attention mechanisms have become a widely used component of many modern neural NLP models. Originally proposed by Bahdanau et al. (2014) and Luong et al. (2015) for machine translation, the general idea behind attention is based on the intuition that not all textual units within a sequence contribute equally to the result. Thus, the attention value is introduced to learn how to assess the importance of a unit during training.",
"cite_spans": [
{
"start": 114,
"end": 136,
"text": "Bahdanau et al. (2014)",
"ref_id": "BIBREF0"
},
{
"start": 141,
"end": 160,
"text": "Luong et al. (2015)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Attention Methods",
"sec_num": "2.1"
},
{
"text": "In recent years, the role of attention within NLP further solidified with researchers exploring new variants, such as multi-head self-attention, as used in transformers (Vaswani et al., 2017) . Generally, larger transformer models with more attentionheads (and therefore more parameters) achieve better performance for many tasks (Vaswani et al., 2017) . In the context of explaining the internal workings of neural models, Kovaleva et al. (2019) has recently focused on transformer-style models, investigating the role of individual attention-heads in the BERT model (Devlin et al., 2019) . Analyzing the capacity to capture different linguistic information within the self-attention module, they find that information represented across attention-heads is oftentimes redundant, thus showing potential to prune those parameters.",
"cite_spans": [
{
"start": 169,
"end": 191,
"text": "(Vaswani et al., 2017)",
"ref_id": "BIBREF26"
},
{
"start": 330,
"end": 352,
"text": "(Vaswani et al., 2017)",
"ref_id": "BIBREF26"
},
{
"start": 424,
"end": 446,
"text": "Kovaleva et al. (2019)",
"ref_id": "BIBREF12"
},
{
"start": 568,
"end": 589,
"text": "(Devlin et al., 2019)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Attention Methods",
"sec_num": "2.1"
},
{
"text": "Following these findings, Raganato et al. (2020) define a combination of fixed, position-based attention heads and a single learnable dot-product self-attention head. They empirically show that this hybrid approach reduces the spatial complexity of the model, while retaining the original performance. In addition, the hybrid model improves the performance in the low-resource case. Broadening these results, Tay et al. (2020) further investigate the contribution of the self-attention mechanism. In their proposed \"Synthesizer\" model, they present a generalized version of the transformer, exploring alternative attention types, generally requiring less parameters, but achieving competitive performances on multiple tasks.",
"cite_spans": [
{
"start": 409,
"end": 426,
"text": "Tay et al. (2020)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Attention Methods",
"sec_num": "2.1"
},
{
"text": "In this paper, instead of pruning the redundant heads of the transformer model empirically or exclusively based on position, we reduce the number of parameters by incorporating linguistic information (i.e. discourse) in the attention computation. We compare our setup for extractive summarization against alternative attention mechanisms, defined in the Synthesizer (Tay et al., 2020) . Marcu (1999) was the first to explore the application of RST-style discourse to the task of extractive summarization. In particular, he showed that discourse can be used directly to improve summarization, by simply extracting EDUs along the paths with more nuclei as the document summary. Later on, researchers started to explore unsupervised methods for discourse-tree-based summarization. Hirao et al. (2013) for example propose a trimming-based method on dependency trees, previously converted from the RST constituency trees, aiming to generate a more coherent summary. Based on this idea of trimming the dependencytree, Kikuchi et al. (2014) propose another method of trimming nested trees, composed into two levels: a document-tree considering the structure of the document and a sentence-tree considering the structure within each sentence.",
"cite_spans": [
{
"start": 366,
"end": 384,
"text": "(Tay et al., 2020)",
"ref_id": "BIBREF25"
},
{
"start": 387,
"end": 399,
"text": "Marcu (1999)",
"ref_id": "BIBREF17"
},
{
"start": 778,
"end": 797,
"text": "Hirao et al. (2013)",
"ref_id": "BIBREF5"
},
{
"start": 1012,
"end": 1033,
"text": "Kikuchi et al. (2014)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Attention Methods",
"sec_num": "2.1"
},
{
"text": "More recently, further work along this line started to incorporate discourse structures into supervised summarization with the goal to better leverage the (linguistic) structure of a document. Xiao and Carenini (2019) and Cohan et al. (2018) thereby use the natural structure of scientific papers (i.e. sections) to improve the inputs of the sequence models, better encoding long documents using a structural prior. They empirically show that such structure effectively improves performance.",
"cite_spans": [
{
"start": 193,
"end": 217,
"text": "Xiao and Carenini (2019)",
"ref_id": "BIBREF30"
},
{
"start": 222,
"end": 241,
"text": "Cohan et al. (2018)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Discourse and Summarization",
"sec_num": "2.2"
},
{
"text": "Moreover, Xu et al. (2020) propose a graphbased discourse-aware extractive summarization method incorporating the dependency trees converted from RST trees on top of the BERTSUM model (Liu and Lapata, 2019) and the document co-reference graph. The results show consistent improvements, implying a close, bidirectional relationship between downstream tasks and discourse parsing. Carenini (2019, 2020) show that sentiment information can be used to infer discourse trees with promising performance. They further mention extractive summarization as another important downstream task with strong potential connections to the document's discourse, motivating the bidirectional use of available information. This paper employs a rather different objective from aforementioned work combining discourse and summarization. Instead of leveraging additional discourse information to enhance the model performance, we strive to create a summarization model with significantly less parameters, hence being less prone to over-fitting, smaller, and easier to interpret and deploy.",
"cite_spans": [
{
"start": 10,
"end": 26,
"text": "Xu et al. (2020)",
"ref_id": "BIBREF31"
},
{
"start": 184,
"end": 206,
"text": "(Liu and Lapata, 2019)",
"ref_id": "BIBREF14"
},
{
"start": 379,
"end": 400,
"text": "Carenini (2019, 2020)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Discourse and Summarization",
"sec_num": "2.2"
},
{
"text": "3 Synthesizer-based Self-Attention Evaluation Framework",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discourse and Summarization",
"sec_num": "2.2"
},
{
"text": "Aiming to answer the two guiding questions stated in section 1, Tay et al. (2020) propose a suite of alternative self-attention approaches besides the standard dot-product self-attention, as used in the original transformer model. In their \"Synthesizer\" framework, they show that parameter-reduced selfattention mechanisms can achieve competitive performance across multiple tasks, including abstractive summarization. While the experiments in the original \"Synthesizer\" framework are on token level, employing an sequence-to-sequence architecture, we adapt the framework to explore different attention mechanisms on EDU-/sentence-level for the extractive summarization task.",
"cite_spans": [
{
"start": 64,
"end": 81,
"text": "Tay et al. (2020)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Discourse and Summarization",
"sec_num": "2.2"
},
{
"text": "To evaluate the effect of different attention types in our scenario, we apply the general system shown in Figure 2 , using the pretrained BERT model as our unit encoder. Each unit is thereby represented as the hidden state of the first token in the last BERT layer. Subsequently, we feed the BERT representations into the \"Synthesizer\" documentencoder (Tay et al., 2020) with different attention types and employ a Multi-Layer Perceptron (MLP) with Sigmoid activation to retrieve a confidence score for each unit, indicating its predicted likelihood to be part of the extractive summary.",
"cite_spans": [
{
"start": 352,
"end": 370,
"text": "(Tay et al., 2020)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [
{
"start": 106,
"end": 114,
"text": "Figure 2",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Discourse and Summarization",
"sec_num": "2.2"
},
{
"text": "The \"Synthesizer\" document encoder is essentially a transformer encoder with alternative attention modules, other than the dot-product selfattention. As commonly done, we employ multiple self-attention heads, previously shown to improve the performance of similar models (Vaswani et al., 2017) . For each attention head, the input is defined as X \u2208 R l\u00d7d where l is the length of the input document (i.e. the number of units), and d represents the hidden dimension of the model. The self-attention matrix is accordingly defined as A \u2208 R l\u00d7l , where A ij is the attention-value that unit i pays to unit j. We further force the sum of the incoming attentions to each unit (as commonly done) to add up to 1, i.e. j A ij = 1. The pa- rameterized function G, calculating the Value, is multiplied with the attention matrix for the attention output:",
"cite_spans": [
{
"start": 271,
"end": 293,
"text": "(Vaswani et al., 2017)",
"ref_id": "BIBREF26"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Discourse and Summarization",
"sec_num": "2.2"
},
{
"text": "X out = A \u2022 G(X).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discourse and Summarization",
"sec_num": "2.2"
},
{
"text": "Here, we evaluate the three self-attention methodologies proposed by Tay et al. (2020) as our baselines: Dot Product: As used in the original transformer model, this self-attention calculates a key, a value and a query representation for each textual unit. The attention value is learned as the relationship between the key-and the query-vector defined as A = sof tmax(K(X) \u2022 Q(X))",
"cite_spans": [
{
"start": 69,
"end": 86,
"text": "Tay et al. (2020)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Discourse and Summarization",
"sec_num": "2.2"
},
{
"text": "Dense: Instead of using the relationship between units, encoded as keys and values, the dense self-attention A = sof tmax(Dense(X)) is solely learned based on the input unit, where Dense(\u2022) is a two-layer fully connected layer mapping from R l\u00d7d to R l\u00d7l , which can be represented as",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discourse and Summarization",
"sec_num": "2.2"
},
{
"text": "Dense(X) = W 1 \u03c3(W 2 X + b 2 ) + b 1 . 2",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discourse and Summarization",
"sec_num": "2.2"
},
{
"text": "Random: A random attention matrix is generated for each attention-head, shared across all data points, i.e. A = sof tmax(R). R can thereby be either updated (referred as Learned Random in Sec. 5) or fixed (Fixed Random) during training.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discourse and Summarization",
"sec_num": "2.2"
},
{
"text": "(D-Tree) Inspired by previous work using dependency trees to support the summarization task (Marcu, 1999; Hirao et al., 2013; Xu et al., 2020) , we first convert the original constituency-tree, obtained with the RST-DT trained discourse parser (Wang et al., 2017) , into the respective dependency tree and subsequently generate the final matrix-representation.",
"cite_spans": [
{
"start": 92,
"end": 105,
"text": "(Marcu, 1999;",
"ref_id": "BIBREF17"
},
{
"start": 106,
"end": 125,
"text": "Hirao et al., 2013;",
"ref_id": "BIBREF5"
},
{
"start": 126,
"end": 142,
"text": "Xu et al., 2020)",
"ref_id": "BIBREF31"
},
{
"start": 244,
"end": 263,
"text": "(Wang et al., 2017)",
"ref_id": "BIBREF28"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Dependency-based Nuclearity Attributes",
"sec_num": "4.1"
},
{
"text": "In the first step, we follow the constituency-todependency conversion algorithm proposed by Hirao et al. (2013) (shown superior for summarization in Hayashi et al. (2016) ). While this algorithm ensures a near-bijective conversion (see Morey et al. (2018) ), the resulting dependency trees do not necessarily have single-rooted sentence sub-trees.To account for this, we apply the post-editing method proposed in Hayashi et al. (2016) .",
"cite_spans": [
{
"start": 149,
"end": 170,
"text": "Hayashi et al. (2016)",
"ref_id": "BIBREF4"
},
{
"start": 236,
"end": 255,
"text": "Morey et al. (2018)",
"ref_id": "BIBREF19"
},
{
"start": 413,
"end": 434,
"text": "Hayashi et al. (2016)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Dependency-based Nuclearity Attributes",
"sec_num": "4.1"
},
{
"text": "To use the newly generated dependency tree in the \"Synthesizer\" transformer model, we generate the self-attention matrix from the tree structure by following a standard Graph Theory approach (Xu et al., 2020) . Head-dependent relations in the tree are represented as binary values (1 indicating a relation, 0 representing no connection) in the selfattention matrix, where each column of the matrix identifies the head and each row represents dependents. The root is considered head and dependent of itself, ensuring all row-sums to be 1. Figure 4 shows the inferred dependency-tree and the generated self-attention matrix for our running example. ",
"cite_spans": [
{
"start": 191,
"end": 208,
"text": "(Xu et al., 2020)",
"ref_id": "BIBREF31"
}
],
"ref_spans": [
{
"start": 538,
"end": 546,
"text": "Figure 4",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Dependency-based Nuclearity Attributes",
"sec_num": "4.1"
},
{
"text": "(C-Tree) Arguably, there are aspects of the constituency treestructure that may not be captured adequately by the corresponding dependency-tree. These aspects, defining the compositional structure of the document, may contain valuable information for the self-attention. In particular, the inter-EDU relationships encoded in the constituency tree can be used to define the relatedness of textual units, implying that the closer the units are in the discourse tree, the more related they are, and the more attention they should pay to each other. Further inspired by the ideas of aggregation (Nguyen et al., 2020) and splitting (Shen et al., 2019) , we define the attention between EDUs based on the depth of the constituency-tree on which they are assigned to the same constituent (Left in Figure 5 ).",
"cite_spans": [
{
"start": 591,
"end": 612,
"text": "(Nguyen et al., 2020)",
"ref_id": "BIBREF21"
},
{
"start": 627,
"end": 646,
"text": "(Shen et al., 2019)",
"ref_id": "BIBREF24"
}
],
"ref_spans": [
{
"start": 790,
"end": 798,
"text": "Figure 5",
"ref_id": "FIGREF2"
}
],
"eq_spans": [],
"section": "Constituency-based Structure Attributes",
"sec_num": "4.2"
},
{
"text": "More specifically, we compute the attention between every two nodes in the self-attention matrix as follows. Suppose the height of the constituencytree is H, then for each level L of the tree, there is a binary matrix M L \u2208 R l\u00d7l with M L ij = 1 if EDU i and EDU j are in the same constituent and M L ij = 0 otherwise. The final self-attention matrix A is defined as the normalized aggregate matrices of all levels:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Constituency-based Structure Attributes",
"sec_num": "4.2"
},
{
"text": "A = normalize( L M L )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Constituency-based Structure Attributes",
"sec_num": "4.2"
},
{
"text": "The resulting self-attention matrix A is exclusively based on the discourse structure-attribute, without taking the nuclearity into account, representing a rather different approach from the previously described one based on the dependency-tree.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Constituency-based Structure Attributes",
"sec_num": "4.2"
},
{
"text": "Nuclearity Attributes (C-Tree w/Nuc) With the previous sections focusing on either exploiting the nuclearity attribute, by converting the RST-style constituency tree into a dependency representation, or the constituency-tree structure itself, we now propose a third, hybrid approach, using both attributes to generate the self-attention matrix. Plausably, the combination could further enhance the quality of the self-attention matrix. The combined approach is closely related to the structural approach presented in section 4.2, but extends the binary self-attention matrix computation to the ternary case. At each level, M L ij = 2 if the node rooting the local sub-tree containing EDU i and EDU j is the nucleus in its relation 3 , M L ij = 1 for the satellite case. Unchanged from section 4.2, if EDUs i and j are not sharing a common sub-tree on level L, M L ij = 0. For example, M 1 3:4,3:4 = 2, as the sub-tree containing EDU 3 & 4 is the nucleus in it's relation with the sub-tree containing EDU 5.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Constituency-based Structure and",
"sec_num": "4.3"
},
{
"text": "The natural granularity-level for a discourse-related summarization model is Elementary Discourse Units (EDUs). Besides using EDUs as our atomic elements, we also explore similar models on sentence-level, the more standard approach in the To obtain the respective sentence-level selfattention matrix, given the EDU-level self-attention matrix A e of the three matrix-generation approaches defined above, we define an indicatormatrix I \u2208 R N S\u00d7N E . N S and N E are thereby the number of sentences and EDUs in the document. I ij = 1 if and only if EDU j belongs to sentence i. The sentence-level self-attention matrix A s is then defined as A s = IA e I T Generating the sentence-level self-attention matrices directly from the EDU-level self-attention matrices, instead of the tree-representation itself, avoids the problem of potentially leaky EDUs (Joty et al., 2015) , as sentences with leaky EDUs (having naturally high attention values between them) will continue to be tightly connected.",
"cite_spans": [
{
"start": 850,
"end": 869,
"text": "(Joty et al., 2015)",
"ref_id": "BIBREF8"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Sentence-based Discourse Self-Attention",
"sec_num": "4.4"
},
{
"text": "We use the popular CNN/DM dataset (Nallapati et al., 2016) , a standard corpus for extractive summarization. Key dimensions of the dataset with corresponding statistics are in by the oracle 4 on EDU-and sentence-level, we de-fine the summarization task to choose the top 6 EDUs or the highest scoring 3 sentences, depending on the task granularity. Please further note that the original corpus does not contain any EDUlevel markers (as presented in Table 1 ). The EDU segmentation process employed for EDU-related dataset dimensions is described below. Discourse Augmentation: To obtain highquality discourse representations for the documents in the CNN/DM training corpus we use the pretrained versions of the top-performing discoursesegmenter (Wang et al., 2018) and -parser (Wang et al., 2017) , reaching an F1-score of 94.3%, 86.0% (span) and 72.4% (nuclearity) respectively on the RST-DT dataset. 5 In line with previous work exploring the combination of discourse and summarization, we follow the \"dependency-restriction\" strategy proposed in Xu et al. (2020) to enhance the coherence and grammatical correctness of the summarization. Such strategy requires that all ancestors of a selected EDU within the same sentence should be recursively added to the final summary.",
"cite_spans": [
{
"start": 34,
"end": 58,
"text": "(Nallapati et al., 2016)",
"ref_id": "BIBREF20"
},
{
"start": 745,
"end": 764,
"text": "(Wang et al., 2018)",
"ref_id": "BIBREF29"
},
{
"start": 777,
"end": 796,
"text": "(Wang et al., 2017)",
"ref_id": "BIBREF28"
},
{
"start": 902,
"end": 903,
"text": "5",
"ref_id": null
},
{
"start": 1049,
"end": 1065,
"text": "Xu et al. (2020)",
"ref_id": "BIBREF31"
}
],
"ref_spans": [
{
"start": 449,
"end": 456,
"text": "Table 1",
"ref_id": "TABREF0"
}
],
"eq_spans": [],
"section": "Experimental Setup Dataset:",
"sec_num": "5.1"
},
{
"text": "Hyper-Parameters: To stay consistent with previous work, we set the dimensions of the attention key(d k ), value(d v ) and query vector(d q ) to 64 for each head, and the inner dimension of the positionwise feed-forward layer (d inner ) to 3072. Similar to the synthesizer model (Tay et al., 2020) , we only alter the attention part of the transformer model, which contains a small portion of the overall parameters. Additionally, we explore a more balanced, setting, with Table 2 : Overall Performance of the models on the EDU level with the number of heads each layer, as well as the number of parameters to train in the attention module and in the whole model. The dashed line splits the models with learnt attentions and with fixed attentions. \u2020 indicates that corresponding result is NOT significantly worse than the best result of single-head models with p < 0.01 with the bootstrap test, and \u2021 indicates that the corresponding result is NOT significantly worse than the result of the 8-head Dot Product with same setting.",
"cite_spans": [
{
"start": 279,
"end": 297,
"text": "(Tay et al., 2020)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [
{
"start": 473,
"end": 480,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Experimental Setup Dataset:",
"sec_num": "5.1"
},
{
"text": "d v = d k = d q =",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setup Dataset:",
"sec_num": "5.1"
},
{
"text": "mizer (Kingma and Ba, 2014), following the hyperparameter setting in the original transformer paper (Vaswani et al., 2017) .",
"cite_spans": [
{
"start": 100,
"end": 122,
"text": "(Vaswani et al., 2017)",
"ref_id": "BIBREF26"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setup Dataset:",
"sec_num": "5.1"
},
{
"text": "We compare our new, parameter-reduced Tree Attention approach against a variety of competitive baselines. Based on the standard Dot Product Attention, as used in the original transformer, we explore two settings: A single head and an 8-head Dot Product Attention. Inspired by the \"Synthesizer\"-framework, we further compare our approach against the Dense and Random Attention computation, as mentioned in Section 3. To better show the effect of different attention methods, we use a 'No Attention Model' as an additional baseline, in which each input can only attend to itself, i.e. A = I. Please note, (1) as our goal is to explore possible parameter reductions, we ensure that all heads contain similar dimensions across models. (2) The attention matrices in the \"Fixed Random\", \"No Attention\" and all three Tree Attention models (D-Tree, C-Tree and C-Tree w/Nuc) are fixed, while they are learned for other models.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Baseline Models:",
"sec_num": null
},
{
"text": "We present and discuss three sets of experimental results. First, the natural task for discourse-related extractive summarization on EDU-level. Second, the most common task of extractive summarization on sentence-level and, finally, further experiments regarding the low resource case. Tables 2 and 3 show our experimental results on EDU and Sentence level, respectively. Each row thereby contains the Rouge-1, -2 and -L scores of the model, along with the number of self-attention heads and the amount of trainable parameters in the attention module and in the complete model 6 . For readability, the results in either table are divided into three sub-tables. The first sub-table contains the commonly used Lead-baseline (Lead6 on EDU level and Lead3 on sentence level), along with the Oracle, representing the performance upperbound, and the current state-of-the-art models (Dis-coBERT (Xu et al., 2020) on EDU level, BERT-SUM (Liu and Lapata, 2019) on sentence level). Please note, both SOTA models finetune BERT as a token-based document encoder, to learn additional cross-unit information of tokens. However, this requires additional training resources (as the BERT model itself contains 108M learnable parameters). Furthermore, both SOTA models use Table 3 : Overall Performance of the models on the sentence level. \u2020 represents that it is NOT significantly worse than the best result of the single-head models with p < 0.01 with the bootstrap test, and \u2021 indicates that the corresponding result is NOT significantly worse than the result of 8-head Dot Product with same setting ( \u2021 for Default Models only).",
"cite_spans": [
{
"start": 888,
"end": 905,
"text": "(Xu et al., 2020)",
"ref_id": "BIBREF31"
}
],
"ref_spans": [
{
"start": 286,
"end": 300,
"text": "Tables 2 and 3",
"ref_id": null
},
{
"start": 1255,
"end": 1262,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results and Analysis",
"sec_num": "5.2"
},
{
"text": "'Trigram-Blocking', which has been shown to be able to greatly improve summarization results (Liu, 2019) . The second sub-table shows our experimental results using the default parameter setting, as proposed in the original transformer, and the last sub-table presents the results when using a balanced parameter setting. Within each sub-table, we further differentiate models by the number of heads, either containing a single attention head or the original 8-head self-attention. As each document only contains a single discourse tree, there is only one fixed self-attention matrix for each document, making the single-head model equivalent to the multi-head approach.",
"cite_spans": [
{
"start": 93,
"end": 104,
"text": "(Liu, 2019)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Results and Analysis",
"sec_num": "5.2"
},
{
"text": "EDU Level Experiments: are shown in Table 2 . When comparing the single head models using the default setting (second sub-table), it appears that both, C-Tree and C-Tree w/Nuc achieve competitive performance with the single head Dot Product model, despite the Dot product using twice as many parameters in the attention module (0.4M vs. 0.2M ). This is an important advantage because, even though the non attention related parameters in the complete model outweigh the number of attention parameters in this setting, the attention however resembles the core component of the transformer model, and so saving attention parameters is arguably more critical. In addition, the difference would become large with the increment of the number of heads. Furthermore, when comparing models with fixed attention or no attention, the effect of the attention module becomes clear, showing superior performance of the C-Tree and C-Tree /w Nuc approaches, indicating that discourse structure can indeed help for the task of extractive summarization. In contrast, the D-Tree inspired self-attention does not perform as well. The drop in performance when using this tree-attention might be caused by the rather strict, binary attention computation, potentially pruning too much valuable discourse information. Examining the models with learnt attentions, we observe that the Dense model reduces the number of parameters compared to the best performing 8-head Dot Product, however, still contains far more parameters than the single-head Dot Product. Despite the large difference in the number of parameters, the single-head Dot Product Attention performs comparable to the Dense model, suggesting the necessity to synthesize the Dense attention (see (Tay et al., 2020) the benefits of our tree attention models are improving over-proportionally for more balanced models, with the C-tree /w Nuc even outperforming the single-head Dot Product and achieving competitive performance to the 8-head Dot Product model, which contains an order of magnitude more parameters in this setting.",
"cite_spans": [
{
"start": 1734,
"end": 1752,
"text": "(Tay et al., 2020)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [
{
"start": 36,
"end": 43,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results and Analysis",
"sec_num": "5.2"
},
{
"text": "Sentence Level Experiments: Our sentence level experiments, presented in Table 3 , are mostly akin to the EDU level experiments. However, a relative performance improvement of fixed attention models compared to learned attention approaches can be observed, leading to a smaller performance gap on sentence level. We believe that this overproportional improvement might be due to the position bias on sentence level, which tends to be larger than on EDU level, generally making the sentence level task easier to learn. In line with this trend, we also observe that the difference between the Tables 2 and 3 on each subset. However, contrasting our initial expectation, the tree-inspired C-Tree w/Nuc model only improves the performance on the low-ressource experiments under the balanced setting, with no significant improvements under the default setting.",
"cite_spans": [],
"ref_spans": [
{
"start": 73,
"end": 80,
"text": "Table 3",
"ref_id": null
},
{
"start": 591,
"end": 605,
"text": "Tables 2 and 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results and Analysis",
"sec_num": "5.2"
},
{
"text": "Overall: Comparing the results in Tables 2 and 3 , it becomes obvious that the sentence level models are consistently better than the EDU level models, despite the opposite trend holding between sentence Oracle and EDU Oracle, as well as the respective SOTA models. One possible reason for this result is that the BERT model is originally trained on the sentences, which might potentially impair the subsentential (EDU) representation generation ability of the model. Furthermore, when comparing the single head and 8 head Dot Product models in both tables and in both settings, we find that the improvement gains of adding additional heads is rather limited, even impairing the performance in the balanced setting on sentence level. We therefore believe that the balance between the performance and the number of parameters is worth of further exploration for the task of extractive summarizarion.",
"cite_spans": [],
"ref_spans": [
{
"start": 34,
"end": 48,
"text": "Tables 2 and 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results and Analysis",
"sec_num": "5.2"
},
{
"text": "We extend and adapt the \"Synthesizer\" framework for extractive summarization by proposing a new tree self-attention method, based on RST-style consitituency and dependency trees. In our experiments, we show that the performance of the tree self-attention is significantly better than other fixed attention models, while being competitive to the single-head standard dot product self-attention in the transformer model on both, the EDU-level and sentence-level extractive summarization task. Furthermore, our tree attention is better than the 8-head dot product in the balanced setting. Besides these general results, we further investigate low-resource scenarios, where our parameter-light approaches are assumed to be especially useful. However, contrary to this expectation, they do not seem to be more stable and robust than other solutions. In addition, we also find that the multi-head Dot product model is not always significantly better than the single-head approach. This, combined with the previous finding, suggest that more research is needed on the balance between the number of parameter and the performance of the summarization model.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion and Future Work",
"sec_num": "6"
},
{
"text": "In the future, we plan to explore ways to also incorporate rhetorical relations into self-attention, in addition to discourse structure and nuclearity. Further, we want to replace the hard-coded weight trade-off between Nucleus and Satellite in the C-Tree w/Nuc approach, using instead the confidence score from the discourse parser as the weight. Finally, since the current two-level encoder performs generally worse than a single token-based encoder (e.g. BERTSUM(Liu and Lapata, 2019)), we intend to explore tree self-attention in combination with the BERTSUM model.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion and Future Work",
"sec_num": "6"
},
{
"text": "Our code can be found herehttp://www.cs. ubc.ca/cs-research/lci/research-groups/ natural-language-processing/",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "We use the inner dimension as 512 for all experiments.4 Discourse Tree AttentionWe propose a fourth self-attention candidate: a fixed, discourse-dependent self-attention matrix taking advantage of the strong, tree-structured discourse prior. (seeFigure 3for a comparison of all the self-attention methods). The justification for our new self-attention is two-fold: (1) RST-style discourse trees represent document-level semantic structures of coherent documents, which are important semantic markers for the summarization task (2) RST discourse-trees, especially the nuclearity attribute, has been shown to be closely related to the summarization task(Marcu, 1999;Hirao et al., 2013;Kikuchi et al., 2014).To explore a diverse set of RST-style discourse tree attributes, we propose three distinct tree-tomatrix encodings focusing on: the nuclearityattribute, through a dependency-tree transformation; the plain discourse-structure, derived from the original constituency structure; and a nuclearityaugmented discourse structure, obtained from the constituency representation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "The weight of Nucleus and Satellite is set hard-coded, and will be tuned in the future.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "The oracle summary contains the units greedily picked according to the ground-truth summary, which is built followKedzie et al. (2020).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "We use the publicly available implementation by the original authors at //github.com/yizhongw/StageDP",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "The BERT EDU/sentence encoder is fixed and the parameters therefore not included.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "We thank reviewers and the UBC-NLP group for their insightful comments. This research was supported by the Language & Speech Innovation Lab of Cloud BU, Huawei Technologies Co., Ltd.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgments",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Neural machine translation by jointly learning to align and translate",
"authors": [
{
"first": "Dzmitry",
"middle": [],
"last": "Bahdanau",
"suffix": ""
},
{
"first": "Kyunghyun",
"middle": [],
"last": "Cho",
"suffix": ""
},
{
"first": "Yoshua",
"middle": [],
"last": "Bengio",
"suffix": ""
}
],
"year": 2014,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1409.0473"
]
},
"num": null,
"urls": [],
"raw_text": "Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Ben- gio. 2014. Neural machine translation by jointly learning to align and translate. arXiv preprint arXiv:1409.0473.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "RST discourse treebank. Linguistic Data Consortium",
"authors": [
{
"first": "Lynn",
"middle": [],
"last": "Carlson",
"suffix": ""
},
{
"first": "Mary",
"middle": [
"Ellen"
],
"last": "Okurowski",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Marcu",
"suffix": ""
}
],
"year": 2002,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lynn Carlson, Mary Ellen Okurowski, and Daniel Marcu. 2002. RST discourse treebank. Linguistic Data Consortium, University of Pennsylvania.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "A discourse-aware attention model for abstractive summarization of long documents",
"authors": [
{
"first": "Arman",
"middle": [],
"last": "Cohan",
"suffix": ""
},
{
"first": "Franck",
"middle": [],
"last": "Dernoncourt",
"suffix": ""
},
{
"first": "Soon",
"middle": [],
"last": "Doo",
"suffix": ""
},
{
"first": "Trung",
"middle": [],
"last": "Kim",
"suffix": ""
},
{
"first": "Seokhwan",
"middle": [],
"last": "Bui",
"suffix": ""
},
{
"first": "Walter",
"middle": [],
"last": "Kim",
"suffix": ""
},
{
"first": "Nazli",
"middle": [],
"last": "Chang",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Goharian",
"suffix": ""
}
],
"year": 2018,
"venue": "NAACL HLT 2018 -2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies -Proceedings of the Conference",
"volume": "2",
"issue": "",
"pages": "615--621",
"other_ids": {
"DOI": [
"10.18653/v1/n18-2097"
]
},
"num": null,
"urls": [],
"raw_text": "Arman Cohan, Franck Dernoncourt, Doo Soon Kim, Trung Bui, Seokhwan Kim, Walter Chang, and Na- zli Goharian. 2018. A discourse-aware attention model for abstractive summarization of long docu- ments. NAACL HLT 2018 -2018 Conference of the North American Chapter of the Association for Com- putational Linguistics: Human Language Technolo- gies -Proceedings of the Conference, 2:615-621.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "BERT: Pre-training of deep bidirectional transformers for language understanding",
"authors": [
{
"first": "Jacob",
"middle": [],
"last": "Devlin",
"suffix": ""
},
{
"first": "Ming-Wei",
"middle": [],
"last": "Chang",
"suffix": ""
},
{
"first": "Kenton",
"middle": [],
"last": "Lee",
"suffix": ""
},
{
"first": "Kristina",
"middle": [],
"last": "Toutanova",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "1",
"issue": "",
"pages": "4171--4186",
"other_ids": {
"DOI": [
"10.18653/v1/N19-1423"
]
},
"num": null,
"urls": [],
"raw_text": "Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2019. BERT: Pre-training of deep bidirectional transformers for language under- standing. In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers), pages 4171-4186, Minneapolis, Minnesota. Associ- ation for Computational Linguistics.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Empirical comparison of dependency conversions for rst discourse trees",
"authors": [
{
"first": "Katsuhiko",
"middle": [],
"last": "Hayashi",
"suffix": ""
},
{
"first": "Tsutomu",
"middle": [],
"last": "Hirao",
"suffix": ""
},
{
"first": "Masaaki",
"middle": [],
"last": "Nagata",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the 17th Annual Meeting of the Special Interest Group on Discourse and Dialogue",
"volume": "",
"issue": "",
"pages": "128--136",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Katsuhiko Hayashi, Tsutomu Hirao, and Masaaki Na- gata. 2016. Empirical comparison of dependency conversions for rst discourse trees. In Proceedings of the 17th Annual Meeting of the Special Interest Group on Discourse and Dialogue, pages 128-136.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Single-Document Summarization as a Tree Knapsack Problem",
"authors": [
{
"first": "Tsutomu",
"middle": [],
"last": "Hirao",
"suffix": ""
},
{
"first": "Yasuhisa",
"middle": [],
"last": "Yoshida",
"suffix": ""
},
{
"first": "Masaaki",
"middle": [],
"last": "Nishino",
"suffix": ""
},
{
"first": "Norihito",
"middle": [],
"last": "Yasuda",
"suffix": ""
},
{
"first": "Masaaki",
"middle": [],
"last": "Nagata",
"suffix": ""
}
],
"year": 2013,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tsutomu Hirao, Yasuhisa Yoshida, Masaaki Nishino, Norihito Yasuda, and Masaaki Nagata. 2013. Single- Document Summarization as a Tree Knapsack Prob- lem. Technical report.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Predicting discourse structure using distant supervision from sentiment",
"authors": [
{
"first": "Patrick",
"middle": [],
"last": "Huber",
"suffix": ""
},
{
"first": "Giuseppe",
"middle": [],
"last": "Carenini",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)",
"volume": "",
"issue": "",
"pages": "2306--2316",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Patrick Huber and Giuseppe Carenini. 2019. Pre- dicting discourse structure using distant supervision from sentiment. In Proceedings of the 2019 Con- ference on Empirical Methods in Natural Language Processing and the 9th International Joint Confer- ence on Natural Language Processing (EMNLP- IJCNLP), pages 2306-2316.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Mega rst discourse treebanks with structure and nuclearity from scalable distant sentiment supervision",
"authors": [
{
"first": "Patrick",
"middle": [],
"last": "Huber",
"suffix": ""
},
{
"first": "Giuseppe",
"middle": [],
"last": "Carenini",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Patrick Huber and Giuseppe Carenini. 2020. Mega rst discourse treebanks with structure and nuclear- ity from scalable distant sentiment supervision. In Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Codra: A novel discriminative framework for rhetorical analysis",
"authors": [
{
"first": "Shafiq",
"middle": [],
"last": "Joty",
"suffix": ""
},
{
"first": "Giuseppe",
"middle": [],
"last": "Carenini",
"suffix": ""
},
{
"first": "Raymond T",
"middle": [],
"last": "Ng",
"suffix": ""
}
],
"year": 2015,
"venue": "Computational Linguistics",
"volume": "41",
"issue": "3",
"pages": "385--435",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Shafiq Joty, Giuseppe Carenini, and Raymond T Ng. 2015. Codra: A novel discriminative framework for rhetorical analysis. Computational Linguistics, 41(3):385-435.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Content selection in deep learning models of summarization",
"authors": [
{
"first": "Chris",
"middle": [],
"last": "Kedzie",
"suffix": ""
},
{
"first": "Kathleen",
"middle": [],
"last": "Mckeown",
"suffix": ""
},
{
"first": "Hal",
"middle": [],
"last": "Daum\u00e9",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "1818--1828",
"other_ids": {
"DOI": [
"10.18653/v1/d18-1208"
]
},
"num": null,
"urls": [],
"raw_text": "Chris Kedzie, Kathleen McKeown, and Hal Daum\u00e9. 2020. Content selection in deep learning models of summarization. Proceedings of the 2018 Con- ference on Empirical Methods in Natural Language Processing, EMNLP 2018, pages 1818-1828.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Single document summarization based on nested tree structure",
"authors": [
{
"first": "Yuta",
"middle": [],
"last": "Kikuchi",
"suffix": ""
},
{
"first": "Tsutomu",
"middle": [],
"last": "Hirao",
"suffix": ""
},
{
"first": "Hiroya",
"middle": [],
"last": "Takamura",
"suffix": ""
},
{
"first": "Manabu",
"middle": [],
"last": "Okumura",
"suffix": ""
},
{
"first": "Masaaki",
"middle": [],
"last": "Nagata",
"suffix": ""
}
],
"year": 2014,
"venue": "52nd Annual Meeting of the Association for Computational Linguistics",
"volume": "2",
"issue": "",
"pages": "315--320",
"other_ids": {
"DOI": [
"10.3115/v1/p14-2052"
]
},
"num": null,
"urls": [],
"raw_text": "Yuta Kikuchi, Tsutomu Hirao, Hiroya Takamura, Man- abu Okumura, and Masaaki Nagata. 2014. Single document summarization based on nested tree struc- ture. 52nd Annual Meeting of the Association for Computational Linguistics, ACL 2014 -Proceedings of the Conference, 2:315-320.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Adam: A method for stochastic optimization",
"authors": [
{
"first": "P",
"middle": [],
"last": "Diederik",
"suffix": ""
},
{
"first": "Jimmy",
"middle": [],
"last": "Kingma",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Ba",
"suffix": ""
}
],
"year": 2014,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1412.6980"
]
},
"num": null,
"urls": [],
"raw_text": "Diederik P Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Revealing the dark secrets of BERT",
"authors": [
{
"first": "Olga",
"middle": [],
"last": "Kovaleva",
"suffix": ""
},
{
"first": "Alexey",
"middle": [],
"last": "Romanov",
"suffix": ""
},
{
"first": "Anna",
"middle": [],
"last": "Rogers",
"suffix": ""
},
{
"first": "Anna",
"middle": [],
"last": "Rumshisky",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)",
"volume": "",
"issue": "",
"pages": "4365--4374",
"other_ids": {
"DOI": [
"10.18653/v1/D19-1445"
]
},
"num": null,
"urls": [],
"raw_text": "Olga Kovaleva, Alexey Romanov, Anna Rogers, and Anna Rumshisky. 2019. Revealing the dark secrets of BERT. In Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natu- ral Language Processing (EMNLP-IJCNLP), pages 4365-4374, Hong Kong, China. Association for Computational Linguistics.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Fine-tune BERT for extractive summarization. CoRR, abs",
"authors": [
{
"first": "Yang",
"middle": [],
"last": "Liu",
"suffix": ""
}
],
"year": 1903,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yang Liu. 2019. Fine-tune BERT for extractive sum- marization. CoRR, abs/1903.10318.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Text Summarization with Pretrained Encoders",
"authors": [
{
"first": "Yang",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Mirella",
"middle": [],
"last": "Lapata",
"suffix": ""
}
],
"year": 2019,
"venue": "EMNLP-IJCNLP 2019 -2019 Conference on Empirical Methods in Natural Language Processing and 9th International Joint Conference on Natural Language Processing, Proceedings of the Conference",
"volume": "",
"issue": "",
"pages": "3730--3740",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yang Liu and Mirella Lapata. 2019. Text Summa- rization with Pretrained Encoders. EMNLP-IJCNLP 2019 -2019 Conference on Empirical Methods in Natural Language Processing and 9th International Joint Conference on Natural Language Processing, Proceedings of the Conference, pages 3730-3740.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Effective approaches to attentionbased neural machine translation",
"authors": [
{
"first": "Minh-Thang",
"middle": [],
"last": "Luong",
"suffix": ""
},
{
"first": "Hieu",
"middle": [],
"last": "Pham",
"suffix": ""
},
{
"first": "Christopher D",
"middle": [],
"last": "Manning",
"suffix": ""
}
],
"year": 2015,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1508.04025"
]
},
"num": null,
"urls": [],
"raw_text": "Minh-Thang Luong, Hieu Pham, and Christopher D Manning. 2015. Effective approaches to attention- based neural machine translation. arXiv preprint arXiv:1508.04025.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Rhetorical Structure Theory: Toward a functional theory of text organization",
"authors": [
{
"first": "C",
"middle": [],
"last": "William",
"suffix": ""
},
{
"first": "Sandra",
"middle": [
"A"
],
"last": "Mann",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Thompson",
"suffix": ""
}
],
"year": 1988,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"DOI": [
"10.1515/text.1.1988.8.3.243"
]
},
"num": null,
"urls": [],
"raw_text": "William C. Mann and Sandra A. Thompson. 1988. Rhetorical Structure Theory: Toward a functional theory of text organization.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Discourse Trees are Good Indicators of Importance in Text",
"authors": [
{
"first": "Daniel",
"middle": [],
"last": "Marcu",
"suffix": ""
}
],
"year": 1999,
"venue": "Advances in Automatic Text Summarization",
"volume": "",
"issue": "",
"pages": "123--136",
"other_ids": {
"DOI": [
"10.1017/CBO9781107415324.004"
]
},
"num": null,
"urls": [],
"raw_text": "Daniel Marcu. 1999. Discourse Trees are Good Indica- tors of Importance in Text. Advances in Automatic Text Summarization, pages 123-136.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Are sixteen heads really better than one?",
"authors": [
{
"first": "Paul",
"middle": [],
"last": "Michel",
"suffix": ""
},
{
"first": "Omer",
"middle": [],
"last": "Levy",
"suffix": ""
},
{
"first": "Graham",
"middle": [],
"last": "Neubig",
"suffix": ""
}
],
"year": 2019,
"venue": "Advances in Neural Information Processing Systems",
"volume": "32",
"issue": "",
"pages": "14014--14024",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Paul Michel, Omer Levy, and Graham Neubig. 2019. Are sixteen heads really better than one? In H. Wal- lach, H. Larochelle, A. Beygelzimer, F. dAlch\u00e9-Buc, E. Fox, and R. Garnett, editors, Advances in Neural Information Processing Systems 32, pages 14014- 14024. Curran Associates, Inc.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "A dependency perspective on rst discourse parsing and evaluation",
"authors": [
{
"first": "Mathieu",
"middle": [],
"last": "Morey",
"suffix": ""
},
{
"first": "Philippe",
"middle": [],
"last": "Muller",
"suffix": ""
},
{
"first": "Nicholas",
"middle": [],
"last": "Asher",
"suffix": ""
}
],
"year": 2018,
"venue": "Computational Linguistics",
"volume": "44",
"issue": "2",
"pages": "197--235",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mathieu Morey, Philippe Muller, and Nicholas Asher. 2018. A dependency perspective on rst discourse parsing and evaluation. Computational Linguistics, 44(2):197-235.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Abstractive text summarization using sequence-to-sequence RNNs and beyond",
"authors": [
{
"first": "Ramesh",
"middle": [],
"last": "Nallapati",
"suffix": ""
},
{
"first": "Bowen",
"middle": [],
"last": "Zhou",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Cicero Dos Santos",
"suffix": ""
},
{
"first": "Bing",
"middle": [],
"last": "Aglar Gul\u00e7ehre",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Xiang",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of The 20th SIGNLL Conference on Computational Natural Language Learning",
"volume": "",
"issue": "",
"pages": "280--290",
"other_ids": {
"DOI": [
"10.18653/v1/K16-1028"
]
},
"num": null,
"urls": [],
"raw_text": "Ramesh Nallapati, Bowen Zhou, Cicero dos Santos, \u00c7 aglar Gul\u00e7ehre, and Bing Xiang. 2016. Abstrac- tive text summarization using sequence-to-sequence RNNs and beyond. In Proceedings of The 20th SIGNLL Conference on Computational Natural Lan- guage Learning, pages 280-290, Berlin, Germany. Association for Computational Linguistics.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Tree-structured Attention with Hierarchical Accumulation",
"authors": [
{
"first": "Xuan-Phi",
"middle": [],
"last": "Nguyen",
"suffix": ""
},
{
"first": "Shafiq",
"middle": [],
"last": "Joty",
"suffix": ""
},
{
"first": "C",
"middle": [
"H"
],
"last": "Steven",
"suffix": ""
},
{
"first": "Richard",
"middle": [],
"last": "Hoi",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Socher",
"suffix": ""
}
],
"year": 2020,
"venue": "",
"volume": "",
"issue": "",
"pages": "1--15",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Xuan-Phi Nguyen, Shafiq Joty, Steven C. H. Hoi, and Richard Socher. 2020. Tree-structured Attention with Hierarchical Accumulation. pages 1-15.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Fixed Encoder Self-Attention Patterns in Transformer-Based Machine Translation",
"authors": [
{
"first": "Alessandro",
"middle": [],
"last": "Raganato",
"suffix": ""
},
{
"first": "Yves",
"middle": [],
"last": "Scherrer",
"suffix": ""
},
{
"first": "J\u00f6rg",
"middle": [],
"last": "Tiedemann",
"suffix": ""
}
],
"year": 2020,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Alessandro Raganato, Yves Scherrer, and J\u00f6rg Tiede- mann. 2020. Fixed Encoder Self-Attention Patterns in Transformer-Based Machine Translation.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Ordered neurons: Integrating tree structures into recurrent neural networks",
"authors": [
{
"first": "Yikang",
"middle": [],
"last": "Shen",
"suffix": ""
},
{
"first": "Shawn",
"middle": [],
"last": "Tan",
"suffix": ""
},
{
"first": "Alessandro",
"middle": [],
"last": "Sordoni",
"suffix": ""
},
{
"first": "Aaron",
"middle": [],
"last": "Courville",
"suffix": ""
}
],
"year": 2019,
"venue": "7th International Conference on Learning Representations",
"volume": "",
"issue": "",
"pages": "1--14",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yikang Shen, Shawn Tan, Alessandro Sordoni, and Aaron Courville. 2019. Ordered neurons: Integrat- ing tree structures into recurrent neural networks. 7th International Conference on Learning Represen- tations, ICLR 2019, pages 1-14.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Synthesizer: Rethinking self-attention in transformer models",
"authors": [
{
"first": "Yi",
"middle": [],
"last": "Tay",
"suffix": ""
},
{
"first": "Dara",
"middle": [],
"last": "Bahri",
"suffix": ""
},
{
"first": "Donald",
"middle": [],
"last": "Metzler",
"suffix": ""
},
{
"first": "Da-Cheng",
"middle": [],
"last": "Juan",
"suffix": ""
},
{
"first": "Zhe",
"middle": [],
"last": "Zhao",
"suffix": ""
},
{
"first": "Che",
"middle": [],
"last": "Zheng",
"suffix": ""
}
],
"year": 2020,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yi Tay, Dara Bahri, Donald Metzler, Da-Cheng Juan, Zhe Zhao, and Che Zheng. 2020. Synthesizer: Re- thinking self-attention in transformer models.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "Attention is all you need",
"authors": [
{
"first": "Ashish",
"middle": [],
"last": "Vaswani",
"suffix": ""
},
{
"first": "Noam",
"middle": [],
"last": "Shazeer",
"suffix": ""
},
{
"first": "Niki",
"middle": [],
"last": "Parmar",
"suffix": ""
},
{
"first": "Jakob",
"middle": [],
"last": "Uszkoreit",
"suffix": ""
},
{
"first": "Llion",
"middle": [],
"last": "Jones",
"suffix": ""
},
{
"first": "Aidan",
"middle": [
"N"
],
"last": "Gomez",
"suffix": ""
},
{
"first": "\u0141ukasz",
"middle": [],
"last": "Kaiser",
"suffix": ""
},
{
"first": "Illia",
"middle": [],
"last": "Polosukhin",
"suffix": ""
}
],
"year": 2017,
"venue": "Advances in Neural Information Processing Systems",
"volume": "",
"issue": "",
"pages": "5999--6009",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N. Gomez, \u0141ukasz Kaiser, and Illia Polosukhin. 2017. Attention is all you need. Advances in Neural Information Process- ing Systems, 2017-Decem(Nips):5999-6009.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Analyzing the structure of attention in a transformer language model",
"authors": [
{
"first": "Jesse",
"middle": [],
"last": "Vig",
"suffix": ""
},
{
"first": "Yonatan",
"middle": [],
"last": "Belinkov",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 2019 ACL Workshop BlackboxNLP: Analyzing and Interpreting Neural Networks for NLP",
"volume": "",
"issue": "",
"pages": "63--76",
"other_ids": {
"DOI": [
"10.18653/v1/W19-4808"
]
},
"num": null,
"urls": [],
"raw_text": "Jesse Vig and Yonatan Belinkov. 2019. Analyzing the structure of attention in a transformer language model. In Proceedings of the 2019 ACL Workshop BlackboxNLP: Analyzing and Interpreting Neural Networks for NLP, pages 63-76, Florence, Italy. As- sociation for Computational Linguistics.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "A two-stage parsing method for text-level discourse analysis",
"authors": [
{
"first": "Yizhong",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Sujian",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Houfeng",
"middle": [],
"last": "Wang",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics",
"volume": "2",
"issue": "",
"pages": "184--188",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yizhong Wang, Sujian Li, and Houfeng Wang. 2017. A two-stage parsing method for text-level discourse analysis. In Proceedings of the 55th Annual Meet- ing of the Association for Computational Linguistics (Volume 2: Short Papers), pages 184-188.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "Toward fast and accurate neural discourse segmentation",
"authors": [
{
"first": "Yizhong",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Sujian",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Jingfeng",
"middle": [],
"last": "Yang",
"suffix": ""
}
],
"year": 2018,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1808.09147"
]
},
"num": null,
"urls": [],
"raw_text": "Yizhong Wang, Sujian Li, and Jingfeng Yang. 2018. Toward fast and accurate neural discourse segmen- tation. arXiv preprint arXiv:1808.09147.",
"links": null
},
"BIBREF30": {
"ref_id": "b30",
"title": "Extractive summarization of long documents by combining global and local context",
"authors": [
{
"first": "Wen",
"middle": [],
"last": "Xiao",
"suffix": ""
},
{
"first": "Giuseppe",
"middle": [],
"last": "Carenini",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)",
"volume": "",
"issue": "",
"pages": "3011--3021",
"other_ids": {
"DOI": [
"10.18653/v1/D19-1298"
]
},
"num": null,
"urls": [],
"raw_text": "Wen Xiao and Giuseppe Carenini. 2019. Extractive summarization of long documents by combining global and local context. In Proceedings of the 2019 Conference on Empirical Methods in Natu- ral Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP), pages 3011-3021, Hong Kong, China. Association for Computational Linguistics.",
"links": null
},
"BIBREF31": {
"ref_id": "b31",
"title": "Discourse-aware neural extractive text summarization",
"authors": [
{
"first": "Jiacheng",
"middle": [],
"last": "Xu",
"suffix": ""
},
{
"first": "Zhe",
"middle": [],
"last": "Gan",
"suffix": ""
},
{
"first": "Yu",
"middle": [],
"last": "Cheng",
"suffix": ""
},
{
"first": "Jingjing",
"middle": [],
"last": "Liu",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "5021--5031",
"other_ids": {
"DOI": [
"10.18653/v1/2020.acl-main.451"
]
},
"num": null,
"urls": [],
"raw_text": "Jiacheng Xu, Zhe Gan, Yu Cheng, and Jingjing Liu. 2020. Discourse-aware neural extractive text sum- marization. In Proceedings of the 58th Annual Meet- ing of the Association for Computational Linguistics, pages 5021-5031, Online. Association for Computa- tional Linguistics.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"uris": null,
"text": "Structure of the extractive summarization framework containing the Synthesizer moduleFigure 3: Comparison of attention methods. (a),(b) and (c) taken from (Tay et al., 2020), (d) proposed in this paper.",
"num": null,
"type_str": "figure"
},
"FIGREF1": {
"uris": null,
"text": "Dependency tree-to-matrix conversion.",
"num": null,
"type_str": "figure"
},
"FIGREF2": {
"uris": null,
"text": "Constituency tree-to-matrix conversion. Left: Structure only, Right: Structure and Nuclearity area of extractive summarization, using a BERT sentence-encoder instead of the previously used BERT EDU-encoder.",
"num": null,
"type_str": "figure"
},
"TABREF0": {
"num": null,
"content": "<table><tr><td colspan=\"5\">#token #EDU #Sent #EDU(O.) #Sent(O.)</td></tr><tr><td>546</td><td>70.2</td><td>27.2</td><td>6.4</td><td>3.1</td></tr><tr><td colspan=\"5\">Table 1: Statistics of the CNNDM dataset. O. means</td></tr><tr><td colspan=\"4\">the average number of units in the oracle</td><td/></tr></table>",
"text": "Based on the average number of units selected",
"type_str": "table",
"html": null
},
"TABREF1": {
"num": null,
"content": "<table><tr><td>Model</td><td colspan=\"6\">Rouge-1 Rouge-2 Rouge-L # Heads # Params(attn) # Params</td></tr><tr><td>Lead6</td><td>37.99</td><td>15.56</td><td>34.08</td><td>-</td><td>-</td><td>-</td></tr><tr><td>Oracle</td><td>62.08</td><td>38.20</td><td>58.86</td><td>-</td><td>-</td><td>-</td></tr><tr><td>DiscoBERT(5 EDUs)</td><td>43.77</td><td>20.85</td><td>40.67</td><td>-</td><td>-</td><td>-</td></tr><tr><td colspan=\"3\">Default Models (d k Dot Product(8) 41.02 18.78</td><td>37.96</td><td>8</td><td>3.2M</td><td>12.7M</td></tr><tr><td>Dot Product(1)</td><td>40.92 \u2021</td><td>18.69 \u2021</td><td>37.85 \u2021</td><td>1</td><td>0.4M</td><td>9.9M</td></tr><tr><td>Dense</td><td>40.70</td><td>18.65 \u2020</td><td>37.74 \u2020</td><td>1</td><td>1.5M</td><td>11.0M</td></tr><tr><td>Learned Random</td><td>40.24</td><td>18.28</td><td>37.32</td><td>1</td><td>0.7M</td><td>10.3M</td></tr><tr><td>Fixed Random</td><td>40.36</td><td>18.35</td><td>37.40</td><td>1</td><td>0.2M</td><td>9.7M</td></tr><tr><td>No attention</td><td>39.89</td><td>17.98</td><td>36.99</td><td>1</td><td>0.2M</td><td>9.7M</td></tr><tr><td>D-Tree</td><td>40.43</td><td>18.32</td><td>37.45</td><td>1</td><td>0.2M</td><td>9.7M</td></tr><tr><td>C-Tree</td><td>40.80 \u2020</td><td>18.56</td><td>37.74 \u2020</td><td>1</td><td>0.2M</td><td>9.7M</td></tr><tr><td>C-Tree w/Nuc</td><td>40.76</td><td>18.59 \u2020</td><td>37.73</td><td>1</td><td>0.2M</td><td>9.7M</td></tr><tr><td colspan=\"6\">Balanced Models (d k = d v = d q = 512, d inner = 512)</td><td/></tr><tr><td>Dot Product(8)</td><td>40.95</td><td>18.52</td><td>37.78</td><td>8</td><td>25.2M</td><td>27M</td></tr><tr><td>Dot Product(1)</td><td>40.64</td><td>18.33</td><td>37.54</td><td>1</td><td>3.2M</td><td>4.8M</td></tr><tr><td>Dense</td><td>40.87 \u2021</td><td>18.59 \u2021</td><td>37.79 \u2021</td><td>1</td><td>2.9M</td><td>4.5M</td></tr><tr><td>Learned Random</td><td>40.32</td><td>18.22</td><td>37.31</td><td>1</td><td>2.1M</td><td>3.8M</td></tr><tr><td>Fixed Random</td><td>40.18</td><td>18.13</td><td>37.19</td><td>1</td><td>1.6M</td><td>3.2M</td></tr><tr><td>No attention</td><td>40.21</td><td>18.17</td><td>37.22</td><td>1</td><td>1.6M</td><td>3.2M</td></tr><tr><td>D-Tree</td><td>40.29</td><td>18.17</td><td>37.29</td><td>1</td><td>1.6M</td><td>3.2M</td></tr><tr><td>C-Tree</td><td>40.28</td><td>18.13</td><td>37.28</td><td>1</td><td>1.6M</td><td>3.2M</td></tr><tr><td>C-Tree w/Nuc</td><td>40.70</td><td>18.46 \u2020 \u2021</td><td>37.63</td><td>1</td><td>1.6M</td><td>3.2M</td></tr></table>",
"text": "512 and d inner = 512 for all models. During training, we use a scheduled learning-rate (lr = 1e \u2212 2) with standard warm-up steps for the Adam opti-= d v = d q = 64, d inner = 3072)",
"type_str": "table",
"html": null
},
"TABREF2": {
"num": null,
"content": "<table><tr><td>Model</td><td colspan=\"6\">Rouge-1 Rouge-2 Rouge-L # Heads # Params(attn) # Params</td></tr><tr><td>Lead3</td><td>40.30</td><td>17.52</td><td>36.54</td><td>-</td><td>-</td><td>-</td></tr><tr><td>Oracle</td><td>56.04</td><td>33.10</td><td>52.29</td><td>-</td><td>-</td><td>-</td></tr><tr><td>BERTSUM(w/Tri-Block)</td><td>43.25</td><td>20.24</td><td>39.63</td><td>-</td><td>-</td><td>118M</td></tr><tr><td colspan=\"3\">Default Models (d k Dot Product(8) 41.82 19.18</td><td>38.18</td><td>8</td><td>3.2M</td><td>12.7M</td></tr><tr><td>Dot Product(1)</td><td>41.71 \u2021</td><td>19.08 \u2021</td><td>38.08 \u2021</td><td>1</td><td>0.4M</td><td>9.9M</td></tr><tr><td>Dense</td><td>41.69 \u2020</td><td colspan=\"2\">19.07 \u2021 \u2020 38.08 \u2021 \u2020</td><td>1</td><td>1.5M</td><td>11.0M</td></tr><tr><td>Learned Random</td><td>41.21</td><td>18.86</td><td>37.67</td><td>1</td><td>0.7M</td><td>10.3M</td></tr><tr><td>Fixed Random</td><td>41.27</td><td>18.91</td><td>37.72</td><td>1</td><td>0.2M</td><td>9.7M</td></tr><tr><td>No attention</td><td>40.97</td><td>18.64</td><td>37.44</td><td>1</td><td>0.2M</td><td>9.7M</td></tr><tr><td>D-Tree</td><td>41.44</td><td>18.87</td><td>37.83</td><td>1</td><td>0.2M</td><td>9.7M</td></tr><tr><td>C-Tree</td><td>41.64 \u2020</td><td>19.04 \u2020</td><td>38.03 \u2020</td><td>1</td><td>0.2M</td><td>9.7M</td></tr><tr><td>C-Tree w/Nuc</td><td>41.64 \u2020</td><td>19.05 \u2020</td><td>38.03 \u2020</td><td>1</td><td>0.2M</td><td>9.7M</td></tr><tr><td colspan=\"5\">Balanced Models (d k = d v = d q = 512, d inner = 512)</td><td/><td/></tr><tr><td>Dot Product(8)</td><td>41.45</td><td>18.88</td><td>37.84</td><td>8</td><td>25.2M</td><td>27M</td></tr><tr><td>Dot Product(1)</td><td>41.51</td><td>18.95</td><td>37.94</td><td>1</td><td>3.2M</td><td>4.8M</td></tr><tr><td>Dense</td><td>41.63 \u2020</td><td>19.05 \u2020</td><td>38.01 \u2020</td><td>1</td><td>2.9M</td><td>4.5M</td></tr><tr><td>Learned Random</td><td>41.26</td><td>18.83</td><td>37.70</td><td>1</td><td>2.1M</td><td>3.7M</td></tr><tr><td>Fixed Random</td><td>41.17</td><td>18.81</td><td>37.61</td><td>1</td><td>1.6M</td><td>3.2M</td></tr><tr><td>No attention</td><td>41.25</td><td>18.75</td><td>37.68</td><td>1</td><td>1.6M</td><td>3.2M</td></tr><tr><td>D-Tree</td><td>41.31</td><td>18.80</td><td>37.75</td><td>1</td><td>1.6M</td><td>3.2M</td></tr><tr><td>C-Tree</td><td>41.68</td><td>19.11</td><td>38.12</td><td>1</td><td>1.6M</td><td>3.2M</td></tr><tr><td>C-Tree w/Nuc</td><td>41.64 \u2020</td><td>19.02 \u2020</td><td>38.06 \u2020</td><td>1</td><td>1.6M</td><td>3.2M</td></tr></table>",
"text": "= d v = d q = 64, d inner = 3072)",
"type_str": "table",
"html": null
}
}
}
} |