mlsanityData to 14 Oct 2026

Pre-trained Language Models as Re-Annotators

arXiv 2205.05368 ↗First posted 11 May 2022cs.CL cs.AI cs.HCcited by 0

Not on the map. Why?

Abstract (arXiv)

Annotation noise is widespread in datasets, but manually revising a flawed corpus is time-consuming and error-prone. Hence, given the prior knowledge in Pre-trained Language Models and the expected uniformity across all annotations, we attempt to reduce annotation noise in the corpus through two tasks automatically: (1) Annotation Inconsistency Detection that indicates the credibility of annotations, and (2) Annotation Error Correction that rectifies the abnormal annotations. We investigate how to acquire semantic sensitive annotation representations from Pre-trained Language Models, expecting to embed the examples with identical annotations to the mutually adjacent positions even without fine-tuning. We proposed a novel credibility score to reveal the likelihood of annotation inconsistencies based on the neighbouring consistency. Then, we fine-tune the Pre-trained Language Models based classifier with cross-validation for annotation correction. The annotation corrector is further elaborated with two approaches: (1) soft labelling by Kernel Density Estimation and (2) a novel distant-peer contrastive loss. We study the re-annotation in relation extraction and create a new manually revised dataset, Re-DocRED, for evaluating document-level re-annotation. The proposed credibility scores show promising agreement with human revisions, achieving a Binary F1 of 93.4 and 72.5 in detecting inconsistencies on TACRED and DocRED respectively. Moreover, the neighbour-aware classifiers based on distant-peer contrastive learning and uncertain labels achieve Macro F1 up to 66.2 and 57.8 in correcting annotations on TACRED and DocRED respectively. These improvements are not merely theoretical: Rather, automatically denoised training sets demonstrate up to 3.6% performance improvement for state-of-the-art relation extraction models.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 36 of its 209 references that are in the map. First posted on arXiv 11 May 2022.

Builds on

36 of 209 references.

References · 36

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  2. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  3. 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
  4. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,513
  5. 2017Billion-scale similarity search with GPUscited by 2,497
  6. 2021Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processingcited by 2,234
  7. 2016Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translationcited by 1,475
  8. 2019BERT Rediscovers the Classical NLP Pipelinecited by 1,059
  9. 2015Aligning Books and Movies: Towards Story-like Visual Explanations by Watching Movies and Reading Bookscited by 1,043
  10. 2017A Survey on Multi-Task Learningcited by 840
  11. 2020Pre-trained Models for Natural Language Processing: A Surveycited by 505
  12. 2021Recent Advances in Natural Language Processing via Large Pre-Trained Language Models: A Surveycited by 463
24 more
  1. 2021Pervasive Label Errors in Test Sets Destabilize Machine Learning Benchmarkscited by 395
  2. 2019Linguistic Knowledge and Transferability of Contextual Representationscited by 383
  3. 2016Deep Biaffine Attention for Neural Dependency Parsingcited by 334
  4. 2019KG-BERT: BERT for Knowledge Graph Completioncited by 324
  5. 2021Factual Probing Is [MASK]: Learning vs. Learning to Recallcited by 291
  6. 2021Curriculum Learning: A Surveycited by 259
  7. 2019DocRED: A Large-Scale Document-Level Relation Extraction Datasetcited by 239
  8. 2021PTR: Prompt Tuning with Rules for Text Classificationcited by 238
  9. 2020Contrastive Training for Improved Out-of-Distribution Detectioncited by 186
  10. 2021KnowPrompt: Knowledge-aware Prompt-tuning with Synergistic Optimization for Relation Extractioncited by 180
  11. 2017Natural Language Processing: State of The Art, Current Trends and Challengescited by 114
  12. 2021An Improved Baseline for Sentence-level Relation Extractioncited by 81
  13. 2020Learning from Context or Names? An Empirical Study on Neural Relation Extractioncited by 75
  14. 2021Self-Supervised Learning of Remote Sensing Scene Representations Using Contrastive Multiview Codingcited by 58
  15. 2020Contrastive Triple Extraction with Generative Transformercited by 44
  16. 2020A Brief Review of Deep Multi-task Learning and Auxiliary Task Learningcited by 18
  17. 2020A Survey on Curriculum Learningcited by 15
  18. 2020DialBERT: A Hierarchical Pre-Trained Model for Conversation Disentanglementcited by 12
  19. 2020Softmax-based Classification is k-means Clustering: Formal Proof, Consequences for Adversarial Attacks, and Improvement through Centroid Based Tailoringcited by 8
  20. 2021Dynamic curriculum learning via data parameters for noise robust keyword spottingcited by 5
  21. 2021MetaLabelNet: Learning to Generate Soft-Labels from Noisy-Labelscited by 5
  22. 2015Cheaper and Better: Selecting Good Workers for Crowdsourcingcited by 4
  23. 2020Neural relation extraction: a surveycited by 4
  24. 2021Assisted Text Annotation Using Active Learning to Achieve High Quality with Little Effortcited by 1

Built on by

Not cited yet.