File size: 136,965 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 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 | {
"paper_id": "2022",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T15:24:46.862408Z"
},
"title": "Knowledge Base Index Compression via Dimensionality and Precision Reduction",
"authors": [
{
"first": "Vil\u00e9m",
"middle": [],
"last": "Zouhar",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Saarland University",
"location": {
"country": "Germany"
}
},
"email": "vzouhar@lsv.uni-saarland.de"
},
{
"first": "Marius",
"middle": [],
"last": "Mosbach",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Saarland University",
"location": {
"country": "Germany"
}
},
"email": "mmosbach@lsv.uni-saarland.de"
},
{
"first": "Miaoran",
"middle": [],
"last": "Zhang",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Saarland University",
"location": {
"country": "Germany"
}
},
"email": "mzhang@lsv.uni-saarland.de"
},
{
"first": "Dietrich",
"middle": [],
"last": "Klakow",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Saarland University",
"location": {
"country": "Germany"
}
},
"email": "dklakow@lsv.uni-saarland.de"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Recently neural network based approaches to knowledge-intensive NLP tasks, such as question answering, started to rely heavily on the combination of neural retrievers and readers. Retrieval is typically performed over a large textual knowledge base (KB) which requires significant memory and compute resources, especially when scaled up. On HotpotQA we systematically investigate reducing the size of the KB index by means of dimensionality (sparse random projections, PCA, autoencoders) and numerical precision reduction. Our results show that PCA is an easy solution that requires very little data and is only slightly worse than autoencoders, which are less stable. All methods are sensitive to preand post-processing and data should always be centered and normalized both before and after dimension reduction. Finally, we show that it is possible to combine PCA with using 1bit per dimension. Overall we achieve (1) 100\u00d7 compression with 75%, and (2) 24\u00d7 compression with 92% original retrieval performance.",
"pdf_parse": {
"paper_id": "2022",
"_pdf_hash": "",
"abstract": [
{
"text": "Recently neural network based approaches to knowledge-intensive NLP tasks, such as question answering, started to rely heavily on the combination of neural retrievers and readers. Retrieval is typically performed over a large textual knowledge base (KB) which requires significant memory and compute resources, especially when scaled up. On HotpotQA we systematically investigate reducing the size of the KB index by means of dimensionality (sparse random projections, PCA, autoencoders) and numerical precision reduction. Our results show that PCA is an easy solution that requires very little data and is only slightly worse than autoencoders, which are less stable. All methods are sensitive to preand post-processing and data should always be centered and normalized both before and after dimension reduction. Finally, we show that it is possible to combine PCA with using 1bit per dimension. Overall we achieve (1) 100\u00d7 compression with 75%, and (2) 24\u00d7 compression with 92% original retrieval performance.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Recent approaches to knowledge-intensive NLP tasks combine neural network based models with a retrieval component that leverages dense vector representations (Guu et al., 2020; Lewis et al., 2020; Petroni et al., 2021) . The most straightforward example is question answering, where the retriever receives as input a question and returns relevant documents to be used by the reader (both encoder and decoder), which outputs the answer (Chen, 2020) . The same approach can also be applied in other contexts, such as fact-checking (Tchechmedjiev et al., 2019) or knowledgable dialogue (Dinan et al., 2018) . Moreover, this paradigm can also be applied to systems that utilize e.g. caching of contexts from the training corpus to provide better output, such as the k-nearest neighbours language model proposed by Khandelwal et al. (2019) or the dynamic gating language model mechanism by Yogatama et al. (2021) . All these pipelines are generalized as retrieving an artefact from a knowledge base (Zouhar et al., 2021) on which the reader is conditioned together with the query.",
"cite_spans": [
{
"start": 158,
"end": 176,
"text": "(Guu et al., 2020;",
"ref_id": "BIBREF9"
},
{
"start": 177,
"end": 196,
"text": "Lewis et al., 2020;",
"ref_id": "BIBREF15"
},
{
"start": 197,
"end": 218,
"text": "Petroni et al., 2021)",
"ref_id": "BIBREF25"
},
{
"start": 435,
"end": 447,
"text": "(Chen, 2020)",
"ref_id": "BIBREF3"
},
{
"start": 529,
"end": 557,
"text": "(Tchechmedjiev et al., 2019)",
"ref_id": "BIBREF29"
},
{
"start": 583,
"end": 603,
"text": "(Dinan et al., 2018)",
"ref_id": "BIBREF5"
},
{
"start": 810,
"end": 834,
"text": "Khandelwal et al. (2019)",
"ref_id": "BIBREF17"
},
{
"start": 885,
"end": 907,
"text": "Yogatama et al. (2021)",
"ref_id": "BIBREF35"
},
{
"start": 994,
"end": 1015,
"text": "(Zouhar et al., 2021)",
"ref_id": "BIBREF36"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Crucially, all of the previous examples rely on the quality of the retrieval component and the knowledge base. The knowledge base is usually indexed by dense vector representations 1 and the retrieval component performs maximum similarity search, commonly using the inner product or the L 2 distance, to retrieve documents 2 from the knowledge base. Only the index alone takes up a large amount of size of the knowledge base, making deployment and experimentation very difficult. The retrieval speed is also dependent on the dimensionality of the index vector. An example of a large knowledge base is the work of Borgeaud et al. (2021) which performs retrieval over a database of 1.8 billion documents.",
"cite_spans": [
{
"start": 613,
"end": 635,
"text": "Borgeaud et al. (2021)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "This paper focuses on the issue of compressing the index through dimensionality and precision reduction and makes the following contributions:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "\u2022 Comparison of various unsupervised index compression methods for retrieval, including random projections, PCA, autoencoder, precision reduction and their combination. \u2022 Examination of effective pre-and postprocessing transformations, showing that centering and normalization are necessary for boosting the performance. \u2022 Analysis on the impact of adding irrelevant documents and retrieval errors. Recommendations for use by practicioners.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In Section 3, we describe the problem scenario and the experimental setup. We discuss the results of different compression methods in Section 4. We provide further analysis in Section 5 and conclude with usage recommendations in Section 6. The repository for this project is available open-source. 3",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Reducing index size. A thorough overview of the issue of dimensionality reduction in information retrieval in the context of dual encoders has been done by Luan et al. (2021) . Though in-depth and grounded in formal arguments, their study is focused on the limits and properties of dimension reduction in general (even with sparse representations) and the effect of document length on performance. In contrast to their work, this paper aims to compare more methods and give practical advice with experimental evidence.",
"cite_spans": [
{
"start": 156,
"end": 174,
"text": "Luan et al. (2021)",
"ref_id": "BIBREF22"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "A baseline for dimensionality reduction has been recently proposed by Izacard et al. (2020) in which they perform the reduction while training the document (and query) encoder by adding a low dimensional linear projection layer as the final output layer. Compared to our work, their approach is supervised.",
"cite_spans": [
{
"start": 70,
"end": 91,
"text": "Izacard et al. (2020)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "In the concurrent work of Ma et al. (2021) , PCA is also used to reduce the size of the document index. Compared to our work, they perform PCA using the combination of all question and document vectors. We show in Figures 4 and 6 that this is not needed and the PCA transformation matrix can be estimated much more efficiently. Moreover, we use different unsupervised compression approaches for comparison and perform additional analysis of our findings.",
"cite_spans": [
{
"start": 26,
"end": 42,
"text": "Ma et al. (2021)",
"ref_id": "BIBREF23"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "An orthogonal approach to the issue of memory cost has been proposed by Yamada et al. (2021) . Instead of moving to another continuous vector representation, their proposed method maps original vectors to vectors of binary values which are trained using the signal from the downstream task. The pipeline, however, still relies on re-ranking using the uncompressed vectors. This method is different from ours and in Section 4.4 we show that they can be combined.",
"cite_spans": [
{
"start": 72,
"end": 92,
"text": "Yamada et al. (2021)",
"ref_id": "BIBREF33"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "Finally, He et al. (2021) investigate filtering and k-means pruning for the task of kNN language modelling. This work also circumvents the issue of having to always perform an expensive retrieval of a large data store by determining whether the retrieval is actually needed for a given input.",
"cite_spans": [
{
"start": 9,
"end": 25,
"text": "He et al. (2021)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "3 Link will be available in the camera-ready version.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "Effect of normalization. Timkey and van Schijndel (2021) examine how dominating embedding dimensions can worsen retrieval performance. They study the contribution of individual dimensions find that normalization is key for document retrieval based on dense vector representation when BERTbased embeddings are used. Compared to our work, they study pre-trained BERT directly, while we focus on DPR.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "Given a query q, the following set of equations summarizes the conceptual progression from retrieving top k relevant documents Z = {d 1 , d 2 , . . . , d k } from a large collection of documents D so that the relevance of d with q is maximized. For this, the query and the document embedding functions f Q : Q \u2192 R d and f D : D \u2192 R d are used to map the query and all documents to a shared embedding space and a similarity function sim :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Statement and Evaluation",
"sec_num": "3.1"
},
{
"text": "R d \u00d7 R d \u2192 R",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Statement and Evaluation",
"sec_num": "3.1"
},
{
"text": "approximates the relevance between query and documents. Here, we consider either the inner product or the L 2 distance as sim. 4 Finally, to speed up the similarity computation over a large set of documents and to decrease memory usage (f D is usually precomputed), we apply dimension reduction functions r Q :",
"cite_spans": [
{
"start": 127,
"end": 128,
"text": "4",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Statement and Evaluation",
"sec_num": "3.1"
},
{
"text": "R d \u2192 R d \u2032 and r D : R d \u2192 R d \u2032",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Statement and Evaluation",
"sec_num": "3.1"
},
{
"text": "for the query and document embeddings respectively. Formally, we are solving the following problem:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Statement and Evaluation",
"sec_num": "3.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "Z = arg top-k d\u2208D rel.(q, d) , with (1) rel.(q, d) \u2248 sim(f Q (q), f D (d)) (2) \u2248 sim(r Q (f Q (q)), r D (f D (d)))",
"eq_num": "(3)"
}
],
"section": "Problem Statement and Evaluation",
"sec_num": "3.1"
},
{
"text": "The approximation in (2) was shown to work well in practice for inner product and L 2 distance (Lin, 2021) . In this case, f Q is commonly finetuned for a specific downstream task. For this reason, it is desirable in (3) for the functions r Q and r D to be differentiable so that they can propagate the signal. These dimension-reducing functions need not be the same because even though they project to a shared vector space, the input distribution may still be different. Similarly to the query and document embedding functions, they can be fine-tuned.",
"cite_spans": [
{
"start": 95,
"end": 106,
"text": "(Lin, 2021)",
"ref_id": "BIBREF21"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Statement and Evaluation",
"sec_num": "3.1"
},
{
"text": "Task Agnostic Representation. When dealing with multiple downstream tasks that share a single (large) knowledge base, typically only f Q is finetuned for a specific task while f D remains fixed (Lewis et al., 2020; Petroni et al., 2021) . This assumes that the organization of the document vector space is sufficient across tasks and that only the mapping of the queries to this space needs to be trained. 5 Hence, this work is motivated primarily by finding a good r D (because of the dominant size of the document index), though we note that r Q is equally important and necessary because even without any vector semantics, the key and the document embeddings must have the same dimensionality.",
"cite_spans": [
{
"start": 194,
"end": 214,
"text": "(Lewis et al., 2020;",
"ref_id": "BIBREF15"
},
{
"start": 215,
"end": 236,
"text": "Petroni et al., 2021)",
"ref_id": "BIBREF25"
},
{
"start": 406,
"end": 407,
"text": "5",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Statement and Evaluation",
"sec_num": "3.1"
},
{
"text": "R-Precision. To evaluate retrieval performance we compute R-Precision averaged over queries: (relevant documents among top k passages in Z)/r, k = number of passages in relevant documents, in the same way as Petroni et al. (2021) . Following previous work, we consider the inner product (IP) and the L 2 distance as the similarity function.",
"cite_spans": [
{
"start": 208,
"end": 229,
"text": "Petroni et al. (2021)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Statement and Evaluation",
"sec_num": "3.1"
},
{
"text": "As knowledge base we use documents from English Wikipedia and follow the setup described by Petroni et al. (2021) . We mark spans (original articles split into 100 token pieces, 50 million in total) as relevant for a query if they come from the same Wikipedia article as one of the provenances. 6 In order to make our experiments computationally feasible and easy to reproduce we experiment with a modified version of this knowledge base where we keep only spans of documents that are relevant to at least one query from the training or validation set of our downstream tasks. As downstream tasks, we use HotpotQA (Yang et al., 2018) for all main experiments and Natural Questions (Kwiatkowski et al., 2019) to verify that the results transfer to other datasets as well. This leads to over 2 million encoded spans for HotpotQA (see Table 6 for dataset sizes). The 768-dimensional embeddings (32-bit floats) of this dataset (both queries and documents) add up to 7GB (146GB for the whole unpruned dataset).",
"cite_spans": [
{
"start": 92,
"end": 113,
"text": "Petroni et al. (2021)",
"ref_id": "BIBREF25"
},
{
"start": 295,
"end": 296,
"text": "6",
"ref_id": null
},
{
"start": 614,
"end": 633,
"text": "(Yang et al., 2018)",
"ref_id": "BIBREF34"
},
{
"start": 681,
"end": 707,
"text": "(Kwiatkowski et al., 2019)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [
{
"start": 832,
"end": 839,
"text": "Table 6",
"ref_id": "TABREF6"
}
],
"eq_spans": [],
"section": "Data",
"sec_num": "3.2"
},
{
"text": "To establish baselines for uncompressed performance we use models based on BERT (Devlin et al., 5 Guu et al. (2020) provide evidence that this assumption can lead to worse results in some cases.",
"cite_spans": [
{
"start": 96,
"end": 97,
"text": "5",
"ref_id": null
},
{
"start": 98,
"end": 115,
"text": "Guu et al. (2020)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Uncompressed Retrieval Peformance",
"sec_num": "3.3"
},
{
"text": "6 Spans of the original text which help in answering the query. Figure 1 : Comparison of different BERT-based embedding models and versions when using faster but slightly inaccurate nearest neighbour search.",
"cite_spans": [],
"ref_spans": [
{
"start": 64,
"end": 72,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Uncompressed Retrieval Peformance",
"sec_num": "3.3"
},
{
"text": "DPR (Avg) Sentence BERT (Avg) BERT (Avg) DPR [CLS] Sentence BERT [CLS] BERT [CLS] 0.0 0.1 0.2 0.3 0.4 0.5 0.6 R-Precision IP IP fast L 2 L 2 fast",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Uncompressed Retrieval Peformance",
"sec_num": "3.3"
},
{
"text": "[CLS] is the specific token embedding from the last layer while (Avg) is all token average. 2019). We consider (1) vanilla BERT, (2) Sentence-BERT (Reimers and Gurevych, 2019) and 3DPR (Karpukhin et al., 2020) , which was specifically trained for document retrieval. To obtain document embeddings, we use either the last hidden state representation at [CLS] or the average across tokens of the last layer. Our first experiment compares the retrieval performance of the different models on HotpotQA. The result is shown in Figure 1 . In alignment with previous works (Reimers and Gurevych, 2019) an immediately noticeable conclusion is that vanilla BERT has a poor performance, especially when taking the hidden state representation for the [CLS] token. Next, to make computation tractable, we repeat the experiment using FAISS (Johnson et al., 2019) . 7 We find that the performance loss across models is systematic, which warrants the use of this approximate nearest neighbour search for comparisons and all our following experiments will use FAISS on the DPR-CLS model.",
"cite_spans": [
{
"start": 147,
"end": 175,
"text": "(Reimers and Gurevych, 2019)",
"ref_id": "BIBREF26"
},
{
"start": 185,
"end": 209,
"text": "(Karpukhin et al., 2020)",
"ref_id": "BIBREF15"
},
{
"start": 352,
"end": 357,
"text": "[CLS]",
"ref_id": null
},
{
"start": 566,
"end": 594,
"text": "(Reimers and Gurevych, 2019)",
"ref_id": "BIBREF26"
},
{
"start": 740,
"end": 745,
"text": "[CLS]",
"ref_id": null
},
{
"start": 827,
"end": 849,
"text": "(Johnson et al., 2019)",
"ref_id": "BIBREF14"
},
{
"start": 852,
"end": 853,
"text": "7",
"ref_id": null
}
],
"ref_spans": [
{
"start": 522,
"end": 530,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Uncompressed Retrieval Peformance",
"sec_num": "3.3"
},
{
"text": "Pre-processing Transformations. Figure 1 also shows that model performance, especially for DPR, depends heavily on what similarity metric is used for retrieval. This is because none of the models produces normalized vectors by default. Figure 2 shows that performing only normalization ( x ||x|| ) sometimes hurts the performance but when joined with centering beforehand ( x\u2212x ||x\u2212x|| ), it improves the results (compared to no pre- processing) in all cases. The normalization and centering is done for queries and documents separatedly. Moreover, if the vectors are normalized, then the retrieved documents are the same for L 2 and inner product. 8 Nevertheless, we argue it still makes sense to study the compression capabilities of L 2 and the inner product separately, since the output of the compression of normalized vectors need not be normalized.",
"cite_spans": [
{
"start": 649,
"end": 650,
"text": "8",
"ref_id": null
}
],
"ref_spans": [
{
"start": 32,
"end": 40,
"text": "Figure 1",
"ref_id": null
},
{
"start": 236,
"end": 244,
"text": "Figure 2",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Uncompressed Retrieval Peformance",
"sec_num": "3.3"
},
{
"text": "DPR (Avg) Sentence BERT (Avg) BERT (Avg) DPR [CLS] Sentence BERT [CLS] BERT [CLS] 0.0 0.1 0.2 0.3 0.4 0.5 0.6 R-Precision IP IP (center) IP, L 2 (norm) L 2 L 2 (center) IP, L 2 (center, norm)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Uncompressed Retrieval Peformance",
"sec_num": "3.3"
},
{
"text": "Having established the retrieval performance of the uncompressed baseline, we now turn to methods for compressing the dense document index and the queries.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Compression Methods",
"sec_num": "4"
},
{
"text": "Note that we consider unsupervised methods on already trained index, for maximum ease of use and applicability. This is in contrast to supervised methods, which have access to the query-doc relevancy mapping, or to in-training dimension reduction (i.e. lower final layer dimension).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Compression Methods",
"sec_num": "4"
},
{
"text": "The simplest way to perform dimension reduction for a given index x \u2208 R d is to randomly preserve only certain d \u2032 dimensions and drop all other dimensions:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Random Projection",
"sec_num": "4.1"
},
{
"text": "f drop. (x) = (x m 1 , x m 2 , . . . , x m d \u2032 ) 8 arg max k \u2212||a\u2212b|| 2 = arg max k \u2212\u27e8a, a\u27e9 2 \u2212\u27e8b, b\u27e9 2 + 2 \u2022 \u27e8a, b\u27e9 = arg max k 2 \u2022 \u27e8a, b\u27e9 \u2212 2 = arg max k \u27e8a, b\u27e9",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Random Projection",
"sec_num": "4.1"
},
{
"text": "Another approach is to greedily search which dimensions to drop (those that, when omitted, either improve the performance or lessen it the least):",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Random Projection",
"sec_num": "4.1"
},
{
"text": "p i (x) = (x 0 , x 1 , . . ., x i\u22121 , x i+1 , . . ., x 768 ) L i = R-Prec(p i (Q), p i (D)) m = sort desc. L ([1 . . . 768]) f greedy drop. (x) = (x m 1 , x m 2 , . . . , x m d \u2032 )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Random Projection",
"sec_num": "4.1"
},
{
"text": "The advantage of these two approaches is that they can be represented easily by a single R 768\u00d7d matrix. We consider two other standard random projection methods: Gaussian random projection and Sparse random projection (Fodor, 2002) . Such random projections are suitable mostly for inner product (Kaski, 1998) though the differences are removed by normalizing the vectors (which also improves the performance). Results. The results of all random projection methods are shown in Figure 3 . Gaussian random projection seems to perform equally to sparse random projection. The performance is not fully recovered for the two methods. Interestingly, simply dropping random dimensions led to better performance than that of sparse or Gaussian random projection. The greedy dimension dropping even improves the performance slightly over random dimension dropping in some cases before saturating and is deterministic. As shown in Table 2 , the greedy dimension dropping with post-processing achieves the best performance among all random projection methods. Without post-processing, L 2 distance works better compared to inner product.",
"cite_spans": [
{
"start": 219,
"end": 232,
"text": "(Fodor, 2002)",
"ref_id": "BIBREF6"
},
{
"start": 297,
"end": 310,
"text": "(Kaski, 1998)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [
{
"start": 479,
"end": 487,
"text": "Figure 3",
"ref_id": "FIGREF1"
},
{
"start": 923,
"end": 930,
"text": "Table 2",
"ref_id": "TABREF3"
}
],
"eq_spans": [],
"section": "Random Projection",
"sec_num": "4.1"
},
{
"text": "Another natural candidate for dimensionality reduction is principal component analysis (PCA) (F. R.S., 1901) . PCA considers the dimensions with the highest variance and omits the rest. This leads to a projection matrix that projects the original data onto the principal components using an orthonormal basis T . The following loss is minimized L = MSE(T \u2032 Tx, x). Note that we fit PCA on the covariance matrix of either the document index, query embeddings or both and the trained dimension-reducing projection is then applied to both the document and query embeddings.",
"cite_spans": [
{
"start": 97,
"end": 108,
"text": "R.S., 1901)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Principal Component Analysis",
"sec_num": "4.2"
},
{
"text": "Results. The results of performing PCA are shown in Figure 4 . First, we find that the uncompressed performance, as well as the effect of compression, is highly dependent on the data pre-processing. This should not be surprising as the PCA algorithm assumes centered and preprocessed data. Nevertheless, we stress and demonstrate the importance of this step. This is given by the normalization of the input vectors and also that the column vectors of PCA are orthonormal.",
"cite_spans": [],
"ref_spans": [
{
"start": 52,
"end": 60,
"text": "Figure 4",
"ref_id": "FIGREF2"
}
],
"eq_spans": [],
"section": "Principal Component Analysis",
"sec_num": "4.2"
},
{
"text": "Second, when the data is not centered, the PCA is sensitive to what it is trained on. Figure 4 show systematically that training on the set of available queries provides better performance than training on the documents or a combination of both. Subsequently, after centering the data, it does not matter anymore what is used for fitting: both the queries and the documents provide good estimates of the data variance and the dependency on training data size for PCA is explored explicitly in Section 5.1. The reason why queries provide better results without centering is that they are more centered in the first place, as shown in Table 1 .",
"cite_spans": [],
"ref_spans": [
{
"start": 86,
"end": 94,
"text": "Figure 4",
"ref_id": "FIGREF2"
},
{
"start": 633,
"end": 640,
"text": "Table 1",
"ref_id": "TABREF0"
}
],
"eq_spans": [],
"section": "Principal Component Analysis",
"sec_num": "4.2"
},
{
"text": "Avg. L 1 (std) Avg. L 2 (std) Documents 243.0 (20.1)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Principal Component Analysis",
"sec_num": "4.2"
},
{
"text": "12.3 (0.6) Queries 137.0 (7.5) 9.3 (0.2) In all cases, the PCA performance starts to plateau around 128 dimensions and is within 95% of the uncompressed performance. Finally, we note that while PCA is concerned with minimizing re-construction loss, Figure 4 shows that even after vastly decreasing the reconstruction loss, no significant improvements in retrieval performance are achieved. We further discuss this finding in Section 5.4.",
"cite_spans": [],
"ref_spans": [
{
"start": 249,
"end": 257,
"text": "Figure 4",
"ref_id": "FIGREF2"
}
],
"eq_spans": [],
"section": "Principal Component Analysis",
"sec_num": "4.2"
},
{
"text": "Component Scaling. One potential issue of PCA is that there may be dimensions that dominate the vector space. Mu et al. (2017) suggest to simply remove the dimension corresponding to the highest eigenvalue though we find that simply scaling down the top k eigenvectors systematically outperforms standard PCA. For simplicity, we focused on the top 5 eigenvectors and performed a smallscale grid-search of the scaling factors. The best performing one was (0.5, 0.8, 0.8, 0.9, 0.8) and Table 2 shows that it provides a small additional boost in retrieval performance.",
"cite_spans": [
{
"start": 110,
"end": 126,
"text": "Mu et al. (2017)",
"ref_id": "BIBREF24"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Principal Component Analysis",
"sec_num": "4.2"
},
{
"text": "A straightforward extension of PCA for dimensionality reducing is to use autoencoders, which has been widely explored (Hu et al., 2014; Wang et al., 2016) . Usually, the model is described by an encoder e : R d \u2192 R b , a function from a higher dimension to the target (bottleneck) dimension and a decoder r : R b \u2192 R d , which maps back from the target dimension to the original vector space. The final (reconstruction) loss is then commonly computed as L = MSE((r \u2022 e)(x), x). To reduce the dimensionality of a dataset, only the function e is applied to both the query and the document embedding. We consider three models with the bottleneck: 1. A linear projection similar to PCA but without the restriction of orthonormal columns:",
"cite_spans": [
{
"start": 118,
"end": 135,
"text": "(Hu et al., 2014;",
"ref_id": "BIBREF12"
},
{
"start": 136,
"end": 154,
"text": "Wang et al., 2016)",
"ref_id": "BIBREF32"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Autoencoder",
"sec_num": "4.3"
},
{
"text": "e 1 (x) = L 768 128 r 1 (x) = L 128 768",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Autoencoder",
"sec_num": "4.3"
},
{
"text": "2. A multi-layer feed forward neural network with tanh activation:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Autoencoder",
"sec_num": "4.3"
},
{
"text": "e 2 (x) = L 768 512 \u2022 tanh \u2022L 512 256 \u2022 tanh \u2022L 256 128 r 2 (x) = L 128 256 \u2022 tanh \u2022L 256 512 \u2022 tanh \u2022L 512 768",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Autoencoder",
"sec_num": "4.3"
},
{
"text": "3. The same encoder as in the previous model but with a shallow decoder:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Autoencoder",
"sec_num": "4.3"
},
{
"text": "e 3 (x) = L 768 512 \u2022 tanh \u2022L 512 256 \u2022 tanh \u2022L 256 0.2 0.4 0.6 R-Precision (PCA)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Autoencoder",
"sec_num": "4.3"
},
{
"text": "No pre-processing Normalized Centered Centered, Normalized Results. We explore the effects of training data and pre-processing with results for the first model shown in Figure 4 . Surprisingly, the Autoencoder is even more sensitive to proper pre-processing than PCA, most importantly centering which makes the results much more stable. The rationale for the third model is that we would like the hidden representation to require as little post-processing as possible to become the original vector again. The higher performance of the model with shallow decoder, shown in Table 2 supports this reasoning. An alternative way to reduce the computation (modelling dimension relationships) in the decoder is to regularize the weights in the decoder. We make use of L 1 regularization explicitly because L 2 regularization is conceptually already present in Adam's weight decay. This improves each of the three models.",
"cite_spans": [],
"ref_spans": [
{
"start": 169,
"end": 177,
"text": "Figure 4",
"ref_id": "FIGREF2"
}
],
"eq_spans": [],
"section": "Autoencoder",
"sec_num": "4.3"
},
{
"text": "Similarly to the other reconstruction loss-based method (PCA), without post-processing, inner product works yields better results.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Autoencoder",
"sec_num": "4.3"
},
{
"text": "Lastly, we also experiment with reducing index size by lowering the float precision from 32 bits to 16 and 8 bits. Note that despite their quite high retrieval performance, they only reduce the size by 2 and 4 respectively (as opposed to 6 by dimension reduction via PCA to 128 dimensions). Another drawback is that retrieval time is not affected because the dimensionality remains the same.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Precision Reduction",
"sec_num": "4.4"
},
{
"text": "Using only one bit per dimension is a special case of precision reduction suggested by Yamada et al. (2021) . Because we use centered data, we can define the element-wise transformation function as:",
"cite_spans": [
{
"start": 87,
"end": 107,
"text": "Yamada et al. (2021)",
"ref_id": "BIBREF33"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Precision Reduction",
"sec_num": "4.4"
},
{
"text": "f \u03b1 (x i ) = 1 \u2212 \u03b1 x i \u2265 0 0 \u2212 \u03b1 x i < 0",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Precision Reduction",
"sec_num": "4.4"
},
{
"text": "Bit 1 would then correspond to 1 \u2212 \u03b1 and 0 to 0 \u2212 \u03b1. While Yamada et al. (2021) use values 1 and 0, we work with 0.5 and \u22120.5 in order to be able to distinguish between certain cases when using IP-based similarity. 9 As shown in Table 2 , this indeed yields a slight improvement. When applying post-processing, however, the two approaches are equivalent. While this method achieves extreme 32x compression on the disk and retains most of the retrieval performance, the downside is that if one wishes to use standard retrieval pipelines, these variables would have to be converted to a supported, larger, data type. 10",
"cite_spans": [],
"ref_spans": [
{
"start": 229,
"end": 236,
"text": "Table 2",
"ref_id": "TABREF3"
}
],
"eq_spans": [],
"section": "Precision Reduction",
"sec_num": "4.4"
},
{
"text": "Original Center + Norm. ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Method Compression",
"sec_num": null
},
{
"text": "Finally, reducing precision can be readily combined with dimension reduction methods, such as PCA (prior to changing the data type). The results in Figure 5 show that PCA can be combined with e.g. 8-bit precision reduction with negligible loss in performance. As shown in the last row of Table 2, this can lead to the compressed size be 100x smaller while retaining 75% retrieval performance on HotpotQA and 89% for NaturalQuestions (see Table 7 ).",
"cite_spans": [],
"ref_spans": [
{
"start": 148,
"end": 156,
"text": "Figure 5",
"ref_id": "FIGREF3"
},
{
"start": 438,
"end": 445,
"text": "Table 7",
"ref_id": "TABREF8"
}
],
"eq_spans": [],
"section": "Combination of PCA and Precision Reduction",
"sec_num": "4.5"
},
{
"text": "The comparison of all discussed dimension reduction methods is shown in Table 2 . It also shows the role of centering and normalization post-encoding which systematically improves the performance. The best performing model for dimension reduction is the autoencoder with L 1 regularization and either just a single projection layer for the encoder and decoder or with the shallow decoder (6x compression with 97% retrieval performance). Additionally, Appendix B compares training and evaluation speeds of common implementations. ",
"cite_spans": [],
"ref_spans": [
{
"start": 72,
"end": 79,
"text": "Table 2",
"ref_id": "TABREF3"
}
],
"eq_spans": [],
"section": "Model Comparison",
"sec_num": "5.1"
},
{
"text": "A crucial aspect of the PCA and autoencoder methods is how much data they need for training. In the following, we experimented with limiting the number of training samples for PCA and the linear autoencoder. Results are shown in Figure 6 .",
"cite_spans": [],
"ref_spans": [
{
"start": 229,
"end": 237,
"text": "Figure 6",
"ref_id": null
}
],
"eq_spans": [],
"section": "Data size",
"sec_num": "5.2"
},
{
"text": "While Ma et al. (2021) used a much larger training set to fit PCA, we find that PCA requires very 128 10 3.0 10 4.0 10 5.0 10 6.0 10 7.0 10 7.5 Docs count (log scale) Figure 6 : Dependency of PCA and autoencoder performance (evaluated on HotpotQA dev data, trained on document encodings, pre-and post-processing) by modifying the training data (solid lines) and by adding irrelevant documents to the retrieval pool (dashed lines). Black crosses indicate the original training size. Vertical bars are 95% confidence intervals using t-distibution (across 6 runs with random model initialization and sampling). Note the log scale on the x-axis and the truncation of the y-axis. few samples (lower-bounded by 128 which is also the number of dimensions used for this experiment). This is because in the case of PCA training data is used to estimate the data covariance matrix which has been shown to work well when using a few samples (Tadjudin and Landgrebe, 1999) . Additionally, we find that overall the autoencoder needs more data to outperform PCA.",
"cite_spans": [
{
"start": 6,
"end": 22,
"text": "Ma et al. (2021)",
"ref_id": "BIBREF23"
},
{
"start": 930,
"end": 960,
"text": "(Tadjudin and Landgrebe, 1999)",
"ref_id": "BIBREF28"
}
],
"ref_spans": [
{
"start": 167,
"end": 175,
"text": "Figure 6",
"ref_id": null
}
],
"eq_spans": [],
"section": "Data size",
"sec_num": "5.2"
},
{
"text": "Next, we experimented with adding more (potentially irrelevant) documents to the knowledge base. For this, we kept the training data for the autoencoder and PCA to the original size. The results are shown as dashed lines in Figure 6 . Retrieval performance quickly deteriorates for both models (faster than for the uncompressed case), highlighting the importance of filtering irrelevant documents from the knowledge base.",
"cite_spans": [],
"ref_spans": [
{
"start": 224,
"end": 232,
"text": "Figure 6",
"ref_id": null
}
],
"eq_spans": [],
"section": "Data size",
"sec_num": "5.2"
},
{
"text": "So far, our evaluation focused on quantitative comparisons. In the following, we compare the distribution of documents retrieved before and after compression to investigate if there are systematic differences. We carry out this analysis using Hot-potQA which, by design, requires two documents in order to answer a given query. We compare retrieval with the original document embeddings to retrieval with PCA and 1-bit compression.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retrieval errors",
"sec_num": "5.3"
},
{
"text": "We find that there are no systematic differences compared to the uncompressed retrieval. This is demonstrated by the small off-diagonal values in Figure 7 . This result shows that if the retriever working with uncompressed embeddings returns two relevant documents in the top-k for a given query, also the retriever working with the compressed index is very likely to include the same two documents in the top-k. This is further shown by the Pearson correlation in Table 4 . This suggests that the compressed index can be used on downstream tasks with predictable performance loss based on the slightly worsened retrieval performance. Furthermore, there do not seem to be any systematic differences even between the two vastly different compression methods used for this experiment (PCA and 1-bit precision). This indicates that, despite their methodological differences, the two compression approaches seem to remove the same redundances in the uncompressed data. We leave a more detailed exploration of these findings for future work. ",
"cite_spans": [],
"ref_spans": [
{
"start": 146,
"end": 154,
"text": "Figure 7",
"ref_id": "FIGREF5"
},
{
"start": 465,
"end": 472,
"text": "Table 4",
"ref_id": "TABREF5"
}
],
"eq_spans": [],
"section": "Retrieval errors",
"sec_num": "5.3"
},
{
"text": "Despite PCA and autoencoder being the most successful methods, low reconstruction loss provides no theoretical guarantee to the retrieval performance. Consider a simple linear projection that can be represented as a diagonal matrix that projects to a space of the same dimensionality. This function has a trivial inverse and therefore no information is lost when it is applied. The retrieval is however disrupted, as it will mostly depend on the first dimension and nothing else. This is a major flaw of approaches that minimize the vector reconstruction loss because the optimized quantity is different to the actual goal.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Pitfalls of Reconstruction Loss",
"sec_num": "5.4"
},
{
"text": "R = \uf8eb \uf8ec \uf8ec \uf8ec \uf8ed 10 99 0 \u2022 \u2022 \u2022 0 0 1 \u2022 \u2022 \u2022 0 . . . . . . . . . . . . 0 0 \u2022 \u2022 \u2022 1 \uf8f6 \uf8f7 \uf8f7 \uf8f7 \uf8f8 R \u22121 = \uf8eb \uf8ec \uf8ec \uf8ec \uf8ed 10 \u221299 0 \u2022 \u2022 \u2022 0 0 \u2022 \u2022 \u2022 0 . . . . . . . . . . . . 0 0 \u2022 \u2022 \u2022 1 \uf8f6 \uf8f7 \uf8f7 \uf8f7 \uf8f8",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Pitfalls of Reconstruction Loss",
"sec_num": "5.4"
},
{
"text": "Distance Learning. The task of dimensionality reduction has been explored by standard statistical methods by the name manifold learning. The most used method is t-distributed stochastic neighbor (t-SNE) embedding built on the work of Hinton and Roweis (2002) or multidimensional scaling (Kruskal, 1964; Borg and Groenen, 2005) . They organize a new vector space (of lower dimensionality) so that the L 2 distances follow those of the original space (extensions to other metrics also exist). Although the optimization goal is more in line with our task of vector space compression with the preservation of nearest neighbours, methods of manifold learning are limited by the large computation costs 11 and the fact that they do not construct a function but rather move the discrete points in the new space to lower the optimization loss. This makes it not applicable for online purposes (i.e. adding new samples that need to be compressed as well). The main disadvantage of the approaches based on reconstruction loss is that their optimization goal strays from what we are interested in, namely preserving distances between vectors. We tried to reformulate the problem in terms of deep learning and gradient-based optimization to alleviate the issue of speed and extensibility of standard manifold learning approaches. We try to learn a function that maps the original vector space to a lower-dimensional one while preserving similarities. That can be either a simple linear projection A or generally a more complex differentiable function f :",
"cite_spans": [
{
"start": 234,
"end": 258,
"text": "Hinton and Roweis (2002)",
"ref_id": "BIBREF11"
},
{
"start": 287,
"end": 302,
"text": "(Kruskal, 1964;",
"ref_id": "BIBREF18"
},
{
"start": 303,
"end": 326,
"text": "Borg and Groenen, 2005)",
"ref_id": "BIBREF1"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Pitfalls of Reconstruction Loss",
"sec_num": "5.4"
},
{
"text": "L = MSE(sim(f (t i ), f (t j )), sim(t i , t j ))",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Pitfalls of Reconstruction Loss",
"sec_num": "5.4"
},
{
"text": "After the function f is fitted, both the training and new data can be compressed by its application. As opposed to manifold learning which usually 11 The common fast implementation for t-SNE, Barnes-Hut (Barnes and Hut, 1986; Van Der Maaten, 2013) is based on either quadtrees or octrees and is limited to 3 dimensions. leverages specific properties of the metrics, here they can be any differentiable functions. The optimization was, however, too slow, underperforming (between sparse projection and PCA) and did not currently provide any benefits.",
"cite_spans": [
{
"start": 147,
"end": 149,
"text": "11",
"ref_id": null
},
{
"start": 192,
"end": 225,
"text": "Barnes-Hut (Barnes and Hut, 1986;",
"ref_id": "BIBREF0"
},
{
"start": 226,
"end": 247,
"text": "Van Der Maaten, 2013)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Pitfalls of Reconstruction Loss",
"sec_num": "5.4"
},
{
"text": "We also tried to use unsupervised contrastive learning by considering close neighbours in the original space as positive samples and distant neighbours as negative samples but reached similar results.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Pitfalls of Reconstruction Loss",
"sec_num": "5.4"
},
{
"text": "In this section we briefly discuss the main conclusions from our experiments and analysis in the form of recommendations for NLP practicioners.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion",
"sec_num": "6"
},
{
"text": "Importance of Pre-/post-processing. As our results show, for all methods (and models), centering and normalization should be done before and after dimension reduction, as it boosts the performance of every model. Method recommendation. While most compression methods achieve similar retrieval performance and compression ratios (cf. Table 2 and Table 7) , PCA stands out in the following regards: (1) It requires only minimal implementation effort and no tuning of hyper-parameters beyond selecting which principal components to keep; (2) as our analysis shows, the PCA matrix can be estimated well with only 1000 document or query embeddings. It is not necessary to learn a transformation matrix on the full knowledge base; (3) PCA can easily be combined with precision reduction based approaches.",
"cite_spans": [],
"ref_spans": [
{
"start": 333,
"end": 353,
"text": "Table 2 and Table 7)",
"ref_id": "TABREF3"
}
],
"eq_spans": [],
"section": "Discussion",
"sec_num": "6"
},
{
"text": "In this work, we examined several simple unsupervised methods for dimensionality reduction for retrieval-based NLP tasks: random projections, PCA, autoencoder and precision reduction and their combination. We also documented the data requirements of each method and their reliance on preand post-processing.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Summary",
"sec_num": "7"
},
{
"text": "Future work. As shown in prior works, dimension reduction can take place also during training where the loss is more in-line with the retrieval goal. Methods for dimension reduction after training, however, rely mostly on reconstruction loss, which is suboptimal. Therefore more research for dimension reduction methods is needed, such as fast manifold or distance-based learning.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Summary",
"sec_num": "7"
},
{
"text": "Adam Learning rate 10 \u22123 L 1 regularization 10 \u22125.9 Table 3 : Hyperparameters of autoencoder architectures described in Section 4.3. L 1 regularization is used only when explicitly mentioned.",
"cite_spans": [],
"ref_spans": [
{
"start": 52,
"end": 59,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Batch size 128 Optimizer",
"sec_num": null
},
{
"text": "A Pre-processing",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Batch size 128 Optimizer",
"sec_num": null
},
{
"text": "Another common approach before any feature selection is to use z-scores ( x\u2212x \u03c3 ) instead of the original values. Its boost in performance is however similar to that of centering and normalization. The effects of each pre-processing step are in Table 5 . The significant differences in performance show the importance of data pre-processing (agnostic to model selection).",
"cite_spans": [],
"ref_spans": [
{
"start": 245,
"end": 252,
"text": "Table 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "Batch size 128 Optimizer",
"sec_num": null
},
{
"text": "Despite the autoencoder providing slightly better retrieval performance and PCA being generally easier to use (due to the lack of hyperparameters), there are several tradeoffs in model selection. Once the models are trained, the runtime performance (encoding) is comparable though for PCA it is a single matrix projection while for the autoencoder it may be several layers and activation functions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "B Speed",
"sec_num": null
},
{
"text": "Depending on the specific library used for implementation, however, the results differ. Figure 8 shows that the autoencoder (implemented in Py-Torch) is much slower than any other model when run on a CPU but the fastest when run on a GPU. Similarly, PCA works best if used from the Py-Torch library (whether on CPU or GPU) and from 12 PyTorch 1.9.1, scikit-learn 0.23.2, RTX 2080 Ti (CUDA 11.4), 64\u00d72.1GHz Intel Xeon E5-2683 v4, 1TB RAM.",
"cite_spans": [],
"ref_spans": [
{
"start": 88,
"end": 96,
"text": "Figure 8",
"ref_id": null
}
],
"eq_spans": [],
"section": "B Speed",
"sec_num": null
},
{
"text": "Uncompressed PCA 1bit Uncompressed 1.00 PCA 0.87 1.00 1bit 0.81 0.80 1.00 the standard Scikit package. Except for Scikit, there seems to be little relation between the target dimensionality and computation time.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "B Speed",
"sec_num": null
},
{
"text": "We also show the major experiments in Table 7 (table structure equivalent to that for the pruned dataset in Table 2 ) on Natural Question (Kwiatkowski et al., 2019) with identical dataset pre-processing. The performance is overall larger because the task is different and the set of documents is lower (1.5 million spans) but comparatively the trends are in line with the previous conclusions of the paper. Figure 8 : Speed comparison of PCA and autoencoder (model 3) implemented in PyTorch and Scikit 12 split into training and encoding parts. Models were trained on documents and queries jointly (normalized). Error bars are 95% confidence intervals using t-distribution (5 runs).",
"cite_spans": [
{
"start": 138,
"end": 164,
"text": "(Kwiatkowski et al., 2019)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [
{
"start": 108,
"end": 115,
"text": "Table 2",
"ref_id": "TABREF3"
},
{
"start": 407,
"end": 415,
"text": "Figure 8",
"ref_id": null
}
],
"eq_spans": [],
"section": "C Comparison on Natural Questions",
"sec_num": null
},
{
"text": "Compression Original Center + Norm. : Overview of compression method performance (from 768) using either L 2 or inner product for retrieval. Inputs are based on (1) original and (2) centered and normalized output of DPR-CLS. Performance is measured by R-Precision on NaturalQuestions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Method",
"sec_num": null
},
{
"text": "Sparse representations via BM25 (Robertson et al., 1995) are also commonly used but not the focus of this work.2 We refer to the retrieved objects as documents though they commonly range from spans of text (e.g. 100 tokens) to the full documents.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Cosine similarity could also be used but for computation reasons we skip it. Results are the same as for inner product and L 2 distance when the vectors are normalized.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "IndexIVFFlat, nlist=200, nprobe=100.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "r 3 (x) = L 128 768Compared to PCA, it is able to model nonpairwise interaction between dimensions (in case of models 2 and 3 also non-linear interaction).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "When using 0 and 1, the IP similarity of 0 and 1 is the same as 0 and 0 while for \u22120.5 and 0.5 they are \u22120.25 and 0.25 respectively.10 The Tevatron toolkit(Gao et al., 2022) supports mixed precision training with 16-bit floats.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "This work was funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) -Project-ID 232722074 -SFB 1102. Thank you to the reviewers, Badr M. Abdullah and many others for their comments to our work.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgements",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "A hierarchical o (n log n) force-calculation algorithm",
"authors": [
{
"first": "Josh",
"middle": [],
"last": "Barnes",
"suffix": ""
},
{
"first": "Piet",
"middle": [],
"last": "Hut",
"suffix": ""
}
],
"year": 1986,
"venue": "nature",
"volume": "324",
"issue": "6096",
"pages": "446--449",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Josh Barnes and Piet Hut. 1986. A hierarchical o (n log n) force-calculation algorithm. nature, 324(6096):446-449.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Modern multidimensional scaling: Theory and applications",
"authors": [
{
"first": "Ingwer",
"middle": [],
"last": "Borg",
"suffix": ""
},
{
"first": "J",
"middle": [
"F"
],
"last": "Patrick",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Groenen",
"suffix": ""
}
],
"year": 2005,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ingwer Borg and Patrick JF Groenen. 2005. Modern multidimensional scaling: Theory and applications. Springer Science & Business Media.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Neural Network Models for Tasks in Open-Domain and Closed-Domain Question Answering",
"authors": [
{
"first": "",
"middle": [],
"last": "Charles L Chen",
"suffix": ""
}
],
"year": 2020,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Charles L Chen. 2020. Neural Network Models for Tasks in Open-Domain and Closed-Domain Question Answering. Ohio University.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Bert: Pre-training of deep bidirectional transformers for language understanding",
"authors": [
{
"first": "Jacob",
"middle": [],
"last": "Devlin",
"suffix": ""
},
{
"first": "Ming-Wei",
"middle": [],
"last": "Chang",
"suffix": ""
},
{
"first": "Kenton",
"middle": [],
"last": "Lee",
"suffix": ""
},
{
"first": "Kristina",
"middle": [],
"last": "Toutanova",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "1",
"issue": "",
"pages": "4171--4186",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2019. Bert: Pre-training of deep bidirectional transformers for language understand- ing. In Proceedings of the 2019 Conference of the North American Chapter of the Association for Com- putational Linguistics: Human Language Technolo- gies, Volume 1 (Long and Short Papers), pages 4171- 4186.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Wizard of wikipedia: Knowledge-powered conversational agents",
"authors": [
{
"first": "Emily",
"middle": [],
"last": "Dinan",
"suffix": ""
},
{
"first": "Stephen",
"middle": [],
"last": "Roller",
"suffix": ""
},
{
"first": "Kurt",
"middle": [],
"last": "Shuster",
"suffix": ""
},
{
"first": "Angela",
"middle": [],
"last": "Fan",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Auli",
"suffix": ""
},
{
"first": "Jason",
"middle": [],
"last": "Weston",
"suffix": ""
}
],
"year": 2018,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1811.01241"
]
},
"num": null,
"urls": [],
"raw_text": "Emily Dinan, Stephen Roller, Kurt Shuster, Angela Fan, Michael Auli, and Jason Weston. 2018. Wizard of wikipedia: Knowledge-powered conversational agents. arXiv preprint arXiv:1811.01241.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "A survey of dimension reduction techniques",
"authors": [
{
"first": "K",
"middle": [],
"last": "Imola",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Fodor",
"suffix": ""
}
],
"year": 2002,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Imola K Fodor. 2002. A survey of dimension reduction techniques. Technical report, Citeseer.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Liii. on lines and planes of closest fit to systems of points in space. The London, Edinburgh, and Dublin Philosophical Magazine",
"authors": [
{
"first": "Karl",
"middle": [],
"last": "Pearson",
"suffix": ""
},
{
"first": "F",
"middle": [
"R S"
],
"last": "",
"suffix": ""
}
],
"year": 1901,
"venue": "Journal of Science",
"volume": "2",
"issue": "11",
"pages": "559--572",
"other_ids": {
"DOI": [
"10.1080/14786440109462720"
]
},
"num": null,
"urls": [],
"raw_text": "Karl Pearson F.R.S. 1901. Liii. on lines and planes of closest fit to systems of points in space. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science, 2(11):559-572.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Tevatron: An efficient and flexible toolkit for dense retrieval",
"authors": [
{
"first": "Luyu",
"middle": [],
"last": "Gao",
"suffix": ""
},
{
"first": "Xueguang",
"middle": [],
"last": "Ma",
"suffix": ""
},
{
"first": "Jimmy",
"middle": [],
"last": "Lin",
"suffix": ""
},
{
"first": "Jamie",
"middle": [],
"last": "Callan",
"suffix": ""
}
],
"year": 2022,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:2203.05765"
]
},
"num": null,
"urls": [],
"raw_text": "Luyu Gao, Xueguang Ma, Jimmy Lin, and Jamie Callan. 2022. Tevatron: An efficient and flexible toolkit for dense retrieval. arXiv preprint arXiv:2203.05765.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Realm: Retrievalaugmented language model pre-training",
"authors": [
{
"first": "Kelvin",
"middle": [],
"last": "Guu",
"suffix": ""
},
{
"first": "Kenton",
"middle": [],
"last": "Lee",
"suffix": ""
},
{
"first": "Zora",
"middle": [],
"last": "Tung",
"suffix": ""
},
{
"first": "Panupong",
"middle": [],
"last": "Pasupat",
"suffix": ""
},
{
"first": "Ming-Wei",
"middle": [],
"last": "Chang",
"suffix": ""
}
],
"year": 2020,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:2002.08909"
]
},
"num": null,
"urls": [],
"raw_text": "Kelvin Guu, Kenton Lee, Zora Tung, Panupong Pasu- pat, and Ming-Wei Chang. 2020. Realm: Retrieval- augmented language model pre-training. arXiv preprint arXiv:2002.08909.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Efficient nearest neighbor language models",
"authors": [
{
"first": "Junxian",
"middle": [],
"last": "He",
"suffix": ""
},
{
"first": "Graham",
"middle": [],
"last": "Neubig",
"suffix": ""
},
{
"first": "Taylor",
"middle": [],
"last": "Berg-Kirkpatrick",
"suffix": ""
}
],
"year": 2021,
"venue": "Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "5703--5714",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Junxian He, Graham Neubig, and Taylor Berg- Kirkpatrick. 2021. Efficient nearest neighbor lan- guage models. In Proceedings of the 2021 Confer- ence on Empirical Methods in Natural Language Processing, pages 5703-5714.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Stochastic neighbor embedding",
"authors": [
{
"first": "Geoffrey",
"middle": [],
"last": "Hinton",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Sam T Roweis",
"suffix": ""
}
],
"year": 2002,
"venue": "NIPS",
"volume": "15",
"issue": "",
"pages": "833--840",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Geoffrey Hinton and Sam T Roweis. 2002. Stochastic neighbor embedding. In NIPS, volume 15, pages 833-840. Citeseer.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Improving the architecture of an autoencoder for dimension reduction",
"authors": [
{
"first": "Changjie",
"middle": [],
"last": "Hu",
"suffix": ""
},
{
"first": "Xiaoli",
"middle": [],
"last": "Hou",
"suffix": ""
},
{
"first": "Yonggang",
"middle": [],
"last": "Lu",
"suffix": ""
}
],
"year": 2014,
"venue": "IEEE 11th Intl Conf on Ubiquitous Intelligence and Computing and 2014 IEEE 11th Intl Conf on Autonomic and Trusted Computing and 2014 IEEE 14th Intl Conf on Scalable Computing and Communications and Its Associated Workshops",
"volume": "",
"issue": "",
"pages": "855--858",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Changjie Hu, Xiaoli Hou, and Yonggang Lu. 2014. Im- proving the architecture of an autoencoder for di- mension reduction. In 2014 IEEE 11th Intl Conf on Ubiquitous Intelligence and Computing and 2014 IEEE 11th Intl Conf on Autonomic and Trusted Com- puting and 2014 IEEE 14th Intl Conf on Scalable Computing and Communications and Its Associated Workshops, pages 855-858. IEEE.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "A memory efficient baseline for open domain question answering",
"authors": [
{
"first": "Gautier",
"middle": [],
"last": "Izacard",
"suffix": ""
},
{
"first": "Fabio",
"middle": [],
"last": "Petroni",
"suffix": ""
},
{
"first": "Lucas",
"middle": [],
"last": "Hosseini",
"suffix": ""
},
{
"first": "Nicola",
"middle": [
"De"
],
"last": "Cao",
"suffix": ""
},
{
"first": "Sebastian",
"middle": [],
"last": "Riedel",
"suffix": ""
},
{
"first": "Edouard",
"middle": [],
"last": "Grave",
"suffix": ""
}
],
"year": 2020,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:2012.15156"
]
},
"num": null,
"urls": [],
"raw_text": "Gautier Izacard, Fabio Petroni, Lucas Hosseini, Nicola De Cao, Sebastian Riedel, and Edouard Grave. 2020. A memory efficient baseline for open domain ques- tion answering. arXiv preprint arXiv:2012.15156.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Billion-scale similarity search with gpus",
"authors": [
{
"first": "Jeff",
"middle": [],
"last": "Johnson",
"suffix": ""
},
{
"first": "Matthijs",
"middle": [],
"last": "Douze",
"suffix": ""
},
{
"first": "Herv\u00e9",
"middle": [],
"last": "J\u00e9gou",
"suffix": ""
}
],
"year": 2019,
"venue": "IEEE Transactions on Big Data",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jeff Johnson, Matthijs Douze, and Herv\u00e9 J\u00e9gou. 2019. Billion-scale similarity search with gpus. IEEE Transactions on Big Data.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Dense passage retrieval for opendomain question answering",
"authors": [
{
"first": "Vladimir",
"middle": [],
"last": "Karpukhin",
"suffix": ""
},
{
"first": "Barlas",
"middle": [],
"last": "Oguz",
"suffix": ""
},
{
"first": "Sewon",
"middle": [],
"last": "Min",
"suffix": ""
},
{
"first": "Patrick",
"middle": [],
"last": "Lewis",
"suffix": ""
},
{
"first": "Ledell",
"middle": [],
"last": "Wu",
"suffix": ""
},
{
"first": "Sergey",
"middle": [],
"last": "Edunov",
"suffix": ""
},
{
"first": "Danqi",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Wen-Tau",
"middle": [],
"last": "Yih",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP)",
"volume": "",
"issue": "",
"pages": "6769--6781",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Vladimir Karpukhin, Barlas Oguz, Sewon Min, Patrick Lewis, Ledell Wu, Sergey Edunov, Danqi Chen, and Wen-tau Yih. 2020. Dense passage retrieval for open- domain question answering. In Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP), pages 6769-6781.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Dimensionality reduction by random mapping: Fast similarity computation for clustering",
"authors": [
{
"first": "Samuel",
"middle": [],
"last": "Kaski",
"suffix": ""
}
],
"year": 1998,
"venue": "IEEE International Joint Conference on Neural Networks Proceedings. IEEE World Congress on Computational Intelligence (Cat. No. 98CH36227)",
"volume": "1",
"issue": "",
"pages": "413--418",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Samuel Kaski. 1998. Dimensionality reduction by ran- dom mapping: Fast similarity computation for clus- tering. In 1998 IEEE International Joint Confer- ence on Neural Networks Proceedings. IEEE World Congress on Computational Intelligence (Cat. No. 98CH36227), volume 1, pages 413-418. IEEE.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Generalization through memorization: Nearest neighbor language models",
"authors": [
{
"first": "Urvashi",
"middle": [],
"last": "Khandelwal",
"suffix": ""
},
{
"first": "Omer",
"middle": [],
"last": "Levy",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Jurafsky",
"suffix": ""
},
{
"first": "Luke",
"middle": [],
"last": "Zettlemoyer",
"suffix": ""
},
{
"first": "Mike",
"middle": [],
"last": "Lewis",
"suffix": ""
}
],
"year": 2019,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1911.00172"
]
},
"num": null,
"urls": [],
"raw_text": "Urvashi Khandelwal, Omer Levy, Dan Jurafsky, Luke Zettlemoyer, and Mike Lewis. 2019. Generalization through memorization: Nearest neighbor language models. arXiv preprint arXiv:1911.00172.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Nonmetric multidimensional scaling: a numerical method",
"authors": [
{
"first": "B",
"middle": [],
"last": "Joseph",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Kruskal",
"suffix": ""
}
],
"year": 1964,
"venue": "Psychometrika",
"volume": "29",
"issue": "2",
"pages": "115--129",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joseph B Kruskal. 1964. Nonmetric multidimen- sional scaling: a numerical method. Psychometrika, 29(2):115-129.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Natural questions: a benchmark for question answering research",
"authors": [
{
"first": "Tom",
"middle": [],
"last": "Kwiatkowski",
"suffix": ""
},
{
"first": "Jennimaria",
"middle": [],
"last": "Palomaki",
"suffix": ""
},
{
"first": "Olivia",
"middle": [],
"last": "Redfield",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Collins",
"suffix": ""
},
{
"first": "Ankur",
"middle": [],
"last": "Parikh",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Alberti",
"suffix": ""
},
{
"first": "Danielle",
"middle": [],
"last": "Epstein",
"suffix": ""
},
{
"first": "Illia",
"middle": [],
"last": "Polosukhin",
"suffix": ""
},
{
"first": "Jacob",
"middle": [],
"last": "Devlin",
"suffix": ""
},
{
"first": "Kenton",
"middle": [],
"last": "Lee",
"suffix": ""
}
],
"year": 2019,
"venue": "Transactions of the Association for Computational Linguistics",
"volume": "7",
"issue": "",
"pages": "453--466",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tom Kwiatkowski, Jennimaria Palomaki, Olivia Red- field, Michael Collins, Ankur Parikh, Chris Alberti, Danielle Epstein, Illia Polosukhin, Jacob Devlin, Ken- ton Lee, et al. 2019. Natural questions: a benchmark for question answering research. Transactions of the Association for Computational Linguistics, 7:453- 466.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Tim Rockt\u00e4schel, et al. 2020. Retrieval-augmented generation for knowledge-intensive nlp tasks",
"authors": [
{
"first": "Patrick",
"middle": [],
"last": "Lewis",
"suffix": ""
},
{
"first": "Ethan",
"middle": [],
"last": "Perez",
"suffix": ""
},
{
"first": "Aleksandra",
"middle": [],
"last": "Piktus",
"suffix": ""
},
{
"first": "Fabio",
"middle": [],
"last": "Petroni",
"suffix": ""
},
{
"first": "Vladimir",
"middle": [],
"last": "Karpukhin",
"suffix": ""
},
{
"first": "Naman",
"middle": [],
"last": "Goyal",
"suffix": ""
},
{
"first": "Heinrich",
"middle": [],
"last": "K\u00fcttler",
"suffix": ""
},
{
"first": "Mike",
"middle": [],
"last": "Lewis",
"suffix": ""
},
{
"first": "Wen-Tau",
"middle": [],
"last": "Yih",
"suffix": ""
}
],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:2005.11401"
]
},
"num": null,
"urls": [],
"raw_text": "Patrick Lewis, Ethan Perez, Aleksandra Piktus, Fabio Petroni, Vladimir Karpukhin, Naman Goyal, Hein- rich K\u00fcttler, Mike Lewis, Wen-tau Yih, Tim Rock- t\u00e4schel, et al. 2020. Retrieval-augmented generation for knowledge-intensive nlp tasks. arXiv preprint arXiv:2005.11401.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "A proposed conceptual framework for a representational approach to information retrieval",
"authors": [
{
"first": "Jimmy",
"middle": [],
"last": "Lin",
"suffix": ""
}
],
"year": 2021,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:2110.01529"
]
},
"num": null,
"urls": [],
"raw_text": "Jimmy Lin. 2021. A proposed conceptual framework for a representational approach to information re- trieval. arXiv preprint arXiv:2110.01529.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Sparse, dense, and attentional representations for text retrieval",
"authors": [
{
"first": "Yi",
"middle": [],
"last": "Luan",
"suffix": ""
},
{
"first": "Jacob",
"middle": [],
"last": "Eisenstein",
"suffix": ""
},
{
"first": "Kristina",
"middle": [],
"last": "Toutanova",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Collins",
"suffix": ""
}
],
"year": 2021,
"venue": "Transactions of the Association for Computational Linguistics",
"volume": "9",
"issue": "",
"pages": "329--345",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yi Luan, Jacob Eisenstein, Kristina Toutanova, and Michael Collins. 2021. Sparse, dense, and attentional representations for text retrieval. Transactions of the Association for Computational Linguistics, 9:329- 345.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Simple and effective unsupervised redundancy elimination to compress dense vectors for passage retrieval",
"authors": [
{
"first": "Xueguang",
"middle": [],
"last": "Ma",
"suffix": ""
},
{
"first": "Minghan",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Kai",
"middle": [],
"last": "Sun",
"suffix": ""
},
{
"first": "Ji",
"middle": [],
"last": "Xin",
"suffix": ""
},
{
"first": "Jimmy",
"middle": [],
"last": "Lin",
"suffix": ""
}
],
"year": 2021,
"venue": "Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "2854--2859",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Xueguang Ma, Minghan Li, Kai Sun, Ji Xin, and Jimmy Lin. 2021. Simple and effective unsupervised re- dundancy elimination to compress dense vectors for passage retrieval. In Proceedings of the 2021 Con- ference on Empirical Methods in Natural Language Processing, pages 2854-2859.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Simple and effective postprocessing for word representations",
"authors": [
{
"first": "Jiaqi",
"middle": [],
"last": "Mu",
"suffix": ""
},
{
"first": "Suma",
"middle": [],
"last": "Bhat",
"suffix": ""
},
{
"first": "Pramod",
"middle": [],
"last": "Viswanath",
"suffix": ""
}
],
"year": 2017,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1702.01417"
]
},
"num": null,
"urls": [],
"raw_text": "Jiaqi Mu, Suma Bhat, and Pramod Viswanath. 2017. All-but-the-top: Simple and effective postprocess- ing for word representations. arXiv preprint arXiv:1702.01417.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Kilt: a benchmark for knowledge intensive language tasks",
"authors": [
{
"first": "Fabio",
"middle": [],
"last": "Petroni",
"suffix": ""
},
{
"first": "Aleksandra",
"middle": [],
"last": "Piktus",
"suffix": ""
},
{
"first": "Angela",
"middle": [],
"last": "Fan",
"suffix": ""
},
{
"first": "Patrick",
"middle": [],
"last": "Lewis",
"suffix": ""
},
{
"first": "Majid",
"middle": [],
"last": "Yazdani",
"suffix": ""
},
{
"first": "Nicola",
"middle": [
"De"
],
"last": "Cao",
"suffix": ""
},
{
"first": "James",
"middle": [],
"last": "Thorne",
"suffix": ""
},
{
"first": "Yacine",
"middle": [],
"last": "Jernite",
"suffix": ""
},
{
"first": "Vladimir",
"middle": [],
"last": "Karpukhin",
"suffix": ""
},
{
"first": "Jean",
"middle": [],
"last": "Maillard",
"suffix": ""
}
],
"year": 2021,
"venue": "Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "",
"issue": "",
"pages": "2523--2544",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Fabio Petroni, Aleksandra Piktus, Angela Fan, Patrick Lewis, Majid Yazdani, Nicola De Cao, James Thorne, Yacine Jernite, Vladimir Karpukhin, Jean Maillard, et al. 2021. Kilt: a benchmark for knowledge in- tensive language tasks. In Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pages 2523-2544.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "Sentence-bert: Sentence embeddings using siamese bert-networks",
"authors": [
{
"first": "Nils",
"middle": [],
"last": "Reimers",
"suffix": ""
},
{
"first": "Iryna",
"middle": [],
"last": "Gurevych",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)",
"volume": "",
"issue": "",
"pages": "3973--3983",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Nils Reimers and Iryna Gurevych. 2019. Sentence-bert: Sentence embeddings using siamese bert-networks. In Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP), pages 3973-3983.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Okapi at trec-3",
"authors": [
{
"first": "Steve",
"middle": [],
"last": "Stephen E Robertson",
"suffix": ""
},
{
"first": "Susan",
"middle": [],
"last": "Walker",
"suffix": ""
},
{
"first": "Micheline",
"middle": [
"M"
],
"last": "Jones",
"suffix": ""
},
{
"first": "Mike",
"middle": [],
"last": "Hancock-Beaulieu",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Gatford",
"suffix": ""
}
],
"year": 1995,
"venue": "Nist Special Publication Sp",
"volume": "109",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Stephen E Robertson, Steve Walker, Susan Jones, Micheline M Hancock-Beaulieu, Mike Gatford, et al. 1995. Okapi at trec-3. Nist Special Publication Sp, 109:109.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "Covariance estimation with limited training samples",
"authors": [
{
"first": "Saldju",
"middle": [],
"last": "Tadjudin",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "David A Landgrebe",
"suffix": ""
}
],
"year": 1999,
"venue": "IEEE Transactions on Geoscience and Remote Sensing",
"volume": "37",
"issue": "4",
"pages": "2113--2118",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Saldju Tadjudin and David A Landgrebe. 1999. Co- variance estimation with limited training samples. IEEE Transactions on Geoscience and Remote Sens- ing, 37(4):2113-2118.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "Claimskg: A knowledge graph of fact-checked claims",
"authors": [
{
"first": "Andon",
"middle": [],
"last": "Tchechmedjiev",
"suffix": ""
},
{
"first": "Pavlos",
"middle": [],
"last": "Fafalios",
"suffix": ""
},
{
"first": "Katarina",
"middle": [],
"last": "Boland",
"suffix": ""
},
{
"first": "Malo",
"middle": [],
"last": "Gasquet",
"suffix": ""
},
{
"first": "Matth\u00e4us",
"middle": [],
"last": "Zloch",
"suffix": ""
},
{
"first": "Benjamin",
"middle": [],
"last": "Zapilko",
"suffix": ""
},
{
"first": "Stefan",
"middle": [],
"last": "Dietze",
"suffix": ""
},
{
"first": "Konstantin",
"middle": [],
"last": "Todorov",
"suffix": ""
}
],
"year": 2019,
"venue": "International Semantic Web Conference",
"volume": "",
"issue": "",
"pages": "309--324",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Andon Tchechmedjiev, Pavlos Fafalios, Katarina Boland, Malo Gasquet, Matth\u00e4us Zloch, Benjamin Zapilko, Stefan Dietze, and Konstantin Todorov. 2019. Claimskg: A knowledge graph of fact-checked claims. In International Semantic Web Conference, pages 309-324. Springer.",
"links": null
},
"BIBREF30": {
"ref_id": "b30",
"title": "All bark and no bite: Rogue dimensions in transformer language models obscure representational quality",
"authors": [
{
"first": "William",
"middle": [],
"last": "Timkey",
"suffix": ""
},
{
"first": "Marten",
"middle": [],
"last": "Van Schijndel",
"suffix": ""
}
],
"year": 2021,
"venue": "Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "4527--4546",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "William Timkey and Marten van Schijndel. 2021. All bark and no bite: Rogue dimensions in transformer language models obscure representational quality. In Proceedings of the 2021 Conference on Empir- ical Methods in Natural Language Processing, pages 4527-4546.",
"links": null
},
"BIBREF32": {
"ref_id": "b32",
"title": "Auto-encoder based dimensionality reduction",
"authors": [
{
"first": "Yasi",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Hongxun",
"middle": [],
"last": "Yao",
"suffix": ""
},
{
"first": "Sicheng",
"middle": [],
"last": "Zhao",
"suffix": ""
}
],
"year": 2016,
"venue": "Neurocomputing",
"volume": "184",
"issue": "",
"pages": "232--242",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yasi Wang, Hongxun Yao, and Sicheng Zhao. 2016. Auto-encoder based dimensionality reduction. Neu- rocomputing, 184:232-242.",
"links": null
},
"BIBREF33": {
"ref_id": "b33",
"title": "Efficient passage retrieval with hashing for open-domain question answering",
"authors": [
{
"first": "Ikuya",
"middle": [],
"last": "Yamada",
"suffix": ""
},
{
"first": "Akari",
"middle": [],
"last": "Asai",
"suffix": ""
},
{
"first": "Hannaneh",
"middle": [],
"last": "Hajishirzi",
"suffix": ""
}
],
"year": 2021,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:2106.00882"
]
},
"num": null,
"urls": [],
"raw_text": "Ikuya Yamada, Akari Asai, and Hannaneh Hajishirzi. 2021. Efficient passage retrieval with hashing for open-domain question answering. arXiv preprint arXiv:2106.00882.",
"links": null
},
"BIBREF34": {
"ref_id": "b34",
"title": "Hotpotqa: A dataset for diverse, explainable multi-hop question answering",
"authors": [
{
"first": "Zhilin",
"middle": [],
"last": "Yang",
"suffix": ""
},
{
"first": "Peng",
"middle": [],
"last": "Qi",
"suffix": ""
},
{
"first": "Saizheng",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Yoshua",
"middle": [],
"last": "Bengio",
"suffix": ""
},
{
"first": "William",
"middle": [],
"last": "Cohen",
"suffix": ""
},
{
"first": "Ruslan",
"middle": [],
"last": "Salakhutdinov",
"suffix": ""
},
{
"first": "Christopher D",
"middle": [],
"last": "Manning",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "2369--2380",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Zhilin Yang, Peng Qi, Saizheng Zhang, Yoshua Bengio, William Cohen, Ruslan Salakhutdinov, and Christo- pher D Manning. 2018. Hotpotqa: A dataset for diverse, explainable multi-hop question answering. In Proceedings of the 2018 Conference on Empiri- cal Methods in Natural Language Processing, pages 2369-2380.",
"links": null
},
"BIBREF35": {
"ref_id": "b35",
"title": "Adaptive semiparametric language models",
"authors": [
{
"first": "Dani",
"middle": [],
"last": "Yogatama",
"suffix": ""
},
{
"first": "Cyprien",
"middle": [],
"last": "De Masson D'autume",
"suffix": ""
},
{
"first": "Lingpeng",
"middle": [],
"last": "Kong",
"suffix": ""
}
],
"year": 2021,
"venue": "Transactions of the Association for Computational Linguistics",
"volume": "9",
"issue": "",
"pages": "362--373",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dani Yogatama, Cyprien de Masson d'Autume, and Lingpeng Kong. 2021. Adaptive semiparametric lan- guage models. Transactions of the Association for Computational Linguistics, 9:362-373.",
"links": null
},
"BIBREF36": {
"ref_id": "b36",
"title": "Artefact retrieval: Overview of NLP models with knowledge base access",
"authors": [
{
"first": "Vil\u00e9m",
"middle": [],
"last": "Zouhar",
"suffix": ""
},
{
"first": "Marius",
"middle": [],
"last": "Mosbach",
"suffix": ""
},
{
"first": "Debanjali",
"middle": [],
"last": "Biswas",
"suffix": ""
},
{
"first": "Dietrich",
"middle": [],
"last": "Klakow",
"suffix": ""
}
],
"year": 2021,
"venue": "Workshop on Commonsense Reasoning and Knowledge Bases",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Vil\u00e9m Zouhar, Marius Mosbach, Debanjali Biswas, and Dietrich Klakow. 2021. Artefact retrieval: Overview of NLP models with knowledge base access. In Work- shop on Commonsense Reasoning and Knowledge Bases.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "Effect of data centering and normalization on performance (evaluated with FAISS).",
"uris": null,
"num": null,
"type_str": "figure"
},
"FIGREF1": {
"text": "Dimension reduction using different random projections methods. Presented values are the max of 3 runs (except for greedy dimension dropping, which is deterministic), semi-transparent lines correspond to the minimum. Embeddings are provided by centered and normalized DPR-CLS. Final vectors are also postprocessed by centering and normalization.",
"uris": null,
"num": null,
"type_str": "figure"
},
"FIGREF2": {
"text": "Dimension reduction using PCA (top) and Autoencoder (bottom) trained either on document index, query embeddings or both. Each figure corresponds to one of the four possible combinations of centering and normalizing the input data. The output vectors are not post-processed. Reconstruction loss (MSE, average for both documents and queries) is shown in transparent colour and computed in original data space. Horizontal lines show uncompressed performance. Embeddings are provided by DPR-CLS.",
"uris": null,
"num": null,
"type_str": "figure"
},
"FIGREF3": {
"text": "Combination of PCA and precision reduction. Compression ratio is shown in text. 16-bit and 32-bit values overlap with 8-bit and their compression ratios are not shown. Measured on HotpotQA with DPR-CLS.",
"uris": null,
"num": null,
"type_str": "figure"
},
"FIGREF5": {
"text": "Distribution of the number of retrieved documents for HotpotQA queries before and after compression: PCA (128) and 1-bit precision with R-Precisions (centered & normalized) of 0.579 and 0.561, respectively.",
"uris": null,
"num": null,
"type_str": "figure"
},
"TABREF0": {
"type_str": "table",
"text": "Average L 1 and L 2 norms of document and query embeddings from DPR-CLS without preprocessing.",
"num": null,
"html": null,
"content": "<table/>"
},
"TABREF3": {
"type_str": "table",
"text": "Overview of compression method performance (from 768) using either L 2 or inner product for retrieval. Inputs are based on centered and normalized output of DPR-CLS and the outputs optionally post-processed again.",
"num": null,
"html": null,
"content": "<table/>"
},
"TABREF5": {
"type_str": "table",
"text": "",
"num": null,
"html": null,
"content": "<table><tr><td>: Correlation of the number of retrieved docu-ments for HotpotQA queries in different retrieval modes: uncompressed, PCA (128) and 1-bit precision with R-Precisions (centered & normalized) of 0.618, 0.579 and 0.561, respectively.</td></tr></table>"
},
"TABREF6": {
"type_str": "table",
"text": "Number of training and dev queries and documents for HotpotQA and Natural Questions. Train and dev columns are queries.",
"num": null,
"html": null,
"content": "<table/>"
},
"TABREF8": {
"type_str": "table",
"text": "",
"num": null,
"html": null,
"content": "<table/>"
}
}
}
} |