Datasets:
File size: 97,505 Bytes
76d4cf5 | 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 | [
{
"type": "text",
"text": "CORRUPTED IMAGE MODELING FOR SELF-SUPERVISED VISUAL PRE-TRAINING ",
"text_level": 1,
"bbox": [
176,
98,
746,
146
],
"page_idx": 0
},
{
"type": "text",
"text": "Yuxin Fang 1, 2∗ Li Dong 2 Hangbo Bao 2 Xinggang Wang 1† Furu Wei 2 1 School of EIC, Huazhong University of Science & Technology 2 Microsoft Research {yxf,xgwang}@hust.edu.cn ",
"bbox": [
184,
167,
743,
212
],
"page_idx": 0
},
{
"type": "text",
"text": "ABSTRACT ",
"text_level": 1,
"bbox": [
454,
250,
544,
263
],
"page_idx": 0
},
{
"type": "text",
"text": "We introduce Corrupted Image Modeling (CIM) for self-supervised visual pretraining. CIM uses an auxiliary generator with a small trainable BEiT (Bao et al., 2021) to corrupt the input image instead of using artificial [MASK] tokens, where some patches are randomly selected and replaced with plausible alternatives sampled from the BEiT output distribution. Given this corrupted image, an enhancer network learns to either recover all the original image pixels, or predict whether each visual token is replaced by a generator sample or not. The generator and the enhancer are simultaneously trained and synergistically updated. After pre-training, the enhancer can be used as a high-capacity visual encoder for downstream tasks. CIM is a general and flexible visual pre-training framework that is suitable for various network architectures. For the first time, CIM demonstrates that both ViT and CNN can learn rich visual representations using a unified, non-Siamese framework. Experimental results show that our approach achieves compelling results in vision benchmarks, such as ImageNet classification and ADE20K semantic segmentation. ",
"bbox": [
233,
280,
766,
473
],
"page_idx": 0
},
{
"type": "text",
"text": "1 INTRODUCTION ",
"text_level": 1,
"bbox": [
176,
500,
336,
515
],
"page_idx": 0
},
{
"type": "text",
"text": "Vision Transformers (ViTs) (Dosovitskiy et al., 2020) are transferring the landscape of computer vision, not only in terms of the network architecture design, but also the self-supervised pre-training recipe. Masked image modeling (MIM) (Bao et al., 2021), which randomly masks out some input tokens and then recovers the masked content by conditioning on the visible context, is able to learn rich visual representations and shows promising performance on various vision benchmarks (Zhou et al., 2021; He et al., 2021; Xie et al., 2021; Dong et al., 2021; Wei et al., 2021). ",
"bbox": [
174,
530,
825,
614
],
"page_idx": 0
},
{
"type": "text",
"text": "Originated in masked language modeling (Devlin et al., 2019), MIM (Figure 1a) is tailor-made for specific architectures (Vaswani et al., 2017), which is generally capable of receiving and processing tokenized inputs such as the artificial [MASK] tokens. Meanwhile, the more common and natural input signal in computer vision is the image in RGB domain with 2D regular grid structures. In order to apply MIM pre-training for images, ViT has to “patchify” the input image into a 1D sequence of non-overlapping patch embeddings, and then use [MASK] tokens to perturb them. ",
"bbox": [
174,
622,
825,
705
],
"page_idx": 0
},
{
"type": "text",
"text": "MIM is tightly coupled with the Transformer family, and the usage of [MASK] tokens limits its scope of application to some extent. More importantly, MIM is not directly suitable for convolutional neural networks (CNNs) (LeCun et al., 1989), the dominant architecture for computer vision in the last decade. Introducing [MASK] tokens in any intermediate stage of CNN is infeasible, as convolution’s intrinsic dense-sliding-window paradigm causes information leakage between visual features in previous layers and therefore impedes the MIM. Therefore the large CNN family cannot directly benefit from the upsurge of this new pre-training scheme. Moreover, the usage of [MASK] tokens causes a discrepancy between pre-training and fine-tuning (Devlin et al., 2019; Clark et al., 2020), as the artificial [MASK] tokens never appear in the fine-tuning stage. ",
"bbox": [
174,
712,
825,
837
],
"page_idx": 0
},
{
"type": "text",
"text": "In this paper, we present a new visual pre-training framework, called Corrupted Image Modeling (CIM, Figure 1b), which avoids directly manipulating [MASK] tokens on pre-trained models and generalizes quite well to both ViT and CNN architectures. Rather than directly using artificial [MASK] tokens to corrupt a portion of non-overlapping patch embeddings as in MIM, CIM uses a small trainable BEiT (Bao et al., 2021) as an auxiliary generator to corrupt the input image. Specifically, the BEiT generator learns to predict visual tokens at the masked positions, where we utilize the predicted distribution to sample visual tokens’ replacements. The replaced visual tokens together with the golden tokens that directly produced by a pre-trained frozen image tokenizer encoder (e.g., the DALL-E (Ramesh et al., 2021) dVAE encoder) given the same input as the small trainable BEiT are then mapped back to the image RGB domain by a pre-trained frozen tokenizer decoder (e.g., the DALL-E dVAE decoder). The resulting corrupted image serves as the input of the enhancer, which is the model to be pre-trained and transferred. ",
"bbox": [
174,
844,
823,
901
],
"page_idx": 0
},
{
"type": "image",
"img_path": "images/4dd8395ea4882213cb68da1f6b25faa4ebd6cb6bd3705e0df1e770aeb9b9d374.jpg",
"image_caption": [
"Figure 1: Overview of our Corrupted Image Modeling (CIM) and comparisons with Masked Image Modeling (MIM). MIM (Figure 1a) requires the pre-trained architecture to receive and process the artificial [MASK] tokens, while CIM (Figure 1b) relaxes these restrictions by using a trainable generator to sample corrupted images serving as the input for the enhancer. Similar to BEiT, the small generator learns to predict the golden visual token produced by the pre-trained frozen image tokenizer encoder (not shown in the figure) based on partial observations of the input. The enhancer can be various architectures including CNN and learns either a generative or a discriminative visual pre-training objective. After pre-training, we throw out the generator and fine-tune the enhancer on downstream tasks. The dice icon in Figure 1b refers to the visual tokens’ stochastic sampling process, and the lock icon means the pre-trained image tokenizer decoder is frozen. "
],
"image_footnote": [],
"bbox": [
173,
70,
823,
280
],
"page_idx": 1
},
{
"type": "text",
"text": "",
"bbox": [
173,
420,
825,
531
],
"page_idx": 1
},
{
"type": "text",
"text": "For the enhancer, the choice of pre-training objectives is quite flexible. We study two representatives: a generative objective that regresses all the original image pixels given the corrupted image (Dosovitskiy et al., 2020; Chen et al., 2020a), dubbed as Pixel Residual learning (RESPIX), and a discriminative objective that predicts whether each visual token is replaced by the small generator or not (Clark et al., 2020), dubbed as Replaced Visual token Detection (REVDET). After pre-training, the enhancer can be used as a strong feature extractor for visual downstream tasks. ",
"bbox": [
174,
537,
825,
622
],
"page_idx": 1
},
{
"type": "text",
"text": "Overall, CIM is a general and flexible pre-training framework suited for different kinds of visual encoders. For the first time, we demonstrate that both ViT and CNN can learn rich visual representations using a unified non-Siamese structure. Experimental results show that our approach achieves compelling results in vision benchmarks, such as ImageNet classification and ADE20K semantic segmentation. We hope CIM can serve as a promising starting point for exploring flexible & unified visual representation learning of various architectures. ",
"bbox": [
174,
628,
825,
713
],
"page_idx": 1
},
{
"type": "text",
"text": "2 CORRUPTED IMAGE MODELING (CIM) ",
"text_level": 1,
"bbox": [
176,
738,
529,
756
],
"page_idx": 1
},
{
"type": "text",
"text": "Figure 1b shows the overview of CIM. Our approach simultaneously learns two neural networks: an auxiliary generator and an enhancer. The generator is used to corrupt the input image, while the enhancer receives the corrupted image (Figure 2) and learns either a generative or a discriminative visual pretext task. After pre-training, we throw out the generator and fine-tune the enhancer on downstream tasks. ",
"bbox": [
173,
773,
825,
844
],
"page_idx": 1
},
{
"type": "text",
"text": "2.1 GENERATOR ",
"text_level": 1,
"bbox": [
174,
867,
302,
881
],
"page_idx": 1
},
{
"type": "text",
"text": "Rather than using artificial [MASK] tokens to corrupt the input image, we learn a trainable auxiliary generator to relax the architectural constraints of MIM. Moreover, the generator enriches the diversity of corrupted images via stochastic sampling, which helps the enhancer generalize. The generator consists of a pre-trained frozen image tokenizer, and a small trainable BEiT (Bao et al., 2021). ",
"bbox": [
174,
895,
823,
924
],
"page_idx": 1
},
{
"type": "image",
"img_path": "images/5050220e448020d78790b1e83d4696485816144f9fb9557d3b542de7e5a3860c.jpg",
"image_caption": [
"(a) Corrupted image samples from ImageNet-1K training set. Although the model is trained using the same dataset, the corrupted image samples still vary to a certain extent. Therefore during pre-training, the generator is able to continuously provide abundant and diverse corrupted samples for the enhancer. "
],
"image_footnote": [],
"bbox": [
178,
54,
820,
224
],
"page_idx": 2
},
{
"type": "image",
"img_path": "images/0c8a620d9099ed9ff0ad3e2aaed16fcd2e9d97c08f253ca8ff92b89ace11e791.jpg",
"image_caption": [
"(b) Corrupted image samples from COCO val split (Lin et al., 2014) using ImageNet-1K pre-trained model. ",
"Figure 2: Visualizations of some corrupted image samples. For each image set, we show (from left to right) the original image, the masked image, and four different corrupted images sampled from the generator output distribution with the same masked input. Simple stochastic sampling can greatly enrich the corrupted image distribution in terms of both low-level features and high-level semantics, which feeds the enhancer better. "
],
"image_footnote": [],
"bbox": [
178,
272,
820,
446
],
"page_idx": 2
},
{
"type": "text",
"text": "",
"bbox": [
174,
532,
823,
561
],
"page_idx": 2
},
{
"type": "text",
"text": "The frozen image tokenizer in CIM is a pre-trained discrete variational autoencoder (dVAE) (Rolfe, 2016; Van Den Oord et al., 2017), consisting of a paired encoder and decoder. The tokenizer encoder maps the input image into a sequence of discrete visual tokens with a fixed vocabulary size. The tokenizer decoder can recover semantically plausible images given a permutation of appropriate and meaningful visual tokens. We directly use the DALL-E (Ramesh et al., 2021) tokenizer, following BEiT. ",
"bbox": [
174,
568,
825,
651
],
"page_idx": 2
},
{
"type": "text",
"text": "The small BEiT consists of several Transformer encoder layers and is trained to perform MIM, which uses two views for each input image, i.e., a sequence of non-overlapping patch embeddings, and their corresponding discrete visual tokens. Patch embeddings are linearly embedded from non-overlapping input image patches. Discrete visual tokens are from the DALL-E tokenizer encoder, serving as the prediction target for BEiT. ",
"bbox": [
174,
659,
825,
728
],
"page_idx": 2
},
{
"type": "text",
"text": "Given a sequence of patch embeddings, the small BEiT randomly masks out a set of positions. The patch embeddings at the masked positions are replaced with special mask embeddings. The small BEiT takes this corrupted sequence of patch embeddings as the input, and learns to predict the corresponding discrete visual tokens at all masked positions given the visible context only. In CIM pre-training, the size of the small BEiT we use is typically a quarter or a half of the enhancer. ",
"bbox": [
174,
734,
825,
806
],
"page_idx": 2
},
{
"type": "text",
"text": "Using discrete visual tokens to represent images enables CIM to perform stochastic sampling during the corrupted image’s generation process, which greatly enriches the output set of the generator. In this paper, we directly sample from softmax with a temperature of 1 at all the masked positions according to the small BEiT output distribution. All the masked tokens are replaced by the sampled visual tokens. The sampled tokens together with the golden tokens that are directly produced by the image tokenizer encoder at all the non-masked positions constitute the input for the image tokenizer decoder. Then the decoder maps those plausible visual tokens to a corrupted image (refer to examples in Figure 2), which serves as the input for the enhancer. ",
"bbox": [
174,
811,
825,
924
],
"page_idx": 2
},
{
"type": "image",
"img_path": "images/c649970c6ab9f97e43291e9e16de40c65e8ad4cf1995b66201d058e9c24be0c1.jpg",
"image_caption": [
"(a) CIM-RESPIX pre-training objective with sliding window normalized pixels as the enhancer prediction target. "
],
"image_footnote": [],
"bbox": [
176,
51,
821,
226
],
"page_idx": 3
},
{
"type": "image",
"img_path": "images/06a181c2f58d7ee657036e02167e76fee2211bdd65d0593da1ded42af9144f35.jpg",
"image_caption": [
"(b) CIM-RESPIX pre-training objective with unnormalized pixels as the enhancer prediction target. ",
"Figure 3: Example visualization results on COCO val split images from vanilla ViT-Base/16 model pre-trained with the RESPIX objective using ImageNet-1K training data. For each image quadruplet, we show the original input image (1st column), the masked input image for the generator (2nd column), the corrupted image sampled from the generator output (3rd column), and the enhancer output (4th column). Given the corrupted image, the enhancer is able to perform image denoising, deblurring and completion, etc., and learns to predict plausible output in terms of both low-level features as well as high-level semantics. "
],
"image_footnote": [],
"bbox": [
176,
250,
821,
422
],
"page_idx": 3
},
{
"type": "text",
"text": "2.2 ENHANCER ",
"text_level": 1,
"bbox": [
174,
554,
294,
568
],
"page_idx": 3
},
{
"type": "text",
"text": "Given the corrupted image sampled from the auxiliary generator, the enhancer learns either a generative or a discriminative visual pretext task. The prediction head is a simple linear layer, and the choice of pre-training objectives is quite flexible. In this paper, we study two representative objectives, coined as Pixel Residual learning (RESPIX) and Replaced Visual token Detection (REVDET). ",
"bbox": [
173,
589,
826,
645
],
"page_idx": 3
},
{
"type": "text",
"text": "RESPIX (Figure 3) is a generative visual pretext task that requires the enhancer to predict the uncorrupted pixel value for all positions given the corrupted input. Instead of directly regressing the original pixel, MAE (He et al., 2021) suggests learning the normalized counterpart. Specifically, the image is partitioned into a set of non-overlapping patches, and each pixel is normalized by the mean and standard deviation of all pixels in the patch it lives in, i.e., patches with layer normalization (Ba et al., 2016) are the reconstruction target. ",
"bbox": [
174,
654,
485,
819
],
"page_idx": 3
},
{
"type": "text",
"text": "In CIM, we further propose to normalize the prediction target inside a sliding window, i.e., each pixel is normalized by all pixels in a local $8 \\times 8$ sized window centered at where the target pixel lives in. We observe improved representation quality using the sliding window normalization paradigm. ",
"bbox": [
174,
827,
483,
924
],
"page_idx": 3
},
{
"type": "image",
"img_path": "images/bff27fbe41eea6e635bbeb3ed3ffc0bcf18122b22ff97b3a0c695ab06f6813fe.jpg",
"image_caption": [
"Figure 4: Normalizations as learning templates for RESPIX. For each image triplet, we visualize the original image (left), the template of using non-overlapping window normalization (He et al., 2021), and the template of the proposed sliding window normalization paradigm. Our approach can provide more accurate and moderate hints that can boost the enhancer’s pre-training as well as improve its representation quantity. "
],
"image_footnote": [],
"bbox": [
500,
655,
821,
824
],
"page_idx": 3
},
{
"type": "text",
"text": "Naive pixel recovery without normalization tends to waste modeling capability on learning short-range dependencies and high-frequency details (Ramesh et al., 2021; Bao et al., 2021), while the normalized target can mitigate irrelevant information fittings. From another perspective, normalizations are equal to providing learning templates, as shown in Figure 4. With the normalized prediction target, the enhancer only needs to learn the residual pixel value at each position given the normalized pixel value, while the unnormalized target provides no hint therefore the enhancer has to “learn to see in the dark” (i.e., regress from RGB: 0, 0, 0). It is also hard for the enhancer to learn without a template since the corrupted image usually provides bad priors (refer to the corrupted image samples in Figure 2 and Figure 3). Therefore, we believe appropriate and moderate hints will help the enhancer see better. ",
"bbox": [
174,
103,
825,
229
],
"page_idx": 4
},
{
"type": "text",
"text": "REVDET is a discriminative visual pretext task that requires the enhancer to determine whether each visual token is replaced by a generator sample or not. To be specific, the visual tokens produced by the pre-trained frozen image tokenizer encoder are considered as golden tokens. If a generated visual token is different from the golden token at the same position, that generated token is considered “replaced”, and vice versa. ",
"bbox": [
174,
236,
825,
305
],
"page_idx": 4
},
{
"type": "text",
"text": "REVDET is inspired by ELECTRA (Clark et al., 2020) in language modeling. The main difference is, in the proposed CIM, the determining criterion of replacement is hidden in the corrupted image. Token replacement is a kind of local, high-frequency operation by nature. However, the visual token set after sampling and replacement is further smoothed and processed by the image tokenizer decoder. Therefore the token sampling and replacement operations are finally embodied as non-local, high-level semantics changes in the corrupted image. The enhancer is required to “decrypt” it and identify all the replaced tokens given the corrupted input, which yields a nontrivial and meaningful visual pretext task1. To some extent, REVDET also learns the DALL-E dVAE’s visual codebook similar to BEiT, but in a discriminative manner. ",
"bbox": [
174,
311,
825,
438
],
"page_idx": 4
},
{
"type": "text",
"text": "The enhancer is regarded as the visual encoder after pre-training. Moreover, unlike masked image modeling, CIM does not assume too many architectural priors for the pre-trained network. We successfully pre-train a high-capacity vanilla ResNet-50 (He et al., 2016), ResNet-50x2 and ResNet$5 0 { \\bf x } 4$ enhancers that achieve compelling transfer learning performance using a similar configuration as pre-training a ViT enhancer. For the first time, we demonstrate that both ViT and CNN can learn strong visual representations using a unified non-Siamese framework. ",
"bbox": [
174,
444,
825,
527
],
"page_idx": 4
},
{
"type": "text",
"text": "2.3 TRAINING AND OPTIMIZATION ",
"text_level": 1,
"bbox": [
176,
545,
428,
559
],
"page_idx": 4
},
{
"type": "text",
"text": "The auxiliary generator and the enhancer are simultaneously trained and synergistically (rather than adversarially as GAN (Goodfellow et al., 2014)) updated. The trainable part of the generator, i.e., the small BEiT, learns a MIM objective in the same vein as in (Bao et al., 2021). The whole pre-trained image tokenizer is frozen. ",
"bbox": [
174,
570,
825,
626
],
"page_idx": 4
},
{
"type": "text",
"text": "For the RESPIX visual pretext task, the enhancer is optimized by a combination of $l _ { 1 }$ and $l _ { 2 }$ loss. For the REVDET visual pretext task, the enhancer is learned by binary cross-entropy loss. Notice that the gradients of the enhancer are not back-propagated through the generator. A detailed formulation is presented in Appendix A.3. ",
"bbox": [
174,
633,
825,
689
],
"page_idx": 4
},
{
"type": "text",
"text": "3 EXPERIMENTS ",
"text_level": 1,
"bbox": [
176,
709,
326,
724
],
"page_idx": 4
},
{
"type": "text",
"text": "We study CIM self-supervised pre-trained vanilla ViT-Small/16 (Touvron et al., 2021a), vanilla ViT-Base/16 (Dosovitskiy et al., 2020) and vanilla ResNet-50 (He et al., 2016) models. We use the actual processed images / views to measure the pre-training epochs (PT epochs). ImageNet-1K (Deng et al., 2009) training data is used to pre-train the small BEiT and the enhancer. Our pre-training setting generally follows BEiT (Bao et al., 2021). Unlike BEiT, CIM only uses cropping and flipping for data argumentation, while dropout (Srivastava et al., 2014) and stochastic depth (Huang et al., 2016) are not applied. The detailed pre-training settings are summarized in the Appendix A.4. Notably, the pre-training configurations are almost the same for both ViT and CNN architectures. ",
"bbox": [
174,
739,
825,
852
],
"page_idx": 4
},
{
"type": "text",
"text": "In order to evaluate the pre-trained representations from CIM, for both ViT and CNN architectures, we conduct supervised end-to-end fine-tuning (FT) experiments on ImageNet-1K (Deng et al., 2009) image classification in $\\ S 3 . 1$ , and ADE20K (Zhou et al., 2019) semantic segmentation in $\\ S 3 . 2$ . ",
"bbox": [
176,
858,
826,
901
],
"page_idx": 4
},
{
"type": "table",
"img_path": "images/459f801e7ff81d17f3cfa23c0fd8ec3c9133f10c7e6196636b03f74ece08238a.jpg",
"table_caption": [
"Table 1: ImageNet-1K end-to-end fine-tuning top-1 accuracy of vanilla ViT-Small/16 and ViT-Base/16 models. †Doubled attention heads. ‡Our reproduction. "
],
"table_footnote": [
"Ablation study on ImageNet-1K is presented in $\\ S 3 . 3$ . For ImageNet-1K, we observe ${ \\sim } 0 . 2$ Top-1 acc. fluctuations. For ADE20K, we observe ${ \\sim } 0 . 5$ mIoU fluctuations. We report key results using the median of 3 independent runs. "
],
"table_body": "<table><tr><td>Models PT Epochs Top-1 ViT-Small/16 model results</td></tr><tr><td>Scratch (Touvron et al., 2021a) MoCo-v3† (Chen et al., 2021) 600 DINO (Caron et al., 2021) 1600 81.5 BEiT (Bao et al., 2021) 300</td></tr><tr><td>CIM-RESPIX (Ours) 300 81.5 CIM-REVDET (Ours) 300 81.6</td></tr><tr><td>ViT-Base/l6 model results 81.8</td></tr><tr><td>Scratch (Touvron et al., 2021a)</td></tr><tr><td>Scratch (He et al., 2021) 82.3</td></tr><tr><td>DINO (Caron et al., 2021) 1600 82.8 MoCo-v3 (Chen et al.,2021) 600 83.2</td></tr><tr><td>BEiT (Bao et al.,2021) 300 82.9 BEiT (Bao et al., 2021) 800 83.2</td></tr></table>",
"bbox": [
184,
123,
485,
387
],
"page_idx": 5
},
{
"type": "table",
"img_path": "images/2f2175fb1329d3136feceda47e76b8d02304ba1093ecd6911c001590c997ed9b.jpg",
"table_caption": [
"Table 2: ImageNet-1K end-to-end fine-tuning top-1 accuracy of vanilla ResNet-50 model. RSB (Wightman et al., 2021) is the current vanilla ResNet stateof-the-art training procedure. "
],
"table_footnote": [],
"table_body": "<table><tr><td>Models</td><td>PT Epochs Top-1</td></tr><tr><td>Fine-tuning for l0o epochs RSB A3 (Wightman et al., 2021) CIM-REVDET (Ours) 300</td><td>78.1 78.8</td></tr><tr><td>Fine-tuning for 300 epochs RSB A2 (Wightman et al., 2021) SimSiam (Chen & He,2021) MoCo-v2 (Chen et al., 2020c) SimCLR (Chen et al., 2020b) SimCLR (Chen et al., 2020b) BYOL (Grill et al., 2020) SwAV (Caron et al., 2020) CIM-RESPIX(Ours) CIM-REVDET (Ours)</td><td>79.8 400 79.1 400 79.6 800 79.9 2000 80.0 400 80.0 600 80.1 300 79.9 300</td></tr><tr><td>Fine-tuning for 60o epochs</td><td>80.5</td></tr><tr><td>RSB A1 (Wightman et al., 2021) CIM-REVDET (Ours) 300</td><td>80.4 80.7</td></tr></table>",
"bbox": [
501,
125,
813,
386
],
"page_idx": 5
},
{
"type": "text",
"text": "3.1 IMAGE CLASSIFICATION ",
"text_level": 1,
"bbox": [
176,
453,
383,
467
],
"page_idx": 5
},
{
"type": "text",
"text": "ViT. The ImageNet-1K end-to-end fine-tuning top-1 accuracy of vanilla ViT-Small/16 and ViTBase/16 models are presented in Table 1. We fine-tune the small-sized model for 200 epochs, and the base-sized model for 100 epochs. Other self-supervised methods in Table 1 use the same or longer fine-tuning schedule. The fine-tuning hyperparameters mostly follow BEiT, while our layerwise lr decay rate is set to 0.8 as suggested by Clark et al. (2020). See Appendix A.4 for detailed configurations. ",
"bbox": [
174,
479,
825,
564
],
"page_idx": 5
},
{
"type": "text",
"text": "As shown in Table 1, CIM is able to achieve better accuracy with fewer pre-training epochs compared with other representative self-supervised vanilla ViT models. Moreover, we find both REVDET and RESPIX visual pretext task can help the ViT enhancer learn useful representations. ",
"bbox": [
174,
570,
825,
612
],
"page_idx": 5
},
{
"type": "text",
"text": "ResNet-50. We demonstrate that CIM can also pre-train a high-capacity ResNet-50 model with the fewest possible modifications from the ViT pre-training settings that can achieve compelling fine-tuning performances on ImageNet-1K. We use the AdamW optimizer (Loshchilov & Hutter, 2017) for fine-tuning, and other configurations basically follow the advanced training recipe of RSB (Wightman et al., 2021). For other self-supervised baselines, we select the best lr out of $\\{ 5 \\mathrm { e } \\mathrm { - } 3$ , 8e-3, 12e-3} and keep other settings unchanged to ensure a fair and challenging competition. The detailed configurations are given in Appendix A.4. ",
"bbox": [
174,
630,
825,
728
],
"page_idx": 5
},
{
"type": "text",
"text": "As shown in Table 2, under such a demanding training procedure, CIM pre-trained ResNet-50 model can still outperform several representative self-supervised methods based on the Siamese framework as well as the modernized state-of-the-art ResNet-50 results. Using the improved fine-tuning recipe, we also observe performance degeneration for some self-supervised baselines compared with the RSB from scratch results. Notably, even with the extreme 600-epoch training schedule, the CIM representation can still improve the state-of-the-art RSB A1 by $0 . 3 \\%$ . ",
"bbox": [
174,
734,
825,
819
],
"page_idx": 5
},
{
"type": "text",
"text": "3.2 SEMANTIC SEGMENTATION ",
"text_level": 1,
"bbox": [
176,
838,
403,
852
],
"page_idx": 5
},
{
"type": "text",
"text": "We study the transfer learning performance of CIM pre-trained vanilla ViT-Base/16 and ResNet-50 models on the ADE20K semantic segmentation benchmark. The pre-trained models are used as an encoder, and we purposefully choose simple decoders to better reveal the pre-trained representations. Experiments are based on the code of Bao et al. (2021); MMSegmentation (2020). ",
"bbox": [
174,
864,
825,
920
],
"page_idx": 5
},
{
"type": "text",
"text": "Specifically, for ViT-Base/16 we use a simple linear layer as the decoder, and for ResNet-50 we choose the ubiquitous FCN (Long et al., 2015) as the decoder. For ViT, the baseline settings as well as the fine-tuning recipes are from (Bao et al., 2021). We select the best lr out of $\\{ 1 \\mathrm { e } { - } 4 , 3 \\mathrm { e } { - } 4 , 5 \\mathrm { e } { - } 4 , 7 \\mathrm { e } { - } 4 \\}$ for DINO. For BEiT we use the default setting (lr 7e4 with a decay rate of 0.65). For CIM pretrained ViT, we set the fine-tuning lr equal to 3e-4 with a decay rate of 0.8 as suggested by Clark et al. (2020). For ResNet-50, we use the canonical configuration for all methods, i.e., the optimizer is SGD with a momentum of 0.9, lr follows a poly decay schedule, and the batch size is 16. The training crop size is set to 512 for all models, and we use singlescale inference. ",
"bbox": [
174,
104,
472,
353
],
"page_idx": 6
},
{
"type": "text",
"text": "As summarized in Table 3, when transferred to semantic segmentation task, CIM pre-trained models can still achieve competitive performances compared with other approaches. Notably, for ResNet-50, as the fine-tuning schedule becomes longer (i.e., 80k iterations 160k iterations), the performance gain from the ImageNet-1K supervised pre-trained representation is small. Moreover, the performance is even worse than training from scratch. Meanwhile, the CIM pre-trained ResNet-50 representation can provide sustaining performance gain for a longer fine-tuning schedule. ",
"bbox": [
176,
361,
472,
541
],
"page_idx": 6
},
{
"type": "table",
"img_path": "images/257b2d046b6a80a0c4242edb91b80120eb4cc02c4fc1ff7be23b230fa7763efd.jpg",
"table_caption": [
"Table 3: ADE20K semantic segmentation performances (mIoU) of ViT and ResNet-50 models. "
],
"table_footnote": [
"(a) Vanilla ViT-Base/16 as encoder with one linear layer as decoder. "
],
"table_body": "<table><tr><td>Models PT Epochs Top-1</td></tr><tr><td>Fine-tuning for l60k iterations</td></tr><tr><td>DINO (Caron et al., 2021) 1600 43.0</td></tr><tr><td>BEiT (Bao et al., 2021) 300 43.2</td></tr><tr><td>CIM-RESPIX (Ours) 300 43.5</td></tr><tr><td>CIM-REVDET (Ours) 300 43.6</td></tr></table>",
"bbox": [
517,
138,
790,
234
],
"page_idx": 6
},
{
"type": "table",
"img_path": "images/2f3f4d7c5fe049564a76505d36cdc91369e5917e24856f2a77ca68e436f7de97.jpg",
"table_caption": [],
"table_footnote": [
"(b) Vanilla ResNet-50 as encoder with a classic FCN as decoder. "
],
"table_body": "<table><tr><td>Models PT Epochs mloU</td></tr><tr><td>Fine-tuning for 80k iterations Training from Scratch 29.9 IN1K Supervised† (He et al., 2019) 120 35.9 CIM-REVDET (Ours)</td></tr><tr><td>300 36.2 Fine-tuning forl6Ok iterations Training from Scratch 36.7 IN1K Supervised (He et al., 2019) 120 36.1 BYOL (Grill et al., 2020) 400 37.1</td></tr><tr><td>SimCLR (Chen et al.,2020b) 2000 37.7 CIM-RESPIX (Ours) 300 38.7</td></tr><tr><td>SimSiam (Chen & He,2021) 400 37.1 SwAV (Caron et al., 2020) 600 37.2 MoCo-v2 (Chen et al.,2020c) 400 37.5 SimCLR (Chen et al., 2020b) 800 37.6</td></tr></table>",
"bbox": [
491,
276,
816,
510
],
"page_idx": 6
},
{
"type": "text",
"text": "Together with the observation from $\\ S 3 . 1$ , we demonstrate CIM is a general, non-Siamese framework that is capable of pre-training both strong ViT and CNN visual encoders. ",
"bbox": [
174,
547,
823,
575
],
"page_idx": 6
},
{
"type": "text",
"text": "3.3 ABLATION STUDIES ",
"text_level": 1,
"bbox": [
176,
603,
352,
617
],
"page_idx": 6
},
{
"type": "text",
"text": "Ablation studies are conducted using 300-epoch CIM-RESPIX pre-trained ViT-Base model with 100 epochs fine-tuning on ImageNet-1K unless specified. Some additional analysis is available in Appendix A.1. ",
"bbox": [
174,
633,
825,
676
],
"page_idx": 6
},
{
"type": "text",
"text": "Masking Strategy and Masking Ratio. As shown in Table 4, we observe CIM works better with simple random masking (He et al., 2021; Xie et al., 2021) compared with the blockwise masking strategy (Bao et al., 2021). ",
"bbox": [
174,
702,
826,
743
],
"page_idx": 6
},
{
"type": "text",
"text": "The optimal random masking ratio is around $50 \\%$ , which we find also holds for the REVDET pretext task, in part because it provides almost equal amounts of positive and negative training samples. ",
"bbox": [
173,
751,
825,
779
],
"page_idx": 6
},
{
"type": "text",
"text": "The Small BEiT Depth and Weight Sharing. Following Meng et al. (2021); Chi et al. (2021), we adjust the size of the small trainable BEiT by varying its depth (i.e., the number of Transformer encoder layers) instead of its width (i.e., the feature dimension). As summarized in Table 5, the small BEiT with 4 to 6 layers is generally fine. ",
"bbox": [
174,
804,
825,
861
],
"page_idx": 6
},
{
"type": "text",
"text": "It is also beneficial to share the patch embedding layer as well as the first two Transformer encoder layers between the small BEiT and enhancer as long as the enhancer is also ViT. We hypothesize that sharing the earlier layers can help calibrate the enhancer since the small BEiT receives the real inputs while the enhancer sees the same sources but with corrupted views. ",
"bbox": [
176,
867,
823,
922
],
"page_idx": 6
},
{
"type": "table",
"img_path": "images/ee5dc80eb05b3793abbd4054926c6210fd9d335cfb82360a4506a82308a74359.jpg",
"table_caption": [
"Table 4: Ablation study: masking strategy and masking ratio. "
],
"table_footnote": [],
"table_body": "<table><tr><td>Masking Strategy</td><td>Masking Ratio</td><td>Top-1 Acc.</td></tr><tr><td>Blockwise</td><td>40%</td><td>82.8</td></tr><tr><td>Blockwise</td><td>50%</td><td>82.9</td></tr><tr><td>Blockwise</td><td>60%</td><td>82.8</td></tr><tr><td>Random</td><td>40%</td><td>83.0</td></tr><tr><td>Random</td><td>50%</td><td>83.3</td></tr><tr><td>Random</td><td>60%</td><td>83.1</td></tr></table>",
"bbox": [
179,
98,
491,
208
],
"page_idx": 7
},
{
"type": "table",
"img_path": "images/37fd9c891e3f63ff8b76f7ef5135f72ca6de00ce49141b1a69d3e6a1327cb30b.jpg",
"table_caption": [
"Table 5: Ablation study: depth of the small BEiT in the generator and weight sharing. "
],
"table_footnote": [],
"table_body": "<table><tr><td># Enc.Layers</td><td>Weight Sharing</td><td>Top-1 Acc.</td></tr><tr><td>4</td><td>X</td><td>83.1</td></tr><tr><td>4</td><td>√</td><td>83.3</td></tr><tr><td>5</td><td>√</td><td>83.2</td></tr><tr><td>6</td><td>√</td><td>83.2</td></tr><tr><td>7</td><td>√</td><td>83.1</td></tr><tr><td>8</td><td>√</td><td>82.9</td></tr></table>",
"bbox": [
511,
98,
807,
208
],
"page_idx": 7
},
{
"type": "table",
"img_path": "images/78b5233aa69e2b8710b84af8a93310904973cca210d8a5ee594e3a4fbe8b5102.jpg",
"table_caption": [
"Table 6: Ablation study: pixel reconstruction target for RESPIX pre-training objective. "
],
"table_footnote": [],
"table_body": "<table><tr><td>REsPIX Recon. Target</td><td>Top-1 Acc.</td></tr><tr><td>w/o norm.</td><td>82.8</td></tr><tr><td>norm.w/ non-overlap win.</td><td>83.0</td></tr><tr><td>norm. w/ sliding win.</td><td>83.3</td></tr></table>",
"bbox": [
189,
250,
482,
316
],
"page_idx": 7
},
{
"type": "table",
"img_path": "images/c9f2e2d122de139b2a018c368ebcb283b9709621d2597891c248f8b565ae33bc.jpg",
"table_caption": [
"Table 7: Ablation study: sampling strategy for visual tokens. "
],
"table_footnote": [],
"table_body": "<table><tr><td>Sampling Strategy</td><td>Top-1 Acc.</td></tr><tr><td>Uniform sampling</td><td>77.2</td></tr><tr><td>argmax sampling</td><td>78.5</td></tr><tr><td>softmax sampling</td><td>83.3</td></tr></table>",
"bbox": [
529,
250,
789,
316
],
"page_idx": 7
},
{
"type": "text",
"text": "Target for RESPIX. We believe an appropriate normalization technique can provide moderate hints that can help improve the enhancer’s representation quality with the RESPIX visual pretext task (see our discussion of Figure 4). As shown in Table 6, the proposed sliding window normalization improves the fine-tuning accuracy by $0 . 5 \\%$ vs. the reconstruction target without normalization, and is also $0 . 3 \\%$ better than the normalization method proposed in He et al. (2021). ",
"bbox": [
173,
328,
825,
397
],
"page_idx": 7
},
{
"type": "text",
"text": "Sampling Strategy for Visual Tokens. Using discrete visual tokens to represent images enables CIM to use stochastic sampling techniques during the corrupted image’s generation process, which can greatly enrich the output set of the generator and help the enhancer generalize well. For masked image modeling, randomly masking out a portion of patch embeddings can help regularize the pre-training, while for our approach, regularization for the enhancer mainly comes from the diversity of the corrupted images, therefore regularizations such as dropout & droppath are not used in CIM. ",
"bbox": [
174,
412,
825,
497
],
"page_idx": 7
},
{
"type": "text",
"text": "As presented in Table 7, the visual token representation with simple stochastic sampling from the generator output distribution is crucial for CIM. In contrast, we find that uniform sampling from the codebook of the image tokenizer regardless of the generator distribution or argmax sampling from the distribution cannot provide meaningful or diverse samples and therefore fails to pre-train the enhancer as expected. ",
"bbox": [
174,
503,
825,
574
],
"page_idx": 7
},
{
"type": "text",
"text": "Image Corrupting Strategy. We find that it is crucial to use a generator with a small trainable BEiT to corrupt images in order to successfully pre-train CNN with the proposed CIM. We experiment with another generative visual pretext task for ResNet-50 pre-training, i.e., using $50 \\%$ random erasing (Zhong et al., 2020) to corrupt the input image, and the model is required to recover the erased pixels based on the visible context. We find this pretext task fails to transfer well. A parallel work Tian et al. (2022) also finds that only using hand-crafted transformations to corrupt images is not quite satisfactory in generative visual pre-training of ViT. ",
"bbox": [
174,
588,
825,
686
],
"page_idx": 7
},
{
"type": "table",
"img_path": "images/cf62d90ea51b0125ac51771087f802e651e4c0fc7f7efb54455bf3cf8b69c76b.jpg",
"table_caption": [
"Table 8: Scaling CIM pre-training to larger ResNet. "
],
"table_footnote": [],
"table_body": "<table><tr><td>Methods</td><td>PT Epochs FT Epochs Top-1 Acc.</td><td></td><td></td></tr><tr><td>ResNet-50x2 (#params: 94M)</td><td></td><td></td><td></td></tr><tr><td>From Scratch</td><td>=</td><td>400</td><td>81.1</td></tr><tr><td>SimCLR (Chen et al., 2020b)</td><td>1000</td><td>100 /200</td><td>81.6 /82.1</td></tr><tr><td>CIM-REVDET (Ours)</td><td>300</td><td>100/200</td><td>81.7 /82.2</td></tr><tr><td>ResNet-50x4 (#params:375M)</td><td></td><td></td><td></td></tr><tr><td>From Scratch</td><td></td><td>400</td><td>80.9</td></tr><tr><td>SimCLR (Chen et al., 2020b)</td><td>1000</td><td>100</td><td>82.6</td></tr><tr><td>SimMIM (Xie et al.,2021)</td><td>300</td><td>100</td><td>81.6</td></tr><tr><td>CIM-REVDET (Ours)</td><td>300</td><td>100</td><td>82.6</td></tr></table>",
"bbox": [
431,
719,
826,
877
],
"page_idx": 7
},
{
"type": "text",
"text": "Scaling CIM to Larger CNNs. We study the scaling behavior of our CIM to larger CNNs. We choose two popular architectures in self-supervised learning literature: ResNet- $5 0 \\mathrm { x } 2$ and ResNet-50x4 (with width multipliers of $2 \\mathbf { x }$ and $4 \\mathbf { x }$ of vanilla ResNet50, respectively), and study the endto-end fine-tuning performance on ImageNet-1K in Table 8. We use an improved training recipe following Touvron et al. (2021a); Wightman et al. (2021), therefore our from ",
"bbox": [
174,
703,
419,
881
],
"page_idx": 7
},
{
"type": "text",
"text": "scratch and SimCLR baselines are much higher ( ${ \\sim } 2$ points higher) than the original results in Chen et al. (2020b). Notice that it is non-trivial to pre-train those large CNNs (e.g., ResNet-50x4 is 14 times bigger than ResNet-50 in #params). Under the end-to-end fine-tuning protocol, CIM is better than the recent MIM-based approach SimMIM and competitive with the representative Siamese model SimCLR. ",
"bbox": [
176,
882,
825,
924
],
"page_idx": 7
},
{
"type": "text",
"text": "",
"bbox": [
173,
103,
823,
132
],
"page_idx": 8
},
{
"type": "text",
"text": "Scaling CIM to Larger ViT. We study the scaling behavior of our CIM to ViT-Large in Table 9. Indeed, our approach can give ViT-Large a better initialization compared with the random initialization, and can also achieve better performance than MoCov3 that based on the canonical Siamese framework. Meanwhile, CIM still lags behind the MIM-based BEiT. Nevertheless, we believe CIM can serve as a promising starting point for exploring unified visual pre-training of various architectures. ",
"bbox": [
174,
157,
517,
296
],
"page_idx": 8
},
{
"type": "table",
"img_path": "images/1e98f4f2a2f34a6b30ac5a50bbf903b24ee53ebaff08915364c974e0ceeeea0e.jpg",
"table_caption": [
"Table 9: Scaling CIM pre-training for ViT-Large. "
],
"table_footnote": [],
"table_body": "<table><tr><td>Methods</td><td>Top-1 Acc.</td></tr><tr><td>ViT-Large (#params: 304M)</td><td></td></tr><tr><td>From Scratch (He et al., 2021)</td><td>82.6</td></tr><tr><td>MoCo-v3 (Chen et al., 2021)</td><td>84.1</td></tr><tr><td>BEiT (Bao et al., 2021)</td><td>85.2</td></tr><tr><td>CIM-RESPIX (Ours)</td><td>84.3</td></tr></table>",
"bbox": [
540,
178,
813,
276
],
"page_idx": 8
},
{
"type": "text",
"text": "Limitation and Discussion. The image corrupting process of CIM still has a large room for improvement, which determines the characteristics and styles of the corrupted image distribution. The tokenizer we currently use is essentially a large CNN and adds nontrivial overhead during pre-training, i.e., the wall-clock time of 1-epoch training is about $2 \\times$ of BEiT. Other image tokenizers, such as ViT-VQGAN (Yu et al., 2021), which report much higher throughput and better generation quality, deserve an in-depth study for CIM pre-training in the future. ",
"bbox": [
174,
321,
826,
405
],
"page_idx": 8
},
{
"type": "text",
"text": "4 RELATED WORK ",
"text_level": 1,
"bbox": [
176,
435,
344,
452
],
"page_idx": 8
},
{
"type": "text",
"text": "Siamese Framework is the dominating self-supervised visual pre-training approach over the past few years, which typically relies on strong hand-crafted data augmentations to generate different views of the same image and learns in a contrastive manner. To maintain a large and informative negative sample set, memory banks (He et al., 2020) or large batch size (Chen et al., 2020b) is used. Follow-ups (Grill et al., 2020; Chen & He, 2021) further eliminate the requirement of using negative samples. Recent works (Caron et al., 2021; Chen et al., 2021) study self-supervised visual pre-training of ViT within Siamese frameworks. ",
"bbox": [
174,
473,
825,
570
],
"page_idx": 8
},
{
"type": "text",
"text": "Masked Image Modeling (MIM) learns rich visual representations via masked parts prediction by conditioning on visible context only. ViT (Dosovitskiy et al., 2020) and iGPT (Chen et al., 2020a) report the first meaningful MIM visual pre-training results. BEiT (Bao et al., 2021) greatly improves MIM’s performance via masked visual token prediction, and PeCo (Dong et al., 2021) finds injecting perceptual similarity during visual codebook learning benefits MIM pre-trained representation. Recent work (He et al., 2021; Xie et al., 2021; Wei et al., 2021) re-explore pixel / feature regression in MIM, while Li et al. (2021); Zhou et al. (2021); El-Nouby et al. (2021) incorporate MIM within Siamese frameworks. As MIM is originated in masked language modeling (Devlin et al., 2019), CIM is inspired by Clark et al. (2020). In CIM, visual-token-based MIM plays an important role during the corrupted image generation process, as the stochastic sampling ability greatly enriches the corrupted image set. ",
"bbox": [
174,
578,
825,
731
],
"page_idx": 8
},
{
"type": "text",
"text": "5 CONCLUSION ",
"text_level": 1,
"bbox": [
176,
761,
318,
776
],
"page_idx": 8
},
{
"type": "text",
"text": "We introduce a general self-supervised visual pre-training framework with few architectural constraints for the model to be pre-trained and transferred. Unlike the mainstream Siamese pre-training methods based on strong artificial data augmentations as well as MIM pre-training relying on randomly inserting artificial [MASK] tokens to input embeddings, CIM pre-trained encoder learns from the corrupted view generated from a trainable neural network’s output distribution. Given the stochastic sampling ability, CIM defends using discrete visual token representations during pre-training to some extent. Experimental results show that our approach achieves competitive performance on canonical ViT and CNN models. We hope CIM can serve as a promising starting point for exploring flexible & unified visual representation learning of various architectures. ",
"bbox": [
174,
797,
826,
924
],
"page_idx": 8
},
{
"type": "text",
"text": "ACKNOWLEDGMENT ",
"text_level": 1,
"bbox": [
176,
103,
346,
117
],
"page_idx": 9
},
{
"type": "text",
"text": "This work is in part supported by the National Key Research and Development Program of China under Grant 2022YFB4500602. We would like to acknowledge Yaru Hao for the helpful discussions. ",
"bbox": [
174,
133,
825,
161
],
"page_idx": 9
},
{
"type": "text",
"text": "REFERENCES ",
"text_level": 1,
"bbox": [
174,
183,
287,
198
],
"page_idx": 9
},
{
"type": "text",
"text": "Jimmy Lei Ba, Jamie Ryan Kiros, and Geoffrey E Hinton. Layer normalization. arXiv preprint arXiv:1607.06450, 2016. ",
"bbox": [
173,
205,
823,
234
],
"page_idx": 9
},
{
"type": "text",
"text": "Hangbo Bao, Li Dong, and Furu Wei. BEiT: BERT pre-training of image transformers. arXiv preprint arXiv:2106.08254, 2021. ",
"bbox": [
171,
242,
823,
272
],
"page_idx": 9
},
{
"type": "text",
"text": "Maxim Berman, Hervé Jégou, Andrea Vedaldi, Iasonas Kokkinos, and Matthijs Douze. Multigrain: a unified image embedding for classes and instances. arXiv preprint arXiv:1902.05509, 2019. ",
"bbox": [
173,
281,
823,
310
],
"page_idx": 9
},
{
"type": "text",
"text": "Mathilde Caron, Ishan Misra, Julien Mairal, Priya Goyal, Piotr Bojanowski, and Armand Joulin. Unsupervised learning of visual features by contrasting cluster assignments. arXiv preprint arXiv:2006.09882, 2020. ",
"bbox": [
173,
319,
825,
362
],
"page_idx": 9
},
{
"type": "text",
"text": "Mathilde Caron, Hugo Touvron, Ishan Misra, Hervé Jégou, Julien Mairal, Piotr Bojanowski, and Armand Joulin. Emerging properties in self-supervised vision transformers. arXiv preprint arXiv:2104.14294, 2021. ",
"bbox": [
171,
371,
825,
414
],
"page_idx": 9
},
{
"type": "text",
"text": "Mark Chen, Alec Radford, Rewon Child, Jeffrey Wu, Heewoo Jun, David Luan, and Ilya Sutskever. Generative pretraining from pixels. In ICML, 2020a. ",
"bbox": [
173,
422,
823,
452
],
"page_idx": 9
},
{
"type": "text",
"text": "Ting Chen, Simon Kornblith, Mohammad Norouzi, and Geoffrey Hinton. A simple framework for contrastive learning of visual representations. In ICML, 2020b. ",
"bbox": [
174,
460,
821,
489
],
"page_idx": 9
},
{
"type": "text",
"text": "Xinlei Chen and Kaiming He. Exploring simple siamese representation learning. In CVPR, 2021. ",
"bbox": [
173,
498,
810,
515
],
"page_idx": 9
},
{
"type": "text",
"text": "Xinlei Chen, Haoqi Fan, Ross Girshick, and Kaiming He. Improved baselines with momentum contrastive learning. arXiv preprint arXiv:2003.04297, 2020c. ",
"bbox": [
173,
522,
821,
553
],
"page_idx": 9
},
{
"type": "text",
"text": "Xinlei Chen, Saining Xie, and Kaiming He. An empirical study of training self-supervised vision transformers. arXiv preprint arXiv:2104.02057, 2021. ",
"bbox": [
173,
560,
823,
590
],
"page_idx": 9
},
{
"type": "text",
"text": "Zewen Chi, Shaohan Huang, Li Dong, Shuming Ma, Saksham Singhal, Payal Bajaj, Xia Song, and Furu Wei. Xlm-e: cross-lingual language model pre-training via electra. arXiv preprint arXiv:2106.16138, 2021. ",
"bbox": [
173,
598,
823,
642
],
"page_idx": 9
},
{
"type": "text",
"text": "Kevin Clark, Minh-Thang Luong, Quoc V Le, and Christopher D Manning. Electra: Pre-training text encoders as discriminators rather than generators. arXiv preprint arXiv:2003.10555, 2020. ",
"bbox": [
171,
650,
825,
680
],
"page_idx": 9
},
{
"type": "text",
"text": "Ekin D Cubuk, Barret Zoph, Jonathon Shlens, and Quoc V Le. Randaugment: Practical automated data augmentation with a reduced search space. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, pp. 702–703, 2020. ",
"bbox": [
173,
688,
825,
732
],
"page_idx": 9
},
{
"type": "text",
"text": "Jia Deng, Wei Dong, Richard Socher, Li-Jia Li, Kai Li, and Li Fei-Fei. Imagenet: A large-scale hierarchical image database. In CVPR, 2009. ",
"bbox": [
169,
739,
825,
768
],
"page_idx": 9
},
{
"type": "text",
"text": "Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. BERT: Pre-training of deep bidirectional transformers for language understanding. In NAACL, 2019. ",
"bbox": [
166,
777,
823,
808
],
"page_idx": 9
},
{
"type": "text",
"text": "Xiaoyi Dong, Jianmin Bao, Ting Zhang, Dongdong Chen, Weiming Zhang, Lu Yuan, Dong Chen, Fang Wen, and Nenghai Yu. Peco: Perceptual codebook for bert pre-training of vision transformers. arXiv preprint arXiv:2111.12710, 2021. ",
"bbox": [
174,
815,
825,
858
],
"page_idx": 9
},
{
"type": "text",
"text": "Alexey Dosovitskiy, Lucas Beyer, Alexander Kolesnikov, Dirk Weissenborn, Xiaohua Zhai, Thomas Unterthiner, Mostafa Dehghani, Matthias Minderer, Georg Heigold, Sylvain Gelly, et al. An image is worth 16x16 words: Transformers for image recognition at scale. arXiv preprint arXiv:2010.11929, 2020. ",
"bbox": [
174,
867,
825,
922
],
"page_idx": 9
},
{
"type": "text",
"text": "Alaaeldin El-Nouby, Gautier Izacard, Hugo Touvron, Ivan Laptev, Hervé Jegou, and Edouard Grave. Are large-scale datasets necessary for self-supervised pre-training? arXiv preprint arXiv:2112.10740, 2021. ",
"bbox": [
176,
103,
823,
146
],
"page_idx": 10
},
{
"type": "text",
"text": "Patrick Esser, Robin Rombach, and Bjorn Ommer. Taming transformers for high-resolution image synthesis. In CVPR, 2021. ",
"bbox": [
171,
154,
823,
183
],
"page_idx": 10
},
{
"type": "text",
"text": "Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio. Generative adversarial nets. In NeurIPS, 2014. ",
"bbox": [
171,
190,
825,
220
],
"page_idx": 10
},
{
"type": "text",
"text": "Jean-Bastien Grill, Florian Strub, Florent Altché, Corentin Tallec, Pierre H Richemond, Elena Buchatskaya, Carl Doersch, Bernardo Avila Pires, Zhaohan Daniel Guo, Mohammad Gheshlaghi Azar, et al. Bootstrap your own latent: A new approach to self-supervised learning. arXiv preprint arXiv:2006.07733, 2020. ",
"bbox": [
173,
228,
825,
285
],
"page_idx": 10
},
{
"type": "text",
"text": "Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recognition. In CVPR, 2016. ",
"bbox": [
173,
292,
823,
321
],
"page_idx": 10
},
{
"type": "text",
"text": "Kaiming He, Haoqi Fan, Yuxin Wu, Saining Xie, and Ross Girshick. Momentum contrast for unsupervised visual representation learning. In CVPR, 2020. ",
"bbox": [
173,
329,
823,
359
],
"page_idx": 10
},
{
"type": "text",
"text": "Kaiming He, Xinlei Chen, Saining Xie, Yanghao Li, Piotr Dollár, and Ross Girshick. Masked autoencoders are scalable vision learners. arXiv preprint arXiv:2111.06377, 2021. ",
"bbox": [
173,
367,
823,
396
],
"page_idx": 10
},
{
"type": "text",
"text": "Tong He, Zhi Zhang, Hang Zhang, Zhongyue Zhang, Junyuan Xie, and Mu Li. Bag of tricks for image classification with convolutional neural networks. In CVPR, 2019. ",
"bbox": [
173,
404,
823,
434
],
"page_idx": 10
},
{
"type": "text",
"text": "Elad Hoffer, Tal Ben-Nun, Itay Hubara, Niv Giladi, Torsten Hoefler, and Daniel Soudry. Augment your batch: better training with larger batches. arXiv preprint arXiv:1901.09335, 2019. ",
"bbox": [
173,
440,
823,
470
],
"page_idx": 10
},
{
"type": "text",
"text": "Gao Huang, Yu Sun, Zhuang Liu, Daniel Sedra, and Kilian Q Weinberger. Deep networks with stochastic depth. In ECCV, 2016. ",
"bbox": [
173,
478,
823,
507
],
"page_idx": 10
},
{
"type": "text",
"text": "Phillip Isola, Jun-Yan Zhu, Tinghui Zhou, and Alexei A Efros. Image-to-image translation with conditional adversarial networks. In CVPR, 2017. ",
"bbox": [
171,
515,
823,
545
],
"page_idx": 10
},
{
"type": "text",
"text": "Yann LeCun, Bernhard Boser, John S Denker, Donnie Henderson, Richard E Howard, Wayne Hubbard, and Lawrence D Jackel. Backpropagation applied to handwritten zip code recognition. Neural computation, 1989. ",
"bbox": [
178,
551,
823,
594
],
"page_idx": 10
},
{
"type": "text",
"text": "Zhaowen Li, Zhiyang Chen, Fan Yang, Wei Li, Yousong Zhu, Chaoyang Zhao, Rui Deng, Liwei Wu, Rui Zhao, Ming Tang, et al. Mst: Masked self-supervised transformer for visual representation. NeurIPS, 2021. ",
"bbox": [
176,
603,
825,
646
],
"page_idx": 10
},
{
"type": "text",
"text": "Tsung-Yi Lin, Michael Maire, Serge Belongie, James Hays, Pietro Perona, Deva Ramanan, Piotr Dollár, and C Lawrence Zitnick. Microsoft coco: Common objects in context. In ECCV, 2014. ",
"bbox": [
171,
654,
823,
684
],
"page_idx": 10
},
{
"type": "text",
"text": "Jonathan Long, Evan Shelhamer, and Trevor Darrell. Fully convolutional networks for semantic segmentation. In CVPR, 2015. ",
"bbox": [
171,
691,
823,
719
],
"page_idx": 10
},
{
"type": "text",
"text": "Ilya Loshchilov and Frank Hutter. Decoupled weight decay regularization. arXiv preprint arXiv:1711.05101, 2017. ",
"bbox": [
171,
728,
823,
757
],
"page_idx": 10
},
{
"type": "text",
"text": "Yu Meng, Chenyan Xiong, Payal Bajaj, Saurabh Tiwary, Paul Bennett, Jiawei Han, and Xia Song. COCO-LM: Correcting and contrasting text sequences for language model pretraining. In NeurIPS, 2021. ",
"bbox": [
176,
765,
825,
809
],
"page_idx": 10
},
{
"type": "text",
"text": "MMSegmentation. MMSegmentation: Openmmlab semantic segmentation toolbox and benchmark. https://github.com/open-mmlab/mmsegmentation, 2020. ",
"bbox": [
169,
816,
825,
845
],
"page_idx": 10
},
{
"type": "text",
"text": "Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, Alban Desmaison, Andreas Kopf, Edward Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, and Soumith Chintala. Pytorch: An imperative style, high-performance deep learning library. In NeurIPS, 2019. ",
"bbox": [
176,
854,
825,
922
],
"page_idx": 10
},
{
"type": "text",
"text": "Aditya Ramesh, Mikhail Pavlov, Gabriel Goh, Scott Gray, Chelsea Voss, Alec Radford, Mark Chen, and Ilya Sutskever. Zero-shot text-to-image generation. arXiv preprint arXiv:2102.12092, 2021. ",
"bbox": [
173,
103,
825,
133
],
"page_idx": 11
},
{
"type": "text",
"text": "Jason Tyler Rolfe. Discrete variational autoencoders. arXiv preprint arXiv:1609.02200, 2016. ",
"bbox": [
173,
143,
790,
159
],
"page_idx": 11
},
{
"type": "text",
"text": "Peter Shaw, Jakob Uszkoreit, and Ashish Vaswani. Self-attention with relative position representations. arXiv preprint arXiv:1803.02155, 2018. ",
"bbox": [
173,
170,
820,
199
],
"page_idx": 11
},
{
"type": "text",
"text": "Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov. Dropout: A simple way to prevent neural networks from overfitting. JMLR, 2014. ",
"bbox": [
176,
210,
823,
241
],
"page_idx": 11
},
{
"type": "text",
"text": "Christian Szegedy, Vincent Vanhoucke, Sergey Ioffe, Jon Shlens, and Zbigniew Wojna. Rethinking the inception architecture for computer vision. In CVPR, 2016. ",
"bbox": [
171,
251,
825,
281
],
"page_idx": 11
},
{
"type": "text",
"text": "Yunjie Tian, Lingxi Xie, Jiemin Fang, Mengnan Shi, Junran Peng, Xiaopeng Zhang, Jianbin Jiao, Qi Tian, and Qixiang Ye. Beyond masking: Demystifying token-based pre-training for vision transformers. arXiv preprint arXiv:2203.14313, 2022. ",
"bbox": [
176,
291,
825,
335
],
"page_idx": 11
},
{
"type": "text",
"text": "Hugo Touvron, Matthieu Cord, Matthijs Douze, Francisco Massa, Alexandre Sablayrolles, and Hervé Jégou. Training data-efficient image transformers & distillation through attention. In ICML, 2021a. ",
"bbox": [
173,
345,
825,
376
],
"page_idx": 11
},
{
"type": "text",
"text": "Hugo Touvron, Matthieu Cord, Alexandre Sablayrolles, Gabriel Synnaeve, and Hervé Jégou. Going deeper with image transformers. arXiv preprint arXiv:2103.17239, 2021b. ",
"bbox": [
173,
387,
825,
416
],
"page_idx": 11
},
{
"type": "text",
"text": "Aaron Van Den Oord, Oriol Vinyals, et al. Neural discrete representation learning. In NeurIPS, 2017. ",
"bbox": [
171,
428,
825,
444
],
"page_idx": 11
},
{
"type": "text",
"text": "Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Łukasz Kaiser, and Illia Polosukhin. Attention is all you need. In NeurIPS, 2017. ",
"bbox": [
169,
454,
825,
483
],
"page_idx": 11
},
{
"type": "text",
"text": "Chen Wei, Haoqi Fan, Saining Xie, Chao-Yuan Wu, Alan Yuille, and Christoph Feichtenhofer. Masked feature prediction for self-supervised visual pre-training. arXiv preprint arXiv:2112.09133, 2021. ",
"bbox": [
173,
494,
826,
525
],
"page_idx": 11
},
{
"type": "text",
"text": "Ross Wightman, Hugo Touvron, and Hervé Jégou. Resnet strikes back: An improved training procedure in timm. arXiv preprint arXiv:2110.00476, 2021. ",
"bbox": [
173,
535,
826,
565
],
"page_idx": 11
},
{
"type": "text",
"text": "Zhenda Xie, Zheng Zhang, Yue Cao, Yutong Lin, Jianmin Bao, Zhuliang Yao, Qi Dai, and Han Hu. Simmim: A simple framework for masked image modeling. arXiv preprint arXiv:2111.09886, 2021. ",
"bbox": [
176,
575,
825,
618
],
"page_idx": 11
},
{
"type": "text",
"text": "Jiahui Yu, Xin Li, Jing Yu Koh, Han Zhang, Ruoming Pang, James Qin, Alexander Ku, Yuanzhong Xu, Jason Baldridge, and Yonghui Wu. Vector-quantized image modeling with improved vqgan. arXiv preprint arXiv:2110.04627, 2021. ",
"bbox": [
174,
631,
823,
674
],
"page_idx": 11
},
{
"type": "text",
"text": "Sangdoo Yun, Dongyoon Han, Seong Joon Oh, Sanghyuk Chun, Junsuk Choe, and Youngjoon Yoo. Cutmix: Regularization strategy to train strong classifiers with localizable features. In ICCV, 2019. ",
"bbox": [
176,
684,
826,
714
],
"page_idx": 11
},
{
"type": "text",
"text": "Hongyi Zhang, Moustapha Cisse, Yann N Dauphin, and David Lopez-Paz. mixup: Beyond empirical risk minimization. arXiv preprint arXiv:1710.09412, 2017. ",
"bbox": [
171,
724,
825,
755
],
"page_idx": 11
},
{
"type": "text",
"text": "Richard Zhang, Phillip Isola, Alexei A Efros, Eli Shechtman, and Oliver Wang. The unreasonable effectiveness of deep features as a perceptual metric. In CVPR, 2018. ",
"bbox": [
169,
765,
825,
796
],
"page_idx": 11
},
{
"type": "text",
"text": "Zhun Zhong, Liang Zheng, Guoliang Kang, Shaozi Li, and Yi Yang. Random erasing data augmentation. In AAAI, 2020. ",
"bbox": [
173,
806,
825,
835
],
"page_idx": 11
},
{
"type": "text",
"text": "Bolei Zhou, Hang Zhao, Xavier Puig, Tete Xiao, Sanja Fidler, Adela Barriuso, and Antonio Torralba. Semantic understanding of scenes through the ade20k dataset. IJCV, 2019. ",
"bbox": [
173,
847,
825,
876
],
"page_idx": 11
},
{
"type": "text",
"text": "Jinghao Zhou, Chen Wei, Huiyu Wang, Wei Shen, Cihang Xie, Alan Yuille, and Tao Kong. ibot: Image bert pre-training with online tokenizer. arXiv preprint arXiv:2111.07832, 2021. ",
"bbox": [
173,
887,
825,
916
],
"page_idx": 11
},
{
"type": "text",
"text": "A APPENDIX ",
"text_level": 1,
"bbox": [
176,
102,
297,
117
],
"page_idx": 12
},
{
"type": "text",
"text": "A.1 ADDITIONAL ANALYSIS ",
"text_level": 1,
"bbox": [
176,
133,
385,
147
],
"page_idx": 12
},
{
"type": "text",
"text": "Relationship between the type of the generator and the performance of the enhancer. What makes a \"good\" generator for the enhancer? We believe there are three main factors that affect the output quality of the generator: (1) The masking strategy and masking ratio of the generator’s inputs. (2) The size / capacity of the small trainable BEiT. (3) The type of image tokenizers. ",
"bbox": [
174,
160,
825,
215
],
"page_idx": 12
},
{
"type": "text",
"text": "While there are many perspectives / ways to evaluate a generator, this study focuses on visual pretraining of the enhancer, so we are particularly interested in how these factors affect the enhancer’s fine-tuning performance on downstream visual recognition tasks. ",
"bbox": [
174,
222,
825,
263
],
"page_idx": 12
},
{
"type": "text",
"text": "Factor 1 & 2 has already been well studied in Table 4 & Table 5 respectively: either a too “weak” generator (e.g., too much masking or the size of the trainable BEiT is too small) or a too “strong” generator (e.g., too less masking or the trainable BEiT is too large) is harmful to the fine-tuning performance of the enhancer. ",
"bbox": [
174,
271,
826,
328
],
"page_idx": 12
},
{
"type": "text",
"text": "As for Factor 3, the image tokenizer represents a given image in the RGB domain as a permutation of discrete tokens with a fixed vocabulary size. This compact representation along with the stochastic sampling process can generate an abundant & diverse input set to feed the enhancer better. However, if the generator is too strong & robust that can always generate near ground truth output regardless of the stochastic sampling, the enhancer can hardly learn useful representations or even be wrongly penalized. ",
"bbox": [
174,
334,
825,
417
],
"page_idx": 12
},
{
"type": "text",
"text": "To show that, in Table 10 we study another well-established and open-sourced image tokenizer, VQGAN (Esser et al., 2021), on the ViT-B enhancer with 300 epochs pre-training & 100 epochs fine-tuning on ImageNet-1k. We also study the effects of directly using a MAE-Base model as the generator. ",
"bbox": [
174,
424,
825,
481
],
"page_idx": 12
},
{
"type": "table",
"img_path": "images/11722fd593ca78fd5d9b310b95d8c94bb026bc8ce78add68a2106de48bc05343.jpg",
"table_caption": [
"Table 10: Study of different generator tpye of CIM pre-training for ViT-Base. "
],
"table_footnote": [],
"table_body": "<table><tr><td>Generator Type of CIM</td><td>Top-1 Acc.</td></tr><tr><td>MAE-style generator w/ 50% masking ratio</td><td>82.6 (-0.7)</td></tr><tr><td>BEiT-Style generator w/ VQGAN tokenizer</td><td>82.9 (-0.4)</td></tr><tr><td>BEiT-Style generator w/DALL-E tokenizer (our default seting)</td><td>83.3</td></tr></table>",
"bbox": [
259,
511,
738,
582
],
"page_idx": 12
},
{
"type": "text",
"text": "For the MAE-style generator, we sample RGB color values at all masked positions of the MAE decoder outputs. Since the stochastic sampling is performed on the RGB domain, only some low-level features (mainly color) can be changed and corrupted. Therefore the enhancer only learns to correct low-level attributes. ",
"bbox": [
174,
601,
825,
656
],
"page_idx": 12
},
{
"type": "text",
"text": "For the BEiT-style generator w/ VQGAN tokenizer, compared with the DALL-E tokenizer used as default, the VQGAN tokenizer is trained with two additional losses, i.e., the perceptual loss (Zhang et al., 2018) as well as the GAN loss (Isola et al., 2017). These two additional losses are originally intended for high-quality image synthesis, but could make the tokenizer become too strong & robust to generate appropriate corrupted samples for the enhancer. We visualize the corrupted samples from the VQGAN tokenizer, and we find it nearly reconstructs the original input even with stochastic token sampling. Therefore the samples from the VQGAN tokenizer are not diverse enough and cannot provide rich supervision for the enhancer to learn transferable representations. ",
"bbox": [
173,
662,
825,
776
],
"page_idx": 12
},
{
"type": "text",
"text": "Overall, it is hard to find a good indicator from the generator that can directly reflect and measure the representation quality of the enhancer. By now, the best way is to honestly fine-tune the pre-trained enhancer on downstream tasks. ",
"bbox": [
174,
782,
825,
824
],
"page_idx": 12
},
{
"type": "text",
"text": "Study of training the generator first and keeping it fixed for the enhancer’s pre-training. We tried first train the generator separately for 300 epochs and then pre-train the enhancer for another 300 epochs while keeping the generator’s weights fixed. The performance suffers from a $0 . 4 \\%$ degeneration. We hypothesize synergetic & simultaneous training provides a curriculum-like pretraining strategy for the enhancer where the generator starts off weak but gets better throughout training. ",
"bbox": [
174,
839,
825,
924
],
"page_idx": 12
},
{
"type": "text",
"text": "Additional training cost of CIM compared to simple mask prediction with the same mask ratio. We study the relationship between the pre-training time and downstream performances of different approaches for both ViTs and ConvNets in Table 11 and Table 12 respectively. ",
"bbox": [
171,
103,
826,
146
],
"page_idx": 13
},
{
"type": "text",
"text": "Since CIM is built upon BEiT, we choose BEiT as the masked image modeling baseline approach of ViTs. Here, we first study the ViT-B model’s 100-epoch fine-tuning performance on ImageNet-1k val set with different pre-training schedules in Table 11. The wall-clock time of 1-epoch pre-training of CIM is about $1 . 8 \\mathrm { x }$ of BEiT (CIM has an additional tokenizer decoder compared with BEiT) on the same machine. ",
"bbox": [
174,
151,
825,
222
],
"page_idx": 13
},
{
"type": "table",
"img_path": "images/9f19c80d9892bf0eafbfada72334ba90039256ec6b69592291e8a2703246b3f1.jpg",
"table_caption": [
"Table 11: Study of the training cost for ViT-Base pre-training. "
],
"table_footnote": [],
"table_body": "<table><tr><td>Methods</td><td>PT Epochs</td><td>Relative PT Time</td><td>Top-1 Acc.</td></tr><tr><td>BEiT</td><td>300</td><td>1.0x</td><td>82.9</td></tr><tr><td>BEiT</td><td>800</td><td>2.7x</td><td>83.2</td></tr><tr><td>BEiT</td><td>1600</td><td>5.3x</td><td>83.3</td></tr><tr><td>CIM</td><td>800</td><td>1.8x</td><td>83.3</td></tr><tr><td>CIM</td><td>800</td><td>4.8x</td><td>83.4</td></tr></table>",
"bbox": [
313,
250,
684,
353
],
"page_idx": 13
},
{
"type": "text",
"text": "In Table 12, we also study the ResNet-50x4 model’s 100-epoch fine-tuning performance on ImageNet1k val set with different pre-training schedules. We choose SimMIM as the masked image modeling baseline approach of ConvNets, for it reports the ResNet-50x4 model’s result in Appendix E of its paper. The wall-clock time of 1-epoch pre-training of CIM is about $2 . 6 \\mathbf { x }$ of SimMIM (CIM has an additional generator, including a small BEiT and a tokenizer encoder & decoder compared with SimMIM) on the same machine. ",
"bbox": [
173,
376,
825,
459
],
"page_idx": 13
},
{
"type": "table",
"img_path": "images/2edaafd385f7816c24ee0c69f4e6edba89da99b65dc5010a1a3222e44ff964bb.jpg",
"table_caption": [
"Table 12: Study of the training cost for ResNet-50x4 pre-training. "
],
"table_footnote": [],
"table_body": "<table><tr><td>Methods</td><td>PT Epochs</td><td>Relative PT Time</td><td> Top-1 Acc.</td></tr><tr><td>SimMIM</td><td>300</td><td>1.0x</td><td>81.6</td></tr><tr><td>CIM</td><td>100</td><td>0.9x</td><td>82.2</td></tr></table>",
"bbox": [
310,
488,
684,
546
],
"page_idx": 13
},
{
"type": "text",
"text": "These results imply that CIM can obtain better fine-tuning performance with less pre-training time compared with baseline approaches for both ViTs and ConvNets. ",
"bbox": [
173,
566,
825,
594
],
"page_idx": 13
},
{
"type": "text",
"text": "A.2 A NOTE ON VISUALIZATIONS IN $\\ S 2 . 2$ AND FIGURE 3 ",
"text_level": 1,
"bbox": [
174,
612,
583,
627
],
"page_idx": 13
},
{
"type": "text",
"text": "Since there exists information loss in any form of normalization, we have to inject the original image’s information in order to visualize the enhancer output (4th column in Figure 3a). In order to comprehensively demonstrate our method’s behavior, we also include the unnormalized counterpart in Figure 3b for reference, where there is no additional information injection during visualization. ",
"bbox": [
174,
638,
825,
694
],
"page_idx": 13
},
{
"type": "text",
"text": "A.3 TRAINING AND OPTIMIZATION DETAILS ",
"text_level": 1,
"bbox": [
178,
710,
498,
726
],
"page_idx": 13
},
{
"type": "text",
"text": "The auxiliary generator and the enhancer are simultaneously trained and synergistically (rather than adversarially as GAN (Goodfellow et al., 2014)) updated. The trainable part of the generator, i.e., the small BEiT, learns a MIM objective in the same vein as in BEiT (Bao et al., 2021). Formally, given an input image’s patch embedding sequence $\\pmb { x } = ( \\pmb { x } _ { 1 } , . . . , \\pmb { x } _ { n } )$ , we randomly mask $k$ embeddings at positions $\\pmb { m } = ( m _ { 1 } , . . . , m _ { k } )$ using [MASK] token2. The resulting masked input sequence $_ { \\textbf { \\em x } }$ masked for BEiT is: ",
"bbox": [
173,
737,
825,
819
],
"page_idx": 13
},
{
"type": "equation",
"img_path": "images/42e8fc53e8f4be30937cdb6ace8fd64d90e6685bfa047e152d28d0e0a10d8902.jpg",
"text": "$$\n\\begin{array} { r } { m _ { i } \\sim \\mathrm { u n i f o r m } \\{ 1 , n \\} , \\mathrm { f o r } i = 1 , . . . , k , } \\\\ { \\pmb { x } ^ { \\mathrm { m a s k e d } } = \\mathrm { r e p l a c e } ( \\pmb { x } , \\pmb { m } , [ \\mathrm { M A S K } ] ) , \\quad \\quad } \\end{array}\n$$",
"text_format": "latex",
"bbox": [
356,
816,
640,
856
],
"page_idx": 13
},
{
"type": "text",
"text": "where the replace $( x , m$ , [MASK]) operation denotes using the special [MASK] token to replace patch embeddings of $_ { \\textbf { \\em x } }$ at positions $_ { m }$ . The small BEiT then encodes $x ^ { \\mathrm { m a s k e d } }$ and learns to maximize ",
"bbox": [
173,
858,
823,
887
],
"page_idx": 13
},
{
"type": "text",
"text": "$\\log p _ { \\mathrm { B E i T } } ( \\pmb { g } \\mid \\pmb { x } ^ { \\mathrm { m a s k e d } } )$ , i.e., the log-likelihood of the golden visual tokens $\\pmb { g } = ( g _ { 1 } , . . . , g _ { k } )$ at the masked positions $_ { \\mathbf { \\nabla } } \\mathbf { m } _ { \\mathbf { \\nabla } }$ conditioned on $x ^ { \\mathrm { m a s k e d } }$ . Notice that the golden tokens are obtained by feeding the original image to the image tokenizer encoder. ",
"bbox": [
174,
102,
825,
146
],
"page_idx": 14
},
{
"type": "text",
"text": "In order to generate corrupted image samples $\\mathcal { T } ^ { \\mathrm { c o r r u p t e d } }$ for the enhancer, we sample tokens’ replacements from the BEiT output distribution $p _ { \\mathrm { B E i T } }$ at each masked position $j$ of the encoded $\\pmb { x } ^ { \\mathrm { m a s k } \\bar { \\mathrm { e } } \\mathrm { d } }$ : ",
"bbox": [
169,
151,
825,
181
],
"page_idx": 14
},
{
"type": "equation",
"img_path": "images/18e6b78eddd4fd2046d76c403975aa716a6ba499d341db868418ae20e32e4835.jpg",
"text": "$$\n\\begin{array} { r l } & { x _ { j } ^ { \\mathrm { s a m p l e d } } \\sim p _ { \\mathrm { B E i T } } ( x _ { j } ^ { \\mathrm { s a m p l e d } } \\mid x ^ { \\mathrm { m a s k e d } } ) , \\mathrm { f o r } j \\in m , } \\\\ & { x ^ { \\mathrm { c o r r u p t e d } } = \\mathrm { r e p l a c e } ( g , m , x ^ { \\mathrm { s a m p l e d } } ) , } \\end{array}\n$$",
"text_format": "latex",
"bbox": [
336,
188,
660,
231
],
"page_idx": 14
},
{
"type": "text",
"text": "where the replace $( \\pmb { g } , \\pmb { m } , \\pmb { x } ^ { \\mathrm { s a m p l e d } } )$ operation denotes using the sampled visual token $x ^ { \\mathrm { s a m p l e d } }$ to replace golden tokens of $\\textbf { { g } }$ at positions $_ { m }$ . Next, the image tokenizer decoder maps $\\pmb { x } ^ { \\mathrm { c o r r u p t e d } }$ to a corrupted image $\\mathcal { T } ^ { \\mathrm { c o r r u p t e d } }$ . The whole image tokenizer is frozen (i.e., not updated throughout the pre-training phase), which directly uses the publicly available3 pre-trained DALL-E dVAE weight (Ramesh et al., 2021) following BEiT. ",
"bbox": [
173,
237,
825,
308
],
"page_idx": 14
},
{
"type": "text",
"text": "The enhancer takes the corrupted image $\\mathcal { T } ^ { \\mathrm { c o r r u p t e d } }$ as input. For the RESPIX visual pretext task, the enhancer is optimized by a combination of $l _ { 1 }$ and $l _ { 2 }$ loss for pixel regression. For the REVDET variant, the enhancer is learned by binary cross-entropy loss for replaced visual token detection. The gradients of the enhancer are not back-propagated through the generator. ",
"bbox": [
173,
313,
825,
371
],
"page_idx": 14
},
{
"type": "text",
"text": "In this paper, we study CIM self-supervised pre-trained vanilla ViT (Dosovitskiy et al., 2020) and vanilla ResNet (He et al., 2016) models. The vanilla ViT models refer to the design from (Dosovitskiy et al., 2020; Touvron et al., 2021a) without further architectural change such as using relative position embeddings (Shaw et al., 2018) and LayerScale (Touvron et al., 2021b). The vanilla ResNet-50 model refers to the torchvision ResNet-50 (Paszke et al., 2019) without any architectural change. The larger ResNet-50x2 and ResNet-50x4 models follows the canonical design in SimCLR (Chen et al., 2020b). We conduct experiments on $1 6 \\times$ or $3 2 \\times$ V100 GPUs with 32GB memory. ",
"bbox": [
173,
376,
825,
474
],
"page_idx": 14
},
{
"type": "text",
"text": "A.4 PRE-TRAINING & FINE-TUNING CONFIGURATIONS ",
"bbox": [
173,
103,
568,
117
],
"page_idx": 15
},
{
"type": "table",
"img_path": "images/4807200fe7e925dbdc60b90edd5d9d60a1d6ba86cf5df067ecbafc9f4a16b409.jpg",
"table_caption": [
"A.4.1 THE IMAGENET-1K CIM PRE-TRAINING CONFIGURATIONS FOR VANILLA VIT AND RESNET MODELS ",
"Table 13: The ImageNet-1K CIM pre-training settings for vanilla ViT-S/16, ViT-B/16 and ResNet-50 models. Notably, the pre-training configurations are almost the same for different architectures. We implement the pre-training using the codebase of BEiT (Bao et al., 2021). Mixed precision and deepspeed acceleration are used. "
],
"table_footnote": [],
"table_body": "<table><tr><td>Pre-training Config. (ViT & ResNet)</td><td>Value</td></tr><tr><td>Optimizer</td><td>AdamW (Loshchilov & Hutter, 2017)</td></tr><tr><td>Pre-training Epochs</td><td>300</td></tr><tr><td>Peak Learning Rate</td><td>1.5e-3</td></tr><tr><td>Batch Size</td><td>2048</td></tr><tr><td>Weight Decay</td><td>0.05</td></tr><tr><td>Optimizer Momentum (β1,β2)</td><td>(0.9, 0.98) (Vaswani et al., 2017)</td></tr><tr><td>Learning Rate Schedule</td><td>Cosine Decay</td></tr><tr><td>Gradient Clipping</td><td>3.0</td></tr><tr><td>Warmup Epochs</td><td>10</td></tr><tr><td>#Masked Patches for the Generator</td><td>100 to 120, Random Masking</td></tr><tr><td>The Generator's Depth</td><td>4 to 6</td></tr><tr><td>The Generator's Width</td><td>Same to the Enhancer (ViT), 384 (ResNet)</td></tr><tr><td>The Enhancer's Loss Weight</td><td>1 forREVDET,1O forREsPIX</td></tr><tr><td>Data Augmentation</td><td>RandomResizedCrop Only</td></tr><tr><td>Dropout (Srivastava et al., 2014)</td><td>X X</td></tr><tr><td>Stochastic Depth (Huang et al., 2016)</td><td></td></tr><tr><td>LayerScale (Touvron et al., 2021b) Pos.Emb.in TransformerLayers</td><td>X</td></tr><tr><td></td><td>1-D Absolute Pos. Emb. (Dosovitskiy et al., 2020)</td></tr><tr><td>Patch Size</td><td>16 224</td></tr><tr><td>Pre-training Resolution</td><td></td></tr></table>",
"bbox": [
181,
170,
812,
493
],
"page_idx": 15
},
{
"type": "table",
"img_path": "images/83efd4ce5e9f67758c2f3c0126b6bd809a111992d57dd19dce7c41206828fde1.jpg",
"table_caption": [
"A.4.2 THE IMAGENET-1K IMAGE CLASSIFICATION FINE-TUNING CONFIGURATIONS FOR VANILLA VIT MODELS ",
"Table 14: The ImageNet-1K image classification fine-tuning recipes for vanilla ViT-S/16 and ViT-B/16. We implement the fine-tuning using the codebase of BEiT (Bao et al., 2021). Mixed precision and deepspeed acceleration are used. We select the best learning rate out of $\\{ 3 \\mathrm { e } { - } 3 , 4 \\mathrm { e } { - } 3 , 5 \\mathrm { e } { - } 3 \\}$ for different sized models and pre-training objectives, and the absolute difference between the worst and the best learning rate is less than 0.3 in terms of the top-1 accuracy. "
],
"table_footnote": [],
"table_body": "<table><tr><td>Fine-tuning Config. (ViT)</td><td>Value</td></tr><tr><td>Optimizer</td><td>AdamW (Loshchilov & Hutter, 2017)</td></tr><tr><td>Fine-tuning Epochs</td><td>200 forViT-S/16,10O forViT-B/16</td></tr><tr><td>Peak Learning Rate</td><td>3e-3 forViT-B/16REsPIX,5e-3 forViT-B/16 REVDET,3e-3 or4e-3 forViT-S/16</td></tr><tr><td>Layer-wise Learning Rate Decay (Bao et al.,</td><td>0.8 (Clark et al., 2020)</td></tr><tr><td>2021) Batch Size</td><td>1024</td></tr><tr><td>Weight Decay</td><td>0.05</td></tr><tr><td>Optimizer Momentum (β1, β2)</td><td>(0.9, 0.999)</td></tr><tr><td>Learning Rate Schedule</td><td>Cosine Decay</td></tr><tr><td>Warmup Epochs</td><td>5</td></tr><tr><td>Gradient Clipping</td><td>X</td></tr><tr><td>Dropout (Srivastava et al., 2014)</td><td>X</td></tr><tr><td>Stochastic Depth (Huang et al., 2016)</td><td>0.1</td></tr><tr><td>Label Smoothing (Szegedy et al., 2016)</td><td>0.1</td></tr><tr><td>Mixup (Zhang et al., 2017)</td><td>0.8</td></tr><tr><td>CutMix (Yun et al., 2019)</td><td>1.0</td></tr><tr><td>Random Augmentation (Cubuk et al., 2020)</td><td>9 /0.5</td></tr><tr><td>Patch Size</td><td>16</td></tr><tr><td>Fine-tuning Resolution</td><td>224</td></tr><tr><td>Test Resolution</td><td>224</td></tr><tr><td>Test Crop Ratio</td><td>0.95</td></tr><tr><td>Loss Function</td><td>Cross Entropy Loss</td></tr></table>",
"bbox": [
181,
145,
810,
496
],
"page_idx": 16
},
{
"type": "table",
"img_path": "images/7960520ef2506bb75f22ffff775afd2c62315d6c6cf140e221c32d08d23acb6c.jpg",
"table_caption": [
"A.4.3 THE IMAGENET-1K IMAGE CLASSIFICATION FINE-TUNING CONFIGURATIONS FOR VANILLA RESNET-50 ",
"Table 15: The ImageNet-1K image classification fine-tuning recipes for vanilla ResNet-50. We use the AdamW optimizer. The hyperparameter settings basically follows (Wightman et al., 2021). We implement the fine-tuning based on the codebase of BEiT (Bao et al., 2021). Mixed precision and deepspeed acceleration are used. For other self-supervised baseline approaches we compared in Table 2, we select the best learning rate out of $\\{ 5 \\mathrm { e } { - } 3 , 8 \\mathrm { e } { - } 3 , 1 2 \\mathrm { e } { - } 3 \\}$ and keep other settings unchanged. "
],
"table_footnote": [],
"table_body": "<table><tr><td>Fine-tuning Config. (ResNet-50)</td><td>100 Epoch FT</td><td>300Epoch FT</td><td>600 Epoch FT</td></tr><tr><td>Optimizer</td><td colspan=\"3\">AdamW (Loshchilov & Hutter, 2017)</td></tr><tr><td>Peak Learning Rate</td><td colspan=\"3\">12e-3</td></tr><tr><td>Layer-wise Learning Rate Decay (Bao et al., 2021)</td><td colspan=\"3\">X</td></tr><tr><td>Batch Size</td><td colspan=\"3\">2048</td></tr><tr><td>Learning Rate Schedule</td><td colspan=\"3\">Cosine Decay</td></tr><tr><td>Loss Function</td><td colspan=\"3\">Binary Cross Entropy Loss</td></tr><tr><td>Warmup Epochs</td><td colspan=\"3\">5</td></tr><tr><td>Weight Decay</td><td>0.02</td><td>0.02</td><td>0.01</td></tr><tr><td>Fine-tuning Resolution</td><td>160</td><td>224</td><td>224</td></tr><tr><td>Test Resolution</td><td></td><td>224</td><td></td></tr><tr><td>Test Crop Ratio</td><td></td><td>0.95</td><td></td></tr><tr><td>Repeated Augmentation (Berman et al.,</td><td>X</td><td>√</td><td>1</td></tr><tr><td>2019; Hoffer et al., 2019) Random Augmentation (Cubuk et al.,</td><td>6/0.5</td><td>7 /0.5</td><td>7 /0.5</td></tr><tr><td>2020)</td><td></td><td></td><td></td></tr><tr><td>Mixup (Zhang et al., 2017) CutMix (Yun et al., 2019)</td><td>0.1</td><td>0.1 1.0</td><td>0.2</td></tr><tr><td>Label Smoothing (Szegedy et al., 2016)</td><td>0.1</td><td></td><td>0.1</td></tr><tr><td>Stochastic Depth (Huang et al.,2016)</td><td></td><td>X</td><td></td></tr><tr><td></td><td>X</td><td>X</td><td>0.05</td></tr><tr><td>Dropout (Srivastava et al., 2014)</td><td></td><td>X</td><td></td></tr><tr><td>Layer-wise Learning Rate Decay</td><td></td><td>X</td><td></td></tr></table>",
"bbox": [
178,
145,
815,
482
],
"page_idx": 17
}
] |