Class-Incremental Few-Shot Event Detection

• URL: http://arxiv.org/abs/2404.01767v1
• Date: Tue, 2 Apr 2024 09:31:14 GMT
• Title: Class-Incremental Few-Shot Event Detection
• Authors: Kailin Zhao, Xiaolong Jin, Long Bai, Jiafeng Guo, Xueqi Cheng,
• Abstract summary: This paper proposes a new task, called class-incremental few-shot event detection. This task faces two problems, i.e., old knowledge forgetting and new class overfitting. To solve these problems, this paper presents a novel knowledge distillation and prompt learning based method, called Prompt-KD.
• Score: 68.66116956283575
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Event detection is one of the fundamental tasks in information extraction and knowledge graph. However, a realistic event detection system often needs to deal with new event classes constantly. These new classes usually have only a few labeled instances as it is time-consuming and labor-intensive to annotate a large number of unlabeled instances. Therefore, this paper proposes a new task, called class-incremental few-shot event detection. Nevertheless, this task faces two problems, i.e., old knowledge forgetting and new class overfitting. To solve these problems, this paper further presents a novel knowledge distillation and prompt learning based method, called Prompt-KD. Specifically, to handle the forgetting problem about old knowledge, Prompt-KD develops an attention based multi-teacher knowledge distillation framework, where the ancestor teacher model pre-trained on base classes is reused in all learning sessions, and the father teacher model derives the current student model via adaptation. On the other hand, in order to cope with the few-shot learning scenario and alleviate the corresponding new class overfitting problem, Prompt-KD is also equipped with a prompt learning mechanism. Extensive experiments on two benchmark datasets, i.e., FewEvent and MAVEN, demonstrate the superior performance of Prompt-KD.

Related papers

• Few-Shot Class Incremental Learning with Attention-Aware Self-Adaptive Prompt [58.880105981772324]
  We propose a novel framework named Attention-aware Self-adaptive Prompt (ASP) ASP encourages task-invariant prompts to capture shared knowledge by reducing specific information from the attention aspect. In summary, ASP prevents overfitting on base task and does not require enormous data in few-shot incremental tasks.
  arXiv  Detail & Related papers  (2024-03-14T20:34:53Z)
• Hierarchical Prompts for Rehearsal-free Continual Learning [67.37739666753008]
  Continual learning endeavors to equip the model with the capability to integrate current task knowledge while mitigating the forgetting of past task knowledge. Inspired by prompt tuning, prompt-based methods maintain a frozen backbone and train with slight learnable prompts. This paper introduces a novel rehearsal-free paradigm for continual learning termed Hierarchical Prompts (H-Prompts)
  arXiv  Detail & Related papers  (2024-01-21T16:59:44Z)
• Fine-Grained Knowledge Selection and Restoration for Non-Exemplar Class Incremental Learning [64.14254712331116]
  Non-exemplar class incremental learning aims to learn both the new and old tasks without accessing any training data from the past. We propose a novel framework of fine-grained knowledge selection and restoration.
  arXiv  Detail & Related papers  (2023-12-20T02:34:11Z)
• Few-shot Incremental Event Detection [3.508346077709686]
  Event detection tasks can enable the quick detection of events from texts. To extend them to detect a new class without losing the ability to detect old classes requires costly retraining of the model from scratch. We define a new task, few-shot incremental event detection, which focuses on learning to detect a new event class with limited data.
  arXiv  Detail & Related papers  (2022-09-05T14:21:26Z)
• Towards Generalized and Incremental Few-Shot Object Detection [9.033533653482529]
  A novel Incremental Few-Shot Object Detection (iFSOD) method is proposed to enable the effective continual learning from few-shot samples. Specifically, a Double-Branch Framework (DBF) is proposed to decouple the feature representation of base and novel (few-shot) class. We conduct experiments on both Pascal VOC and MS-COCO, which demonstrate that our method can effectively solve the problem of incremental few-shot detection.
  arXiv  Detail & Related papers  (2021-09-23T12:38:09Z)
• Extensively Matching for Few-shot Learning Event Detection [66.31312496170139]
  Event detection models under super-vised learning settings fail to transfer to new event types. Few-shot learning has not beenexplored in event detection. We propose two novelloss factors that matching examples in the sup-port set to provide more training signals to themodel.
  arXiv  Detail & Related papers  (2020-06-17T18:30:30Z)
• Self-Supervised Learning Aided Class-Incremental Lifelong Learning [17.151579393716958]
  We study the issue of catastrophic forgetting in class-incremental learning (Class-IL) In training procedure of Class-IL, as the model has no knowledge about following tasks, it would only extract features necessary for tasks learned so far, whose information is insufficient for joint classification. We propose to combine self-supervised learning, which can provide effective representations without requiring labels, with Class-IL to partly get around this problem.
  arXiv  Detail & Related papers  (2020-06-10T15:15:27Z)
• Exploiting the Matching Information in the Support Set for Few Shot Event Classification [66.31312496170139]
  We investigate event classification under the few-shot learningsetting. We propose a novel training method for this problem that exten-sively exploit the support set during the training process. Our experiments ontwo benchmark EC datasets show that the proposed method can improvethe best reported few-shot learning models by up to 10% on accuracy for event classification.
  arXiv  Detail & Related papers  (2020-02-13T00:40:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.