TY - GEN
T1 - Evidence-aware Document-level Relation Extraction
AU - Xu, Tianyu
AU - Hua, Wen
AU - Qu, Jianfeng
AU - Li, Zhixu
AU - Xu, Jiajie
AU - Liu, An
AU - Zhao, Lei
N1 - Funding Information:
This work was supported by the National Natural Science Foundation of China (Grant No. 62102276; No. 62072323), the Natural Science Foundation of Jiangsu Province (Grant No. BK20210705, Grant No. BK20211307), the Natural Science Foundation of Educational Commission of Jiangsu Province, China (Grant No. 21KJD520005), Shanghai Municipal Science and Technology Major Project (No. 2021SHZDZX0103), the National Key Research and Development Project (No. 2020AAA0109302), Shanghai Science and Technology Innovation Action Plan (No. 19511120400), NH33714722 Youth Team on Interdisciplinary Research Soochoow University - Research on Subjectivity and Reasoning Theory in Artificial Intelligence, the Major Program of the Natural Science Foundation of Jiangsu Higher Education Institutions of China (Grant No. 19KJA610002), the major project of natural science research in universities of Jiangsu province (Grant No. 20KJA52000) and supported by Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions.
Publisher Copyright:
© 2022 ACM.
PY - 2022/10/17
Y1 - 2022/10/17
N2 - Document-level Relation Extraction (RE) is a promising task aiming at identifying relations of multiple entity pairs in a document. However, in most cases, a relational fact can be expressed enough via a small subset of sentences from the document, namely evidence sentence. Moreover, there often exist strong semantic correlations between evidence sentences that collaborate together to describe a specific relation. To address these challenges, we propose a novel evidence-aware model for document-level RE. Particularly, we formulate evidence sentence selection as a sequential decision problem through a crafted reinforcement learning mechanism. Considering the explosive search space of our agent, an efficient path searching strategy is executed on the converted document graph to heuristically obtain hopeful sentences and feed them to reinforcement learning. Finally, each entity pair owns a customized-filtered document for further inferring the relation between them. We conduct various experiments on two document-level RE benchmarks and achieve a remarkable improvement over previous competitive baselines, verifying the effectiveness of our method.
AB - Document-level Relation Extraction (RE) is a promising task aiming at identifying relations of multiple entity pairs in a document. However, in most cases, a relational fact can be expressed enough via a small subset of sentences from the document, namely evidence sentence. Moreover, there often exist strong semantic correlations between evidence sentences that collaborate together to describe a specific relation. To address these challenges, we propose a novel evidence-aware model for document-level RE. Particularly, we formulate evidence sentence selection as a sequential decision problem through a crafted reinforcement learning mechanism. Considering the explosive search space of our agent, an efficient path searching strategy is executed on the converted document graph to heuristically obtain hopeful sentences and feed them to reinforcement learning. Finally, each entity pair owns a customized-filtered document for further inferring the relation between them. We conduct various experiments on two document-level RE benchmarks and achieve a remarkable improvement over previous competitive baselines, verifying the effectiveness of our method.
KW - document-level relation extraction
KW - evidence extraction
KW - reinforcement learning
UR - http://www.scopus.com/inward/record.url?scp=85140846326&partnerID=8YFLogxK
U2 - 10.1145/3511808.3557313
DO - 10.1145/3511808.3557313
M3 - Conference article published in proceeding or book
AN - SCOPUS:85140846326
T3 - International Conference on Information and Knowledge Management, Proceedings
SP - 2311
EP - 2320
BT - CIKM 2022 - Proceedings of the 31st ACM International Conference on Information and Knowledge Management
PB - Association for Computing Machinery
T2 - 31st ACM International Conference on Information and Knowledge Management, CIKM 2022
Y2 - 17 October 2022 through 21 October 2022
ER -