arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2209.01975cs.CL
收藏

选择性注释使语言模型更好地用于Few-Shot学习

Selective Annotation Makes Language Models Better Few-Shot Learners

The University of Hong Kong(香港大学);University of Washington(华盛顿大学);Carnegie Mellon University(卡内基梅隆大学);Meta AI;Penn State University(宾夕法尼亚州立大学);Allen Institute for AI(艾伦人工智能研究所)

Hongjin Su, Jungo Kasai, Chen Henry Wu, Weijia Shi, Tianlu Wang, Jiayi Xin, Rui Zhang, Mari Ostendorf, Luke Zettlemoyer, Noah A. Smith, Tao Yu

摘要:

许多最近的自然语言任务的方法是建立在大语言模型的显着能力。大语言模型可以执行上下文学习,其中它们从一些任务演示中学习新任务,而无需任何参数更新。这项工作探讨了上下文学习的影响,为新的自然语言任务的数据集的创建。从最近的上下文学习方法出发,我们制定了一个注释效率,两步框架:选择性的注释,选择一个池的例子,从未标记的数据进行注释提前,然后迅速检索,检索任务的例子,在测试时从注释池。基于这个框架,我们提出了一个无监督的,基于图的选择性注释方法,voke-k,选择不同的,有代表性的例子进行注释。在10个数据集(包括分类、常识推理、对话和文本/代码生成)上进行的大量实验表明,我们的选择性注释方法大大提高了任务性能。平均而言,vote-k在18/100的注释预算下实现了12.9%/11.4%的相对增益,与随机选择示例进行注释相比。与最先进的监督微调方法相比,它在10个任务中的注释成本降低了10- 100倍。我们进一步分析了我们的框架在各种情况下的有效性:不同大小的语言模型,替代选择性注释方法,以及有测试数据域转移的情况。我们希望我们的研究将作为数据注释的基础,因为大语言模型越来越多地应用于新的任务。我们的代码可在https://github.com/HKUNLP/icl-selective-annotation上获得。

英文摘要:

Many recent approaches to natural language tasks are built on the remarkable abilities of large language models. Large language models can perform in-context learning, where they learn a new task from a few task demonstrations, without any parameter updates. This work examines the implications of in-context learning for the creation of datasets for new natural language tasks. Departing from recent in-context learning methods, we formulate an annotation-efficient, two-step framework: selective annotation that chooses a pool of examples to annotate from unlabeled data in advance, followed by prompt retrieval that retrieves task examples from the annotated pool at test time. Based on this framework, we propose an unsupervised, graph-based selective annotation method, voke-k, to select diverse, representative examples to annotate. Extensive experiments on 10 datasets (covering classification, commonsense reasoning, dialogue, and text/code generation) demonstrate that our selective annotation method improves the task performance by a large margin. On average, vote-k achieves a 12.9%/11.4% relative gain under an annotation budget of 18/100, as compared to randomly selecting examples to annotate. Compared to state-of-the-art supervised finetuning approaches, it yields similar performance with 10-100x less annotation cost across 10 tasks. We further analyze the effectiveness of our framework in various scenarios: language models with varying sizes, alternative selective annotation methods, and cases where there is a test data domain shift. We hope that our studies will serve as a basis for data annotations as large language models are increasingly applied to new tasks. Our code is available at https://github.com/HKUNLP/icl-selective-annotation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑