Schema-aware Reference as Prompt Improves Data-Efficient Knowledge Graph Construction
With the development of pre-trained language models, many prompt-based approaches to data-efficient knowledge graph construction have been proposed and achieved impressive performance. However, existing prompt-based learning methods for knowledge graph construction are still susceptible to several p...
Gespeichert in:
Veröffentlicht in: | arXiv.org 2023-09 |
---|---|
Hauptverfasser: | , , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Yao, Yunzhi Mao, Shengyu Zhang, Ningyu Chen, Xiang Deng, Shumin Chen, Xi Chen, Huajun |
description | With the development of pre-trained language models, many prompt-based approaches to data-efficient knowledge graph construction have been proposed and achieved impressive performance. However, existing prompt-based learning methods for knowledge graph construction are still susceptible to several potential limitations: (i) semantic gap between natural language and output structured knowledge with pre-defined schema, which means model cannot fully exploit semantic knowledge with the constrained templates; (ii) representation learning with locally individual instances limits the performance given the insufficient features, which are unable to unleash the potential analogical capability of pre-trained language models. Motivated by these observations, we propose a retrieval-augmented approach, which retrieves schema-aware Reference As Prompt (RAP), for data-efficient knowledge graph construction. It can dynamically leverage schema and knowledge inherited from human-annotated and weak-supervised data as a prompt for each sample, which is model-agnostic and can be plugged into widespread existing approaches. Experimental results demonstrate that previous methods integrated with RAP can achieve impressive performance gains in low-resource settings on five datasets of relational triple extraction and event extraction for knowledge graph construction. Code is available in https://github.com/zjunlp/RAP. |
doi_str_mv | 10.48550/arxiv.2210.10709 |
format | Article |
fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2210_10709</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2726616086</sourcerecordid><originalsourceid>FETCH-LOGICAL-a959-931a01e255f58de5fb81f11a21d9aa8f3605d3efbe9fbaf7d0fbed3f3bb71bf03</originalsourceid><addsrcrecordid>eNotj1tLw0AUhBdBsNT-AJ9c8Dl1L91cHiXWtlhQtD6Hk-Qcm9Jc3E1a_feurU8zDMMwH2M3UkxnsTHiHux3dZgq5QMpIpFcsJHSWgbxTKkrNnFuJ4RQYaSM0SP28V5ssYYAjmCRvyGhxaZADo6_2rbuer6qO9se0PFH6CGYE1VFhU3Pn5v2uMfyE_nCQrfladu43g5FX7XNNbsk2Duc_OuYbZ7mm3QZrF8Wq_RhHUBikiDREoREf4RMXKKhPJYkJShZJgAx6VCYUiPlmFAOFJXC21KTzvNI5iT0mN2eZ0_MWWerGuxP9seendh94-7c8AxfA7o-27WDbfynTEUqDGUo4lD_As0fXcI</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2726616086</pqid></control><display><type>article</type><title>Schema-aware Reference as Prompt Improves Data-Efficient Knowledge Graph Construction</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Yao, Yunzhi ; Mao, Shengyu ; Zhang, Ningyu ; Chen, Xiang ; Deng, Shumin ; Chen, Xi ; Chen, Huajun</creator><creatorcontrib>Yao, Yunzhi ; Mao, Shengyu ; Zhang, Ningyu ; Chen, Xiang ; Deng, Shumin ; Chen, Xi ; Chen, Huajun</creatorcontrib><description>With the development of pre-trained language models, many prompt-based approaches to data-efficient knowledge graph construction have been proposed and achieved impressive performance. However, existing prompt-based learning methods for knowledge graph construction are still susceptible to several potential limitations: (i) semantic gap between natural language and output structured knowledge with pre-defined schema, which means model cannot fully exploit semantic knowledge with the constrained templates; (ii) representation learning with locally individual instances limits the performance given the insufficient features, which are unable to unleash the potential analogical capability of pre-trained language models. Motivated by these observations, we propose a retrieval-augmented approach, which retrieves schema-aware Reference As Prompt (RAP), for data-efficient knowledge graph construction. It can dynamically leverage schema and knowledge inherited from human-annotated and weak-supervised data as a prompt for each sample, which is model-agnostic and can be plugged into widespread existing approaches. Experimental results demonstrate that previous methods integrated with RAP can achieve impressive performance gains in low-resource settings on five datasets of relational triple extraction and event extraction for knowledge graph construction. Code is available in https://github.com/zjunlp/RAP.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2210.10709</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Ablation ; Computer Science - Artificial Intelligence ; Computer Science - Computation and Language ; Computer Science - Databases ; Computer Science - Information Retrieval ; Computer Science - Learning ; Empirical analysis ; Information retrieval ; Knowledge ; Learning ; Semantics ; Training</subject><ispartof>arXiv.org, 2023-09</ispartof><rights>2023. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,780,881,27904</link.rule.ids><backlink>$$Uhttps://doi.org/10.1145/3539618.3591763$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.2210.10709$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Yao, Yunzhi</creatorcontrib><creatorcontrib>Mao, Shengyu</creatorcontrib><creatorcontrib>Zhang, Ningyu</creatorcontrib><creatorcontrib>Chen, Xiang</creatorcontrib><creatorcontrib>Deng, Shumin</creatorcontrib><creatorcontrib>Chen, Xi</creatorcontrib><creatorcontrib>Chen, Huajun</creatorcontrib><title>Schema-aware Reference as Prompt Improves Data-Efficient Knowledge Graph Construction</title><title>arXiv.org</title><description>With the development of pre-trained language models, many prompt-based approaches to data-efficient knowledge graph construction have been proposed and achieved impressive performance. However, existing prompt-based learning methods for knowledge graph construction are still susceptible to several potential limitations: (i) semantic gap between natural language and output structured knowledge with pre-defined schema, which means model cannot fully exploit semantic knowledge with the constrained templates; (ii) representation learning with locally individual instances limits the performance given the insufficient features, which are unable to unleash the potential analogical capability of pre-trained language models. Motivated by these observations, we propose a retrieval-augmented approach, which retrieves schema-aware Reference As Prompt (RAP), for data-efficient knowledge graph construction. It can dynamically leverage schema and knowledge inherited from human-annotated and weak-supervised data as a prompt for each sample, which is model-agnostic and can be plugged into widespread existing approaches. Experimental results demonstrate that previous methods integrated with RAP can achieve impressive performance gains in low-resource settings on five datasets of relational triple extraction and event extraction for knowledge graph construction. Code is available in https://github.com/zjunlp/RAP.</description><subject>Ablation</subject><subject>Computer Science - Artificial Intelligence</subject><subject>Computer Science - Computation and Language</subject><subject>Computer Science - Databases</subject><subject>Computer Science - Information Retrieval</subject><subject>Computer Science - Learning</subject><subject>Empirical analysis</subject><subject>Information retrieval</subject><subject>Knowledge</subject><subject>Learning</subject><subject>Semantics</subject><subject>Training</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotj1tLw0AUhBdBsNT-AJ9c8Dl1L91cHiXWtlhQtD6Hk-Qcm9Jc3E1a_feurU8zDMMwH2M3UkxnsTHiHux3dZgq5QMpIpFcsJHSWgbxTKkrNnFuJ4RQYaSM0SP28V5ssYYAjmCRvyGhxaZADo6_2rbuer6qO9se0PFH6CGYE1VFhU3Pn5v2uMfyE_nCQrfladu43g5FX7XNNbsk2Duc_OuYbZ7mm3QZrF8Wq_RhHUBikiDREoREf4RMXKKhPJYkJShZJgAx6VCYUiPlmFAOFJXC21KTzvNI5iT0mN2eZ0_MWWerGuxP9seendh94-7c8AxfA7o-27WDbfynTEUqDGUo4lD_As0fXcI</recordid><startdate>20230918</startdate><enddate>20230918</enddate><creator>Yao, Yunzhi</creator><creator>Mao, Shengyu</creator><creator>Zhang, Ningyu</creator><creator>Chen, Xiang</creator><creator>Deng, Shumin</creator><creator>Chen, Xi</creator><creator>Chen, Huajun</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20230918</creationdate><title>Schema-aware Reference as Prompt Improves Data-Efficient Knowledge Graph Construction</title><author>Yao, Yunzhi ; Mao, Shengyu ; Zhang, Ningyu ; Chen, Xiang ; Deng, Shumin ; Chen, Xi ; Chen, Huajun</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a959-931a01e255f58de5fb81f11a21d9aa8f3605d3efbe9fbaf7d0fbed3f3bb71bf03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Ablation</topic><topic>Computer Science - Artificial Intelligence</topic><topic>Computer Science - Computation and Language</topic><topic>Computer Science - Databases</topic><topic>Computer Science - Information Retrieval</topic><topic>Computer Science - Learning</topic><topic>Empirical analysis</topic><topic>Information retrieval</topic><topic>Knowledge</topic><topic>Learning</topic><topic>Semantics</topic><topic>Training</topic><toplevel>online_resources</toplevel><creatorcontrib>Yao, Yunzhi</creatorcontrib><creatorcontrib>Mao, Shengyu</creatorcontrib><creatorcontrib>Zhang, Ningyu</creatorcontrib><creatorcontrib>Chen, Xiang</creatorcontrib><creatorcontrib>Deng, Shumin</creatorcontrib><creatorcontrib>Chen, Xi</creatorcontrib><creatorcontrib>Chen, Huajun</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yao, Yunzhi</au><au>Mao, Shengyu</au><au>Zhang, Ningyu</au><au>Chen, Xiang</au><au>Deng, Shumin</au><au>Chen, Xi</au><au>Chen, Huajun</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Schema-aware Reference as Prompt Improves Data-Efficient Knowledge Graph Construction</atitle><jtitle>arXiv.org</jtitle><date>2023-09-18</date><risdate>2023</risdate><eissn>2331-8422</eissn><abstract>With the development of pre-trained language models, many prompt-based approaches to data-efficient knowledge graph construction have been proposed and achieved impressive performance. However, existing prompt-based learning methods for knowledge graph construction are still susceptible to several potential limitations: (i) semantic gap between natural language and output structured knowledge with pre-defined schema, which means model cannot fully exploit semantic knowledge with the constrained templates; (ii) representation learning with locally individual instances limits the performance given the insufficient features, which are unable to unleash the potential analogical capability of pre-trained language models. Motivated by these observations, we propose a retrieval-augmented approach, which retrieves schema-aware Reference As Prompt (RAP), for data-efficient knowledge graph construction. It can dynamically leverage schema and knowledge inherited from human-annotated and weak-supervised data as a prompt for each sample, which is model-agnostic and can be plugged into widespread existing approaches. Experimental results demonstrate that previous methods integrated with RAP can achieve impressive performance gains in low-resource settings on five datasets of relational triple extraction and event extraction for knowledge graph construction. Code is available in https://github.com/zjunlp/RAP.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2210.10709</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2023-09 |
issn | 2331-8422 |
language | eng |
recordid | cdi_arxiv_primary_2210_10709 |
source | arXiv.org; Free E- Journals |
subjects | Ablation Computer Science - Artificial Intelligence Computer Science - Computation and Language Computer Science - Databases Computer Science - Information Retrieval Computer Science - Learning Empirical analysis Information retrieval Knowledge Learning Semantics Training |
title | Schema-aware Reference as Prompt Improves Data-Efficient Knowledge Graph Construction |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T18%3A40%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Schema-aware%20Reference%20as%20Prompt%20Improves%20Data-Efficient%20Knowledge%20Graph%20Construction&rft.jtitle=arXiv.org&rft.au=Yao,%20Yunzhi&rft.date=2023-09-18&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2210.10709&rft_dat=%3Cproquest_arxiv%3E2726616086%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2726616086&rft_id=info:pmid/&rfr_iscdi=true |