MétaCan
Menu
Back to cohort

Document-Level Relation Extraction with Sentences Importance Estimation and Focusing

2022· article· en· W4225102708 on OpenAlexafffund
Xu Wang, Kehai Chen, Lili Mou, Tiejun Zhao

Bibliographic record

VenueProceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies · 2022
Typearticle
Languageen
FieldComputer Science
TopicTopic Modeling
Canadian institutionsUniversity of Alberta
FundersNational Key Research and Development Program of ChinaDeepMindCompute CanadaNatural Sciences and Engineering Research Council of CanadaCanadian Institute for Advanced Research
KeywordsSentenceComputer scienceRelationship extractionFocus (optics)Natural language processingArtificial intelligenceRelation (database)Variety (cybernetics)GraphSequence (biology)Information extractionData miningTheoretical computer science

Abstract

fetched live from OpenAlex

Document-level relation extraction (DocRE) aims to determine the relation between two entities from a document of multiple sentences.Recent studies typically represent the entire document by sequence-or graph-based models to predict the relations of all entity pairs.However, we find that such a model is not robust and exhibits bizarre behaviors: it predicts correctly when an entire test document is fed as input, but errs when non-evidence sentences are removed.To this end, we propose a Sentence Importance Estimation and Focusing (SIEF) framework for DocRE, where we design a sentence importance score and a sentence focusing loss, encouraging DocRE models to focus on evidence sentences.Experimental results on two domains show that our SIEF not only improves overall performance, but also makes DocRE models more robust.Moreover, SIEF is a general framework, shown to be effective when combined with a variety of base DocRE models. 1

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.005
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.008
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.005
Meta-epidemiology (narrow)0.0030.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0080.004
Science and technology studies0.0010.001
Scholarly communication0.0010.004
Open science0.0020.002
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0030.005

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.019
GPT teacher head0.254
Teacher spread0.235 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designNot applicable
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations25
Published2022
Admission routes2
Has abstractyes

Explore more

Same venueProceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language TechnologiesSame topicTopic ModelingFrench-language works237,207