MétaCan
Menu
Back to cohort

PRiSM: Enhancing Low-Resource Document-Level Relation Extraction with Relation-Aware Score Calibration

2023· article· en· W4392669927 on OpenAlexaff
Min-Seok Choi, Hyesu Lim, Jaegul Choo

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicTopic Modeling
Canadian institutionsKootenay Association for Science & Technology
FundersNational Supercomputing Center, Korea Institute of Science and Technology InformationInstitute for Information and Communications Technology PromotionSamsungMinistry of Science and ICT, South KoreaKorea Advanced Institute of Science and Technology
KeywordsRelation (database)Computer scienceCalibrationPrismRelationship extractionResource (disambiguation)Code (set theory)Data miningKey (lock)Source codeInformation retrievalPerspective (graphical)Artificial intelligenceMachine learningStatisticsOpticsMathematicsProgramming language

Abstract

fetched live from OpenAlex

Document-level relation extraction (DocRE)aims to extract relations of all entity pairs in a document.A key challenge in DocRE is the cost of annotating such data which requires intensive human effort.Thus, we investigate the case of DocRE in a low-resource setting, and we find that existing models trained on low data overestimate the NA ("no relation") label, causing limited performance.In this work, we approach the problem from a calibration perspective and propose PRiSM, which learns to adapt logits based on relation semantic information.We evaluate our method on three DocRE datasets and demonstrate that integrating existing models with PRiSM improves performance by as much as 26.38 F1 score, while the calibration error drops as much as 36 times when trained with about 3% of data.The code is publicly available at https: //github.com/brightjade/PRiSM.

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.004
metaresearch head score (Gemma)0.016
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.008
Threshold uncertainty score0.022

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.016
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0050.005
Science and technology studies0.0010.001
Scholarly communication0.0030.007
Open science0.0030.004
Research integrity0.0020.004
Insufficient payload (model declined to judge)0.0050.009

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.030
GPT teacher head0.256
Teacher spread0.226 · 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 designSimulation or modeling
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

Citations3
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicTopic ModelingFrench-language works237,207