File size: 141,662 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 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812 2813 2814 | {
"paper_id": "2022",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T01:11:38.515832Z"
},
"title": "Diverse Lottery Tickets Boost Ensemble from a Single Pretrained Model",
"authors": [
{
"first": "Sosuke",
"middle": [],
"last": "Kobayashi",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Shun",
"middle": [],
"last": "Kiyono",
"suffix": "",
"affiliation": {},
"email": "shun.kiyono@riken.jp"
},
{
"first": "Jun",
"middle": [],
"last": "Suzuki",
"suffix": "",
"affiliation": {},
"email": "jun.suzuki@tohoku.ac.jp"
},
{
"first": "Kentaro",
"middle": [],
"last": "Inui",
"suffix": "",
"affiliation": {},
"email": "inui@tohoku.ac.jp"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Ensembling is a popular method used to improve performance as a last resort. However, ensembling multiple models finetuned from a single pretrained model has been not very effective; this could be due to the lack of diversity among ensemble members. This paper proposes Multi-Ticket Ensemble, which finetunes different subnetworks of a single pretrained model and ensembles them. We empirically demonstrated that winning-ticket subnetworks produced more diverse predictions than dense networks, and their ensemble outperformed the standard ensemble on some tasks. Repeat and use final Pruning mask pretrained model before each finetuning. We ex-088 pect that, during finetuning, each sub-network ac-089 quires different views using different sub-spaces of 090 the pretrained knowledge. This idea has two chal-091 lenges: the diversity and the accuracy of the sub-092 networks. Recent studies on the lottery ticket hy-093 pothesis (Frankle and Carbin, 2019) suggest that a 094 dense neural network at an initialization contains a 095 sub-network, called winning ticket, whose accuracy 096 becomes comparable with that of the dense network 097 after the same training steps. A pretrained BERT 098 also has sparse sub-networks (e.g., 50%), which 099 can achieve the same accuracy with the entire net-100 work when finetuning on downstream tasks (Chen 101 et al., 2020). However, it is still unclear how di-102 verse winning tickets exist and how to find them 103",
"pdf_parse": {
"paper_id": "2022",
"_pdf_hash": "",
"abstract": [
{
"text": "Ensembling is a popular method used to improve performance as a last resort. However, ensembling multiple models finetuned from a single pretrained model has been not very effective; this could be due to the lack of diversity among ensemble members. This paper proposes Multi-Ticket Ensemble, which finetunes different subnetworks of a single pretrained model and ensembles them. We empirically demonstrated that winning-ticket subnetworks produced more diverse predictions than dense networks, and their ensemble outperformed the standard ensemble on some tasks. Repeat and use final Pruning mask pretrained model before each finetuning. We ex-088 pect that, during finetuning, each sub-network ac-089 quires different views using different sub-spaces of 090 the pretrained knowledge. This idea has two chal-091 lenges: the diversity and the accuracy of the sub-092 networks. Recent studies on the lottery ticket hy-093 pothesis (Frankle and Carbin, 2019) suggest that a 094 dense neural network at an initialization contains a 095 sub-network, called winning ticket, whose accuracy 096 becomes comparable with that of the dense network 097 after the same training steps. A pretrained BERT 098 also has sparse sub-networks (e.g., 50%), which 099 can achieve the same accuracy with the entire net-100 work when finetuning on downstream tasks (Chen 101 et al., 2020). However, it is still unclear how di-102 verse winning tickets exist and how to find them 103",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Ensembling (Levin et al., 1989; Domingos, 1997) has long been an easy and effective approach to improve model performance by averaging the outputs of multiple comparable but independent models. Allen-Zhu and Li (2020) explain that different models obtain different views for judgments, and the ensemble uses complementary views to make more robust decisions. A good ensemble requires diverse member models. However, how to encourage diversity without sacrificing the accuracy of each model is non-trivial (Liu and Yao, 1999; Kirillov et al., 2016; Rame and Cord, 2021) .",
"cite_spans": [
{
"start": 11,
"end": 31,
"text": "(Levin et al., 1989;",
"ref_id": "BIBREF17"
},
{
"start": 32,
"end": 47,
"text": "Domingos, 1997)",
"ref_id": "BIBREF9"
},
{
"start": 505,
"end": 524,
"text": "(Liu and Yao, 1999;",
"ref_id": "BIBREF20"
},
{
"start": 525,
"end": 547,
"text": "Kirillov et al., 2016;",
"ref_id": "BIBREF15"
},
{
"start": 548,
"end": 568,
"text": "Rame and Cord, 2021)",
"ref_id": "BIBREF27"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The pretrain-then-finetune paradigm has become another best practice for achieving state-of-the-art performance on NLP tasks (Devlin et al., 2019) . The cost of large-scale pretraining, however, is enormously high (Sharir et al., 2020) ; This often makes it difficult to independently pretrain multiple models. Therefore, most researchers and practitioners only use a single pretrained model, which is distributed by resource-rich organizations.",
"cite_spans": [
{
"start": 125,
"end": 146,
"text": "(Devlin et al., 2019)",
"ref_id": "BIBREF7"
},
{
"start": 214,
"end": 235,
"text": "(Sharir et al., 2020)",
"ref_id": "BIBREF30"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "This situation brings up a novel question to ensemble learning: Can we make an effective ensemble from only a single pre-trained model? Although ensembles can be combined with the pretrain-then-finetune paradigm, an ensemble of Figure 1 : When finetuning from a single pretrained model (left), the models are less diverse (center). If we finetune different sparse subnetworks, they become more diverse and make the ensemble effective (right). models finetuned from a single pretrained model is much less effective than that using different pretrained models from scratch in many tasks (Raffel et al., 2020) . Na\u00efve ensemble offers limited improvements, possibly due to the lack of diversity of finetuning from the same initial parameters.",
"cite_spans": [
{
"start": 585,
"end": 606,
"text": "(Raffel et al., 2020)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [
{
"start": 228,
"end": 236,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In this paper, we propose a simple yet effective method called Multi-Ticket Ensemble, ensembling finetuned winning-ticket subnetworks (Frankle and Carbin, 2019) in a single pretrained model. We empirically demonstrate that pruning a single pretrained model can make diverse models, and their ensemble can outperform the na\u00efve dense ensemble if winning-ticket subnetworks are found.",
"cite_spans": [
{
"start": 134,
"end": 160,
"text": "(Frankle and Carbin, 2019)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In this paper, we discuss the most standard way of ensemble, which averages the outputs of multiple neural networks; each has the same architecture but different parameters. That is, let f (x; \u03b8) be the output of a model with the parameter vector \u03b8 given the input x, the output of an ensemble is f M (x) = \u03b8\u2208M f (x; \u03b8)/|M|, where M = {\u03b8 1 , ..., \u03b8 |M| } is the member parameters.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Diversity in a Single Pretrained Model",
"sec_num": "2"
},
{
"text": "As discussed, when constructing an ensemble f M by finetuning from a single pretrained model multiple times with different random seeds {s 1 , ..., s |M| }, the boost in performance tends to be only marginal. In the case of BERT (Devlin et al., 2019) and its variants, three sources of diversities can be considered: random initialization of the task-specific layer, dataset shuffling for stochastic gradient descent (SGD), and dropout. However, empirically, such finetuned parameters tend not to be largely different from the initial parameters, and they do not lead to diverse models (Radiya-Dixit and Wang, 2020) . Of course, if one adds significant noise to the parameters, it leads to diversity; however, it would also hurt accuracy.",
"cite_spans": [
{
"start": 229,
"end": 250,
"text": "(Devlin et al., 2019)",
"ref_id": "BIBREF7"
},
{
"start": 586,
"end": 615,
"text": "(Radiya-Dixit and Wang, 2020)",
"ref_id": "BIBREF24"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Diversity from Finetuning",
"sec_num": "2.1"
},
{
"text": "To make models ensuring both accuracy and diversity, we focus on subnetworks in the pretrained model. Different subnetworks employ different subspaces of the pre-trained knowledge (Radiya-Dixit and Wang, 2020; Zhao et al., 2020; Cao et al., 2021) ; this would help the subnetworks to acquire different views, which can be a source of desired diversity 1 . Also, in terms of accuracy, recent studies on the lottery ticket hypothesis (Frankle and Carbin, 2019) suggest that a dense network at initialization contains a subnetwork, called the winning ticket, whose accuracy becomes comparable to that of the dense one after the same training. Interestingly, the pretrained BERT also has a winning ticket for finetuning on downstream tasks (Chen et al., 2020) . Thus, if we can find diverse winning tickets, they can be good ensemble members with the two desirable properties: diversity and accuracy.",
"cite_spans": [
{
"start": 180,
"end": 209,
"text": "(Radiya-Dixit and Wang, 2020;",
"ref_id": "BIBREF24"
},
{
"start": 210,
"end": 228,
"text": "Zhao et al., 2020;",
"ref_id": "BIBREF43"
},
{
"start": 229,
"end": 246,
"text": "Cao et al., 2021)",
"ref_id": "BIBREF3"
},
{
"start": 432,
"end": 458,
"text": "(Frankle and Carbin, 2019)",
"ref_id": "BIBREF11"
},
{
"start": 736,
"end": 755,
"text": "(Chen et al., 2020)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Diversity from Pruning",
"sec_num": "2.2"
},
{
"text": "We propose a simple yet effective method, multiticket ensemble, which finetunes different subnetworks instead of dense networks. Because it could be a key how to find subnetworks, we explore three variants based on iterative magnitude pruning.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Subnetwork Exploration",
"sec_num": "3"
},
{
"text": "tasks using the BERT in this paper, the same problem happens in other settings generally. In the results by Raffel et al. (2020) , we found that this happened on almost all the tasks of GLUE (Wang et al., 2018) , SuperGLUE (Wang et al., 2019) , SQuAD (Rajpurkar et al., 2016) , summarization, and machine translations using the T5 models. also has sparse sub-networks (e.g., 50%), which 099 can achieve the same accuracy with the entire net-100 work when finetuning on downstream tasks (Chen 101 et al., 2020) . However, it is still unclear how di-102 verse winning tickets exist and how to find them 103 tasks using the BERT in this paper, the same problem happens in other settings generally. In the results by Raffel et al. (2020) , we found that this happened on almost all the tasks of GLUE (Wang et al., 2018) , SuperGLUE (Wang et al., 2019) , SQuAD (Rajpurkar et al., 2016) , summarization, and machine translations using the T5 models. on a random seed s. Also, let \u2713 s represent the parameter of the pretrained BERT and the task-specific layer, whose parameter is randomly initialized by random seed s. After finetuning \u2713 s to FINE(\u2713 s , s), we identify and prune the parameters with 10% lowest magnitudes in FINE(\u2713 s , s). We also get the corresponding binary mask of pruning, m s,10% 2 {0, 1} |\u2713s| , where the surviving positions have 1 otherwise 0. The pruning of parameters \u2713 by a mask m can be also represented as \u2713 m, where is the element-wise product. Next, we replay finetuning but from \u2713 s m s,10% and get FINE(\u2713 s m s,10% , s) as well as 20%-pruning mask m s,20% . By repeating iterative magnitude pruning, we obtain the parameter FINE(\u2713 s m s,P % , s). In our experiments, we set P = 30, i.e., evaluate ensemble of 30%-pruning sub-networks, where verse winning tickets exist and how to find them 103 tasks using the BERT in this paper, the same problem happens in other settings generally. In the results by Raffel et al. (2020) , we found that this happened on almost all the tasks of GLUE (Wang et al., 2018) , SuperGLUE (Wang et al., 2019) , SQuAD (Rajpurkar et al., 2016) , summarization, and machine translations using the T5 models. also has sparse sub-networks (e.g., 50%), which 099 can achieve the same accuracy with the entire net-100 work when finetuning on downstream tasks (Chen 101 et al., 2020). However, it is still unclear how di-102 verse winning tickets exist and how to find them 103 tasks using the BERT in this paper, the same problem happens in other settings generally. In the results by Raffel et al. (2020) , we found that this happened on almost all the tasks of GLUE (Wang et al., 2018) , SuperGLUE (Wang et al., 2019) , SQuAD (Rajpurkar et al., 2016) , summarization, and machine translations using the T5 models. the parameter of the pretrained BERT and the task-specific layer, whose parameter is randomly initialized by random seed s. After finetuning \u2713 s to FINE(\u2713 s , s), we identify and prune the parameters with 10% lowest magnitudes in FINE(\u2713 s , s). We also get the corresponding binary ",
"cite_spans": [
{
"start": 108,
"end": 128,
"text": "Raffel et al. (2020)",
"ref_id": "BIBREF25"
},
{
"start": 191,
"end": 210,
"text": "(Wang et al., 2018)",
"ref_id": "BIBREF35"
},
{
"start": 223,
"end": 242,
"text": "(Wang et al., 2019)",
"ref_id": "BIBREF34"
},
{
"start": 251,
"end": 275,
"text": "(Rajpurkar et al., 2016)",
"ref_id": "BIBREF26"
},
{
"start": 486,
"end": 509,
"text": "(Chen 101 et al., 2020)",
"ref_id": null
},
{
"start": 713,
"end": 733,
"text": "Raffel et al. (2020)",
"ref_id": "BIBREF25"
},
{
"start": 796,
"end": 815,
"text": "(Wang et al., 2018)",
"ref_id": "BIBREF35"
},
{
"start": 828,
"end": 847,
"text": "(Wang et al., 2019)",
"ref_id": "BIBREF34"
},
{
"start": 856,
"end": 880,
"text": "(Rajpurkar et al., 2016)",
"ref_id": "BIBREF26"
},
{
"start": 1928,
"end": 1948,
"text": "Raffel et al. (2020)",
"ref_id": "BIBREF25"
},
{
"start": 2011,
"end": 2030,
"text": "(Wang et al., 2018)",
"ref_id": "BIBREF35"
},
{
"start": 2043,
"end": 2062,
"text": "(Wang et al., 2019)",
"ref_id": "BIBREF34"
},
{
"start": 2071,
"end": 2095,
"text": "(Rajpurkar et al., 2016)",
"ref_id": "BIBREF26"
},
{
"start": 2306,
"end": 2315,
"text": "(Chen 101",
"ref_id": null
},
{
"start": 2532,
"end": 2552,
"text": "Raffel et al. (2020)",
"ref_id": "BIBREF25"
},
{
"start": 2615,
"end": 2634,
"text": "(Wang et al., 2018)",
"ref_id": "BIBREF35"
},
{
"start": 2647,
"end": 2666,
"text": "(Wang et al., 2019)",
"ref_id": "BIBREF34"
},
{
"start": 2675,
"end": 2699,
"text": "(Rajpurkar et al., 2016)",
"ref_id": "BIBREF26"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Subnetwork Exploration",
"sec_num": "3"
},
{
"text": "M = {FINE(\u2713 s1 m s1,30% , s 1 ), ..., FINE(\u2713 s |M| 2",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Subnetwork Exploration",
"sec_num": "3"
},
{
"text": "{FINE(\u2713 s1 m s1,30% , s 1 ), ..., FINE(\u2713 s |M| 2",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Subnetwork Exploration",
"sec_num": "3"
},
{
"text": "We also did not prune the embedding layer, following Chen et al. 2020 verse winning tickets exist and how to find them 103 tasks using the BERT in this paper, the same problem happens in other settings generally. In the results by Raffel et al. (2020) , we found that this happened on almost all the tasks of GLUE (Wang et al., 2018) , SuperGLUE (Wang et al., 2019) , SQuAD (Rajpurkar et al., 2016) , summarization, and machine translations using the T5 models.",
"cite_spans": [
{
"start": 231,
"end": 251,
"text": "Raffel et al. (2020)",
"ref_id": "BIBREF25"
},
{
"start": 314,
"end": 333,
"text": "(Wang et al., 2018)",
"ref_id": "BIBREF35"
},
{
"start": 346,
"end": 365,
"text": "(Wang et al., 2019)",
"ref_id": "BIBREF34"
},
{
"start": 374,
"end": 398,
"text": "(Rajpurkar et al., 2016)",
"ref_id": "BIBREF26"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Subnetwork Exploration",
"sec_num": "3"
},
{
"text": "First, we describe iterative magnitude pruning, the Figure 2: Overview of iterative magnitude pruning (Section 3.1). We can also use regularizers during finetuning to diversify pruning (Section 3.2).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Subnetwork Exploration",
"sec_num": "3"
},
{
"text": "We employ iterative magnitude pruning (Frankle and Carbin, 2019) to find winning tickets for simplicity. Other sophisticated options are left for future work. Here, we explain the algorithm (refer to the paper for details). The algorithm explores a good pruning mask via rehearsals of finetuning. First, it completes a finetuning procedure of an initialized dense network and identifies the parameters with the 10% lowest magnitudes as the targets of pruning. Then, it makes the pruned subnetwork and resets its parameters to the originally-initialized (sub-)parameters. This finetune-prune-reset process is repeated until reaching the desired pruning ratio. We used 30% as pruning ratio.",
"cite_spans": [
{
"start": 38,
"end": 64,
"text": "(Frankle and Carbin, 2019)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Iterative Magnitude Pruning",
"sec_num": "3.1"
},
{
"text": "We discussed that finetuning with different random seeds did not lead to diverse parameters in Section 2.1. Therefore, iterative magnitude pruning with different seeds could also produce less diverse subnetworks. Thus, we also explore means of diversifying pruning patterns by enforcing different parameters to have lower magnitudes. Motivated by this, we experiment with a simple approach, applying an L 1 regularizer (i.e., magnitude decay) to different parameters selectively depending on the random seeds. Specifically, we explore two policies to determine which parameters are decayed and how strongly they are, i.e., the element-wise coefficients of the L 1 regularizer, l s \u2208 R \u22650 |\u03b8| . During finetuning (for pruning), we add a regularization term \u03c4 ||\u03b8 s \u2299 l s || 1 with a positive scalar coefficient \u03c4 into the loss of the task (e.g., cross entropy for classification), where \u2299 is element-wise product. This softly enforces various parameters to have a lower magnitude among a set of random seeds and could lead various parameters to be pruned.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Pruning with Regularizer",
"sec_num": "3.2"
},
{
"text": "Active Masking To maximize the diversity of the surviving parameters of member models, it is necessary to prune the surviving parameters of the random seed s 1 when building a model with the next random seed s 2 . Thus, during finetuning with seed s 2 , we apply the L 1 regularizer on the first surviving parameters. Likewise, with the following seeds s 3 , s 4 , ..., s i , ..., s |M| , we cumulatively use the average of the surviving masks as the regularizer coefficient mask. Let m s j \u2208 {0, 1} |\u03b8| be the pruning mask indicating surviving parameters from seed s j , the coefficient mask with seed s i is l s i = j<i m s j /(i \u2212 1). We call this affirmative policy as active masking.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Pruning with Regularizer",
"sec_num": "3.2"
},
{
"text": "Random Masking In active masking, each coefficient mask has a sequential dependence on the preceding random seeds. Thus, the training of ensemble members cannot be parallelized. Therefore, we also experiment with a simpler and parallelizable variant, random masking, where a mask is independently and randomly generated from a random seed. With a random seed s i , we generate the seed-dependent random binary mask, i.e.,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Pruning with Regularizer",
"sec_num": "3.2"
},
{
"text": "l s = m rand s i \u2208 {0, 1} |\u03b8| ,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Pruning with Regularizer",
"sec_num": "3.2"
},
{
"text": "where each element is sampled from Bernoulli distribution and 0's probability equals to the target pruning ratio.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Pruning with Regularizer",
"sec_num": "3.2"
},
{
"text": "We evaluate the performance of ensembles using four finetuning schemes: (1) finetuning without pruning (BASELINE), (2) finetuning of lotteryticket subnetworks found with the na\u00efve iterative magnitude pruning (BASE-LT), and (3) with L 1 regularizer by the active masking (ACTIVE-LT) or (4) random masking (RANDOM-LT). We also compare with (5) BAGGING-based ensemble, which trains dense models on different random 90% training subsets. We use the GLUE benchmark (Wang et al., 2018) as tasks. The implementation and settings follow Chen et al. (2020) 2 using the Transformers library (Wolf et al., 2020) and its bert-baseuncased pretrained model. We report the average performance using twenty different random seeds. Ensembles are evaluated using exhaustive combinations of five members. We also perform Student's t-test for validating statistical significance 3 Table 1 : The performances (single, ens.) and the improvements by ensembling (diff.). Italic indicates that the value is significantly larger than that of BASELINE. Bold-italic indicates significantly larger than that of both BASELINE and BASE-LT. Underline indicates the best. that, while the experiments focus on using BERT, we believe that the insights would be helpful to other pretrain-then-finetune settings in general 4 .",
"cite_spans": [
{
"start": 460,
"end": 479,
"text": "(Wang et al., 2018)",
"ref_id": "BIBREF35"
},
{
"start": 581,
"end": 600,
"text": "(Wolf et al., 2020)",
"ref_id": "BIBREF28"
},
{
"start": 859,
"end": 860,
"text": "3",
"ref_id": null
}
],
"ref_spans": [
{
"start": 861,
"end": 868,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Experiments",
"sec_num": "4"
},
{
"text": "We show the results on MRPC (Dolan and Brockett, 2005) and STS-B (Cer et al., 2017) in Table 1 . Multi-ticket ensembles (*-LT) outperform BASE-LINE and BAGGING significantly (p < 0.001). This result supports the effectiveness of multi-ticket ensemble. Note that the improvements of *-LT are attributable to ensembling (diff.) rather than to any performance gains of the individual models (single). We also plot the improvements (ens. values relative to BASELINE) as a function of the number of ensemble members on MRPC and STS-B in Figure 3. This also clearly shows that while the single models of *-LT have accuracy similar to BASE-LINE, the gains appear when ensembling them. While multi-ticket ensemble works well even with the naive pruning method (BASE-LT), RANDOM-LT and ACTIVE-LT achieve the better ensembling effect on average; this suggests the effectiveness of regularizers. Interestingly, RANDOM-LT is simpler but more effective than ACTIVE-LT.",
"cite_spans": [
{
"start": 65,
"end": 83,
"text": "(Cer et al., 2017)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [
{
"start": 87,
"end": 94,
"text": "Table 1",
"ref_id": null
},
{
"start": 532,
"end": 538,
"text": "Figure",
"ref_id": null
}
],
"eq_spans": [],
"section": "Accuracy",
"sec_num": "4.1"
},
{
"text": "When Winning Tickets are Less Accurate Does multi-ticket ensemble work well on any tasks? The answer is no. To enjoy the benefit from multi-ticket ensemble, we have to find diverse winning-ticket subnetworks sufficiently comparable to their dense network. When winning tickets are less accurate than the baseline, their ensembles often fail to outperform the baseline's ensemble. It happened to CoLA (Warstadt et al., 2019) , QNLI (Rajpurkar et al., 2016) , SST-2 (Socher et al., 2013) , MNLI (Williams et al., 2018) ; the naive iterative magnitude pruning did not find comparable winning-ticket subnetworks (with or sometimes even without regularizers) 567 . Note that, even in such a case, RANDOM-LT often yielded a higher effect of ensembling (diff.), while the degradation of single models canceled out the effect in total, and BAGGING also failed to improve. More sophisticated pruning methods (Blalock et al., 2020; Sanh et al., 2020) or tuning will find better winningticket subnetworks and maximize the opportunities for multi-ticket ensemble in future work.",
"cite_spans": [
{
"start": 400,
"end": 423,
"text": "(Warstadt et al., 2019)",
"ref_id": "BIBREF36"
},
{
"start": 431,
"end": 455,
"text": "(Rajpurkar et al., 2016)",
"ref_id": "BIBREF26"
},
{
"start": 458,
"end": 485,
"text": "SST-2 (Socher et al., 2013)",
"ref_id": null
},
{
"start": 493,
"end": 516,
"text": "(Williams et al., 2018)",
"ref_id": "BIBREF37"
},
{
"start": 899,
"end": 921,
"text": "(Blalock et al., 2020;",
"ref_id": "BIBREF2"
},
{
"start": 922,
"end": 940,
"text": "Sanh et al., 2020)",
"ref_id": "BIBREF28"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Accuracy",
"sec_num": "4.1"
},
{
"text": "As an auxiliary analysis of behaviors, we show that each subnetwork produces diverse predictions. Because any existing diversity scores do not completely explain or justify the ensemble performance 8 , we discuss only rough trends in five popular metrics of classification diversity; Q statistic (Yule, 1900) , ratio errors (Aksela, 2003) , negative double fault (Giacinto and Roli, 2001) , disagreement measure (Skalak, 1996) , and correlation coefficient (Kuncheva and Whitaker, 2003) . See Kuncheva and Whitaker (2003) ; Cruz et al. 2020for their summarized definitions. As shown in Table 2, in all the metrics, winning-ticket subnetworks (*-LT) produced more diverse predictions than the 5 Although some studies (Prasanna et al., 2020; Chen et al., 2020; Liang et al., 2021) reported that they found winningticket subnetworks on these tasks, our finding did not contradict it. Their subnetworks were often actually a little worse than their dense networks, as well as we found. Chen et al. (2020) defined winning tickets as subnetworks with performances within one standard deviation from the dense networks. Prasanna et al. (2020) considered subnetworks with even 90% performance as winning tickets.",
"cite_spans": [
{
"start": 296,
"end": 308,
"text": "(Yule, 1900)",
"ref_id": "BIBREF41"
},
{
"start": 324,
"end": 338,
"text": "(Aksela, 2003)",
"ref_id": "BIBREF0"
},
{
"start": 363,
"end": 388,
"text": "(Giacinto and Roli, 2001)",
"ref_id": "BIBREF13"
},
{
"start": 412,
"end": 426,
"text": "(Skalak, 1996)",
"ref_id": "BIBREF31"
},
{
"start": 457,
"end": 486,
"text": "(Kuncheva and Whitaker, 2003)",
"ref_id": "BIBREF16"
},
{
"start": 493,
"end": 521,
"text": "Kuncheva and Whitaker (2003)",
"ref_id": "BIBREF16"
},
{
"start": 692,
"end": 693,
"text": "5",
"ref_id": null
},
{
"start": 716,
"end": 739,
"text": "(Prasanna et al., 2020;",
"ref_id": "BIBREF23"
},
{
"start": 740,
"end": 758,
"text": "Chen et al., 2020;",
"ref_id": "BIBREF5"
},
{
"start": 759,
"end": 778,
"text": "Liang et al., 2021)",
"ref_id": "BIBREF18"
},
{
"start": 982,
"end": 1000,
"text": "Chen et al. (2020)",
"ref_id": "BIBREF5"
},
{
"start": 1113,
"end": 1135,
"text": "Prasanna et al. (2020)",
"ref_id": "BIBREF23"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Diversity of Predictions",
"sec_num": "4.2"
},
{
"text": "6 For example, comparing BASELINE with RANDOM-LT of pruning ratio 20%, their average values of single/ensemble/difference are 91.38/91.93/+0.55 vs. 91.09/91.90/+0.81 on This also happens to experiments with roberta-base while multi-ticket ensemble still works well on MRPC.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Diversity of Predictions",
"sec_num": "4.2"
},
{
"text": "8 Finding such a convenient diversity metric itself is still a challenge in the research community (Wu et al., 2021 Table 2 : Diversity metrics on MRPC. The signs, \u2193 and \u2191, indicate that the metric gets lower and higher when the predictions are diverse. Q = Q statistic, R = ratio errors, ND = negative double fault, D = disagreement measure, C = correlation coefficient.",
"cite_spans": [
{
"start": 99,
"end": 115,
"text": "(Wu et al., 2021",
"ref_id": "BIBREF40"
}
],
"ref_spans": [
{
"start": 116,
"end": 123,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Diversity of Predictions",
"sec_num": "4.2"
},
{
"text": "Overlap ratio of pruning masks m si between different seeds on MRPC. The lower (yellower) the value is, the more dissimilar the two masks are. baseline using the dense networks (BASELINE).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Figure 4:",
"sec_num": null
},
{
"text": "We finally revealed the diversity of the subnetwork structures on MRPC. We calculated the overlap ratio of two pruning masks, which is defined as intersection over union, IoU = (Chen et al., 2020) . In Figure 4 , we show the overlap ratio between the pruning masks for the five random seeds, i.e., {m s 1 , ..., m s 5 }. At first, we can see that ACTIVE-LT and RANDOM-LT using the regularizers resulted in diverse pruning. This higher diversity could lead to the best improvements by ensembling, as discussed in Section 4.1. Secondly, BASE-LT produced surprisingly similar (99%) pruning masks with different random seeds. However, recall that even BASE-LT using the na\u00efve iterative magnitude pruning performed better than BASE-LINE. This result shows that even seemingly small changes in structure can improve the diversity of predictions and the performance of the ensemble.",
"cite_spans": [
{
"start": 177,
"end": 196,
"text": "(Chen et al., 2020)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [
{
"start": 202,
"end": 210,
"text": "Figure 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "Diversity of Subnetwork Structures",
"sec_num": "4.3"
},
{
"text": "|m i \u2229m j | |m i \u222am j |",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Diversity of Subnetwork Structures",
"sec_num": "4.3"
},
{
"text": "We raised a question on difficulty of ensembling large-scale pretrained models. As an efficient remedy, we explored methods to use subnetworks in a single model. We empirically demonstrated that ensembling winning-ticket subnetworks could outperform the dense ensembles via diversification and indicated a limitation too.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "5"
},
{
"text": "We follow the setting of Chen et al. (2020) 's implementation; epoch: 3, initial learning rate: 2e-5 with linear decay, maximum sequence length: 128, batch size: 32, dropout probability: 0.1. This is one of the most-used settings for finetuning a BERT; e.g., the example of finetuning in the Transformers library (Wolf et al., 2020) uses the setting 9 .",
"cite_spans": [
{
"start": 25,
"end": 43,
"text": "Chen et al. (2020)",
"ref_id": "BIBREF5"
},
{
"start": 313,
"end": 332,
"text": "(Wolf et al., 2020)",
"ref_id": "BIBREF28"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "A The Setting of Fine-tuning",
"sec_num": null
},
{
"text": "We did not prune the embedding layer, following Chen et al. (2020) ; Prasanna et al. (2020) . The coefficient of L 1 regularizer, \u03c4 , is decayed using the same scheduler as the learning rate. We tuned it on MRPC and used it for other tasks.",
"cite_spans": [
{
"start": 48,
"end": 66,
"text": "Chen et al. (2020)",
"ref_id": "BIBREF5"
},
{
"start": 69,
"end": 91,
"text": "Prasanna et al. (2020)",
"ref_id": "BIBREF23"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "A The Setting of Fine-tuning",
"sec_num": null
},
{
"text": "B The Learning Rate Scheduler of Chen et al. (2020) Our implementation used in the experiments are derived from Chen et al. (2020)'s implementation 10 . However, we found a bug in Chen et al. (2020) 's implementation on GitHub. Thus, we fixed it and experimented with the correct version. In their implementation, the learning rate schedule did not follow the common setting and the description mentioned in the paper; 'We use standard implementations and hyperparameters [49] . Learning rate decays linearly from initial value to zero'. Specifically, the learning rate with linear decay did not reach zero but was at significant levels even at the end of the finetuning. Our implementation corrected it so that it did reach zero as specified in their paper and in the common setting.",
"cite_spans": [
{
"start": 33,
"end": 51,
"text": "Chen et al. (2020)",
"ref_id": "BIBREF5"
},
{
"start": 180,
"end": 198,
"text": "Chen et al. (2020)",
"ref_id": "BIBREF5"
},
{
"start": 472,
"end": 476,
"text": "[49]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "A The Setting of Fine-tuning",
"sec_num": null
},
{
"text": "In the experiments, we first prepared twenty random seeds and split them into two groups, each of which trained ten models. For stabilizing the measurement of the result, we exhaustively evaluated all the possible combinations of ensembles (i.e., depending on the number of members, 10 C 2 , 10 C 3 , 10 C 4 , 10 C 5 patterns, respectively) among the ten models for each group, and averaged the results with the two groups. The performance of the members is also averaged over all the seeds.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "C The Combinations of Ensembles",
"sec_num": null
},
{
"text": "9 https://github.com/ huggingface/transformers/blob/ 7e406f4a65727baf8e22ae922f410224cde99ed6/ examples/pytorch/text-classification/ README.md#glue-tasks 10 https://github.com/VITA-Group/ BERT-Tickets Table 3 : The performances (single, ens.) and the improvements by ensembling (diff.) of RoBERTa-base models.",
"cite_spans": [],
"ref_spans": [
{
"start": 201,
"end": 208,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "C The Combinations of Ensembles",
"sec_num": null
},
{
"text": "We simply conducted supplementary experiments with RoBERTa (Liu et al., 2019) (robeta-base model), although optimal hyperparameters were not searched well. The results were similar to the cases of base-base-uncased. The patterns can be categorized into the three. First, multi-ticket ensembles worked well with roberta on MRPC, as shown in Table 3 . Secondly, accurate winningticket subnetworks were not found on CoLA and QNLI. Although the effect of ensembleing was improved after pruning, each single model got worse and the final ensemble accuracy did not outperform the dense baseline. Thirdly, although accurate winning-ticket subnetworks were found on STS-B and SST-2, regularizations worsened single-model performances. While this case also improved the effect of ensembling, the final accuracy did not outperform the baseline. These experiments further emphasized the importance of development of more sophisticated pruning methods without sacrifice of model performances in the context of the lottery ticket hypothesis.",
"cite_spans": [
{
"start": 59,
"end": 77,
"text": "(Liu et al., 2019)",
"ref_id": null
}
],
"ref_spans": [
{
"start": 340,
"end": 347,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "D The Results with RoBERTa",
"sec_num": null
},
{
"text": "Some concurrent studies also investigate the usage of subnetworks for ensembles. Gal and Ghahramani (2016) is a pioneer to use subnetwork ensemble. A trained neural network with dropout can infer with many different subnetworks, and their ensemble can be used for uncertainty estimation, which is called MC-dropout. Durasov et al. (2021) improved the efficiency of MC-dropout by exploring subnetworks. Zhang et al. (2021) (unpublished) experimented with an ensemble of subnetworks of different structures and initialization when trained from scratch, while the improvements possibly could be due to regularization of each single model. Havasi et al. (2021) is a similar but more elegant approach, which does not explicitly identify subnetworks. Instead, it trains a single dense model",
"cite_spans": [
{
"start": 316,
"end": 337,
"text": "Durasov et al. (2021)",
"ref_id": "BIBREF10"
},
{
"start": 402,
"end": 435,
"text": "Zhang et al. (2021) (unpublished)",
"ref_id": null
},
{
"start": 636,
"end": 656,
"text": "Havasi et al. (2021)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "E Related Work",
"sec_num": null
},
{
"text": "Some concurrent and recent studies also investigate subnetworks for effective ensemble(Durasov et al., 2021;Havasi et al., 2021) for training-from-scratch settings of image recognition.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "We also did not prune the embedding layer, followingChen et al. (2020);Prasanna et al. (2020)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "We also did not prune the embedding layer, followingChen et al. (2020);Prasanna et al. (2020)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "We found a bug inChen et al. (2020)'s implementation on GitHub, so we fixed it and experimented with the correct version.3 Note that not all evaluation samples satisfy independence assumption.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Raffel et al. (2020) reported that the same problem happened on almost all tasks (GLUE(Wang et al., 2018), Super-GLUE(Wang et al., 2019), SQuAD(Rajpurkar et al., 2016), summarization, and machine translation) using the T5 model.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "We appreciate the helpful comments from the anonymous reviewers. This work was supported by JSPS KAKENHI Grant Number JP19H04162.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgments",
"sec_num": null
},
{
"text": "with training using multi-input multi-output inference; the optimization can implicitly find multiple disentangled subnetworks in the dense model during optimization from random initialization. These studies support our assumption that different subnetworks can improve ensemble by diversity.Some other directions for introducing diversity exist, while most are unstable. Promising directions are to use entropy (Pang et al., 2019) or adversarial training (Rame and Cord, 2021) . Although they required complex optimization processes, they improved the robustness or ensemble performance on small image recognition datasets.Recently, concurrent work (Sellam et al., 2022; Tay et al., 2022) provide multiple BERT or T5 models pretrained from different seeds or configurations for investigation of seed or configuration dependency using large-scale computational resources. Further research with the models and such computational resources will be helpful for more solid comparison and analysis.Note that no prior work tackled the problem of ensembles from a pre-trained model. Framing the problem is one of the contributions of this paper. Secondly, our multi-ticket ensemble based on random masking enables an independently parallelizable training while existing methods require a sequential processing or a grouped training procedure. Finally, multi-ticket ensemble can be combined with other methods, which can improve the total performance together.",
"cite_spans": [
{
"start": 412,
"end": 431,
"text": "(Pang et al., 2019)",
"ref_id": "BIBREF22"
},
{
"start": 456,
"end": 477,
"text": "(Rame and Cord, 2021)",
"ref_id": "BIBREF27"
},
{
"start": 650,
"end": 671,
"text": "(Sellam et al., 2022;",
"ref_id": null
},
{
"start": 672,
"end": 689,
"text": "Tay et al., 2022)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "annex",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Comparison of classifier selection methods for improving committee performance",
"authors": [
{
"first": "Matti",
"middle": [],
"last": "Aksela",
"suffix": ""
}
],
"year": 2003,
"venue": "Proceedings of the 4th International Conference on Multiple Classifier Systems, MCS'03",
"volume": "",
"issue": "",
"pages": "84--93",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Matti Aksela. 2003. Comparison of classifier selection methods for improving committee performance. In Proceedings of the 4th International Conference on Multiple Classifier Systems, MCS'03, page 84-93, Berlin, Heidelberg. Springer-Verlag.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Towards understanding ensemble, knowledge distillation and self-distillation in deep learning",
"authors": [
{
"first": "Zeyuan",
"middle": [],
"last": "Allen-Zhu",
"suffix": ""
},
{
"first": "Yuanzhi",
"middle": [],
"last": "Li",
"suffix": ""
}
],
"year": 2020,
"venue": "CoRR",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Zeyuan Allen-Zhu and Yuanzhi Li. 2020. To- wards understanding ensemble, knowledge distilla- tion and self-distillation in deep learning. CoRR, abs/2012.09816.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "What is the state of neural network pruning?",
"authors": [
{
"first": "Davis",
"middle": [],
"last": "Blalock",
"suffix": ""
},
{
"first": "Jose Javier Gonzalez",
"middle": [],
"last": "Ortiz",
"suffix": ""
},
{
"first": "Jonathan",
"middle": [],
"last": "Frankle",
"suffix": ""
},
{
"first": "John",
"middle": [],
"last": "Guttag",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of Second Machine Learning and Systems",
"volume": "",
"issue": "",
"pages": "129--146",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Davis Blalock, Jose Javier Gonzalez Ortiz, Jonathan Frankle, and John Guttag. 2020. What is the state of neural network pruning? In Proceedings of Second Machine Learning and Systems (MLSys 2020), pages 129-146.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Low-complexity probing via finding subnetworks",
"authors": [
{
"first": "Steven",
"middle": [],
"last": "Cao",
"suffix": ""
},
{
"first": "Victor",
"middle": [],
"last": "Sanh",
"suffix": ""
},
{
"first": "Alexander",
"middle": [
"M"
],
"last": "Rush",
"suffix": ""
}
],
"year": 2021,
"venue": "Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT 2021)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Steven Cao, Victor Sanh, and Alexander M. Rush. 2021. Low-complexity probing via finding subnetworks. In Proceedings of the 2021 Conference of the North American Chapter of the Association for Computa- tional Linguistics: Human Language Technologies (NAACL-HLT 2021). Association for Computational Linguistics.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "SemEval-2017 task 1: Semantic textual similarity multilingual and crosslingual focused evaluation",
"authors": [
{
"first": "Daniel",
"middle": [],
"last": "Cer",
"suffix": ""
},
{
"first": "Mona",
"middle": [],
"last": "Diab",
"suffix": ""
},
{
"first": "Eneko",
"middle": [],
"last": "Agirre",
"suffix": ""
},
{
"first": "I\u00f1igo",
"middle": [],
"last": "Lopez-Gazpio",
"suffix": ""
},
{
"first": "Lucia",
"middle": [],
"last": "Specia",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 11th International Workshop on Semantic Evaluation",
"volume": "",
"issue": "",
"pages": "1--14",
"other_ids": {
"DOI": [
"10.18653/v1/S17-2001"
]
},
"num": null,
"urls": [],
"raw_text": "Daniel Cer, Mona Diab, Eneko Agirre, I\u00f1igo Lopez- Gazpio, and Lucia Specia. 2017. SemEval-2017 task 1: Semantic textual similarity multilingual and crosslingual focused evaluation. In Proceedings of the 11th International Workshop on Semantic Evaluation (SemEval 2017), pages 1-14, Vancouver, Canada. Association for Computational Linguistics.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "The lottery ticket hypothesis for pretrained bert networks",
"authors": [
{
"first": "Tianlong",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Jonathan",
"middle": [],
"last": "Frankle",
"suffix": ""
},
{
"first": "Shiyu",
"middle": [],
"last": "Chang",
"suffix": ""
},
{
"first": "Sijia",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Yang",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Zhangyang",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Carbin",
"suffix": ""
}
],
"year": 2020,
"venue": "Advances in Neural Information Processing Systems",
"volume": "33",
"issue": "",
"pages": "15834--15846",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tianlong Chen, Jonathan Frankle, Shiyu Chang, Sijia Liu, Yang Zhang, Zhangyang Wang, and Michael Carbin. 2020. The lottery ticket hypothesis for pre- trained bert networks. In Advances in Neural Infor- mation Processing Systems 33 (NeurIPS 2020), pages 15834-15846. Curran Associates, Inc.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Deslib: A dynamic ensemble selection library in python",
"authors": [
{
"first": "M",
"middle": [
"O"
],
"last": "Rafael",
"suffix": ""
},
{
"first": "Luiz",
"middle": [
"G"
],
"last": "Cruz",
"suffix": ""
},
{
"first": "Robert",
"middle": [],
"last": "Hafemann",
"suffix": ""
},
{
"first": "George",
"middle": [
"D C"
],
"last": "Sabourin",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Cavalcanti",
"suffix": ""
}
],
"year": 2020,
"venue": "Journal of Machine Learning Research",
"volume": "21",
"issue": "8",
"pages": "1--5",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rafael M. O. Cruz, Luiz G. Hafemann, Robert Sabourin, and George D. C. Cavalcanti. 2020. Deslib: A dy- namic ensemble selection library in python. Journal of Machine Learning Research, 21(8):1-5.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"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 (NAACL-HLT 2019)",
"volume": "",
"issue": "",
"pages": "4171--4186",
"other_ids": {
"DOI": [
"10.18653/v1/N19-1423"
]
},
"num": null,
"urls": [],
"raw_text": "Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2019. BERT: Pre-training of deep bidirectional transformers for language under- standing. In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT 2019), pages 4171-4186, Minneapolis, Minnesota. Association for Computa- tional Linguistics.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Automatically constructing a corpus of sentential paraphrases",
"authors": [
{
"first": "B",
"middle": [],
"last": "William",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Dolan",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Brockett",
"suffix": ""
}
],
"year": 2005,
"venue": "Proceedings of the Third International Workshop on Paraphrasing",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "William B. Dolan and Chris Brockett. 2005. Automati- cally constructing a corpus of sentential paraphrases. In Proceedings of the Third International Workshop on Paraphrasing (IWP 2005).",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Why does bagging work? a bayesian account and its implications",
"authors": [
{
"first": "Pedro",
"middle": [],
"last": "Domingos",
"suffix": ""
}
],
"year": 1997,
"venue": "Proceedings of the Third International Conference on Knowledge Discovery and Data Mining",
"volume": "",
"issue": "",
"pages": "155--158",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Pedro Domingos. 1997. Why does bagging work? a bayesian account and its implications. In Proceed- ings of the Third International Conference on Knowl- edge Discovery and Data Mining (KDD 1997), page 155-158. AAAI Press.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Masksembles for uncertainty estimation",
"authors": [
{
"first": "Nikita",
"middle": [],
"last": "Durasov",
"suffix": ""
},
{
"first": "Timur",
"middle": [],
"last": "Bagautdinov",
"suffix": ""
},
{
"first": "Pierre",
"middle": [],
"last": "Baque",
"suffix": ""
},
{
"first": "Pascal",
"middle": [],
"last": "Fua",
"suffix": ""
}
],
"year": 2021,
"venue": "Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"volume": "",
"issue": "",
"pages": "13539--13548",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Nikita Durasov, Timur Bagautdinov, Pierre Baque, and Pascal Fua. 2021. Masksembles for uncertainty esti- mation. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 13539-13548.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "The lottery ticket hypothesis: Finding sparse, trainable neural networks",
"authors": [
{
"first": "Jonathan",
"middle": [],
"last": "Frankle",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Carbin",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 7th International Conference on Learning Representations",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jonathan Frankle and Michael Carbin. 2019. The lottery ticket hypothesis: Finding sparse, trainable neural networks. In Proceedings of the 7th Inter- national Conference on Learning Representations (ICLR 2019).",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Dropout as a bayesian approximation: Representing model uncertainty in deep learning",
"authors": [
{
"first": "Yarin",
"middle": [],
"last": "Gal",
"suffix": ""
},
{
"first": "Zoubin",
"middle": [],
"last": "Ghahramani",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of The 33rd International Conference on Machine Learning",
"volume": "48",
"issue": "",
"pages": "1050--1059",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yarin Gal and Zoubin Ghahramani. 2016. Dropout as a bayesian approximation: Representing model un- certainty in deep learning. In Proceedings of The 33rd International Conference on Machine Learn- ing, volume 48 of Proceedings of Machine Learning Research, pages 1050-1059, New York, New York, USA. PMLR.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Design of effective neural network ensembles for image classification purposes",
"authors": [
{
"first": "Giorgio",
"middle": [],
"last": "Giacinto",
"suffix": ""
},
{
"first": "Fabio",
"middle": [],
"last": "Roli",
"suffix": ""
}
],
"year": 2001,
"venue": "Image and Vision Computing",
"volume": "19",
"issue": "9",
"pages": "699--707",
"other_ids": {
"DOI": [
"10.1016/S0262-8856(01)00045-2"
]
},
"num": null,
"urls": [],
"raw_text": "Giorgio Giacinto and Fabio Roli. 2001. Design of effective neural network ensembles for image clas- sification purposes. Image and Vision Computing, 19(9):699-707.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Training independent subnetworks for robust prediction",
"authors": [
{
"first": "Marton",
"middle": [],
"last": "Havasi",
"suffix": ""
},
{
"first": "Rodolphe",
"middle": [],
"last": "Jenatton",
"suffix": ""
},
{
"first": "Stanislav",
"middle": [],
"last": "Fort",
"suffix": ""
},
{
"first": "Jeremiah",
"middle": [
"Zhe"
],
"last": "Liu",
"suffix": ""
},
{
"first": "Jasper",
"middle": [],
"last": "Snoek",
"suffix": ""
},
{
"first": "Balaji",
"middle": [],
"last": "Lakshminarayanan",
"suffix": ""
},
{
"first": "Andrew",
"middle": [
"Mingbo"
],
"last": "Dai",
"suffix": ""
},
{
"first": "Dustin",
"middle": [],
"last": "Tran",
"suffix": ""
}
],
"year": 2021,
"venue": "International Conference on Learning Representations",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Marton Havasi, Rodolphe Jenatton, Stanislav Fort, Jeremiah Zhe Liu, Jasper Snoek, Balaji Lakshmi- narayanan, Andrew Mingbo Dai, and Dustin Tran. 2021. Training independent subnetworks for robust prediction. In International Conference on Learning Representations.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "CVPR tutorial: Diversity meets deep networks -inference, ensemble learning, and applications",
"authors": [
{
"first": "Alexander",
"middle": [],
"last": "Kirillov",
"suffix": ""
},
{
"first": "Bogdan",
"middle": [],
"last": "Savchynskyy",
"suffix": ""
},
{
"first": "Carsten",
"middle": [],
"last": "Rother",
"suffix": ""
},
{
"first": "Stefan",
"middle": [],
"last": "Lee",
"suffix": ""
},
{
"first": "Dhruv",
"middle": [],
"last": "Batra",
"suffix": ""
}
],
"year": 2016,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Alexander Kirillov, Bogdan Savchynskyy, Carsten Rother, Stefan Lee, and Dhruv Batra. 2016. CVPR tutorial: Diversity meets deep networks -inference, ensemble learning, and applications.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Measures of diversity in classifier ensembles and their relationship with the ensemble accuracy",
"authors": [
{
"first": "I",
"middle": [],
"last": "Ludmila",
"suffix": ""
},
{
"first": "Christopher",
"middle": [
"J"
],
"last": "Kuncheva",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Whitaker",
"suffix": ""
}
],
"year": 2003,
"venue": "",
"volume": "51",
"issue": "",
"pages": "181--207",
"other_ids": {
"DOI": [
"10.1023/A:1022859003006"
]
},
"num": null,
"urls": [],
"raw_text": "Ludmila I. Kuncheva and Christopher J. Whitaker. 2003. Measures of diversity in classifier ensembles and their relationship with the ensemble accuracy. Ma- chine Learning, 51(2):181-207.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "A statistical approach to learning and generalization in layered neural networks",
"authors": [
{
"first": "Esther",
"middle": [],
"last": "Levin",
"suffix": ""
},
{
"first": "Naftali",
"middle": [],
"last": "Tishby",
"suffix": ""
},
{
"first": "Sara",
"middle": [
"A"
],
"last": "Solla",
"suffix": ""
}
],
"year": 1989,
"venue": "Proceedings of the Second Annual Workshop on Computational Learning Theory (COLT 1989)",
"volume": "",
"issue": "",
"pages": "245--260",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Esther Levin, Naftali Tishby, and Sara A. Solla. 1989. A statistical approach to learning and generalization in layered neural networks. In Proceedings of the Sec- ond Annual Workshop on Computational Learning Theory (COLT 1989), page 245-260, San Francisco, CA, USA. Morgan Kaufmann Publishers Inc.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Super tickets in pre-trained language models: From model compression to improving generalization",
"authors": [
{
"first": "Chen",
"middle": [],
"last": "Liang",
"suffix": ""
},
{
"first": "Simiao",
"middle": [],
"last": "Zuo",
"suffix": ""
},
{
"first": "Minshuo",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Haoming",
"middle": [],
"last": "Jiang",
"suffix": ""
},
{
"first": "Xiaodong",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Pengcheng",
"middle": [],
"last": "He",
"suffix": ""
},
{
"first": "Tuo",
"middle": [],
"last": "Zhao",
"suffix": ""
},
{
"first": "Weizhu",
"middle": [],
"last": "Chen",
"suffix": ""
}
],
"year": 2021,
"venue": "Proceedings of the 59th",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"DOI": [
"10.18653/v1/2021.acl-long.510"
]
},
"num": null,
"urls": [],
"raw_text": "Chen Liang, Simiao Zuo, Minshuo Chen, Haoming Jiang, Xiaodong Liu, Pengcheng He, Tuo Zhao, and Weizhu Chen. 2021. Super tickets in pre-trained language models: From model compression to im- proving generalization. In Proceedings of the 59th",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing",
"authors": [],
"year": null,
"venue": "",
"volume": "1",
"issue": "",
"pages": "6524--6538",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Confer- ence on Natural Language Processing (Volume 1: Long Papers), pages 6524-6538, Online. Association for Computational Linguistics.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Ensemble learning via negative correlation",
"authors": [
{
"first": "Y",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "X",
"middle": [],
"last": "Yao",
"suffix": ""
}
],
"year": 1999,
"venue": "Neural Networks",
"volume": "12",
"issue": "10",
"pages": "1399--1404",
"other_ids": {
"DOI": [
"10.1016/S0893-6080(99)00073-8"
]
},
"num": null,
"urls": [],
"raw_text": "Y. Liu and X. Yao. 1999. Ensemble learn- ing via negative correlation. Neural Networks, 12(10):1399-1404.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Improving adversarial robustness via promoting ensemble diversity",
"authors": [
{
"first": "Tianyu",
"middle": [],
"last": "Pang",
"suffix": ""
},
{
"first": "Kun",
"middle": [],
"last": "Xu",
"suffix": ""
},
{
"first": "Chao",
"middle": [],
"last": "Du",
"suffix": ""
},
{
"first": "Ning",
"middle": [],
"last": "Chen",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 36th International Conference on Machine Learning",
"volume": "97",
"issue": "",
"pages": "4970--4979",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tianyu Pang, Kun Xu, Chao Du, Ning Chen, and Jun Zhu. 2019. Improving adversarial robustness via pro- moting ensemble diversity. In Proceedings of the 36th International Conference on Machine Learn- ing, volume 97 of Proceedings of Machine Learning Research, pages 4970-4979. PMLR.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "When BERT Plays the Lottery, All Tickets Are Winning",
"authors": [
{
"first": "Sai",
"middle": [],
"last": "Prasanna",
"suffix": ""
},
{
"first": "Anna",
"middle": [],
"last": "Rogers",
"suffix": ""
},
{
"first": "Anna",
"middle": [],
"last": "Rumshisky",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP 2020)",
"volume": "",
"issue": "",
"pages": "3208--3229",
"other_ids": {
"DOI": [
"10.18653/v1/2020.emnlp-main.259"
]
},
"num": null,
"urls": [],
"raw_text": "Sai Prasanna, Anna Rogers, and Anna Rumshisky. 2020. When BERT Plays the Lottery, All Tickets Are Win- ning. In Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP 2020), pages 3208-3229, Online. Associa- tion for Computational Linguistics.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "How fine can fine-tuning be? learning efficient language models",
"authors": [
{
"first": "Evani",
"middle": [],
"last": "Radiya",
"suffix": ""
},
{
"first": "-Dixit",
"middle": [],
"last": "",
"suffix": ""
},
{
"first": "Xin",
"middle": [],
"last": "Wang",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics (ICML 2020)",
"volume": "108",
"issue": "",
"pages": "2435--2443",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Evani Radiya-Dixit and Xin Wang. 2020. How fine can fine-tuning be? learning efficient language models. In Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics (ICML 2020), volume 108 of Proceedings of Machine Learning Research, pages 2435-2443. PMLR.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Exploring the limits of transfer learning with a unified text-to-text transformer",
"authors": [
{
"first": "Colin",
"middle": [],
"last": "Raffel",
"suffix": ""
},
{
"first": "Noam",
"middle": [],
"last": "Shazeer",
"suffix": ""
},
{
"first": "Adam",
"middle": [],
"last": "Roberts",
"suffix": ""
},
{
"first": "Katherine",
"middle": [],
"last": "Lee",
"suffix": ""
},
{
"first": "Sharan",
"middle": [],
"last": "Narang",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Matena",
"suffix": ""
},
{
"first": "Yanqi",
"middle": [],
"last": "Zhou",
"suffix": ""
},
{
"first": "Wei",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Peter",
"middle": [
"J"
],
"last": "Liu",
"suffix": ""
}
],
"year": 2020,
"venue": "Journal of Machine Learning Research",
"volume": "21",
"issue": "140",
"pages": "1--67",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Colin Raffel, Noam Shazeer, Adam Roberts, Kather- ine Lee, Sharan Narang, Michael Matena, Yanqi Zhou, Wei Li, and Peter J. Liu. 2020. Exploring the limits of transfer learning with a unified text-to-text transformer. Journal of Machine Learning Research, 21(140):1-67.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "SQuAD: 100,000+ questions for machine comprehension of text",
"authors": [
{
"first": "Pranav",
"middle": [],
"last": "Rajpurkar",
"suffix": ""
},
{
"first": "Jian",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Konstantin",
"middle": [],
"last": "Lopyrev",
"suffix": ""
},
{
"first": "Percy",
"middle": [],
"last": "Liang",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing (EMNLP 2016)",
"volume": "",
"issue": "",
"pages": "2383--2392",
"other_ids": {
"DOI": [
"10.18653/v1/D16-1264"
]
},
"num": null,
"urls": [],
"raw_text": "Pranav Rajpurkar, Jian Zhang, Konstantin Lopyrev, and Percy Liang. 2016. SQuAD: 100,000+ questions for machine comprehension of text. In Proceedings of the 2016 Conference on Empirical Methods in Nat- ural Language Processing (EMNLP 2016), pages 2383-2392, Austin, Texas. Association for Computa- tional Linguistics.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "{DICE}: Diversity in deep ensembles via conditional redundancy adversarial estimation",
"authors": [
{
"first": "Alexandre",
"middle": [],
"last": "Rame",
"suffix": ""
},
{
"first": "Matthieu",
"middle": [],
"last": "Cord",
"suffix": ""
}
],
"year": 2021,
"venue": "Proceedings of the 9th International Conference on Learning Representations",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Alexandre Rame and Matthieu Cord. 2021. {DICE}: Diversity in deep ensembles via conditional redun- dancy adversarial estimation. In Proceedings of the 9th International Conference on Learning Represen- tations (ICLR 2021).",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "Movement pruning: Adaptive sparsity by fine-tuning",
"authors": [
{
"first": "Victor",
"middle": [],
"last": "Sanh",
"suffix": ""
},
{
"first": "Thomas",
"middle": [],
"last": "Wolf",
"suffix": ""
},
{
"first": "Alexander",
"middle": [],
"last": "Rush",
"suffix": ""
}
],
"year": 2020,
"venue": "Advances in Neural Information Processing Systems",
"volume": "33",
"issue": "",
"pages": "20378--20389",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Victor Sanh, Thomas Wolf, and Alexander Rush. 2020. Movement pruning: Adaptive sparsity by fine-tuning. In Advances in Neural Information Processing Sys- tems, volume 33, pages 20378-20389. Curran Asso- ciates, Inc.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "Dipanjan Das, and Ellie Pavlick. 2022. The multiB-ERTs: BERT reproductions for robustness analysis",
"authors": [
{
"first": "Thibault",
"middle": [],
"last": "Sellam",
"suffix": ""
},
{
"first": "Steve",
"middle": [],
"last": "Yadlowsky",
"suffix": ""
},
{
"first": "Ian",
"middle": [],
"last": "Tenney",
"suffix": ""
},
{
"first": "Jason",
"middle": [],
"last": "Wei",
"suffix": ""
},
{
"first": "Naomi",
"middle": [],
"last": "Saphra",
"suffix": ""
},
{
"first": "Alexander D'",
"middle": [],
"last": "Amour",
"suffix": ""
},
{
"first": "Tal",
"middle": [],
"last": "Linzen",
"suffix": ""
},
{
"first": "Jasmijn",
"middle": [],
"last": "Bastings",
"suffix": ""
},
{
"first": "Jacob",
"middle": [],
"last": "Iulia Raluca Turc",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Eisenstein",
"suffix": ""
}
],
"year": null,
"venue": "International Conference on Learning Representations",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Thibault Sellam, Steve Yadlowsky, Ian Tenney, Jason Wei, Naomi Saphra, Alexander D'Amour, Tal Linzen, Jasmijn Bastings, Iulia Raluca Turc, Jacob Eisenstein, Dipanjan Das, and Ellie Pavlick. 2022. The multiB- ERTs: BERT reproductions for robustness analysis. In International Conference on Learning Representa- tions (ICLR 2022).",
"links": null
},
"BIBREF30": {
"ref_id": "b30",
"title": "The cost of training NLP models: A concise overview",
"authors": [
{
"first": "Or",
"middle": [],
"last": "Sharir",
"suffix": ""
},
{
"first": "Barak",
"middle": [],
"last": "Peleg",
"suffix": ""
},
{
"first": "Yoav",
"middle": [],
"last": "Shoham",
"suffix": ""
}
],
"year": 2020,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Or Sharir, Barak Peleg, and Yoav Shoham. 2020. The cost of training NLP models: A concise overview. CoRR, abs/2004.08900.",
"links": null
},
"BIBREF31": {
"ref_id": "b31",
"title": "The sources of increased accuracy for two proposed boosting algorithms",
"authors": [
{
"first": "David",
"middle": [
"B"
],
"last": "Skalak",
"suffix": ""
}
],
"year": 1996,
"venue": "Proc. American Association for Arti Intelligence, AAAI-96, Integrating Multiple Learned Models Workshop",
"volume": "",
"issue": "",
"pages": "120--125",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "David B. Skalak. 1996. The sources of increased ac- curacy for two proposed boosting algorithms. In In Proc. American Association for Arti Intelligence, AAAI-96, Integrating Multiple Learned Models Work- shop, pages 120-125.",
"links": null
},
"BIBREF32": {
"ref_id": "b32",
"title": "Recursive deep models for semantic compositionality over a sentiment treebank",
"authors": [
{
"first": "Richard",
"middle": [],
"last": "Socher",
"suffix": ""
},
{
"first": "Alex",
"middle": [],
"last": "Perelygin",
"suffix": ""
},
{
"first": "Jean",
"middle": [],
"last": "Wu",
"suffix": ""
},
{
"first": "Jason",
"middle": [],
"last": "Chuang",
"suffix": ""
},
{
"first": "Christopher",
"middle": [
"D"
],
"last": "Manning",
"suffix": ""
},
{
"first": "Andrew",
"middle": [],
"last": "Ng",
"suffix": ""
},
{
"first": "Christopher",
"middle": [],
"last": "Potts",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing (EMNLP 2013)",
"volume": "",
"issue": "",
"pages": "1631--1642",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Richard Socher, Alex Perelygin, Jean Wu, Jason Chuang, Christopher D. Manning, Andrew Ng, and Christopher Potts. 2013. Recursive deep models for semantic compositionality over a sentiment treebank. In Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing (EMNLP 2013), pages 1631-1642, Seattle, Washington, USA. Association for Computational Linguistics.",
"links": null
},
"BIBREF33": {
"ref_id": "b33",
"title": "Hyung Won Chung, Sharan Narang, Dani Yogatama, Ashish Vaswani, and Donald Metzler. 2022. Scale efficiently: Insights from pretraining and finetuning transformers",
"authors": [
{
"first": "Yi",
"middle": [],
"last": "Tay",
"suffix": ""
},
{
"first": "Mostafa",
"middle": [],
"last": "Dehghani",
"suffix": ""
},
{
"first": "Jinfeng",
"middle": [],
"last": "Rao",
"suffix": ""
},
{
"first": "William",
"middle": [],
"last": "Fedus",
"suffix": ""
},
{
"first": "Samira",
"middle": [],
"last": "Abnar",
"suffix": ""
}
],
"year": null,
"venue": "International Conference on Learning Representations",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yi Tay, Mostafa Dehghani, Jinfeng Rao, William Fedus, Samira Abnar, Hyung Won Chung, Sharan Narang, Dani Yogatama, Ashish Vaswani, and Donald Met- zler. 2022. Scale efficiently: Insights from pretrain- ing and finetuning transformers. In International Conference on Learning Representations.",
"links": null
},
"BIBREF34": {
"ref_id": "b34",
"title": "SuperGLUE: A stickier benchmark for general-purpose language understanding systems",
"authors": [
{
"first": "Alex",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Yada",
"middle": [],
"last": "Pruksachatkun",
"suffix": ""
},
{
"first": "Nikita",
"middle": [],
"last": "Nangia",
"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": 2019,
"venue": "Advances in Neural Information Processing Systems",
"volume": "32",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Alex Wang, Yada Pruksachatkun, Nikita Nangia, Aman- preet Singh, Julian Michael, Felix Hill, Omer Levy, and Samuel Bowman. 2019. SuperGLUE: A stickier benchmark for general-purpose language understand- ing systems. In Advances in Neural Information Processing Systems 32 (NeurIPS 2019). Curran As- sociates, Inc.",
"links": null
},
"BIBREF35": {
"ref_id": "b35",
"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": {
"DOI": [
"10.18653/v1/W18-5446"
]
},
"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 nat- ural language understanding. In Proceedings of the 2018 EMNLP Workshop BlackboxNLP: Analyzing and Interpreting Neural Networks for NLP, pages 353-355, Brussels, Belgium. Association for Com- putational Linguistics.",
"links": null
},
"BIBREF36": {
"ref_id": "b36",
"title": "Neural network acceptability judgments",
"authors": [
{
"first": "Alex",
"middle": [],
"last": "Warstadt",
"suffix": ""
},
{
"first": "Amanpreet",
"middle": [],
"last": "Singh",
"suffix": ""
},
{
"first": "Samuel",
"middle": [
"R"
],
"last": "",
"suffix": ""
}
],
"year": 2019,
"venue": "Transactions of the Association for Computational Linguistics",
"volume": "7",
"issue": "",
"pages": "625--641",
"other_ids": {
"DOI": [
"10.1162/tacl_a_00290"
]
},
"num": null,
"urls": [],
"raw_text": "Alex Warstadt, Amanpreet Singh, and Samuel R. Bow- man. 2019. Neural network acceptability judgments. Transactions of the Association for Computational Linguistics, 7:625-641.",
"links": null
},
"BIBREF37": {
"ref_id": "b37",
"title": "A broad-coverage challenge corpus for sentence understanding through inference",
"authors": [
{
"first": "Adina",
"middle": [],
"last": "Williams",
"suffix": ""
},
{
"first": "Nikita",
"middle": [],
"last": "Nangia",
"suffix": ""
},
{
"first": "Samuel",
"middle": [],
"last": "Bowman",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "1",
"issue": "",
"pages": "1112--1122",
"other_ids": {
"DOI": [
"10.18653/v1/N18-1101"
]
},
"num": null,
"urls": [],
"raw_text": "Adina Williams, Nikita Nangia, and Samuel Bowman. 2018. A broad-coverage challenge corpus for sen- tence understanding through inference. In Proceed- ings of the 2018 Conference of the North American Chapter of the Association for Computational Lin- guistics: Human Language Technologies, Volume 1 (Long Papers), pages 1112-1122, New Orleans, Louisiana. Association for Computational Linguis- tics.",
"links": null
},
"BIBREF39": {
"ref_id": "b39",
"title": "Transformers: State-of-the-art natural language processing",
"authors": [
{
"first": "Joe",
"middle": [],
"last": "Davison",
"suffix": ""
},
{
"first": "Sam",
"middle": [],
"last": "Shleifer",
"suffix": ""
},
{
"first": "Clara",
"middle": [],
"last": "Patrick Von Platen",
"suffix": ""
},
{
"first": "Yacine",
"middle": [],
"last": "Ma",
"suffix": ""
},
{
"first": "Julien",
"middle": [],
"last": "Jernite",
"suffix": ""
},
{
"first": "Canwen",
"middle": [],
"last": "Plu",
"suffix": ""
},
{
"first": "Teven",
"middle": [
"Le"
],
"last": "Xu",
"suffix": ""
},
{
"first": "Sylvain",
"middle": [],
"last": "Scao",
"suffix": ""
},
{
"first": "Mariama",
"middle": [],
"last": "Gugger",
"suffix": ""
},
{
"first": "Quentin",
"middle": [],
"last": "Drame",
"suffix": ""
},
{
"first": "Alexander",
"middle": [
"M"
],
"last": "Lhoest",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Rush",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: System Demonstrations (EMNLP 2020)",
"volume": "",
"issue": "",
"pages": "38--45",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joe Davison, Sam Shleifer, Patrick von Platen, Clara Ma, Yacine Jernite, Julien Plu, Canwen Xu, Teven Le Scao, Sylvain Gugger, Mariama Drame, Quentin Lhoest, and Alexander M. Rush. 2020. Transform- ers: State-of-the-art natural language processing. In Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: System Demonstrations (EMNLP 2020), pages 38-45, On- line. Association for Computational Linguistics.",
"links": null
},
"BIBREF40": {
"ref_id": "b40",
"title": "Boosting ensemble accuracy by revisiting ensemble diversity metrics",
"authors": [
{
"first": "Yanzhao",
"middle": [],
"last": "Wu",
"suffix": ""
},
{
"first": "Ling",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Zhongwei",
"middle": [],
"last": "Xie",
"suffix": ""
},
{
"first": "Ka-Ho",
"middle": [],
"last": "Chow",
"suffix": ""
},
{
"first": "Wenqi",
"middle": [],
"last": "Wei",
"suffix": ""
}
],
"year": 2021,
"venue": "Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"volume": "",
"issue": "",
"pages": "16469--16477",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yanzhao Wu, Ling Liu, Zhongwei Xie, Ka-Ho Chow, and Wenqi Wei. 2021. Boosting ensemble accuracy by revisiting ensemble diversity metrics. In Pro- ceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 16469- 16477.",
"links": null
},
"BIBREF41": {
"ref_id": "b41",
"title": "On the association of attributes in statistics: With illustrations from the material of the childhood society, &c",
"authors": [
{
"first": "G",
"middle": [],
"last": "Udny Yule",
"suffix": ""
}
],
"year": 1900,
"venue": "Philosophical Transactions of the Royal Society of London",
"volume": "194",
"issue": "",
"pages": "257--319",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "G. Udny Yule. 1900. On the association of attributes in statistics: With illustrations from the material of the childhood society, &c. Philosophical Transactions of the Royal Society of London, 194:257-319.",
"links": null
},
"BIBREF42": {
"ref_id": "b42",
"title": "Ex uno plures: Splitting one model into an ensemble of subnetworks",
"authors": [
{
"first": "Zhilu",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Vianne",
"suffix": ""
},
{
"first": "Mert",
"middle": [
"R"
],
"last": "Gao",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Sabuncu",
"suffix": ""
}
],
"year": 2021,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Zhilu Zhang, Vianne R. Gao, and Mert R. Sabuncu. 2021. Ex uno plures: Splitting one model into an ensemble of subnetworks.",
"links": null
},
"BIBREF43": {
"ref_id": "b43",
"title": "Masking as an efficient alternative to finetuning for pretrained language models",
"authors": [
{
"first": "Mengjie",
"middle": [],
"last": "Zhao",
"suffix": ""
},
{
"first": "Tao",
"middle": [],
"last": "Lin",
"suffix": ""
},
{
"first": "Fei",
"middle": [],
"last": "Mi",
"suffix": ""
},
{
"first": "Martin",
"middle": [],
"last": "Jaggi",
"suffix": ""
},
{
"first": "Hinrich",
"middle": [],
"last": "Sch\u00fctze",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP 2020)",
"volume": "",
"issue": "",
"pages": "2226--2241",
"other_ids": {
"DOI": [
"10.18653/v1/2020.emnlp-main.174"
]
},
"num": null,
"urls": [],
"raw_text": "Mengjie Zhao, Tao Lin, Fei Mi, Martin Jaggi, and Hin- rich Sch\u00fctze. 2020. Masking as an efficient alterna- tive to finetuning for pretrained language models. In Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP 2020), pages 2226-2241, Online. Association for Computational Linguistics.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"num": null,
"uris": null,
"text": "mask of pruning, m s,10% 2 {0, 1} |\u2713s| , where the surviving positions have 1 otherwise 0. The pruning of parameters \u2713 by a mask m can be also represented as \u2713 m, where is the element-wise product. Next, we replay finetuning but from \u2713 s m s,10% and get FINE(\u2713 s m s,10% , s) as well as 20%-pruning mask m s,20% . By repeating iterative magnitude pruning, we obtain the parameter FINE(\u2713 s m s,P % , s). In our experiments, we set P = 30, i.e., evaluate ensemble of 30%-pruning sub-networks, where M =",
"type_str": "figure"
},
"FIGREF1": {
"num": null,
"uris": null,
"text": ";Prasanna et al. (2020) 2 tialization of the task-specific output layer, (2) 080 dataset shuffling for stochastic gradient descent 081 (SGD), and (3) dropout noise. However, empiri-082 cally, they do not necessarily lead to diverse mod-083 els, asRadiya-Dixit and Wang (2020) reported the 084 finetuned parameters could not be far away.085For diversifying models more, we propose to086 introduce a novel randomness, (4) pruning of the 087 pretrained model before each finetuning. We ex-088 pect that, during finetuning, each sub-network ac-089 quires different views using different sub-spaces of 090 the pretrained knowledge. This idea has two chal-091 lenges: the diversity and the accuracy of the sub-092 networks. Recent studies on the lottery ticket hy-093 pothesis (Frankle and Carbin, 2019) suggest that a 094 dense neural network at an initialization contains a 095 sub-network, called winning ticket, whose accuracy 096 becomes comparable with that of the dense network 097 after the same training steps. A pretrained BERT 098 also has sparse sub-networks (e.g., 50%), which 099 can achieve the same accuracy with the entire net-100 work when finetuning on downstream tasks (Chen 101 et al., 2020). However, it is still unclear how di-102",
"type_str": "figure"
},
"FIGREF2": {
"num": null,
"uris": null,
"text": "'s procedure 2 . We experiment with several 118 variants on the basis of this method.119Let FINE(\u2713, s) be the new parameters, which 120 are finetuned from \u2713 using SGD depending121 on a random seed s. Also, let \u2713 s represent 122 the parameter of the pretrained BERT and the 123 task-specific layer, whose parameter is randomly 124 initialized by random seed s. After finetuning 125 \u2713 s to FINE(\u2713 s , s), we identify and prune the 126 parameters with 10% lowest magnitudes in 127 FINE(\u2713 s , s). We also get the corresponding binary 128 mask of pruning, m s,10% 2 {0, 1} |\u2713s| , where 129 the surviving positions have 1 otherwise 0. The 130 pruning of parameters \u2713 by a mask m can be also 131 represented as \u2713 m, where is the element-wise 132 product. Next, we replay finetuning but from 133 \u2713 s m s,10% and get FINE(\u2713 s m s,10% , s) as 134 well as 20%-pruning mask m s,20% . By repeating 135 iterative magnitude pruning, we obtain the 136 parameter FINE(\u2713 s m s,P % , s). In our exper-137 iments, we set P = 30, i.e., evaluate ensemble 138 of 30%-pruning sub-networks, where M = 139 {FINE(\u2713 s1 m s1,30% , s 1 ), ..., FINE(\u2713 s |M| 140",
"type_str": "figure"
},
"FIGREF3": {
"num": null,
"uris": null,
"text": "Comparison of the performances and the number of ensemble members on MRPC (left) and STS-B (right). They are represented as the relative gain compared with BASELINE's accuracy.",
"type_str": "figure"
},
"TABREF0": {
"type_str": "table",
"num": null,
"html": null,
"text": "on a random seed s. Also, let \u2713 s represent 122 the parameter of the pretrained BERT and the 123 task-specific layer, whose parameter is randomly 124 initialized by random seed s. After finetuning 125 \u2713 s to FINE(\u2713 s , s), we identify and prune the , s). We also get the corresponding binary128 mask of pruning, m s,10% 2 {0, 1} |\u2713s| , where 129 the surviving positions have 1 otherwise 0. The 130 pruning of parameters \u2713 by a mask m can be also 131 represented as \u2713 m, where is the element-wise",
"content": "<table><tr><td>088</td><td colspan=\"3\">pretrained model before each finetuning. We ex-</td></tr><tr><td>089</td><td colspan=\"3\">pect that, during finetuning, each sub-network ac-</td></tr><tr><td>090</td><td colspan=\"2\">quires different views using different sub-spaces of</td><td/></tr><tr><td>091</td><td colspan=\"3\">the pretrained knowledge. This idea has two chal-</td></tr><tr><td>092</td><td colspan=\"3\">lenges: the diversity and the accuracy of the sub-</td></tr><tr><td>093</td><td colspan=\"3\">networks. Recent studies on the lottery ticket hy-</td><td>126</td></tr><tr><td>094</td><td colspan=\"4\">parameters with 10% lowest magnitudes in pothesis (Frankle and Carbin, 2019) suggest that a</td><td>127</td></tr><tr><td>095 096 097 098</td><td colspan=\"4\">dense neural network at an initialization contains a sub-network, called winning ticket, whose accuracy becomes comparable with that of the dense network FINE(\u2713 s 132 after the same training steps. A pretrained BERT</td></tr><tr><td/><td colspan=\"4\">product. Next, we replay finetuning but from</td><td>133</td></tr><tr><td/><td>\u2713 s</td><td colspan=\"2\">m s,10% and get FINE(\u2713 s</td><td>m s,10% , s) as</td><td>134</td></tr><tr><td/><td colspan=\"4\">well as 20%-pruning mask m s,20% . By repeating</td><td>135</td></tr><tr><td/><td colspan=\"4\">iterative magnitude pruning, we obtain the</td><td>136</td></tr><tr><td/><td colspan=\"2\">parameter FINE(\u2713 s</td><td colspan=\"2\">m s,P % , s). In our exper-</td><td>137</td></tr><tr><td/><td colspan=\"4\">iments, we set P = 30, i.e., evaluate ensemble</td><td>138</td></tr><tr><td/><td colspan=\"4\">of 30%-pruning sub-networks, where M = {FINE(\u2713 s1 m s1,30% , s 1 ), ..., FINE(\u2713 s |M|</td><td>139 140</td></tr><tr><td/><td/><td colspan=\"3\">2 We also did not prune the embedding layer, following</td></tr><tr><td/><td colspan=\"3\">Chen et al. (2020); Prasanna et al. (2020)</td></tr><tr><td/><td>2</td><td/><td/></tr></table>"
},
"TABREF1": {
"type_str": "table",
"num": null,
"html": null,
"text": "For diversifying models more, we propose to dense neural network at an initialization contains a 095 sub-network, called winning ticket, whose accuracy 096 becomes comparable with that of the dense network 097 after the same training steps. A pretrained BERT 098 also has sparse sub-networks (e.g., 50%), which 099 can achieve the same accuracy with the entire net-",
"content": "<table/>"
},
"TABREF2": {
"type_str": "table",
"num": null,
"html": null,
"text": "We also get the corresponding binary128 mask of pruning, m s,10% 2 {0, 1} |\u2713s| , where 129 the surviving positions have 1 otherwise 0. The 130 pruning of parameters \u2713 by a mask m can be also 131 represented as \u2713 m, where is the element-wise 132 product. Next, we replay finetuning but from 133 \u2713 s m s,10% and get FINE(\u2713 s m s,10% , s) as 134 well as 20%-pruning mask m s,20% . By repeating 135 iterative magnitude pruning, we obtain the 136 parameter FINE(\u2713 s m s,P % , s). In our exper-137 iments, we set P = 30, i.e., evaluate ensemble 30% , s 1 ), ..., FINE(\u2713 s |M| 140 2 We also did not prune the embedding layer, following Chen et al. (2020); Prasanna et al. (2020) 2 pect that, during finetuning, each sub-network ac-089 quires different views using different sub-spaces of 090 the pretrained knowledge. This idea has two chal-091 lenges: the diversity and the accuracy of the sub-092 networks. Recent studies on the lottery ticket hy-093 pothesis (Frankle and Carbin, 2019) suggest that a 094 dense neural network at an initialization contains a 095 sub-network, called winning ticket, whose accuracy 096 becomes comparable with that of the dense network 097 after the same training steps. A pretrained BERT",
"content": "<table><tr><td>of 30%-pruning sub-networks, where M = {FINE(\u2713 s1 m s1,098</td><td>138 139</td></tr></table>"
},
"TABREF3": {
"type_str": "table",
"num": null,
"html": null,
"text": ". Note MRPC STS-B single ens. diff. single ens. diff. 83.48 84.34 +0.86 88.35 89.04 +0.69 (BAGGING) 82.87 84.19 +1.32 88.17 88.84 +0.68 BASE-LT 83.84 84.98 +1.14 88.37 89.16 +0.79 ACTIVE-LT 83.22 84.60 +1.38 88.39 89.32 +0.94 RANDOM-LT 83.53 85.05 +1.52 88.49 89.35 +0.86",
"content": "<table/>"
},
"TABREF5": {
"type_str": "table",
"num": null,
"html": null,
"text": "MRPC STS-B single ens. diff. single ens. diff. BASELINE 87.77 88.47 +0.70 89.52 90.00 +0.48 (BAGGING) 87.64 88.12 +0.49 89.34 89.91 +0.54 BASE-LT 87.72 88.25 +0.53 89.71 90.07 +0.36 ACTIVE-LT 87.39 88.51 +1.12 88.46 89.50 +1.04 RANDOM-LT 87.86 89.26 +1.40 88.41 89.39 +0.98",
"content": "<table/>"
}
}
}
} |