Improve Event Extraction via Self-Training with Gradient Guidance
Not on the map. Why?
Abstract (arXiv)
Data scarcity has been the main factor that hinders the progress of event extraction. To overcome this issue, we propose a Self-Training with Feedback (STF) framework that leverages the large-scale unlabeled data and acquires feedback for each new event prediction from the unlabeled data by comparing it to the Abstract Meaning Representation (AMR) graph of the same sentence. Specifically, STF consists of (1) a base event extraction model trained on existing event annotations and then applied to large-scale unlabeled corpora to predict new event mentions as pseudo training samples, and (2) a novel scoring model that takes in each new predicted event trigger, an argument, its argument role, as well as their paths in the AMR graph to estimate a compatibility score indicating the correctness of the pseudo label. The compatibility scores further act as feedback to encourage or discourage the model learning on the pseudo labels during self-training. Experimental results on three benchmark datasets, including ACE05-E, ACE05-E+, and ERE, demonstrate the effectiveness of the STF framework on event extraction, especially event argument extraction, with significant performance gain over the base event extraction models and strong baselines. Our experimental analysis further shows that STF is a generic framework as it can be applied to improve most, if not all, event extraction models by leveraging large-scale unlabeled data, even when high-quality AMR graph annotations are not available.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 27 of its 62 references that are in the map. First posted on arXiv 25 May 2022.
Builds on
27 of 62 references.
References · 27
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2017On Calibration of Modern Neural Networkscited by 4,860
- 2017MentorNet: Learning Data-Driven Curriculum for Very Deep Neural Networks on Corrupted Labelscited by 652
- 2019Pseudo-Labeling and Confirmation Bias in Deep Semi-Supervised Learningcited by 507
- 2020Meta Pseudo Labelscited by 372
- 2019Entity, Relation, and Event Extraction with Contextualized Span Representationscited by 261
- 2022Unified Structure Generation for Universal Information Extractioncited by 220
- 2020Event Extraction by Answering (Almost) Natural Questionscited by 177
- 2020Improved Noisy Student Training for Automatic Speech Recognitioncited by 139
- 2021Text2Event: Controllable Sequence-to-Structure Generation for End-to-end Event Extractioncited by 129
15 more
- 2019Self-Training for End-to-End Speech Recognitioncited by 128
- 2020Self-training Improves Pre-training for Natural Language Understandingcited by 96
- 2021DEGREE: A Data-Efficient Generation-Based Event Extraction Modelcited by 82
- 2017Zero-Shot Transfer Learning for Event Extractioncited by 66
- 2020Transition-based Parsing with Stack-Transformerscited by 37
- 2021CLEVE: Contrastive Pre-training for Event Extractioncited by 36
- 2020Semi-supervised Relation Extraction via Incremental Meta Self-Trainingcited by 35
- 2021Gradient Imitation Reinforcement Learning for Low Resource Relation Extractioncited by 33
- 2021Noisy-Labeled NER with Confidence Estimationcited by 28
- 2021Query and Extract: Refining Event Extraction as Type-oriented Binary Decodingcited by 26
- 2021OntoED: Low-resource Event Detection with Ontology Embeddingcited by 23
- 2021Cross-Task Instance Representation Interactions and Label Dependencies for Joint Information Extraction with Graph Convolutional Networkscited by 22
- 2018Semi-Supervised Event Extraction with Paraphrase Clusterscited by 10
- 2018Towards Semi-Supervised Learning for Deep Semantic Role Labelingcited by 8
- 2021Improved Latent Tree Induction with Distant Supervision via Span Constraintscited by 6
Built on by
Citing papers per year: 2024: 3.
3 papers.