Beyond the Numbers: Transparency in Relation Extraction Benchmark Creation and Leaderboards
This paper investigates the transparency in the creation of benchmarks and the use of leaderboards for measuring progress in NLP, with a focus on the relation extraction (RE) task. Existing RE benchmarks often suffer from insufficient documentation, lacking crucial details such as data sources, inter-annotator agreement, the algorithms used for the selection of instances for datasets, and information on potential biases like dataset imbalance. Progress in RE is frequently measured by leaderboards that rank systems based on evaluation methods, typically limited to aggregate metrics like F1-score. However, the absence of detailed performance analysis beyond these metrics can obscure the true generalisation capabilities of models. Our analysis reveals that widely used RE benchmarks, such as TACRED and NYT, tend to be highly imbalanced and contain noisy labels. Moreover, the lack of class-based performance metrics fails to accurately reflect model performance across datasets with a large number of relation types. These limitations should be carefully considered when reporting progress in RE. While our discussion centers on the transparency of RE benchmarks and leaderboards, the observations we discuss are broadly applicable to other NLP tasks as well. Rather than undermining the significance and value of existing RE benchmarks and the development of new models, this paper advocates for improved documentation and more rigorous evaluation to advance the field.
Code (0)
등록된 구현이 없습니다.
Tasks
RelationRelation ExtractionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Extracting Victim Counts from Text
Decision-makers in the humanitarian sector rely on timely and exact information during crisis events. Knowing how many civilians were injured during an earthquake is vital to allocate aids properly. Information about suc…
Dependency ParsingHumanitarianQuestion AnsweringSemantic Role LabelingRethinking Relation Extraction: Beyond Shortcuts to Generalization with a Debiased Benchmark
Benchmarks are crucial for evaluating machine learning algorithm performance, facilitating comparison and identifying superior solutions. However, biases within datasets can lead models to learn shortcut patterns, result…
RelationRelation ExtractionText2NKG: Fine-Grained N-ary Relation Extraction for N-ary relational Knowledge Graph Construction
Beyond traditional binary relational facts, n-ary relational knowledge graphs (NKGs) are comprised of n-ary relational facts containing more than two entities, which are closer to real-world facts with broader applicatio…
Event-based N-ary Relaiton ExtractionHypergraph-based N-ary Relaiton ExtractionHyper-Relational ExtractionRelation+1GAN Driven Semi-distant Supervision for Relation Extraction
Distant supervision has been widely used in relation extraction tasks without hand-labeled datasets recently. However, the automatically constructed datasets comprise numbers of wrongly labeled negative instances due to …
Generative Adversarial NetworkRelationRelation ExtractionImproving Cross-Domain Performance for Relation Extraction via Dependency Prediction and Information Flow Control
Relation Extraction (RE) is one of the fundamental tasks in Information Extraction and Natural Language Processing. Dependency trees have been shown to be a very useful source of information for this task. The current de…
Domain GeneralizationRelationRelation Extraction