用描述检索提升少样本关系抽取,缓解模型遗忘问题。
Few-Shot, No Problem: Descriptive Continual Relation Extraction
- 基于大模型生成关系描述,用双编码器增强表示学习。
- 通过双向排序融合实现精准关系预测,准确率显著提升。
- 适合需要持续学习新关系的动态场景应用。
少样本持续关系抽取是让AI系统识别并适应动态现实领域中不断演化的关系的关键挑战。传统基于记忆的方法在样本有限时容易过拟合,难以巩固旧知识,而少样本场景下数据稀缺进一步加剧了潜在空间数据增强的困难。本文提出一种新型基于检索的解决方案:首先利用大语言模型为每种关系生成描述;基于这些描述,引入双编码器检索训练范式,以丰富样本与类别表征学习。借助这些增强的表征,设计了一种基于检索的预测方法,每个样本通过结合关系描述向量与类别原型的双向排序融合得分,检索最匹配的关系。在多个数据集上的大量实验表明,该方法在连续任务上保持稳健性能,显著优于当前最佳方法,有效缓解灾难性遗忘。
原文摘要 · Abstract (English)
Few-shot Continual Relation Extraction is a crucial challenge for enabling AI systems to identify and adapt to evolving relationships in dynamic real-world domains. Traditional memory-based approaches often overfit to limited samples, failing to reinforce old knowledge, with the scarcity of data in few-shot scenarios further exacerbating these issues by hindering effective data augmentation in the latent space. In this paper, we propose a novel retrieval-based solution, starting with a large language model to generate descriptions for each relation. From these descriptions, we introduce a bi-encoder retrieval training paradigm to enrich both sample and class representation learning. Leveraging these enhanced representations, we design a retrieval-based prediction method where each sample "retrieves" the best fitting relation via a reciprocal rank fusion score that integrates both relation description vectors and class prototypes. Extensive experiments on multiple datasets demonstrate that our method significantly advances the state-of-the-art by maintaining robust performance across sequential tasks, effectively addressing catastrophic forgetting.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。