File size: 138,431 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 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 | {
"paper_id": "2020",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T07:57:56.404198Z"
},
"title": "TextGraphs 2020 Shared Task on Multi-Hop Inference for Explanation Regeneration *",
"authors": [
{
"first": "Peter",
"middle": [],
"last": "Jansen",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Arizona",
"location": {
"country": "USA"
}
},
"email": "pajansen@email.arizona.edu"
},
{
"first": "Dmitry",
"middle": [],
"last": "Ustalov",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Yandex Saint Petersburg",
"location": {
"country": "Russia"
}
},
"email": "dustalov@yandex-team.ru"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "The 2020 Shared Task on Multi-Hop Inference for Explanation Regeneration tasks participants with regenerating large detailed multi-fact explanations for standardized science exam questions. Given a question, correct answer, and knowledge base, models must rank each fact in the knowledge base such that facts most likely to appear in the explanation are ranked highest. Explanations consist of an average of 6 (and as many as 16) facts that span both core scientific knowledge and world knowledge, and form an explicit lexically-connected \"explanation graph\" describing how the facts interrelate. In this second iteration of the explanation regeneration shared task, participants are supplied with more than double the training and evaluation data of the first shared task, as well as a knowledge base nearly double in size, both of which expand into more challenging scientific topics that increase the difficulty of the task. In total 10 teams participated, and 5 teams submitted system description papers. The best-performing teams significantly increased state-of-the-art performance both in terms of ranking (mean average precision) and inference speed on this challenge task.",
"pdf_parse": {
"paper_id": "2020",
"_pdf_hash": "",
"abstract": [
{
"text": "The 2020 Shared Task on Multi-Hop Inference for Explanation Regeneration tasks participants with regenerating large detailed multi-fact explanations for standardized science exam questions. Given a question, correct answer, and knowledge base, models must rank each fact in the knowledge base such that facts most likely to appear in the explanation are ranked highest. Explanations consist of an average of 6 (and as many as 16) facts that span both core scientific knowledge and world knowledge, and form an explicit lexically-connected \"explanation graph\" describing how the facts interrelate. In this second iteration of the explanation regeneration shared task, participants are supplied with more than double the training and evaluation data of the first shared task, as well as a knowledge base nearly double in size, both of which expand into more challenging scientific topics that increase the difficulty of the task. In total 10 teams participated, and 5 teams submitted system description papers. The best-performing teams significantly increased state-of-the-art performance both in terms of ranking (mean average precision) and inference speed on this challenge task.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Multi-hop inference is the task of combining two or more facts to make an inference. In the context of natural language processing, this is often studied in terms of question answering tasks, where a model must combine multiple textual facts (typically retrieved from different books, web pages, or other documents) to answer a question correctly. With the recent field-wide push towards building machine learning models that are able to explain the reasons behind their inferences, multi-hop inference has garnered a renewed interest, as the set of connected facts used to perform the inference can be supplied to the user as a form of human-readable explanation for why the inference is correct.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Multi-hop inference can be extremely challenging, particularly as the number of facts required to perform an inference increases, which typically causes large drops in performance (Fried et al., 2015; Jansen et al., 2017) and places strong limits on inference capacity (Jansen, 2018; Khashabi et al., 2019) . Moreover, a body of recent work suggests that, in spite of steadily increasing performance on multi-hop benchmarks, much of this performance may be due to strong retrieval baselines rather than methods that are explicitly performing compositional inference (Min et al., 2019; Chen and Durrett, 2019; Trivedi et al., 2020) . The Shared Task on Multi-Hop Inference for Explanation Regeneration aims to address some of these contemporary challenges in multi-hop inference by asking participants to develop systems that can construct very large multi-fact explanations for science exam questions that contain up to 16 facts. The task simplifies the question answering problem, supplying both question and correct answer a given model, allowing that model to squarely focus on the explanation construction task. For a given question, a model must pick a complete set of explanatory facts from a knowledge base of approximately 10,000 semi-structured facts that span core scientific knowledge as well as detailed common sense or world knowledge. These model-generated explanations are then evaluated against hand-authored explanations generated by skilled human annotators whose goals in authoring were both explanatory completeness and having a high level of explanatory depth. An example question, answer, and short explanation graph is shown in Figure 1 .",
"cite_spans": [
{
"start": 180,
"end": 200,
"text": "(Fried et al., 2015;",
"ref_id": "BIBREF12"
},
{
"start": 201,
"end": 221,
"text": "Jansen et al., 2017)",
"ref_id": "BIBREF17"
},
{
"start": 269,
"end": 283,
"text": "(Jansen, 2018;",
"ref_id": "BIBREF19"
},
{
"start": 284,
"end": 306,
"text": "Khashabi et al., 2019)",
"ref_id": "BIBREF23"
},
{
"start": 566,
"end": 584,
"text": "(Min et al., 2019;",
"ref_id": "BIBREF31"
},
{
"start": 585,
"end": 608,
"text": "Chen and Durrett, 2019;",
"ref_id": "BIBREF4"
},
{
"start": 609,
"end": 630,
"text": "Trivedi et al., 2020)",
"ref_id": "BIBREF37"
}
],
"ref_spans": [
{
"start": 1651,
"end": 1659,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In the context of contemporary datasets for multi-hop inference, the WorldTree V2 corpus (Xie et al., 2020) used in this shared task has both substantially larger multi-hop inference problems and substantially less training data than other multi-hop inference datasets, making this shared task extremely challenging. For example, the frequently used HotpotQA dataset (Yang et al., 2018) requires aggregating sentences from 2 paragraphs in Wikipedia, and has seen contemporary models reach nearly 90% performance on its analogous supporting-fact selection task 1 . Similarly, QASC , a science-domain dataset 2 similar to WorldTree that requires selecting two supporting facts from a corpus, has also seen accuracy reach 90% (Khashabi et al., 2020) . In contrast, the best-performing model in this 2020 shared task was able to achieve a MAP of 0.60 on the 1-to-16 fact multi-hop inference problems in WorldTree V2, highlighting the difficulty of this challenge task, and showcasing that there is still plenty of room to grow. An example 13-fact explanation from this shared task is shown in Figure 2 , illustrating the difference in difficulty between generating 2-fact explanations and many-fact explanations that include detailed world knowledge.",
"cite_spans": [
{
"start": 89,
"end": 107,
"text": "(Xie et al., 2020)",
"ref_id": "BIBREF39"
},
{
"start": 367,
"end": 386,
"text": "(Yang et al., 2018)",
"ref_id": "BIBREF40"
},
{
"start": 723,
"end": 746,
"text": "(Khashabi et al., 2020)",
"ref_id": "BIBREF24"
}
],
"ref_spans": [
{
"start": 1089,
"end": 1097,
"text": "Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "This is the second iteration of the Shared Task on Multi-Hop Inference for Explanation Regeneration, which keeps the task identical to the first iteration run in 2019 (Jansen and Ustalov, 2019) , but more than doubles the available training data, evaluation data, and supporting knowledge base. This increase in size is largely due to expanding the explanation corpus to more advanced years of standardized science exams, causing the task to also become significantly more challenging. In this regard, baseline tf.idf performance decreased from 0.30 MAP in 2019 to 0.23 MAP in 2020, a drop of more than 20% in performance, highlighting the challenging nature of this additional data. Participating teams used a wide variety of approaches, typically with large language models featuring prominently, augmented with graph neural networks, integer linear programming, or iterative scoring methods for the multi-hop inference task. In spite of the dataset being substantially more challenging than the 2019 shared task, participants made substantial increases both in overall task performance as well as in the speed of training and inference.",
"cite_spans": [
{
"start": 167,
"end": 193,
"text": "(Jansen and Ustalov, 2019)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Our shared task has been organized on the CodaLab platform. 3 We released train and development datasets along with the baseline solution in advance to allow one to get to know the task specifics. We ran the practice phase from March 1 till April 5, 2020. Then we released the test dataset without answers and ran the official evaluation phase from April 6 till September 21, 2020. After that we established post-competition phase to enable long-term evaluation of the methods beyond our competition.",
"cite_spans": [
{
"start": 60,
"end": 61,
"text": "3",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In this shared task summary paper we first highlight some of the contemporary challenges in multi-hop inference. We then describe the explanation regeneration task (framed as a ranking problem), the details of the training and evaluation dataset used for the shared task, followed by competition details and system descriptions for participating teams.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "A number of contemporary challenges exist in performing multi-hop inference for question answering, with several highlighted below. For a more in-depth survey of contemporary challenges and methods for multi-hop inference, see Thayaparan et al. (2020) .",
"cite_spans": [
{
"start": 227,
"end": 251,
"text": "Thayaparan et al. (2020)",
"ref_id": "BIBREF36"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Contemporary Challenges in Multi-Hop Inference",
"sec_num": "2"
},
{
"text": "Semantic Drift. Semantic drift is the tendency for inference algorithms based on graph traversal to traverse from highly-relevant facts (nodes) towards irrelevant nodes based on noisy signals. For example, when answering a question about popular varieties of orchard apples, without mechanisms to control for semantic drift, a given algorithm might traverse to facts about popular apple computers because common signals for traversal (such as two facts having one or more of the same words) are often noisy and lack context. Semantic drift has been observed across a wide variety of representations and traversal methods Figure 1 : An example of the explanation regeneration task. A model is supplied with a question and correct answer (top), and from this must construct an explanation from facts in the supporting knowledge base. An example 3-fact gold explanation is shown (bottom). Facts are connected to question, answer, and/or other facts by explicit lexical overlap (edges). from word and dependency level (Fried et al., 2015; Pan et al., 2017) to sentence-level (Jansen et al., 2017) to paragraph-level (Clark and Gardner, 2018) .",
"cite_spans": [
{
"start": 1014,
"end": 1034,
"text": "(Fried et al., 2015;",
"ref_id": "BIBREF12"
},
{
"start": 1035,
"end": 1052,
"text": "Pan et al., 2017)",
"ref_id": "BIBREF32"
},
{
"start": 1071,
"end": 1092,
"text": "(Jansen et al., 2017)",
"ref_id": "BIBREF17"
},
{
"start": 1112,
"end": 1137,
"text": "(Clark and Gardner, 2018)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [
{
"start": 621,
"end": 629,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Contemporary Challenges in Multi-Hop Inference",
"sec_num": "2"
},
{
"text": "Many-hop multi-hop training data. Large, high-quality datasets for training multi-hop inference models generally were not available until recently (Yang et al., 2018; Xie et al., 2020) . Even as such, pragmatic challenges in dataset construction necessitate that each dataset will have limitations. The ideal dataset would be: (1) large in terms of the number of training and evaluation examples, (2) use natural rather than artificial questions, (3) use found (retrieved) rather than authored facts, (4) contain large many-fact multi-hop inference problems, (5) include explicit details of the inference required to be made, including any common sense or world knowledge that may otherwise be implicit and inaccessible to a model. In general, existing datasets tend to compromise on at least several of these (and other) desiderata for technical or pragmatic reasons (such as cost or scalability).",
"cite_spans": [
{
"start": 147,
"end": 166,
"text": "(Yang et al., 2018;",
"ref_id": "BIBREF40"
},
{
"start": 167,
"end": 184,
"text": "Xie et al., 2020)",
"ref_id": "BIBREF39"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Contemporary Challenges in Multi-Hop Inference",
"sec_num": "2"
},
{
"text": "Relevance versus Completeness Judgements in Explanations. A given corpus will typically have facts that may have a spectrum of relevancies towards a given inference -some highly relevant, others completely irrelevant -and many of those facts may significantly overlap in the information they convey. Orthogonal to this is the idea of explanatory completeness -finding a set of facts that forms a complete inference chain, without holes or gaps, to arrive from question to correct answer. In dataset construction, it appears to be much easier to annotate relevance rather than make completeness judgements. Even still, human relevance judgements are typically provided for only a small subset of the facts in a corpus, as there are often multiple paths to building an explanation for a given question, and exhaustively constructing them all would be intractable. These are significant methodological limitations in training and evaluating contemporary multi-hop inference algorithms.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Contemporary Challenges in Multi-Hop Inference",
"sec_num": "2"
},
{
"text": "Chance performance on graph traversal. Intuitively, chance performance of \"hopping\" to relevant facts (nodes) in a knowledge graph can be very low -for example, if only 1% of the links from a given node are relevant to answering and explaining a given question, then chance performance on \"hopping\" to the correct facts in a 6-fact multi-hop explanation would be only 1 in 100 trillion. But, depending on the connection methodology used in graphs of natural language facts, it is possible for as many as 50% of the links from a given node to be relevant, dramatically increasing chance performance (Jansen, 2018) , in some cases to be on the order of the effect sizes typically reported in the literature. This means that methods that appear to be increasing performance on multi-hop inference tasks may have significant proportions of their performance due to chance traversals.",
"cite_spans": [
{
"start": 598,
"end": 612,
"text": "(Jansen, 2018)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Contemporary Challenges in Multi-Hop Inference",
"sec_num": "2"
},
{
"text": "Solving compositional questions with non-compositional methods. Similarly, while some correct multi-hop traversals may be due to chance, a recent body of work has shown that in other cases models may be using non-compositional methods (i.e. retrieving single facts) to correctly answer questions (Min Figure 2 : An example of a challenging explanation graph that contains 13 facts, including both core scientific knowledge as well as detailed common-sense or world knowledge. et al., 2019; Chen and Durrett, 2019). Chen and Durrett (2019) found that simple baseline retrieval models could outperform state-of-the-art multi-hop methods on the HotpotQA dataset. Similarly, Trivedi et al. (2020) found that a large language model can appear to achieve above 70% performance on HotpotQA while only 18% of it's reasoning truly spans multiple facts. Trivedi et al. (2020) note that this is about the same amount of compositional inference a baseline RNN model, suggesting much of the contemporary performance on some multi-hop inference models may be due to better retrieval modules rather than advancing the science of explicitly combining multiple facts to support inferences.",
"cite_spans": [
{
"start": 515,
"end": 538,
"text": "Chen and Durrett (2019)",
"ref_id": "BIBREF4"
},
{
"start": 671,
"end": 692,
"text": "Trivedi et al. (2020)",
"ref_id": "BIBREF37"
},
{
"start": 844,
"end": 865,
"text": "Trivedi et al. (2020)",
"ref_id": "BIBREF37"
}
],
"ref_spans": [
{
"start": 301,
"end": 309,
"text": "Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Contemporary Challenges in Multi-Hop Inference",
"sec_num": "2"
},
{
"text": "Limited direct evaluations of multi-hop inference performance. An issue related to the above is that performance on multi-hop inference tasks is typically reported in terms of the performance on the downstream task (e.g. on question answering, or the ultimate performance in selecting a series of facts that support that inference). We have regularly argued (Fried et al., 2015; Jansen et al., 2017; Jansen, 2018; Jansen and Ustalov, 2019) that this is insufficient, and, when possible, models should explicitly report model performance as the number of facts being combined increases to allow teasing apart the contributions of a strong initial retrieval module with the performance of the mechanism that combines those facts to perform inference. Without this, from a methodological standpoint, it is difficult to measure when we have truly made progress on the multi-hop inference task. 4",
"cite_spans": [
{
"start": 358,
"end": 378,
"text": "(Fried et al., 2015;",
"ref_id": "BIBREF12"
},
{
"start": 379,
"end": 399,
"text": "Jansen et al., 2017;",
"ref_id": "BIBREF17"
},
{
"start": 400,
"end": 413,
"text": "Jansen, 2018;",
"ref_id": "BIBREF19"
},
{
"start": 414,
"end": 439,
"text": "Jansen and Ustalov, 2019)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Contemporary Challenges in Multi-Hop Inference",
"sec_num": "2"
},
{
"text": "The task description follows the 2019 shared task (Jansen and Ustalov, 2019) , and is described briefly here. The explanation regeneration task supplies models with questions, their correct answers, as well as a knowledge base of facts. From this, for a given question, the model must select a set of facts from the knowledge base that matches the gold explanation authored by a human annotator. An example of the explanation regeneration task is shown in Figure 3 While the task is natively a graph construction task, to encourage a wide variety of submissions, and enable evaluation between a wide variety of modeling choices, the explanation regeneration task is framed here as a ranking task, where a given model must selectively rank the facts it believes are in the gold explanation to the top of the list. This allows evaluating systems with standard ranking metrics, where here we make use of Mean Average Precision (MAP). Similarly, for this shared task, the knowledge base exists simultaneously as a semi-structured knowledge base of tables, as well as a large collection of free-text facts, allowing methods that operate over either structured or free text to be directly compared.",
"cite_spans": [
{
"start": 50,
"end": 76,
"text": "(Jansen and Ustalov, 2019)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [
{
"start": 456,
"end": 464,
"text": "Figure 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Task Description",
"sec_num": "3"
},
{
"text": "This 2020 shared task on explanation regeneration transitions from Worldtree V1 to the new WorldTree V2 explanation corpus (Xie et al., 2020) . Similar to the first WorldTree corpus, the second version contains large multi-hop inference problems that require models to construct large, detailed, multi-fact explanations for standardized science exam questions from the United States -but at a greater scale. WorldTree V1 consists of approximately 1.7k questions paired with explanations constructed from a knowledge base of approximately 5k facts, while V2 expands this to 4.4k questions and a knowledge base of 10k facts, more than doubling the amount of training and evaluation data available.",
"cite_spans": [
{
"start": 123,
"end": 141,
"text": "(Xie et al., 2020)",
"ref_id": "BIBREF39"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Training and Evaluation Dataset",
"sec_num": "4"
},
{
"text": "Questions. Questions consist of standardized science exam questions drawn from the Aristo Reasoning Challenge (ARC) corpus , a set of 4-choice multiple choice questions primarily drawn from 12 US states over the past two decades. Where the 2019 shared task consisted entirely of elementary science questions (intended for students typically between 9 to 10 years in age), the additional questions in the 2020 shared task primarily expand into middle school science (intended for students between 13 and 14 years of age). These questions typically require broader knowledge and more complex forms of reasoning than their elementary counterparts, increasing the overall difficulty of the task.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Training and Evaluation Dataset",
"sec_num": "4"
},
{
"text": "Explanations. Each question in WorldTree is paired with a detailed explanation for why the answer to that question is correct. Explanations take the form of a set of atomic facts that consist of both core scientific knowledge (e.g. \"cellular respiration is when a cell converts from oxygen and carbohydrates into carbon dioxide, water, and energy\") as well as common-sense/world knowledge (e.g. \"if a container contains something, then that container touches that something\"), with the goal of authoring explanations at sufficient explanatory depth to meet the informal goal of making them \"meaningful to a 5 year old\".",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Training and Evaluation Dataset",
"sec_num": "4"
},
{
"text": "Each explanation ranges in length from 1 to over 16 facts (with the average explanation containing 6 facts). The explanations were authored such that key terms in the question, answer, and explanatory facts must be explicitly linked to each other to help make the inference process more explicit -and as such, while the set of facts for each explanation are unordered from the perspective of forming a narrative, they form a lexically-connected \"explanation graph\" describing how the knowledge interconnects.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Training and Evaluation Dataset",
"sec_num": "4"
},
{
"text": "Each fact in an explanation contains an additional rating describing that fact's \"explanatory role\" in the explanation, which can be either CENTRAL, GROUNDING, or LEXICAL GLUE:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Training and Evaluation Dataset",
"sec_num": "4"
},
{
"text": "1. CENTRAL. Central facts are the core facts required to address the scientific concept that the question is asking -for example, a question addressing what happens to a pot of water left outside in the Question. A student placed an ice cube on a plate in the sun. Ten minutes later, only water was on the plate. Which process caused the ice cube to change to water?",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Training and Evaluation Dataset",
"sec_num": "4"
},
{
"text": "Answer Candidates. (A) condensation (B) evaporation (C) freezing (*D) melting",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Training and Evaluation Dataset",
"sec_num": "4"
},
{
"text": "Gold Explanation from WorldTree Corpus. Explanatory Role Fact (Table Row) CENTRAL melting means changing from a solid into a liquid by adding heat energy GROUNDING an ice cube is a kind of solid GROUNDING water is a kind of liquid CENTRAL water is in the solid state, called ice, for temperatures between -273C and 0 C LEXGLUE heat means heat energy LEXGLUE adding heat means increasing temperature CENTRAL if an object absorbs solar energy then that object will increase in temperature CENTRAL if an object is in the sunlight then that object will absorb solar energy CENTRAL the sun is a source of (light ; light energy) called sunlight LEXGLUE to be in the sun means to be in the sunlight CENTRAL melting is a kind of process ice is a kind of food ... 1, 7, 18, 53, 102, 384, 408, 858, 860, 3778, 3956 Average precision of ranking: 0.149 Figure 3 : The example of explanation regeneration as ranking provided to task participants. Models are provided with both a question and correct answer (top). From this, they must selectively rank facts in a knowledge base such that facts most likely to be in the explanation are ranked higher (bottom). This ranked list is then compared to the gold human-authored explanation (middle), and evaluated using mean average precision. Example ranks are shown for the baseline tf.idf model. arctic might contain a central fact such as \"freezing means a substance changes from a liquid to a solid by decreasing heat energy\". On average, each explanation has 2.4 central facts.",
"cite_spans": [
{
"start": 755,
"end": 757,
"text": "1,",
"ref_id": null
},
{
"start": 758,
"end": 760,
"text": "7,",
"ref_id": null
},
{
"start": 761,
"end": 764,
"text": "18,",
"ref_id": null
},
{
"start": 765,
"end": 768,
"text": "53,",
"ref_id": null
},
{
"start": 769,
"end": 773,
"text": "102,",
"ref_id": null
},
{
"start": 774,
"end": 778,
"text": "384,",
"ref_id": null
},
{
"start": 779,
"end": 783,
"text": "408,",
"ref_id": null
},
{
"start": 784,
"end": 788,
"text": "858,",
"ref_id": null
},
{
"start": 789,
"end": 793,
"text": "860,",
"ref_id": null
},
{
"start": 794,
"end": 799,
"text": "3778,",
"ref_id": null
},
{
"start": 800,
"end": 804,
"text": "3956",
"ref_id": null
}
],
"ref_spans": [
{
"start": 62,
"end": 73,
"text": "(Table Row)",
"ref_id": null
},
{
"start": 841,
"end": 849,
"text": "Figure 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Training and Evaluation Dataset",
"sec_num": "4"
},
{
"text": "2. GROUNDING. Grounding facts connect the core concept the question is addressing to specific examples that might be in the question or answer. In our water freezing example, two grounding facts might be \"water is a kind of substance\" and \"the freezing point of water is 0 C\". On average, each explanation has 1.6 grounding facts.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Ranks of gold rows:",
"sec_num": null
},
{
"text": "3. LEXICAL GLUE. Lexical glue facts are an artifact of the requirement that the facts in each explanation must be \"lexically connected\" to each other -i.e. have shared important content lemmas in common.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Ranks of gold rows:",
"sec_num": null
},
{
"text": "If an explanation contains one fact such as \"freezing means a substance changes from a liquid to a solid by decreasing heat energy\" and another that describes \"a fridge can be used for cooling objects\", because the critical link here (the concept of cooling) isn't described using the same words in both facts, the WorldTree explanation authoring procedure requires there to be an additional fact \"cooling means decreasing heat energy\" that makes this link explicit. These explicit linking facts are labeled as lexical glue, and would likely not be required for an explanation intended for adult humans, but help make the link between facts explicit for machine learning algorithms without this world knowledge. On average, each explanation has 1.3 lexical glue facts.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Ranks of gold rows:",
"sec_num": null
},
{
"text": "Knowledge Base. Each fact in WorldTree takes the form of a row in one of 80 semi-structured tables. Each table is centered around a particular kind of knowledge (e.g. taxonomic, part-of, properties, changes, causality, if-then relationships, coupled relationships, affordances, etc.), and contains between 2 and 16 content columns that allow each fact to form a semi-structured n-ary relation. The table topics and structure was empirically derived using prior studies in the science domain as a starting point (Khashabi et al., 2016; Jansen et al., 2016) . Each fact in WorldTree can be used either in this semi-structured form, or read off directly as a plain text sentence, allowing both structured and free-text inference methods to use the same knowledge base, and be directly compared.",
"cite_spans": [
{
"start": 511,
"end": 534,
"text": "(Khashabi et al., 2016;",
"ref_id": "BIBREF21"
},
{
"start": 535,
"end": 555,
"text": "Jansen et al., 2016)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Ranks of gold rows:",
"sec_num": null
},
{
"text": "The 2020 shared task received 10 submissions, nearly doubling submissions from the previous year. System performance is shown in Table 1 . Five of the participating teams submitted system description papers, described below.",
"cite_spans": [],
"ref_spans": [
{
"start": 129,
"end": 136,
"text": "Table 1",
"ref_id": "TABREF2"
}
],
"eq_spans": [],
"section": "System Descriptions and Performance",
"sec_num": "5"
},
{
"text": "Baseline (tf.idf). A term frequency baseline. For a given question and answer pair, the model calculates the cosine similarity between a query vector (composed of term frequencies from either the question or correct answer) and document vectors (composed of term frequencies from a given fact in the knowledge base) for each fact in the knowledge base. This baseline uses the tf.idf weighting scheme when calculating cosine similarity (e.g. see Manning et al. (2008, Ch. 6) ). For each (question, answer, fact) tuple, two cosines are calculated -one between question and fact, the other between answer and fact, and these two scores are combined into a linear model using the SVM rank ranking classifier (Joachims, 2006) , 5 to exhaustively rank each fact in the knowledge base for a given (question, answer) pair.",
"cite_spans": [
{
"start": 445,
"end": 473,
"text": "Manning et al. (2008, Ch. 6)",
"ref_id": null
},
{
"start": 704,
"end": 720,
"text": "(Joachims, 2006)",
"ref_id": "BIBREF20"
},
{
"start": 723,
"end": 724,
"text": "5",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "System Descriptions and Performance",
"sec_num": "5"
},
{
"text": "Baidu PGL. This best-performing system by at Baidu combines language models and graph neural networks in a reranking framework. First, the ERNIE 2.0 language model , which achieves over 90% performance on the GLUE benchmark (Wang et al., 2018) , is used to provide an initial ranking of facts in the knowledge base. The team notes that this nearly doubles oracle ceiling performance compared to a tf.idf model, ranking an average of 92% of gold facts within the top 100, while the initial ranking itself provides a comparatively strong 0.48 MAP on explanation reconstruction as a stand-alone retrieval model. A second ERNIE 2.0-based module then reranks the shortlist from the initial ranker, dramatically increasing performance to 0.59 MAP. A GNN based on GraphSage (Hamilton et al., 2017) is then used to help learn to aggregate facts in a multi-hop fashion, which increases performance by approximately 0.01 MAP. Finally, an ensemble model of the full model is constructed, raising performance 0.02 MAP to reach 0.62 on the development set, while evaluating at 0.60 MAP on the unseen test set.",
"cite_spans": [
{
"start": 224,
"end": 243,
"text": "(Wang et al., 2018)",
"ref_id": "BIBREF38"
},
{
"start": 767,
"end": 790,
"text": "(Hamilton et al., 2017)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "System Descriptions and Performance",
"sec_num": "5"
},
{
"text": "LIIR. The LIIR team at KU Leuven (Cartuyvels et al., 2020 ) approach the explanation regeneration task as an autoregressive re-ranking problem. First, a dynamically-sized shortlist called a \"neighbourhood of visible facts\" is constructed based on pairwise tf.idf distances between questions and all facts in the knowledge base. The model then autoregressively ranks facts by iteratively selecting a top-ranked fact then then re-evaluating the scores of unpicked facts by conditioning them on the set of facts already determined to be within the explanation. As the team notes, \"the role of many facts in explaining a question is not immediately apparent when they are looked at in isolation, and only becomes more evident when they are considered as a part of a larger explanation\". This intuition arguably allows the LIIR model to incorporate both relevance and explanatory completeness (relative to other facts) into their iteratively constructed explanations. LIIR compare their model to the TextGraphs 2019 Shared Task winner (Chains of Reasoning, Das et al. 2019), and note that their autoregressive model significantly outperforms Chains of Reasoning on both 2019 and 2020 datasets while taking approximately one-tenth the training time and one-half the inference time of the winning 2019 model.",
"cite_spans": [
{
"start": 33,
"end": 57,
"text": "(Cartuyvels et al., 2020",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "System Descriptions and Performance",
"sec_num": "5"
},
{
"text": "ChiSquaredX. Large pre-trained language models serving as retrieval modules are the dominant contributor to performance in many approaches to the explanation regeneration task. While Chains of Reasoning previously showed that a BERT baseline can achieve state-of-the-art performance if exhaustively used to evaluate all candidates (Das et al., 2019) , this is computationally expensive (particularly as the knowledge base size increases), and typically participants have chosen to use a language model to rerank the top-k ranked items from a less expensive retretrieval model, such as a tf.idf retriever. The number of available pre-trained language models has dramatically increased in the past year, and the ChiSquareX team (Pawate et al., 2020) examine explanation regeneration performance for a large subset of popular classic and newer language models when reranking the top-100 facts from a tf.idf model, particularly in contexts where training time is limited. The ChiSquaredX team examine ALBERT (Lan et al., 2019) , BART , BERT (Devlin et al., 2019) , DistilBERT (Sanh et al., 2019) , ELECTRA , SciBERT (Beltagy et al., 2019) , and RoBERTa . ChiSquaredX report that, for the top-100 ranked facts, reraning performance can vary by several points depending on which model is chosen, while increasing the top-k can further increase performance by several points. Their top-performing RoBERTa model achieves a MAP of 0.51 when reranking the top-500 facts retrieved by their tf.idf model.",
"cite_spans": [
{
"start": 331,
"end": 349,
"text": "(Das et al., 2019)",
"ref_id": "BIBREF10"
},
{
"start": 1004,
"end": 1022,
"text": "(Lan et al., 2019)",
"ref_id": "BIBREF26"
},
{
"start": 1037,
"end": 1058,
"text": "(Devlin et al., 2019)",
"ref_id": "BIBREF11"
},
{
"start": 1072,
"end": 1091,
"text": "(Sanh et al., 2019)",
"ref_id": "BIBREF34"
},
{
"start": 1112,
"end": 1134,
"text": "(Beltagy et al., 2019)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "System Descriptions and Performance",
"sec_num": "5"
},
{
"text": "Red Dragon AI. The Red Dragon AI team (Chia et al., 2020) present three model components for explanation regeneration. The first, an updated iterative-BM25 (I-BM25) module from the 2019 shared task (Chia et al., 2019) , iteratively constructs a query vector by aggregating the closest N facts in the knowledge base, and is able to independently achieve a MAP of 0.47. The shortlisted results from the I-BM25 module are then reranked by one of two models: a transformer followed by an LSTM, or an LSTM-Interleaved Transformer (LIT), both of which were constructed to enable cross-document (here, cross-fact) interactions to help compose explanations jointly instead of one fact at a time. Their best performing I-BM25 + LIT model achieves a MAP of 0.56, nearly ten points higher than the I-BM25 alone. The team further investigate how several loss functions can affect performance, and empirically demonstrate that Binary Crossentropy outperforms other methods in their model.",
"cite_spans": [
{
"start": 198,
"end": 217,
"text": "(Chia et al., 2019)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "System Descriptions and Performance",
"sec_num": "5"
},
{
"text": "The AG team (Gupta and Srinivasaraghavan, 2020) more directly build explanation graphs by framing explanation regeneration as an Integer Linear Programming (ILP) graph-traversal problem, implemented as a set of constraints for the SemanticILP Solver (Khashabi et al., 2018) . In contrast to Table 2 : Explanation regeneration performance broken down by the proportion of lexical overlap a given explanatory fact has with the question or answer. N refers to the number of questions that have at least one explanatory fact meeting that criterion.",
"cite_spans": [
{
"start": 250,
"end": 273,
"text": "(Khashabi et al., 2018)",
"ref_id": "BIBREF22"
}
],
"ref_spans": [
{
"start": 291,
"end": 298,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "AG.",
"sec_num": null
},
{
"text": "previous approaches towards using ILP on the science exam question set (Khashabi et al., 2016) , to increase tractability, AG select only a shortlist of 30 most-relevant facts ranked from a BERT language model as input to their system, which are then reranked using their ILP model paired with a linear regression module. The total ILP plus regression pipeline achieves a MAP of 0.37.",
"cite_spans": [
{
"start": 71,
"end": 94,
"text": "(Khashabi et al., 2016)",
"ref_id": "BIBREF21"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "AG.",
"sec_num": null
},
{
"text": "The WorldTree corpus is designed to instrument various aspects of the multi-hop inference process, and here as in the first shared task we provide an extended analyses of shared task participant performance beyond the final measure of explanation regeneration quality. As these analyses are identical to those in the 2019 shared task, please see Jansen and Ustalov (2019) for a full description of the analysis metrics and procedures.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Extended Evaluation and Analysis",
"sec_num": "6"
},
{
"text": "One of the core methodological criticisms of current multi-hop inference models is that it is possible to achieve strong downstream performance on the multi-hop inference task without using multi-hop (or \"compositional\") methods (Min et al., 2019; Chen and Durrett, 2019; Trivedi et al., 2020) , and we have argued that performance on compositional inference should be evaluated and reported more directly (Fried et al., 2015; Jansen, 2018; Jansen and Ustalov, 2019) . As part of this, Table 2 shows performance of each model relative to the difficulty of accessing specific facts in an explanation. Some facts in an explanation share many of the same words as the question or answer, and are easier for models to locate than facts that share no words with the question or answer, that (arguably) must be accessed using other means -such as compositional methods that traverse to these challenging facts from other easier-to-locate facts that are \"closer\" to the question. This year, Table 2 illustrates this methodological concern -while the winning BPGL team has higher overall downstream task performance, this appears due to slightly better performance at locating facts with a large amount of lexical overlap with either the question or answer. Similarly, the second-place model demonstrates slightly better performance at finding the most challenging facts that do not have lexical overlap with the question or answer, potentially due to the iterative nature of its collect-then-finish algorithm. That being said, it's important to note that both models have strong relative performance in both these measures, and further analysis would be required to tease apart the relative contributions of each model's retrieval module versus its aggregation module. It's also important to note that all submissions make improvements over the baseline model in accessing the most challenging multi-hop facts, most by substantial margins.",
"cite_spans": [
{
"start": 229,
"end": 247,
"text": "(Min et al., 2019;",
"ref_id": "BIBREF31"
},
{
"start": 248,
"end": 271,
"text": "Chen and Durrett, 2019;",
"ref_id": "BIBREF4"
},
{
"start": 272,
"end": 293,
"text": "Trivedi et al., 2020)",
"ref_id": "BIBREF37"
},
{
"start": 406,
"end": 426,
"text": "(Fried et al., 2015;",
"ref_id": "BIBREF12"
},
{
"start": 427,
"end": 440,
"text": "Jansen, 2018;",
"ref_id": "BIBREF19"
},
{
"start": 441,
"end": 466,
"text": "Jansen and Ustalov, 2019)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [
{
"start": 486,
"end": 493,
"text": "Table 2",
"ref_id": null
},
{
"start": 984,
"end": 991,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Performance by Lexical Overlap / Multiple Hops",
"sec_num": "6.1"
},
{
"text": "In addition to multi-hop inference performance, models can have a spectrum of performance characteristics that can be instrumented either to improve the model, or assessing its suitability for particular tasks. Table 3 : Explanation regeneration performance broken down by explanatory role, knowledge types, and ranking precision profile (Precision@K). Note that small (third decimal) differences in performance relative to Table 1 are possible due to slight differences in how truncated lists are handled during scoring.",
"cite_spans": [],
"ref_spans": [
{
"start": 211,
"end": 218,
"text": "Table 3",
"ref_id": "TABREF4"
},
{
"start": 424,
"end": 431,
"text": "Table 1",
"ref_id": "TABREF2"
}
],
"eq_spans": [],
"section": "Additional Performance Evaluation",
"sec_num": "6.2"
},
{
"text": "performance profile. Of particular note is that while the BPGL and LIIR models perform similarly overall, the BPGL model appears to be accessing significant more central explanatory knowledge to reach its performance, while conversely the LIIR model accesses significantly more lexical glue explanatory knowledge. This is likely due to the difference in methods between the two systems -BPGL leverage a large state-of-the-art language model that is likely able to retrieve many core facts more directly, where as the iterative nature of the LIIR algorithm may require the linking-nature of the lexical-glue facts to enable its multi-hop process and access facts more distant from the question. Both hypotheses are (of course) speculative and based on the narrative of the system descriptions, and would require empirical confirmation, but highlight that different models with very similar overall performance can have different performance profiles and strengths when investigated in more depth.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Additional Performance Evaluation",
"sec_num": "6.2"
},
{
"text": "The 2020 Shared Task on Multi-Hop Inference for Explanation Regeneration successfully achieved a new state-of-the-art performance on the explanation regeneration task using the benchmark WorldTree V2 dataset. Participating teams used a wide variety of methods, typically combining large pre-trained language models with task-specific modules for performing the multi-hop inference task, and improved both explanation regeneration accuracy and speed. Additional analyses show that models with similar downstream performance can show different performance profiles on specific aspects of the task in general, and on multi-hop performance in particular, emphasizing the need to report detailed performance profiles when working on multi-hop inference tasks.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "7"
},
{
"text": "HOTPOTQA leaderboard: https://hotpotqa.github.io/ 2 QASC leaderboard: https://allenai.org/data/qasc 3 https://competitions.codalab.org/competitions/23615",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Indeed, a particularly convincing example of strong multi-hop inference ability might be a model that combines a poor initial retrieval module (producing a long candidate list of facts) with a strong multi-hop module that successfully learns to meaningfully combine subsets of those facts into detailed explanations.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "http://svmlight.joachims.org/",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "The organizers wish to express their thanks to all shared task teams for their participation. We thank Zhengnan Xie, Jaycie Ryrholm Martin, Elizabeth Wainwright, and Steven Marmorstein for contributions to the WorldTree explanation corpus, who were funded by the Allen Institute for Artificial Intelligence (AI2). Peter Jansen's work on the explanation corpus and shared task was supported by National Science Foundation (NSF Award #1815948, \"Explainable Natural Language Inference\").",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgements",
"sec_num": "8"
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "CE] as the thickness ( of something ; of an object ) increases , the resistance ( of that object of that something ) to damage will increase",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "[CE] as the thickness ( of something ; of an object ) increases , the resistance ( of that object of that something ) to damage will increase [COUPLEDRELATIONSHIP]",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "GR] protecting a living thing has a positive impact on that living thing ' s ( survival",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "[GR] protecting a living thing has a positive impact on that living thing ' s ( survival ; health [AFFECT]",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "SciBERT: A Pretrained Language Model for Scientific Text",
"authors": [
{
"first": "Iz",
"middle": [],
"last": "Beltagy",
"suffix": ""
},
{
"first": "Kyle",
"middle": [],
"last": "Lo",
"suffix": ""
},
{
"first": "Arman",
"middle": [],
"last": "Cohan",
"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": "3615--3620",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Iz Beltagy, Kyle Lo, and Arman Cohan. 2019. SciBERT: A Pretrained Language Model for Scientific Text. In Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP), pages 3615-3620, Hong Kong. Association for Computational Linguistics.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Autoregressive Reasoning over Chains of Facts with Transformers",
"authors": [
{
"first": "Ruben",
"middle": [],
"last": "Cartuyvels",
"suffix": ""
},
{
"first": "Graham",
"middle": [],
"last": "Spinks",
"suffix": ""
},
{
"first": "Marie-Francine",
"middle": [],
"last": "Moens",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the 28th International Conference on Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ruben Cartuyvels, Graham Spinks, and Marie-Francine Moens. 2020. Autoregressive Reasoning over Chains of Facts with Transformers. In Proceedings of the 28th International Conference on Computational Linguistics. Association for Computational Linguistics. In press.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Understanding Dataset Design Choices for Multi-hop Reasoning",
"authors": [
{
"first": "Jifan",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Greg",
"middle": [],
"last": "Durrett",
"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": "4026--4032",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jifan Chen and Greg Durrett. 2019. Understanding Dataset Design Choices for Multi-hop Reasoning. In Proceed- ings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers), NAACL-HLT 2019, pages 4026-4032, Minneapolis, MN, USA. Association for Computational Linguistics.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Red Dragon AI at TextGraphs 2019 Shared Task: Language Model Assisted Explanation Generation",
"authors": [
{
"first": "Ken",
"middle": [],
"last": "Yew",
"suffix": ""
},
{
"first": "Sam",
"middle": [],
"last": "Chia",
"suffix": ""
},
{
"first": "Martin",
"middle": [],
"last": "Witteveen",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Andrews",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the Thirteenth Workshop on Graph-Based Methods for Natural Language Processing (TextGraphs-13)",
"volume": "",
"issue": "",
"pages": "85--89",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yew Ken Chia, Sam Witteveen, and Martin Andrews. 2019. Red Dragon AI at TextGraphs 2019 Shared Task: Language Model Assisted Explanation Generation. In Proceedings of the Thirteenth Workshop on Graph-Based Methods for Natural Language Processing (TextGraphs-13), pages 85-89, Hong Kong. Association for Compu- tational Linguistics.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Red Dragon AI at TextGraphs 2020 Shared Task : LIT : LSTM-Interleaved Transformer for Multi-Hop Explanation Ranking",
"authors": [
{
"first": "Ken",
"middle": [],
"last": "Yew",
"suffix": ""
},
{
"first": "Sam",
"middle": [],
"last": "Chia",
"suffix": ""
},
{
"first": "Martin",
"middle": [],
"last": "Witteveen",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Andrews",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the Graph-based Methods for Natural Language Processing (TextGraphs)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yew Ken Chia, Sam Witteveen, and Martin Andrews. 2020. Red Dragon AI at TextGraphs 2020 Shared Task : LIT : LSTM-Interleaved Transformer for Multi-Hop Explanation Ranking. In Proceedings of the Graph-based Methods for Natural Language Processing (TextGraphs). Association for Computational Linguistics.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Simple and Effective Multi-Paragraph Reading Comprehension",
"authors": [
{
"first": "Christopher",
"middle": [],
"last": "Clark",
"suffix": ""
},
{
"first": "Matt",
"middle": [],
"last": "Gardner",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "845--855",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Christopher Clark and Matt Gardner. 2018. Simple and Effective Multi-Paragraph Reading Comprehension. In Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), ACL 2018, pages 845-855, Melbourne, VIC, Australia. Association for Computational Linguistics.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge",
"authors": [
{
"first": "Peter",
"middle": [],
"last": "Clark",
"suffix": ""
},
{
"first": "Isaac",
"middle": [],
"last": "Cowhey",
"suffix": ""
},
{
"first": "Oren",
"middle": [],
"last": "Etzioni",
"suffix": ""
},
{
"first": "Tushar",
"middle": [],
"last": "Khot",
"suffix": ""
},
{
"first": "Ashish",
"middle": [],
"last": "Sabharwal",
"suffix": ""
},
{
"first": "Carissa",
"middle": [],
"last": "Schoenick",
"suffix": ""
},
{
"first": "Oyvind",
"middle": [],
"last": "Tafjord",
"suffix": ""
}
],
"year": 2018,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1803.05457"
]
},
"num": null,
"urls": [],
"raw_text": "Peter Clark, Isaac Cowhey, Oren Etzioni, Tushar Khot, Ashish Sabharwal, Carissa Schoenick, and Oyvind Tafjord. 2018. Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge. arXiv:1803.05457 [cs.AI].",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "ELECTRA: Pre-training Text Encoders as Discriminators Rather Than Generators",
"authors": [
{
"first": "Kevin",
"middle": [],
"last": "Clark",
"suffix": ""
},
{
"first": "Minh-Thang",
"middle": [],
"last": "Luong",
"suffix": ""
},
{
"first": "Quoc",
"middle": [
"V"
],
"last": "Le",
"suffix": ""
},
{
"first": "Christopher",
"middle": [
"D"
],
"last": "Manning",
"suffix": ""
}
],
"year": 2020,
"venue": "International Conference on Learning Representations",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kevin Clark, Minh-Thang Luong, Quoc V. Le, and Christopher D. Manning. 2020. ELECTRA: Pre-training Text Encoders as Discriminators Rather Than Generators. In International Conference on Learning Representations.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Chains-of-Reasoning at TextGraphs 2019 Shared Task: Reasoning over Chains of Facts for Explainable Multi-hop Inference",
"authors": [
{
"first": "Rajarshi",
"middle": [],
"last": "Das",
"suffix": ""
},
{
"first": "Ameya",
"middle": [],
"last": "Godbole",
"suffix": ""
},
{
"first": "Manzil",
"middle": [],
"last": "Zaheer",
"suffix": ""
},
{
"first": "Shehzaad",
"middle": [],
"last": "Dhuliawala",
"suffix": ""
},
{
"first": "Andrew",
"middle": [],
"last": "Mccallum",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the Thirteenth Workshop on Graph-Based Methods for Natural Language Processing (TextGraphs-13)",
"volume": "",
"issue": "",
"pages": "101--117",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rajarshi Das, Ameya Godbole, Manzil Zaheer, Shehzaad Dhuliawala, and Andrew McCallum. 2019. Chains-of- Reasoning at TextGraphs 2019 Shared Task: Reasoning over Chains of Facts for Explainable Multi-hop Infer- ence. In Proceedings of the Thirteenth Workshop on Graph-Based Methods for Natural Language Processing (TextGraphs-13), pages 101-117, Hong Kong. Association for Computational Linguistics.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"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": {},
"num": null,
"urls": [],
"raw_text": "Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2019. BERT: Pre-training of Deep Bidirec- tional Transformers for Language Understanding. 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), NAACL-HLT 2019, pages 4171-4186, Minneapolis, MN, USA. Association for Computational Linguistics.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Higher-order Lexical Semantic Models for Non-factoid Answer Reranking",
"authors": [
{
"first": "Daniel",
"middle": [],
"last": "Fried",
"suffix": ""
},
{
"first": "Peter",
"middle": [],
"last": "Jansen",
"suffix": ""
},
{
"first": "Gustave",
"middle": [],
"last": "Hahn-Powell",
"suffix": ""
},
{
"first": "Mihai",
"middle": [],
"last": "Surdeanu",
"suffix": ""
},
{
"first": "Peter",
"middle": [],
"last": "Clark",
"suffix": ""
}
],
"year": 2015,
"venue": "Transactions of the Association for Computational Linguistics",
"volume": "3",
"issue": "",
"pages": "197--210",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Daniel Fried, Peter Jansen, Gustave Hahn-Powell, Mihai Surdeanu, and Peter Clark. 2015. Higher-order Lexi- cal Semantic Models for Non-factoid Answer Reranking. Transactions of the Association for Computational Linguistics, 3:197-210.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Explanation Regeneration via Multi-Hop ILP Inference over Knowledge Base",
"authors": [
{
"first": "Aayushee",
"middle": [],
"last": "Gupta",
"suffix": ""
},
{
"first": "Gopalakrishnan",
"middle": [],
"last": "Srinivasaraghavan",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the Graph-based Methods for Natural Language Processing (TextGraphs)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Aayushee Gupta and Gopalakrishnan Srinivasaraghavan. 2020. Explanation Regeneration via Multi-Hop ILP Inference over Knowledge Base. In Proceedings of the Graph-based Methods for Natural Language Processing (TextGraphs). Association for Computational Linguistics.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Inductive Representation Learning on Large Graphs",
"authors": [
{
"first": "William",
"middle": [
"L"
],
"last": "Hamilton",
"suffix": ""
},
{
"first": "Rex",
"middle": [],
"last": "Ying",
"suffix": ""
},
{
"first": "Jure",
"middle": [],
"last": "Leskovec",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 31st International Conference on Neural Information Processing Systems, NIPS '17",
"volume": "",
"issue": "",
"pages": "1025--1035",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "William L. Hamilton, Rex Ying, and Jure Leskovec. 2017. Inductive Representation Learning on Large Graphs. In Proceedings of the 31st International Conference on Neural Information Processing Systems, NIPS '17, pages 1025-1035, Long Beach, CA, USA. Curran Associates Inc.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "TextGraphs 2019 Shared Task on Multi-Hop Inference for Explanation Regeneration",
"authors": [
{
"first": "Peter",
"middle": [],
"last": "Jansen",
"suffix": ""
},
{
"first": "Dmitry",
"middle": [],
"last": "Ustalov",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the Thirteenth Workshop on Graph-Based Methods for Natural Language Processing (TextGraphs-13)",
"volume": "",
"issue": "",
"pages": "63--77",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Peter Jansen and Dmitry Ustalov. 2019. TextGraphs 2019 Shared Task on Multi-Hop Inference for Explanation Regeneration. In Proceedings of the Thirteenth Workshop on Graph-Based Methods for Natural Language Processing (TextGraphs-13), pages 63-77, Hong Kong. Association for Computational Linguistics.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "What's in an Explanation? Characterizing Knowledge and Inference Requirements for Elementary Science Exams",
"authors": [
{
"first": "Peter",
"middle": [],
"last": "Jansen",
"suffix": ""
},
{
"first": "Niranjan",
"middle": [],
"last": "Balasubramanian",
"suffix": ""
},
{
"first": "Mihai",
"middle": [],
"last": "Surdeanu",
"suffix": ""
},
{
"first": "Peter",
"middle": [],
"last": "Clark",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers, COLING 2016",
"volume": "",
"issue": "",
"pages": "2956--2965",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Peter Jansen, Niranjan Balasubramanian, Mihai Surdeanu, and Peter Clark. 2016. What's in an Explanation? Char- acterizing Knowledge and Inference Requirements for Elementary Science Exams. In Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers, COLING 2016, pages 2956-2965, Osaka, Japan. The COLING 2016 Organizing Committee.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Framing QA as Building and Ranking Intersentence Answer Justifications",
"authors": [
{
"first": "Peter",
"middle": [],
"last": "Jansen",
"suffix": ""
},
{
"first": "Rebecca",
"middle": [],
"last": "Sharp",
"suffix": ""
},
{
"first": "Mihai",
"middle": [],
"last": "Surdeanu",
"suffix": ""
},
{
"first": "Peter",
"middle": [],
"last": "Clark",
"suffix": ""
}
],
"year": 2017,
"venue": "Computational Linguistics",
"volume": "43",
"issue": "2",
"pages": "407--449",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Peter Jansen, Rebecca Sharp, Mihai Surdeanu, and Peter Clark. 2017. Framing QA as Building and Ranking Intersentence Answer Justifications. Computational Linguistics, 43(2):407-449.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "WorldTree: A Corpus of Explanation Graphs for Elementary Science Questions supporting Multi-hop Inference",
"authors": [
{
"first": "Peter",
"middle": [],
"last": "Jansen",
"suffix": ""
},
{
"first": "Elizabeth",
"middle": [],
"last": "Wainwright",
"suffix": ""
},
{
"first": "Steven",
"middle": [],
"last": "Marmorstein",
"suffix": ""
},
{
"first": "Clayton",
"middle": [],
"last": "Morrison",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the Eleventh International Conference on Language Resources and Evaluation, LREC 2018",
"volume": "",
"issue": "",
"pages": "2732--2740",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Peter Jansen, Elizabeth Wainwright, Steven Marmorstein, and Clayton Morrison. 2018. WorldTree: A Corpus of Explanation Graphs for Elementary Science Questions supporting Multi-hop Inference. In Proceedings of the Eleventh International Conference on Language Resources and Evaluation, LREC 2018, pages 2732-2740, Miyazaki, Japan. European Language Resources Association (ELRA).",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Multi-hop Inference for Sentence-level TextGraphs: How Challenging is Meaningfully Combining Information for Science Question Answering?",
"authors": [
{
"first": "Peter",
"middle": [],
"last": "Jansen",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the Twelfth Workshop on Graph-Based Methods for Natural Language Processing",
"volume": "",
"issue": "",
"pages": "12--17",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Peter Jansen. 2018. Multi-hop Inference for Sentence-level TextGraphs: How Challenging is Meaningfully Com- bining Information for Science Question Answering? In Proceedings of the Twelfth Workshop on Graph-Based Methods for Natural Language Processing, TextGraphs-12, pages 12-17, New Orleans, LA, USA. Association for Computational Linguistics.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Training Linear SVMs in Linear Time",
"authors": [
{
"first": "Thorsten",
"middle": [],
"last": "Joachims",
"suffix": ""
}
],
"year": 2006,
"venue": "Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '06",
"volume": "",
"issue": "",
"pages": "217--226",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Thorsten Joachims. 2006. Training Linear SVMs in Linear Time. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '06, pages 217-226, New York, NY, USA. ACM.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Question Answering via Integer Programming over Semi-Structured Knowledge",
"authors": [
{
"first": "Daniel",
"middle": [],
"last": "Khashabi",
"suffix": ""
},
{
"first": "Tushar",
"middle": [],
"last": "Khot",
"suffix": ""
},
{
"first": "Ashish",
"middle": [],
"last": "Sabharwal",
"suffix": ""
},
{
"first": "Peter",
"middle": [],
"last": "Clark",
"suffix": ""
},
{
"first": "Oren",
"middle": [],
"last": "Etzioni",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Roth",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI-16)",
"volume": "",
"issue": "",
"pages": "1145--1152",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Daniel Khashabi, Tushar Khot, Ashish Sabharwal, Peter Clark, Oren Etzioni, and Dan Roth. 2016. Question Answering via Integer Programming over Semi-Structured Knowledge. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI-16), pages 1145-1152, New York, NY, USA.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Question Answering as Global Reasoning over Semantic Abstractions",
"authors": [
{
"first": "Daniel",
"middle": [],
"last": "Khashabi",
"suffix": ""
},
{
"first": "Tushar",
"middle": [],
"last": "Khot",
"suffix": ""
},
{
"first": "Ashish",
"middle": [],
"last": "Sabharwal",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Roth",
"suffix": ""
}
],
"year": 2018,
"venue": "The Thirty-Second AAAI Conference on Artificial Intelligence (AAAI-18)",
"volume": "",
"issue": "",
"pages": "1905--1914",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Daniel Khashabi, Tushar Khot, Ashish Sabharwal, and Dan Roth. 2018. Question Answering as Global Reasoning over Semantic Abstractions. In The Thirty-Second AAAI Conference on Artificial Intelligence (AAAI-18), pages 1905-1914, New Orleans, LA, USA.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "On the Capabilities and Limitations of Reasoning for Natural Language Understanding",
"authors": [
{
"first": "Daniel",
"middle": [],
"last": "Khashabi",
"suffix": ""
},
{
"first": "Tushar",
"middle": [],
"last": "Erfan Sadeqi Azer",
"suffix": ""
},
{
"first": "Ashish",
"middle": [],
"last": "Khot",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Sabharwal",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Roth",
"suffix": ""
}
],
"year": 2019,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1901.02522"
]
},
"num": null,
"urls": [],
"raw_text": "Daniel Khashabi, Erfan Sadeqi Azer, Tushar Khot, Ashish Sabharwal, and Dan Roth. 2019. On the Capabilities and Limitations of Reasoning for Natural Language Understanding. arXiv:1901.02522 [cs.CL].",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "UNIFIEDQA: Crossing Format Boundaries With a Single QA System",
"authors": [
{
"first": "Daniel",
"middle": [],
"last": "Khashabi",
"suffix": ""
},
{
"first": "Tushar",
"middle": [],
"last": "Khot",
"suffix": ""
},
{
"first": "Ashish",
"middle": [],
"last": "Sabharwal",
"suffix": ""
},
{
"first": "Oyvind",
"middle": [],
"last": "Tafjord",
"suffix": ""
},
{
"first": "Peter",
"middle": [],
"last": "Clark",
"suffix": ""
},
{
"first": "Hannaneh",
"middle": [],
"last": "Hajishirzi",
"suffix": ""
}
],
"year": 2020,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:2005.00700"
]
},
"num": null,
"urls": [],
"raw_text": "Daniel Khashabi, Tushar Khot, Ashish Sabharwal, Oyvind Tafjord, Peter Clark, and Hannaneh Hajishirzi. 2020. UNIFIEDQA: Crossing Format Boundaries With a Single QA System. arXiv:2005.00700 [cs.CL].",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "QASC: A Dataset for Question Answering via Sentence Composition",
"authors": [
{
"first": "Tushar",
"middle": [],
"last": "Khot",
"suffix": ""
},
{
"first": "Peter",
"middle": [],
"last": "Clark",
"suffix": ""
},
{
"first": "Michal",
"middle": [],
"last": "Guerquin",
"suffix": ""
},
{
"first": "Peter",
"middle": [],
"last": "Jansen",
"suffix": ""
},
{
"first": "Ashish",
"middle": [],
"last": "Sabharwal",
"suffix": ""
}
],
"year": 2020,
"venue": "The Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI-20)",
"volume": "",
"issue": "",
"pages": "8082--8090",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tushar Khot, Peter Clark, Michal Guerquin, Peter Jansen, and Ashish Sabharwal. 2020. QASC: A Dataset for Question Answering via Sentence Composition. In The Thirty-Fourth AAAI Conference on Artificial Intelli- gence (AAAI-20), pages 8082-8090, New York, NY, USA.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "ALBERT: A Lite BERT for Self-supervised Learning of Language Representations",
"authors": [
{
"first": "Zhenzhong",
"middle": [],
"last": "Lan",
"suffix": ""
},
{
"first": "Mingda",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Sebastian",
"middle": [],
"last": "Goodman",
"suffix": ""
},
{
"first": "Kevin",
"middle": [],
"last": "Gimpel",
"suffix": ""
},
{
"first": "Piyush",
"middle": [],
"last": "Sharma",
"suffix": ""
},
{
"first": "Radu",
"middle": [],
"last": "Soricut",
"suffix": ""
}
],
"year": 2019,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1909.11942"
]
},
"num": null,
"urls": [],
"raw_text": "Zhenzhong Lan, Mingda Chen, Sebastian Goodman, Kevin Gimpel, Piyush Sharma, and Radu Soricut. 2019. ALBERT: A Lite BERT for Self-supervised Learning of Language Representations. arXiv:1909.11942 [cs.CL].",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehension",
"authors": [
{
"first": "Mike",
"middle": [],
"last": "Lewis",
"suffix": ""
},
{
"first": "Yinhan",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Naman",
"middle": [],
"last": "Goyal",
"suffix": ""
},
{
"first": "Marjan",
"middle": [],
"last": "Ghazvininejad",
"suffix": ""
},
{
"first": "Abdelrahman",
"middle": [],
"last": "Mohamed",
"suffix": ""
},
{
"first": "Omer",
"middle": [],
"last": "Levy",
"suffix": ""
},
{
"first": "Ves",
"middle": [],
"last": "Stoyanov",
"suffix": ""
},
{
"first": "Luke",
"middle": [],
"last": "Zettlemoyer",
"suffix": ""
}
],
"year": 2019,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1910.13461"
]
},
"num": null,
"urls": [],
"raw_text": "Mike Lewis, Yinhan Liu, Naman Goyal, Marjan Ghazvininejad, Abdelrahman Mohamed, Omer Levy, Ves Stoy- anov, and Luke Zettlemoyer. 2019. BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehension. arXiv:1910.13461 [cs.CL].",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "PGL at TextGraphs 2020 Shared Task: Explanation Regeneration using Language and Graph Learning Methods",
"authors": [
{
"first": "Weibin",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Yuxiang",
"middle": [],
"last": "Lu",
"suffix": ""
},
{
"first": "Zhengjie",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "Weiyue",
"middle": [],
"last": "Su",
"suffix": ""
},
{
"first": "Jiaxiang",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Shikun",
"middle": [],
"last": "Feng",
"suffix": ""
},
{
"first": "Yu",
"middle": [],
"last": "Sun",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the Graph-based Methods for Natural Language Processing (TextGraphs)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Weibin Li, Yuxiang Lu, Zhengjie Huang, Weiyue Su, Jiaxiang Liu, Shikun Feng, and Yu Sun. 2020. PGL at TextGraphs 2020 Shared Task: Explanation Regeneration using Language and Graph Learning Methods. In Proceedings of the Graph-based Methods for Natural Language Processing (TextGraphs). Association for Computational Linguistics.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "RoBERTa: A Robustly Optimized BERT Pretraining Approach",
"authors": [
{
"first": "Yinhan",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Myle",
"middle": [],
"last": "Ott",
"suffix": ""
},
{
"first": "Naman",
"middle": [],
"last": "Goyal",
"suffix": ""
},
{
"first": "Jingfei",
"middle": [],
"last": "Du",
"suffix": ""
},
{
"first": "Mandar",
"middle": [],
"last": "Joshi",
"suffix": ""
},
{
"first": "Danqi",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Omer",
"middle": [],
"last": "Levy",
"suffix": ""
},
{
"first": "Mike",
"middle": [],
"last": "Lewis",
"suffix": ""
},
{
"first": "Luke",
"middle": [],
"last": "Zettlemoyer",
"suffix": ""
},
{
"first": "Veselin",
"middle": [],
"last": "Stoyanov",
"suffix": ""
}
],
"year": 2019,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1907.11692"
]
},
"num": null,
"urls": [],
"raw_text": "Yinhan Liu, Myle Ott, Naman Goyal, Jingfei Du, Mandar Joshi, Danqi Chen, Omer Levy, Mike Lewis, Luke Zettlemoyer, and Veselin Stoyanov. 2019. RoBERTa: A Robustly Optimized BERT Pretraining Approach. arXiv:1907.11692 [cs.CL].",
"links": null
},
"BIBREF30": {
"ref_id": "b30",
"title": "Introduction to Information Retrieval",
"authors": [
{
"first": "Christopher",
"middle": [
"D"
],
"last": "Manning",
"suffix": ""
},
{
"first": "Prabhakar",
"middle": [],
"last": "Raghavan",
"suffix": ""
},
{
"first": "Hinrich",
"middle": [],
"last": "Sch\u00fctze",
"suffix": ""
}
],
"year": 2008,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Christopher D. Manning, Prabhakar Raghavan, and Hinrich Sch\u00fctze. 2008. Introduction to Information Retrieval. Cambridge University Press, New York, NY, USA.",
"links": null
},
"BIBREF31": {
"ref_id": "b31",
"title": "Compositional Questions Do Not Necessitate Multi-hop Reasoning",
"authors": [
{
"first": "Sewon",
"middle": [],
"last": "Min",
"suffix": ""
},
{
"first": "Eric",
"middle": [],
"last": "Wallace",
"suffix": ""
},
{
"first": "Sameer",
"middle": [],
"last": "Singh",
"suffix": ""
},
{
"first": "Matt",
"middle": [],
"last": "Gardner",
"suffix": ""
},
{
"first": "Hannaneh",
"middle": [],
"last": "Hajishirzi",
"suffix": ""
},
{
"first": "Luke",
"middle": [],
"last": "Zettlemoyer",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, ACL 2019",
"volume": "",
"issue": "",
"pages": "4249--4257",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sewon Min, Eric Wallace, Sameer Singh, Matt Gardner, Hannaneh Hajishirzi, and Luke Zettlemoyer. 2019. Com- positional Questions Do Not Necessitate Multi-hop Reasoning. In Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, ACL 2019, pages 4249-4257, Florence, Italy. Association for Computational Linguistics.",
"links": null
},
"BIBREF32": {
"ref_id": "b32",
"title": "MEMEN: Multi-layer Embedding with Memory Networks for Machine Comprehension",
"authors": [
{
"first": "Boyuan",
"middle": [],
"last": "Pan",
"suffix": ""
},
{
"first": "Hao",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Zhou",
"middle": [],
"last": "Zhao",
"suffix": ""
}
],
"year": 2017,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1707.09098"
]
},
"num": null,
"urls": [],
"raw_text": "Boyuan Pan, Hao Li, Zhou Zhao, Bin Cao, Deng Cai, and Xiaofei He. 2017. MEMEN: Multi-layer Embedding with Memory Networks for Machine Comprehension. arXiv:1707.09098 [cs.AI].",
"links": null
},
"BIBREF33": {
"ref_id": "b33",
"title": "ChiSquareX at TextGraphs 2020 Shared Task: Leveraging Pretrained Language Models for Explanation Regeneration",
"authors": [
{
"first": "Aditya",
"middle": [],
"last": "Girish Pawate",
"suffix": ""
},
{
"first": "Varun",
"middle": [],
"last": "Madhavan",
"suffix": ""
},
{
"first": "Devansh",
"middle": [],
"last": "Chandak",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the Graphbased Methods for Natural Language Processing (TextGraphs)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Aditya Girish Pawate, Varun Madhavan, and Devansh Chandak. 2020. ChiSquareX at TextGraphs 2020 Shared Task: Leveraging Pretrained Language Models for Explanation Regeneration. In Proceedings of the Graph- based Methods for Natural Language Processing (TextGraphs). Association for Computational Linguistics.",
"links": null
},
"BIBREF34": {
"ref_id": "b34",
"title": "DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter",
"authors": [
{
"first": "Victor",
"middle": [],
"last": "Sanh",
"suffix": ""
},
{
"first": "Lysandre",
"middle": [],
"last": "Debut",
"suffix": ""
},
{
"first": "Julien",
"middle": [],
"last": "Chaumond",
"suffix": ""
},
{
"first": "Thomas",
"middle": [],
"last": "Wolf",
"suffix": ""
}
],
"year": 2019,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1910.01108"
]
},
"num": null,
"urls": [],
"raw_text": "Victor Sanh, Lysandre Debut, Julien Chaumond, and Thomas Wolf. 2019. DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter. arXiv:1910.01108 [cs.CL].",
"links": null
},
"BIBREF35": {
"ref_id": "b35",
"title": "ERNIE 2.0: A Continual Pre-Training Framework for Language Understanding",
"authors": [
{
"first": "Yu",
"middle": [],
"last": "Sun",
"suffix": ""
},
{
"first": "Shuohuan",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Yu-Kun",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Shikun",
"middle": [],
"last": "Feng",
"suffix": ""
},
{
"first": "Hua",
"middle": [],
"last": "Hao Tian",
"suffix": ""
},
{
"first": "Haifeng",
"middle": [],
"last": "Wu",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Wang",
"suffix": ""
}
],
"year": 2020,
"venue": "The Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI-20)",
"volume": "",
"issue": "",
"pages": "8968--8975",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yu Sun, Shuohuan Wang, Yu-Kun Li, Shikun Feng, Hao Tian, Hua Wu, and Haifeng Wang. 2020. ERNIE 2.0: A Continual Pre-Training Framework for Language Understanding. In The Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI-20), pages 8968-8975, New York, NY, USA.",
"links": null
},
"BIBREF36": {
"ref_id": "b36",
"title": "A Survey on Explainability in Machine Reading Comprehension",
"authors": [
{
"first": "Mokanarangan",
"middle": [],
"last": "Thayaparan",
"suffix": ""
},
{
"first": "Marco",
"middle": [],
"last": "Valentino",
"suffix": ""
},
{
"first": "Andr\u00e9",
"middle": [],
"last": "Freitas",
"suffix": ""
}
],
"year": 2020,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:2010.00389"
]
},
"num": null,
"urls": [],
"raw_text": "Mokanarangan Thayaparan, Marco Valentino, and Andr\u00e9 Freitas. 2020. A Survey on Explainability in Machine Reading Comprehension. arXiv:2010.00389 [cs.CL].",
"links": null
},
"BIBREF37": {
"ref_id": "b37",
"title": "Is Multihop QA in DIRE Condition? Measuring and Reducing Disconnected Reasoning",
"authors": [
{
"first": "Harsh",
"middle": [],
"last": "Trivedi",
"suffix": ""
},
{
"first": "Niranjan",
"middle": [],
"last": "Balasubramanian",
"suffix": ""
},
{
"first": "Tushar",
"middle": [],
"last": "Khot",
"suffix": ""
},
{
"first": "Ashish",
"middle": [],
"last": "Sabharwal",
"suffix": ""
}
],
"year": 2020,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:2005.00789"
]
},
"num": null,
"urls": [],
"raw_text": "Harsh Trivedi, Niranjan Balasubramanian, Tushar Khot, and Ashish Sabharwal. 2020. Is Multihop QA in DIRE Condition? Measuring and Reducing Disconnected Reasoning. arXiv:2005.00789 [cs.CL].",
"links": null
},
"BIBREF38": {
"ref_id": "b38",
"title": "GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understanding",
"authors": [
{
"first": "Alex",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Amanpreet",
"middle": [],
"last": "Singh",
"suffix": ""
},
{
"first": "Julian",
"middle": [],
"last": "Michael",
"suffix": ""
},
{
"first": "Felix",
"middle": [],
"last": "Hill",
"suffix": ""
},
{
"first": "Omer",
"middle": [],
"last": "Levy",
"suffix": ""
},
{
"first": "Samuel",
"middle": [],
"last": "Bowman",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 2018 EMNLP Workshop BlackboxNLP: Analyzing and Interpreting Neural Networks for NLP",
"volume": "",
"issue": "",
"pages": "353--355",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Alex Wang, Amanpreet Singh, Julian Michael, Felix Hill, Omer Levy, and Samuel Bowman. 2018. GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understanding. In Proceedings of the 2018 EMNLP Workshop BlackboxNLP: Analyzing and Interpreting Neural Networks for NLP, pages 353-355, Brussels, Belgium. Association for Computational Linguistics.",
"links": null
},
"BIBREF39": {
"ref_id": "b39",
"title": "WorldTree V2: A Corpus of Science-Domain Structured Explanations and Inference Patterns supporting Multi-Hop Inference",
"authors": [
{
"first": "Zhengnan",
"middle": [],
"last": "Xie",
"suffix": ""
},
{
"first": "Sebastian",
"middle": [],
"last": "Thiem",
"suffix": ""
},
{
"first": "Jaycie",
"middle": [],
"last": "Martin",
"suffix": ""
},
{
"first": "Elizabeth",
"middle": [],
"last": "Wainwright",
"suffix": ""
},
{
"first": "Steven",
"middle": [],
"last": "Marmorstein",
"suffix": ""
},
{
"first": "Peter",
"middle": [],
"last": "Jansen",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the 12th Conference on Language Resources and Evaluation (LREC 2020)",
"volume": "",
"issue": "",
"pages": "5456--5473",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Zhengnan Xie, Sebastian Thiem, Jaycie Martin, Elizabeth Wainwright, Steven Marmorstein, and Peter Jansen. 2020. WorldTree V2: A Corpus of Science-Domain Structured Explanations and Inference Patterns support- ing Multi-Hop Inference. In Proceedings of the 12th Conference on Language Resources and Evaluation (LREC 2020), pages 5456-5473, Marseille, France. European Language Resources Association (ELRA).",
"links": null
},
"BIBREF40": {
"ref_id": "b40",
"title": "HOTPOTQA: A Dataset for Diverse, Explainable Multi-hop Question Answering",
"authors": [
{
"first": "Zhilin",
"middle": [],
"last": "Yang",
"suffix": ""
},
{
"first": "Peng",
"middle": [],
"last": "Qi",
"suffix": ""
},
{
"first": "Saizheng",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Yoshua",
"middle": [],
"last": "Bengio",
"suffix": ""
},
{
"first": "William",
"middle": [],
"last": "Cohen",
"suffix": ""
},
{
"first": "Ruslan",
"middle": [],
"last": "Salakhutdinov",
"suffix": ""
},
{
"first": "Christopher",
"middle": [
"D"
],
"last": "Manning",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "2369--2380",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Zhilin Yang, Peng Qi, Saizheng Zhang, Yoshua Bengio, William Cohen, Ruslan Salakhutdinov, and Christopher D. Manning. 2018. HOTPOTQA: A Dataset for Diverse, Explainable Multi-hop Question Answering. In Pro- ceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, EMNLP 2018, pages 2369-2380, Brussels, Belgium. Association for Computational Linguistics.",
"links": null
}
},
"ref_entries": {
"TABREF2": {
"content": "<table/>",
"html": null,
"text": "Official leaderboard performance on the held out test set for the 2020 Shared Task on Multi-Hop Inference for Explanation Regeneration. Post-competition performance is shown in parentheses.",
"type_str": "table",
"num": null
},
"TABREF4": {
"content": "<table><tr><td/><td colspan=\"2\">Questions Baseline</td><td/><td>Team</td><td/></tr><tr><td>Metric</td><td>N</td><td>tf.idf</td><td colspan=\"3\">AG RDAI CSX LIIR BPGL</td></tr><tr><td>Mean Average Precision (MAP)</td><td/><td/><td/><td/><td/></tr><tr><td>MAP</td><td>1670</td><td>0.23</td><td>0.37 0.55</td><td>0.50 0.57</td><td>0.60</td></tr><tr><td>MAP by Explanatory Role</td><td/><td/><td/><td/><td/></tr><tr><td>CENTRAL rows</td><td>1619</td><td>0.27</td><td>0.42 0.59</td><td>0.54 0.57</td><td>0.65</td></tr><tr><td>GROUNDING rows</td><td>1150</td><td>0.15</td><td>0.21 0.40</td><td>0.36 0.44</td><td>0.44</td></tr><tr><td>LEXICALGLUE rows</td><td>987</td><td>0.05</td><td>0.12 0.27</td><td>0.24 0.39</td><td>0.30</td></tr><tr><td>MAP by Table Knowledge Types</td><td/><td/><td/><td/><td/></tr><tr><td>Retrieval tables</td><td>1670</td><td>0.22</td><td>0.37 0.49</td><td>0.44 0.51</td><td>0.53</td></tr><tr><td>Inference-supporting tables</td><td>1670</td><td>0.11</td><td>0.19 0.21</td><td>0.18 0.22</td><td>0.23</td></tr><tr><td>Complex inference tables</td><td>1670</td><td>0.12</td><td>0.22 0.28</td><td>0.25 0.29</td><td>0.32</td></tr><tr><td>Precision@K</td><td/><td/><td/><td/><td/></tr><tr><td>Precision@1</td><td>1670</td><td>0.38</td><td>0.45 0.76</td><td>0.70 0.73</td><td>0.78</td></tr><tr><td>Precision@2</td><td>1670</td><td>0.30</td><td>0.38 0.65</td><td>0.60 0.65</td><td>0.68</td></tr><tr><td>Precision@3</td><td>1670</td><td>0.25</td><td>0.34 0.56</td><td>0.52 0.58</td><td>0.61</td></tr><tr><td>Precision@4</td><td>1670</td><td>0.22</td><td>0.30 0.51</td><td>0.46 0.52</td><td>0.54</td></tr><tr><td>Precision@5</td><td>1670</td><td>0.19</td><td>0.28 0.46</td><td>0.42 0.47</td><td>0.48</td></tr><tr><td>Precision@10</td><td>1670</td><td>0.13</td><td>0.21 0.30</td><td>0.29 0.32</td><td>0.33</td></tr><tr><td>Precision@20</td><td>1670</td><td>0.08</td><td>0.15 0.18</td><td>0.17 0.19</td><td>0.20</td></tr></table>",
"html": null,
"text": "breaks down model performance characteristics by explanatory role, knowledge type, and ranking",
"type_str": "table",
"num": null
}
}
}
} |