mlsanityData to 7 Oct 2026

PeerDA: Data Augmentation via Modeling Peer Relation for Span Identification Tasks

arXiv 2210.08855 ↗First posted 17 Oct 2022cs.CLcited by 7

Not on the map. Why?

Abstract (arXiv)

Span identification aims at identifying specific text spans from text input and classifying them into pre-defined categories. Different from previous works that merely leverage the Subordinate (SUB) relation (i.e. if a span is an instance of a certain category) to train models, this paper for the first time explores the Peer (PR) relation, which indicates that two spans are instances of the same category and share similar features. Specifically, a novel Peer Data Augmentation (PeerDA) approach is proposed which employs span pairs with the PR relation as the augmentation data for training. PeerDA has two unique advantages: (1) There are a large number of PR span pairs for augmenting the training data. (2) The augmented data can prevent the trained model from over-fitting the superficial span-category mapping by pushing the model to leverage the span semantics. Experimental results on ten datasets over four diverse tasks across seven domains demonstrate the effectiveness of PeerDA. Notably, PeerDA achieves state-of-the-art results on six of them.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 52 of its 95 references that are in the map. First posted on arXiv 17 Oct 2022.

Builds on

52 of 95 references.

References · 52

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  4. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  5. 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
  6. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
  7. 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,157
  8. 2019Self-training with Noisy Student improves ImageNet classificationcited by 1,304
  9. 2019Unsupervised Data Augmentation for Consistency Trainingcited by 1,057
  10. 2015Teaching Machines to Read and Comprehendcited by 1,039
  11. 2015Effective Approaches to Attention-based Neural Machine Translationcited by 1,024
  12. 2019EDA: Easy Data Augmentation Techniques for Boosting Performance on Text Classification Taskscited by 800
38 more
  1. 2021A Survey of Data Augmentation Approaches for NLPcited by 408
  2. 2016Bidirectional Attention Flow for Machine Comprehensioncited by 278
  3. 2018The Natural Language Decathlon: Multitask Learning as Question Answeringcited by 235
  4. 2021CUAD: An Expert-Annotated NLP Dataset for Legal Contract Reviewcited by 232
  5. 2015Named Entity Recognition with Bidirectional LSTM-CNNscited by 201
  6. 2018Contextual Augmentation: Data Augmentation by Words with Paradigmatic Relationscited by 201
  7. 2019A Unified MRC Framework for Named Entity Recognitioncited by 199
  8. 2021GPT3Mix: Leveraging Large-scale Language Models for Text Augmentationcited by 185
  9. 2021Few-NERD: A Few-Shot Named Entity Recognition Datasetcited by 150
  10. 2021A Unified Generative Framework for Various NER Subtaskscited by 141
  11. 2019Fine-Grained Analysis of Propaganda in News Articlescited by 130
  12. 2018Conditional BERT Contextual Augmentationcited by 107
  13. 2021A Unified Generative Framework for Aspect-Based Sentiment Analysiscited by 97
  14. 2019Entity-Relation Extraction as Multi-Turn Question Answeringcited by 96
  15. 2021Unified Named Entity Recognition as Word-Word Relation Classificationcited by 89
  16. 2020SemEval-2020 Task 11: Detection of Propaganda Techniques in News Articlescited by 79
  17. 2021Improving Named Entity Recognition by External Context Retrieving and Cooperative Learningcited by 76
  18. 2020An Analysis of Simple Data Augmentation for Named Entity Recognitioncited by 75
  19. 2021A Joint Training Dual-MRC Framework for Aspect Based Sentiment Analysiscited by 61
  20. 2022A Survey on Aspect-Based Sentiment Analysis: Tasks, Methods, and Challengescited by 61
  21. 2018A Unified Model for Opinion Target Extraction and Target Sentiment Predictioncited by 56
  22. 2019An Interactive Multi-Task Learning Network for End-to-End Aspect-Based Sentiment Analysiscited by 52
  23. 2019Open-Domain Targeted Sentiment Analysis via Span-Based Extraction and Classificationcited by 50
  24. 2021SemEval-2021 Task 6: Detection of Persuasion Techniques in Texts and Imagescited by 49
  25. 2021MELM: Data Augmentation with Masked Entity Language Modeling for Low-Resource NERcited by 42
  26. 2022T-NER: An All-Round Python Library for Transformer-based Named Entity Recognitioncited by 37
  27. 2019Entity Projection via Machine Translation for Cross-Lingual NERcited by 32
  28. 2021RockNER: A Simple Method to Create Adversarial Examples for Evaluating the Robustness of Named Entity Recognition Modelscited by 28
  29. 2020Conditional Augmentation for Aspect Term Extraction via Masked Sequence-to-Sequence Generationcited by 27
  30. 2021LightNER: A Lightweight Tuning Paradigm for Low-resource NER via Pluggable Promptingcited by 27
  31. 2020Tasty Burgers, Soggy Fries: Probing Aspect Robustness in Aspect-Based Sentiment Analysiscited by 23
  32. 2020Named Entity Recognition for Social Media Texts with Semantic Augmentationcited by 23
  33. 2020Unsupervised Cross-lingual Adaptation for Sequence Tagging and Beyondcited by 22
  34. 2021Better Feature Integration for Named Entity Recognitioncited by 22
  35. 2022Boundary Smoothing for Named Entity Recognitioncited by 21
  36. 2020Adaptive Self-training for Few-shot Neural Sequence Labelingcited by 18
  37. 2021Data Augmentation for Cross-Domain Named Entity Recognitioncited by 14
  38. 2020Dissecting Span Identification Tasks with Performance Predictioncited by 13

50 most cited of 52 All 52 (JSON)

Built on by

Cited by year

Citing papers per year: 2022: 3; 2023: 4.

7 papers.