File size: 81,906 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 | {
"paper_id": "2022",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T15:24:41.701659Z"
},
"title": "Improving Discriminative Learning for Zero-Shot Relation Extraction",
"authors": [
{
"first": "Van-Hien",
"middle": [],
"last": "Tran",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Nara Institute of Science and Technology",
"location": {
"country": "Japan"
}
},
"email": "tran.van_hien.ts1@is.naist.jp"
},
{
"first": "Hiroki",
"middle": [],
"last": "Ouchi",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Nara Institute of Science and Technology",
"location": {
"country": "Japan"
}
},
"email": "hiroki.ouchi@is.naist.jp"
},
{
"first": "Taro",
"middle": [],
"last": "Watanabe",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Nara Institute of Science and Technology",
"location": {
"country": "Japan"
}
},
"email": ""
},
{
"first": "Yuji",
"middle": [],
"last": "Matsumoto",
"suffix": "",
"affiliation": {},
"email": "yuji.matsumoto@riken.jp"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Zero-shot relation extraction (ZSRE) aims to predict target relations that cannot be observed during training. While most previous studies have focused on fully supervised relation extraction and achieved considerably high performance, less effort has been made towards ZSRE. This study proposes a new model incorporating discriminative embedding learning for both sentences and semantic relations. In addition, a self-adaptive comparator network is used to judge whether the relationship between a sentence and a relation is consistent. Experimental results on two benchmark datasets showed that the proposed method significantly outperforms the state-of-the-art methods.",
"pdf_parse": {
"paper_id": "2022",
"_pdf_hash": "",
"abstract": [
{
"text": "Zero-shot relation extraction (ZSRE) aims to predict target relations that cannot be observed during training. While most previous studies have focused on fully supervised relation extraction and achieved considerably high performance, less effort has been made towards ZSRE. This study proposes a new model incorporating discriminative embedding learning for both sentences and semantic relations. In addition, a self-adaptive comparator network is used to judge whether the relationship between a sentence and a relation is consistent. Experimental results on two benchmark datasets showed that the proposed method significantly outperforms the state-of-the-art methods.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Relation extraction is a fundamental task in Natural Language Processing (NLP) that predicts the semantic relation between two entities in a given sentence. It has attracted considerable research effort as it plays a vital role in many NLP applications such as Information Extraction (Tran et al., 2021a,b) and Question Answering (Xu et al., 2016) .",
"cite_spans": [
{
"start": 284,
"end": 306,
"text": "(Tran et al., 2021a,b)",
"ref_id": null
},
{
"start": 330,
"end": 347,
"text": "(Xu et al., 2016)",
"ref_id": "BIBREF20"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Most recent studies (Tran et al., 2019; Tian et al., 2021) treated this task in a fully supervised manner and achieved excellent performance. However, the supervised models cannot extract relations that are not predefined or observed during training, while many new relations always exist in real-world scenarios. Thus, it is worth enabling models to predict new relations that have never been seen before. Such a task is considered as zero-shot learning (Xian et al., 2019) , where a key to achieving high performance is how to generalize a model to unseen classes by using a limited number of seen classes.",
"cite_spans": [
{
"start": 20,
"end": 39,
"text": "(Tran et al., 2019;",
"ref_id": "BIBREF16"
},
{
"start": 40,
"end": 58,
"text": "Tian et al., 2021)",
"ref_id": "BIBREF14"
},
{
"start": 455,
"end": 474,
"text": "(Xian et al., 2019)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "However, there are only a few existing studies on zero-shot relation extraction (ZSRE). Levy et al. (2017) tackled this task by using reading comprehension models with predefined question templates. Obamuyide and Vlachos (2018) simply reduced ZSRE to a text entailment task, utilizing existing textual entailment models. Recently, Chen and Li (2021) presented ZS-BERT, which projects sentences and relations into a shared space and uses the nearest neighbor search to predict unseen relations.",
"cite_spans": [
{
"start": 88,
"end": 106,
"text": "Levy et al. (2017)",
"ref_id": "BIBREF7"
},
{
"start": 199,
"end": 227,
"text": "Obamuyide and Vlachos (2018)",
"ref_id": "BIBREF9"
},
{
"start": 331,
"end": 349,
"text": "Chen and Li (2021)",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The previous studies overlooked the importance of learning discriminative embeddings. In essence, the discriminative learning helps models to better distinguish relations, especially on similar relations. Our study focuses on this aspect and demonstrates its significance for improving ZSRE. Specifically, we propose a new model that incorporates discriminative embedding learning (Han et al., 2021) for both sentences and semantic relations, which is inspired by contrastive learning (Chen et al., 2020) commonly used in computer vision. In addition, instead of using distance metrics to predict unseen relations as done by Chen and Li (2021) , we use a self-adaptive comparator network to judge whether the relationship between a sentence and a relation is consistent. This verification process helps the model to learn more discriminative embeddings. Experimental results on two datasets showed that our method significantly outperforms the existing methods for ZSRE.",
"cite_spans": [
{
"start": 381,
"end": 399,
"text": "(Han et al., 2021)",
"ref_id": "BIBREF4"
},
{
"start": 485,
"end": 504,
"text": "(Chen et al., 2020)",
"ref_id": "BIBREF2"
},
{
"start": 625,
"end": 643,
"text": "Chen and Li (2021)",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "To date, ZSRE has been under-investigated so far. Levy et al. (2017) formulated ZSRE as a questionanswering task. They first manually created 10 question templates for each relation type and then trained a reading comprehension model. Because it requires the effort of hand-crafted labeling, this method can be unfeasible and impractical to define templates of new-coming unseen relations. Obamuyide and Vlachos (2018) converted ZSRE to a textual entailment task, in which the input sentence containing two entities is considered as the premise P, whereas the relation description containing the same entity pair is regarded as the hypothesis H.",
"cite_spans": [
{
"start": 50,
"end": 68,
"text": "Levy et al. (2017)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "They then used existing textual entailment models (Rockt\u00e4schel et al., 2016; Chen et al., 2017) as their base models, although these models may not be entirely relevant for ZSRE. The closest to our work is research by Chen and Li (2021) . First, they proposed the ZS-BERT model, which learns two functions to project sentences and relation descriptions into a shared embedding space. Then, they used the nearest neighbor search to predict unseen predictions; however, it is prone to suffer the hubness problem (Radovanovic et al., 2010) . Unlike the previous studies, our work emphasizes the necessity of discriminative embedding learning that may play a vital role in solving the ZSRE.",
"cite_spans": [
{
"start": 50,
"end": 76,
"text": "(Rockt\u00e4schel et al., 2016;",
"ref_id": "BIBREF12"
},
{
"start": 77,
"end": 95,
"text": "Chen et al., 2017)",
"ref_id": "BIBREF1"
},
{
"start": 218,
"end": 236,
"text": "Chen and Li (2021)",
"ref_id": "BIBREF0"
},
{
"start": 510,
"end": 536,
"text": "(Radovanovic et al., 2010)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "3 Proposed Model",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "Let Y S and Y U denote the sets of seen and unseen relation labels, respectively. They are disjoint, i.e., Y S \u2229Y U = \u2205. Given a training set with n S samples, the i th sample consists of the input sentence X i , the entities e i1 and e i2 , and the description D i of the corresponding seen relation label",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Task Definition",
"sec_num": "3.1"
},
{
"text": "y i s \u2208 Y S , hereby denoted as S i = X i , e i1 , e i2 , D i , y i s n S i=1 . Us- ing the training set, we train a relation model M, i.e., M (S i ) \u2192 y i s \u2208 Y S .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Task Definition",
"sec_num": "3.1"
},
{
"text": "In the test stage, given a testing sentence S \u2032 consisting of two entities and the descriptions of all unseen relation labels in Y U , M predicts the unseen relation y j u \u2208 Y U for S \u2032 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Task Definition",
"sec_num": "3.1"
},
{
"text": "Sentence Encoder. From the input sentence, we add four entity marker tokens ([E1], [/E1], [E2], and [/E2]) to annotate two entities, e i1 and e i2 . Then, we tokenize and input them through a pretrained BERT encoder (Devlin et al., 2019) . Finally, we obtain the vector representing the relation between the two entities by concatenating the two vectors of the start tokens ([E1] and [E2]).",
"cite_spans": [
{
"start": 216,
"end": 237,
"text": "(Devlin et al., 2019)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Framework",
"sec_num": "3.2"
},
{
"text": "Relation Encoder. Most relations are well defined, and their descriptions are available from open resources such as Wikidata (Chen and Li, 2021) . For each relation, e.g., \"founded by\", we input its description to the pre-trained Sentence-BERT encoder (Reimers and Gurevych, 2019) and obtain the representation vector by using the mean pooling operation on the outputs.",
"cite_spans": [
{
"start": 125,
"end": 144,
"text": "(Chen and Li, 2021)",
"ref_id": "BIBREF0"
},
{
"start": 252,
"end": 280,
"text": "(Reimers and Gurevych, 2019)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Framework",
"sec_num": "3.2"
},
{
"text": "Overview of the Model. On the basis of the two modules above, we present our full model in Figure 1. Given a training mini-batch of N sentences, we feed them into the Sentence Encoder and a subsequent nonlinear projector to obtain N final sentence embeddings. Simultaneously, we acquire K different relations from the N sentences. The K corresponding descriptions of the K relations are then fed into the Relation Encoder and a subsequent nonlinear projector to acquire the final relation embeddings. To obtain more discriminative embeddings, we introduce the learning constraints described in detail later. Finally, we concatenate pairs from the two spaces and use a network F to judge whether the relationship between a sentence and a relation is consistent.",
"cite_spans": [],
"ref_spans": [
{
"start": 91,
"end": 97,
"text": "Figure",
"ref_id": null
}
],
"eq_spans": [],
"section": "Framework",
"sec_num": "3.2"
},
{
"text": "To boost the learning of discriminative embeddings for sentences and relations, we consider three main goals in training: (1) discriminative sentence embeddings, (2) discriminative relation embeddings, and (3) an effective comparator network F.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Model Training",
"sec_num": "3.3"
},
{
"text": "Discriminative Sentence Embeddings. In Figure 1, given a mini-batch of N sentences, we obtain N corresponding sentence embeddings:",
"cite_spans": [],
"ref_spans": [
{
"start": 39,
"end": 45,
"text": "Figure",
"ref_id": null
}
],
"eq_spans": [],
"section": "Model Training",
"sec_num": "3.3"
},
{
"text": "[s 1 , s 2 , . . ., s N ].",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Model Training",
"sec_num": "3.3"
},
{
"text": "To learn the discriminative features, we first use a softmax multi-class relation classifier to predict the seen relation for each sentence:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Model Training",
"sec_num": "3.3"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "L Softmax = \u2212 1 N N i y i s log(\u0177 s i ),",
"eq_num": "(1)"
}
],
"section": "Model Training",
"sec_num": "3.3"
},
{
"text": "where y i s \u2208 Y S is the ground-truth seen relation label of the i th sentence and\u0177 s i is the predicted probability of y i s . However, such a softmax loss only encourages the separability of the inter-class features. Meanwhile, discriminative power characterizes features in both the separable inter-class differences and the compact intra-class variations (Wen et al., 2016) . Thus, we use another loss to ensure the intra-class compactness. First, the similarity distance between two sentences is given by",
"cite_spans": [
{
"start": 359,
"end": 377,
"text": "(Wen et al., 2016)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Model Training",
"sec_num": "3.3"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "d (s i , s j ) = 1/(1 + exp( s i \u2225s i \u2225 \u2022 s j \u2225s j \u2225 )).",
"eq_num": "(2)"
}
],
"section": "Model Training",
"sec_num": "3.3"
},
{
"text": "Clearly, this value should be small for any sentence pair of the same relation (positive pair) and large for a negative pair. We then apply such distance constraints on all T unordered sentence pairs, where (3)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Model Training",
"sec_num": "3.3"
},
{
"text": "L S2S = \u2212 1 T N \u22121 i=1 N j=i+1 I ij log d(s i , s j ) + (1 \u2212 I ij ) log(1 \u2212 d(s i , s j )) ,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Model Training",
"sec_num": "3.3"
},
{
"text": "where",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Model Training",
"sec_num": "3.3"
},
{
"text": "I ij = 1 if the pair (s i , s j )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Model Training",
"sec_num": "3.3"
},
{
"text": "is positive or 0 otherwise. L S2S not only ensures the intra-relation compactness but also encourages the inter-relation separability further. Finally, the final loss of learning discriminative sentence embeddings in the sentence embedding space is defined as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Model Training",
"sec_num": "3.3"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "L sent = L Sof tmax + \u03b3 \u2022 L S2S ,",
"eq_num": "(4)"
}
],
"section": "Model Training",
"sec_num": "3.3"
},
{
"text": "where \u03b3 is a hyperparameter. With this joint supervision, it is expected that not only the inter-class sentence embedding differences are enlarged, but also the intra-class sentence embedding variations are reduced. Thus, the discriminative power of the learned sentence embeddings will be enhanced.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Model Training",
"sec_num": "3.3"
},
{
"text": "Discriminative Relation Embeddings. In Figure 1, we obtain K corresponding relation embeddings: [r 1 , r 2 , . . ., r K ] for K different relations in the relation embedding space. From the K relations, we have a total of Q pairs (Q = K(K \u2212 1)/2), where each pair includes two different unordered relations. Thus, we maximize distance for each of these pairs and define the loss of learning discriminative relation embeddings by",
"cite_spans": [],
"ref_spans": [
{
"start": 39,
"end": 45,
"text": "Figure",
"ref_id": null
}
],
"eq_spans": [],
"section": "Model Training",
"sec_num": "3.3"
},
{
"text": "(5) L rel = \u2212 1 Q K\u22121 i=1 K j=i+1 log(1 \u2212 d(r i , r j )),",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Model Training",
"sec_num": "3.3"
},
{
"text": "where d(r i , r j ) is the similarity distance between two relations using Equation 2.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Model Training",
"sec_num": "3.3"
},
{
"text": "Comparator Network. After obtaining the discriminative embeddings of sentences and relations, we use a comparator network F to judge how well a sentence is consistent with a specific relation. This validation information will guide our model to learn more discriminative embeddings. In Figure 1, we concatenate sentences and relations as pairs and feed them into F. To enhance the training efficiency, we control the rate of positive and negative pairs. Specifically, we keep all positive pairs but randomly keep only a part of negative pairs (e.g., positive:negative rate is 1:3). The F is a two-layer nonlinear neural network that outputs a scalar similarity score in the range of (0,1]. Finally, the loss of training F is defined as",
"cite_spans": [],
"ref_spans": [
{
"start": 286,
"end": 292,
"text": "Figure",
"ref_id": null
}
],
"eq_spans": [],
"section": "Model Training",
"sec_num": "3.3"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "L F = \u2212 Npos i=1 log v i + Nneg j=1 log (1 \u2212 v j ) N pos + N neg ,",
"eq_num": "(6)"
}
],
"section": "Model Training",
"sec_num": "3.3"
},
{
"text": "where v i and v j are the similarity scores of the i th positive pair and j th negative pair, respectively; N pos and N neg are the number of positive pairs and negative pairs for training.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Model Training",
"sec_num": "3.3"
},
{
"text": "Total Loss. Based on the three aforementioned losses, the full loss function for training our model is as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Model Training",
"sec_num": "3.3"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "L = L F + \u03b1L sent + \u03b2L rel ,",
"eq_num": "(7)"
}
],
"section": "Model Training",
"sec_num": "3.3"
},
{
"text": "where \u03b1 and \u03b2 are hyperparameters that control the importance of L sent and L rel , respectively.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Model Training",
"sec_num": "3.3"
},
{
"text": "In the testing stage, we conduct zero-shot relation prediction by comparing the similarity score of a given sentence with all the unseen semantic relation representations. We classify the sentence s i to the unseen relation that has the largest similarity score among relations, which can be formulated as",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Zero-Shot Relation Prediction",
"sec_num": "3.4"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "P zsre (s i ) = max j {v ij } |Y U | j=1 .",
"eq_num": "(8)"
}
],
"section": "Zero-Shot Relation Prediction",
"sec_num": "3.4"
},
{
"text": "4 Experiments",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Zero-Shot Relation Prediction",
"sec_num": "3.4"
},
{
"text": "Following the previous work (Chen and Li, 2021) , we evaluate our model on two benchmark datasets: Wiki-ZSL and FewRel (Han et al., 2018) . FewRel is a human-annotated balanced dataset consisting of 80 relation types, each of which has 700 instances. Wiki-ZSL is a subset of Wiki-KB dataset (Sorokin and Gurevych, 2017) , which filters out both the \"none\" relation and relations that appear fewer than 300 times. ",
"cite_spans": [
{
"start": 28,
"end": 47,
"text": "(Chen and Li, 2021)",
"ref_id": "BIBREF0"
},
{
"start": 119,
"end": 137,
"text": "(Han et al., 2018)",
"ref_id": "BIBREF5"
},
{
"start": 291,
"end": 319,
"text": "(Sorokin and Gurevych, 2017)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Dataset",
"sec_num": "4.1"
},
{
"text": "Following Chen and Li (2021), we randomly selected m relations as unseen ones (m = |Y U |) for the testing set and split the entire dataset into the training and testing datasets accordingly. This guarantees that the m relations in the testing dataset do not appear in the training dataset. We used macro precision (P), macro recall (R), and macro F1-score (F1) as the evaluation metrics. We implemented the neural networks using the PyTorch library 2 . The tanh function is used with each nonlinear projector in our model. The comparator network F is a two-layer nonlinear neural network in which the hidden layer is equipped with the tanh function, and the output layer size is outfitted with the sigmoid function. 2021; \u2020 marks the results we reproduced using the official source code of Chen and Li (2021) .",
"cite_spans": [
{
"start": 791,
"end": 809,
"text": "Chen and Li (2021)",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Settings",
"sec_num": "4.2"
},
{
"text": "technique was applied at a rate of 0.3 on the hidden layer and embeddings of sentences and relations in the two embedding spaces. We used Adam (Kingma and Ba, 2015) as the optimizer, in which the initial learning rate was 5e \u2212 6; the batch size was 16 on FewRel and 32 on Wiki-ZSL; and \u03b1 = 0.7, \u03b2 = 0.3, and \u03b3 = 0.5.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Settings",
"sec_num": "4.2"
},
{
"text": "Main Result. The experimental results obtained by varying m unseen relations are shown in Table 2 . It can be observed that our model steadily outperforms the competing methods on the test datasets when considering different values of m. In addition, the improvement in our model is smaller when m is larger. An increase in m leads to a rise in the possible choices for prediction, thereby making it more difficult to predict the correct unseen relation. Obamuyide and Vlachos (2018) simply used two basic text entailment models (ESIM and CIM) that may not be entirely relevant for ZSRE. Besides, they ignored the importance of discriminative feature learning for sentences and relations. Chen and Li (2021) also overlooked the necessity of learning discriminative embeddings. In addition, the nearest neighbor search method in ZS-BERT is prone to cause the hubness problem (Radovanovic et al., 2010) . Thus, our model was designed to overcome the existing limitations. Compared with ZS-BERT, our model significantly improved its performance when m = 5, by 9.22 and 7.25 F 1-score on Wiki- ZSL and FewRel, respectively.",
"cite_spans": [
{
"start": 689,
"end": 707,
"text": "Chen and Li (2021)",
"ref_id": "BIBREF0"
},
{
"start": 874,
"end": 900,
"text": "(Radovanovic et al., 2010)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [
{
"start": 90,
"end": 97,
"text": "Table 2",
"ref_id": "TABREF3"
}
],
"eq_spans": [],
"section": "Results and Analysis",
"sec_num": "4.3"
},
{
"text": "Impact of Discriminative Learning. To gain more insight into the improvement in our model, we analyzed the importance of learning discriminative features in both the sentence and relation spaces. In Table 3 , we consider three special cases of Equation 7: (1) \u03b1 = 0 means no L sent ;",
"cite_spans": [],
"ref_spans": [
{
"start": 199,
"end": 206,
"text": "Table 3",
"ref_id": "TABREF5"
}
],
"eq_spans": [],
"section": "Results and Analysis",
"sec_num": "4.3"
},
{
"text": "(2) \u03b2 = 0 means no L rel ; and (3) \u03b3 = 0 means no L S2S , which is a part of L sent . Clearly, all three losses are important for training our model to obtain the best performance. In particular, L sent for learning discriminative sentence features is more important than L rel for learning discriminative relation embeddings, as the performance decreases significantly after removing it. In addition, L S2S plays a vital role in L sent since it mainly ensures the intra-relation compactness property of discriminative sentence embeddings.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Results and Analysis",
"sec_num": "4.3"
},
{
"text": "Feature Space Visualization. We visualized the testing sentence embeddings produced by ZS-BERT and our model in a case of m = 5 on the FewRel 3 dataset using t-SNE (Maaten and Hin ton, 2008) . Figure 2 shows that the embeddings generated by our model express not only a larger inter-relation separability but also a better intrarelation compactness, compared with the embeddings by ZS-BERT. Besides, we focus on two relations: \"country\" and \"location\". According to their descriptions (country 4 and location 5 ), we can see that they are somewhat similar but different in some details. Specifically, an ordered entity pair (e1, e2) in a sentence expresses the relation \"country\" if and only if e2 must be a country and e2 has sovereignty over e1. Meanwhile, if the entity pair (e1, e2) does not hold the relation \"country\", it may appear the relation \"location\" when e2 is a place that e1 happens or exists. Thus, the two similar re- lations make it difficult for ZS-BERT to distinguish them. Meanwhile, our model can discriminate between them. These observations again prove the necessity of learning discriminative features for ZSRE.",
"cite_spans": [
{
"start": 180,
"end": 190,
"text": "ton, 2008)",
"ref_id": null
}
],
"ref_spans": [
{
"start": 164,
"end": 179,
"text": "(Maaten and Hin",
"ref_id": null
},
{
"start": 193,
"end": 201,
"text": "Figure 2",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Results and Analysis",
"sec_num": "4.3"
},
{
"text": "In this work, we present a new model to solve the ZSRE task. Our model aims to enhance the discriminative embedding learning for both sentences and relations. It boosts inter-relation separability and intra-relation compactness of sentence embeddings and maximizes distances between different relation embeddings. In addition, a comparator network is used to validate the consistency between a sentence and a relation. Experimental results on two benchmark datasets demonstrated the superiority of the proposed model for ZSRE.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "5"
},
{
"text": "The FewRel dataset is annotated by crowdworkers, thereby ensuring high quality.4 https://www.wikidata.org/wiki/ Property:P175 https://www.wikidata.org/wiki/ Property:P27",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "ZS-BERT: Towards zero-shot relation extraction with attribute representation learning",
"authors": [
{
"first": "Chih-Yao",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Cheng-Te",
"middle": [],
"last": "Li",
"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": "3470--3479",
"other_ids": {
"DOI": [
"10.18653/v1/2021.naacl-main.272"
]
},
"num": null,
"urls": [],
"raw_text": "Chih-Yao Chen and Cheng-Te Li. 2021. ZS-BERT: Towards zero-shot relation extraction with attribute representation learning. In Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pages 3470-3479, Online. Association for Computational Linguistics.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Enhanced LSTM for natural language inference",
"authors": [
{
"first": "Qian",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Xiaodan",
"middle": [],
"last": "Zhu",
"suffix": ""
},
{
"first": "Zhen-Hua",
"middle": [],
"last": "Ling",
"suffix": ""
},
{
"first": "Si",
"middle": [],
"last": "Wei",
"suffix": ""
},
{
"first": "Hui",
"middle": [],
"last": "Jiang",
"suffix": ""
},
{
"first": "Diana",
"middle": [],
"last": "Inkpen",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "1657--1668",
"other_ids": {
"DOI": [
"10.18653/v1/P17-1152"
]
},
"num": null,
"urls": [],
"raw_text": "Qian Chen, Xiaodan Zhu, Zhen-Hua Ling, Si Wei, Hui Jiang, and Diana Inkpen. 2017. Enhanced LSTM for natural language inference. In Proceedings of the 55th Annual Meeting of the Association for Com- putational Linguistics (Volume 1: Long Papers), pages 1657-1668, Vancouver, Canada. Association for Computational Linguistics.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "A simple framework for contrastive learning of visual representations",
"authors": [
{
"first": "Ting",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Simon",
"middle": [],
"last": "Kornblith",
"suffix": ""
},
{
"first": "Mohammad",
"middle": [],
"last": "Norouzi",
"suffix": ""
},
{
"first": "Geoffrey",
"middle": [],
"last": "Hinton",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the 37th International Conference on Machine Learning",
"volume": "119",
"issue": "",
"pages": "1597--1607",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ting Chen, Simon Kornblith, Mohammad Norouzi, and Geoffrey Hinton. 2020. A simple framework for contrastive learning of visual representations. In Proceedings of the 37th International Conference on Machine Learning, volume 119 of Proceedings of Machine Learning Research, pages 1597-1607. PMLR.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "BERT: Pre-training of deep bidirectional transformers for language understanding",
"authors": [
{
"first": "Jacob",
"middle": [],
"last": "Devlin",
"suffix": ""
},
{
"first": "Ming-Wei",
"middle": [],
"last": "Chang",
"suffix": ""
},
{
"first": "Kenton",
"middle": [],
"last": "Lee",
"suffix": ""
},
{
"first": "Kristina",
"middle": [],
"last": "Toutanova",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "1",
"issue": "",
"pages": "4171--4186",
"other_ids": {
"DOI": [
"10.18653/v1/N19-1423"
]
},
"num": null,
"urls": [],
"raw_text": "Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2019. BERT: Pre-training of deep bidirectional transformers for language under- standing. In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Tech- nologies, Volume 1 (Long and Short Papers), pages 4171-4186, Minneapolis, Minnesota. Association for Computational Linguistics.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Learning discriminative and unbiased representations for few-shot relation extraction",
"authors": [
{
"first": "Jiale",
"middle": [],
"last": "Han",
"suffix": ""
},
{
"first": "Bo",
"middle": [],
"last": "Cheng",
"suffix": ""
},
{
"first": "Guoshun",
"middle": [],
"last": "Nan",
"suffix": ""
}
],
"year": 2021,
"venue": "Proceedings of the 30th ACM International Conference on Information amp; Knowledge Management, CIKM '21",
"volume": "",
"issue": "",
"pages": "638--648",
"other_ids": {
"DOI": [
"10.1145/3459637.3482268"
]
},
"num": null,
"urls": [],
"raw_text": "Jiale Han, Bo Cheng, and Guoshun Nan. 2021. Learn- ing discriminative and unbiased representations for few-shot relation extraction. In Proceedings of the 30th ACM International Conference on Information amp; Knowledge Management, CIKM '21, page 638-648, New York, NY, USA. Association for Com- puting Machinery.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "FewRel: A large-scale supervised few-shot relation classification dataset with state-of-the-art evaluation",
"authors": [
{
"first": "Xu",
"middle": [],
"last": "Han",
"suffix": ""
},
{
"first": "Hao",
"middle": [],
"last": "Zhu",
"suffix": ""
},
{
"first": "Pengfei",
"middle": [],
"last": "Yu",
"suffix": ""
},
{
"first": "Ziyun",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Yuan",
"middle": [],
"last": "Yao",
"suffix": ""
},
{
"first": "Zhiyuan",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Maosong",
"middle": [],
"last": "Sun",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "4803--4809",
"other_ids": {
"DOI": [
"10.18653/v1/D18-1514"
]
},
"num": null,
"urls": [],
"raw_text": "Xu Han, Hao Zhu, Pengfei Yu, Ziyun Wang, Yuan Yao, Zhiyuan Liu, and Maosong Sun. 2018. FewRel: A large-scale supervised few-shot relation classification dataset with state-of-the-art evaluation. In Proceed- ings of the 2018 Conference on Empirical Methods in Natural Language Processing, pages 4803-4809, Brussels, Belgium. Association for Computational Linguistics.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Adam: A method for stochastic optimization",
"authors": [
{
"first": "P",
"middle": [],
"last": "Diederik",
"suffix": ""
},
{
"first": "Jimmy",
"middle": [],
"last": "Kingma",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Ba",
"suffix": ""
}
],
"year": 2015,
"venue": "3rd International Conference on Learning Representations",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Diederik P. Kingma and Jimmy Ba. 2015. Adam: A method for stochastic optimization. In 3rd Inter- national Conference on Learning Representations, ICLR 2015, San Diego, CA, USA, May 7-9, 2015, Conference Track Proceedings.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Zero-shot relation extraction via reading comprehension",
"authors": [
{
"first": "Omer",
"middle": [],
"last": "Levy",
"suffix": ""
},
{
"first": "Minjoon",
"middle": [],
"last": "Seo",
"suffix": ""
},
{
"first": "Eunsol",
"middle": [],
"last": "Choi",
"suffix": ""
},
{
"first": "Luke",
"middle": [],
"last": "Zettlemoyer",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 21st Conference on Computational Natural Language Learning",
"volume": "",
"issue": "",
"pages": "333--342",
"other_ids": {
"DOI": [
"10.18653/v1/K17-1034"
]
},
"num": null,
"urls": [],
"raw_text": "Omer Levy, Minjoon Seo, Eunsol Choi, and Luke Zettlemoyer. 2017. Zero-shot relation extraction via reading comprehension. In Proceedings of the 21st Conference on Computational Natural Language Learning (CoNLL 2017), pages 333-342, Vancouver, Canada. Association for Computational Linguistics.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Visualizing data using t-sne",
"authors": [
{
"first": "Laurens",
"middle": [],
"last": "Van Der Maaten",
"suffix": ""
},
{
"first": "Geoffrey",
"middle": [],
"last": "Hinton",
"suffix": ""
}
],
"year": 2008,
"venue": "Journal of Machine Learning Research",
"volume": "9",
"issue": "86",
"pages": "2579--2605",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Laurens van der Maaten and Geoffrey Hinton. 2008. Visualizing data using t-sne. Journal of Machine Learning Research, 9(86):2579-2605.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Zeroshot relation classification as textual entailment",
"authors": [
{
"first": "Abiola",
"middle": [],
"last": "Obamuyide",
"suffix": ""
},
{
"first": "Andreas",
"middle": [],
"last": "Vlachos",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the First Workshop on Fact Extraction and VERification (FEVER)",
"volume": "",
"issue": "",
"pages": "72--78",
"other_ids": {
"DOI": [
"10.18653/v1/W18-5511"
]
},
"num": null,
"urls": [],
"raw_text": "Abiola Obamuyide and Andreas Vlachos. 2018. Zero- shot relation classification as textual entailment. In Proceedings of the First Workshop on Fact Extraction and VERification (FEVER), pages 72-78, Brussels, Belgium. Association for Computational Linguistics.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Hubs in space: Popular nearest neighbors in high-dimensional data",
"authors": [
{
"first": "Milos",
"middle": [],
"last": "Radovanovic",
"suffix": ""
},
{
"first": "Alexandros",
"middle": [],
"last": "Nanopoulos",
"suffix": ""
},
{
"first": "Mirjana",
"middle": [],
"last": "Ivanovic",
"suffix": ""
}
],
"year": 2010,
"venue": "Journal of Machine Learning Research",
"volume": "11",
"issue": "",
"pages": "2487--2531",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Milos Radovanovic, Alexandros Nanopoulos, and Mir- jana Ivanovic. 2010. Hubs in space: Popular nearest neighbors in high-dimensional data. Journal of Ma- chine Learning Research, 11:2487-2531.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Sentence-BERT: Sentence embeddings using Siamese BERTnetworks",
"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": "3982--3992",
"other_ids": {
"DOI": [
"10.18653/v1/D19-1410"
]
},
"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 Natu- ral Language Processing (EMNLP-IJCNLP), pages 3982-3992, Hong Kong, China. Association for Com- putational Linguistics.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Reasoning about entailment with neural attention",
"authors": [
{
"first": "Tim",
"middle": [],
"last": "Rockt\u00e4schel",
"suffix": ""
},
{
"first": "Edward",
"middle": [],
"last": "Grefenstette",
"suffix": ""
},
{
"first": "Karl",
"middle": [
"Moritz"
],
"last": "Hermann",
"suffix": ""
},
{
"first": "Tom\u00e1s",
"middle": [],
"last": "Kocisk\u00fd",
"suffix": ""
},
{
"first": "Phil",
"middle": [],
"last": "Blunsom",
"suffix": ""
}
],
"year": 2016,
"venue": "4th International Conference on Learning Representations",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tim Rockt\u00e4schel, Edward Grefenstette, Karl Moritz Hermann, Tom\u00e1s Kocisk\u00fd, and Phil Blunsom. 2016. Reasoning about entailment with neural attention. In 4th International Conference on Learning Represen- tations, ICLR 2016, San Juan, Puerto Rico, May 2-4, 2016, Conference Track Proceedings.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Contextaware representations for knowledge base relation extraction",
"authors": [
{
"first": "Daniil",
"middle": [],
"last": "Sorokin",
"suffix": ""
},
{
"first": "Iryna",
"middle": [],
"last": "Gurevych",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "1784--1789",
"other_ids": {
"DOI": [
"10.18653/v1/D17-1188"
]
},
"num": null,
"urls": [],
"raw_text": "Daniil Sorokin and Iryna Gurevych. 2017. Context- aware representations for knowledge base relation extraction. In Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing, pages 1784-1789, Copenhagen, Denmark. Associa- tion for Computational Linguistics.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Dependency-driven relation extraction with attentive graph convolutional networks",
"authors": [
{
"first": "Yuanhe",
"middle": [],
"last": "Tian",
"suffix": ""
},
{
"first": "Guimin",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Yan",
"middle": [],
"last": "Song",
"suffix": ""
},
{
"first": "Xiang",
"middle": [],
"last": "Wan",
"suffix": ""
}
],
"year": 2021,
"venue": "Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing",
"volume": "1",
"issue": "",
"pages": "4458--4471",
"other_ids": {
"DOI": [
"10.18653/v1/2021.acl-long.344"
]
},
"num": null,
"urls": [],
"raw_text": "Yuanhe Tian, Guimin Chen, Yan Song, and Xiang Wan. 2021. Dependency-driven relation extraction with attentive graph convolutional networks. In Proceed- ings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), pages 4458-4471, Online. Association for Computational Linguistics.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Improved decomposition strategy for joint entity and relation extraction",
"authors": [
{
"first": "",
"middle": [],
"last": "Van-Hien Tran",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Van-Thuy",
"suffix": ""
},
{
"first": "Akihiko",
"middle": [],
"last": "Phi",
"suffix": ""
},
{
"first": "Hiroyuki",
"middle": [],
"last": "Kato",
"suffix": ""
},
{
"first": "Taro",
"middle": [],
"last": "Shindo",
"suffix": ""
},
{
"first": "Yuji",
"middle": [],
"last": "Watanabe",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Matsumoto",
"suffix": ""
}
],
"year": 2021,
"venue": "Journal of Natural Language Processing",
"volume": "28",
"issue": "4",
"pages": "965--994",
"other_ids": {
"DOI": [
"10.5715/jnlp.28.965"
]
},
"num": null,
"urls": [],
"raw_text": "Van-Hien Tran, Van-Thuy Phi, Akihiko Kato, Hiroyuki Shindo, Taro Watanabe, and Yuji Matsumoto. 2021a. Improved decomposition strategy for joint entity and relation extraction. Journal of Natural Language Processing, 28(4):965-994.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Relation classification using segment-level attention-based CNN and dependencybased RNN",
"authors": [
{
"first": "",
"middle": [],
"last": "Van-Hien Tran",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Van-Thuy",
"suffix": ""
},
{
"first": "Hiroyuki",
"middle": [],
"last": "Phi",
"suffix": ""
},
{
"first": "Yuji",
"middle": [],
"last": "Shindo",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Matsumoto",
"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": "2793--2798",
"other_ids": {
"DOI": [
"10.18653/v1/N19-1286"
]
},
"num": null,
"urls": [],
"raw_text": "Van-Hien Tran, Van-Thuy Phi, Hiroyuki Shindo, and Yuji Matsumoto. 2019. Relation classification using segment-level attention-based CNN and dependency- based RNN. In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Tech- nologies, Volume 1 (Long and Short Papers), pages 2793-2798, Minneapolis, Minnesota. Association for Computational Linguistics.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "CovRelex: A COVID-19 retrieval system with relation extraction",
"authors": [
{
"first": "",
"middle": [],
"last": "Vu Tran",
"suffix": ""
},
{
"first": "Phuong",
"middle": [],
"last": "Van-Hien Tran",
"suffix": ""
},
{
"first": "Chau",
"middle": [],
"last": "Nguyen",
"suffix": ""
},
{
"first": "Ken",
"middle": [],
"last": "Nguyen",
"suffix": ""
},
{
"first": "Yuji",
"middle": [],
"last": "Satoh",
"suffix": ""
},
{
"first": "Minh",
"middle": [],
"last": "Matsumoto",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Nguyen",
"suffix": ""
}
],
"year": 2021,
"venue": "Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: System Demonstrations",
"volume": "",
"issue": "",
"pages": "24--31",
"other_ids": {
"DOI": [
"10.18653/v1/2021.eacl-demos.4"
]
},
"num": null,
"urls": [],
"raw_text": "Vu Tran, Van-Hien Tran, Phuong Nguyen, Chau Nguyen, Ken Satoh, Yuji Matsumoto, and Minh Nguyen. 2021b. CovRelex: A COVID-19 retrieval system with relation extraction. In Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: System Demonstrations, pages 24-31, Online. Association for Computational Linguistics.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "A discriminative feature learning approach for deep face recognition",
"authors": [
{
"first": "Yandong",
"middle": [],
"last": "Wen",
"suffix": ""
},
{
"first": "Kaipeng",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Zhifeng",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Yu",
"middle": [],
"last": "Qiao",
"suffix": ""
}
],
"year": 2016,
"venue": "Computer Vision -ECCV 2016",
"volume": "",
"issue": "",
"pages": "499--515",
"other_ids": {
"DOI": [
"10.1007/978-3-319-46478-7_31"
]
},
"num": null,
"urls": [],
"raw_text": "Yandong Wen, Kaipeng Zhang, Zhifeng Li, and Yu Qiao. 2016. A discriminative feature learning approach for deep face recognition. In Computer Vision -ECCV 2016, pages 499-515. Springer International Publish- ing.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Zero-shot learning-a comprehensive evaluation of the good, the bad and the ugly",
"authors": [
{
"first": "Yongqin",
"middle": [],
"last": "Xian",
"suffix": ""
},
{
"first": "Christoph",
"middle": [
"H"
],
"last": "Lampert",
"suffix": ""
},
{
"first": "Bernt",
"middle": [],
"last": "Schiele",
"suffix": ""
},
{
"first": "Zeynep",
"middle": [],
"last": "Akata",
"suffix": ""
}
],
"year": 2019,
"venue": "IEEE Transactions on Pattern Analysis and Machine Intelligence",
"volume": "41",
"issue": "9",
"pages": "2251--2265",
"other_ids": {
"DOI": [
"10.1109/TPAMI.2018.2857768"
]
},
"num": null,
"urls": [],
"raw_text": "Yongqin Xian, Christoph H. Lampert, Bernt Schiele, and Zeynep Akata. 2019. Zero-shot learning-a com- prehensive evaluation of the good, the bad and the ugly. IEEE Transactions on Pattern Analysis and Machine Intelligence, 41(9):2251-2265.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Question answering on Freebase via relation extraction and textual evidence",
"authors": [
{
"first": "Kun",
"middle": [],
"last": "Xu",
"suffix": ""
},
{
"first": "Siva",
"middle": [],
"last": "Reddy",
"suffix": ""
},
{
"first": "Yansong",
"middle": [],
"last": "Feng",
"suffix": ""
},
{
"first": "Songfang",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "Dongyan",
"middle": [],
"last": "Zhao",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "2326--2336",
"other_ids": {
"DOI": [
"10.18653/v1/P16-1220"
]
},
"num": null,
"urls": [],
"raw_text": "Kun Xu, Siva Reddy, Yansong Feng, Songfang Huang, and Dongyan Zhao. 2016. Question answering on Freebase via relation extraction and textual evidence. In Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 2326-2336, Berlin, Germany. Association for Computational Linguistics.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"uris": null,
"type_str": "figure",
"num": null,
"text": "Overview of our proposed model with an input training mini-batch of size N . T = N (N \u2212 1)/2, and formulate the loss as"
},
"FIGREF1": {
"uris": null,
"type_str": "figure",
"num": null,
"text": "Visualization of the sentence embeddings by ZS-BERT and our model when m = 5 on the FewRel."
},
"TABREF1": {
"html": null,
"num": null,
"text": "The statistics of the datasets.",
"content": "<table/>",
"type_str": "table"
},
"TABREF2": {
"html": null,
"num": null,
"text": "48.58 47.74 48.16 56.27 58.44 57.33 CIM \u22c6 49.63 48.81 49.22 58.05 61.92 59.92 ZS-BERT \u22c6 71.54 72.39 71.96 76.96 78.86 77.90 ZS-BERT \u2020 74.32 71.72 72.97 80.96 78.00 79.44 Ours 87.48 77.50 82.19 87.11 86.29 86.69 BERT \u22c6 60.51 60.98 60.74 56.92 57.59 57.25 ZS-BERT \u2020 64.53 58.30 61.23 60.13 55.63 57.80",
"content": "<table><tr><td/><td/><td>Wiki-ZSL</td><td/><td/><td>FewRel</td><td/></tr><tr><td>m = 5</td><td>P</td><td>R</td><td>F1</td><td>P</td><td>R</td><td>F1</td></tr><tr><td>ESIM \u22c6</td><td/><td/><td/><td/><td/><td/></tr><tr><td>m = 10</td><td>P</td><td>R</td><td>F1</td><td>P</td><td>R</td><td>F1</td></tr><tr><td>ESIM \u22c6</td><td colspan=\"6\">44.12 45.46 44.78 42.89 44.17 43.52</td></tr><tr><td>CIM \u22c6</td><td colspan=\"6\">46.54 47.90 45.57 47.39 49.11 48.23</td></tr><tr><td>ZS-Ours</td><td colspan=\"6\">71.59 64.69 67.94 64.41 62.61 63.50</td></tr><tr><td>m = 15</td><td>P</td><td>R</td><td>F1</td><td>P</td><td>R</td><td>F1</td></tr><tr><td>ESIM \u22c6</td><td colspan=\"6\">27.31 29.62 28.42 29.15 31.59 30.32</td></tr><tr><td>CIM \u22c6</td><td colspan=\"6\">29.17 30.58 29.86 31.83 33.06 32.43</td></tr><tr><td colspan=\"7\">ZS-BERT \u22c6 34.12 34.38 34.25 35.54 38.19 36.82</td></tr><tr><td colspan=\"7\">ZS-BERT \u2020 35.42 33.47 34.42 39.09 36.70 37.84 Ours 38.37 36.05 37.17 43.96 39.11 41.36</td></tr><tr><td>The dropout</td><td/><td/><td/><td/><td/><td/></tr><tr><td>1 https://www.wikidata.org/wiki/</td><td/><td/><td/><td/><td/><td/></tr><tr><td>Wikidata:Main_Page 2 PyTorch is an open-source software library for machine intelligence: https://pytorch.org/</td><td/><td/><td/><td/><td/><td/></tr></table>",
"type_str": "table"
},
"TABREF3": {
"html": null,
"num": null,
"text": "Results with different m values in percentage.",
"content": "<table/>",
"type_str": "table"
},
"TABREF5": {
"html": null,
"num": null,
"text": "Ablation study.",
"content": "<table/>",
"type_str": "table"
}
}
}
} |