Continual Few-shot Event Detection via Hierarchical Augmentation Networks
Not on the map. Why?
Abstract (arXiv)
Traditional continual event detection relies on abundant labeled data for training, which is often impractical to obtain in real-world applications. In this paper, we introduce continual few-shot event detection (CFED), a more commonly encountered scenario when a substantial number of labeled samples are not accessible. The CFED task is challenging as it involves memorizing previous event types and learning new event types with few-shot samples. To mitigate these challenges, we propose a memory-based framework: Hierarchical Augmentation Networks (HANet). To memorize previous event types with limited memory, we incorporate prototypical augmentation into the memory set. For the issue of learning new event types in few-shot scenarios, we propose a contrastive augmentation module for token representations. Despite comparing with previous state-of-the-art methods, we also conduct comparisons with ChatGPT. Experiment results demonstrate that our method significantly outperforms all of these methods in multiple continual few-shot event detection tasks.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 27 of its 48 references that are in the map. First posted on arXiv 26 Mar 2024.
Builds on
27 of 48 references.
References · 27
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2022Training language models to follow instructions with human feedbackcited by 15,712
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2017Prototypical Networks for Few-shot Learningcited by 3,001
- 2016Learning without Forgettingcited by 2,465
15 more
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
- 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,168
- 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,094
- 2022GPT-NeoX-20B: An Open-Source Autoregressive Language Modelcited by 711
- 2015Net2Net: Accelerating Learning via Knowledge Transfercited by 245
- 2018Online Structured Laplace Approximations For Overcoming Catastrophic Forgettingcited by 197
- 2023InstructUIE: Multi-task Instruction Tuning for Unified Information Extractioncited by 167
- 2020MAVEN: A Massive General Domain Event Detection Datasetcited by 103
- 2023How Robust is GPT-3.5 to Predecessors? A Comprehensive Study on Language Understanding Taskscited by 58
- 2019Meta-Learning with Dynamic-Memory-Based Prototypical Network for Few-Shot Event Detectioncited by 54
- 2016Joint Extraction of Events and Entities within a Document Contextcited by 48
- 2021CLASSIC: Continual and Contrastive Learning of Aspect Sentiment Classification Taskscited by 29
- 2022Incremental Prompting: Episodic Memory Prompt for Lifelong Event Detectioncited by 23
- 2020Extensively Matching for Few-shot Learning Event Detectioncited by 18
- 2022HCL-TAT: A Hybrid Contrastive Learning Method for Few-shot Event Detection with Task-Adaptive Thresholdcited by 2
Built on by
Citing papers per year: 2024: 1; 2025: 2.
3 papers.