mlsanityData to 7 Oct 2026

FsPONER: Few-shot Prompt Optimization for Named Entity Recognition in Domain-specific Scenarios

arXiv 2407.08035 ↗First posted 10 Jul 2024cs.CL cs.IRcited by 6

Not on the map. Why?

Abstract (arXiv)

Large Language Models (LLMs) have provided a new pathway for Named Entity Recognition (NER) tasks. Compared with fine-tuning, LLM-powered prompting methods avoid the need for training, conserve substantial computational resources, and rely on minimal annotated data. Previous studies have achieved comparable performance to fully supervised BERT-based fine-tuning approaches on general NER benchmarks. However, none of the previous approaches has investigated the efficiency of LLM-based few-shot learning in domain-specific scenarios. To address this gap, we introduce FsPONER, a novel approach for optimizing few-shot prompts, and evaluate its performance on domain-specific NER datasets, with a focus on industrial manufacturing and maintenance, while using multiple LLMs -- GPT-4-32K, GPT-3.5-Turbo, LLaMA 2-chat, and Vicuna. FsPONER consists of three few-shot selection methods based on random sampling, TF-IDF vectors, and a combination of both. We compare these methods with a general-purpose GPT-NER method as the number of few-shot examples increases and evaluate their optimal NER performance against fine-tuned BERT and LLaMA 2-chat. In the considered real-world scenarios with data scarcity, FsPONER with TF-IDF surpasses fine-tuned models by approximately 10% in F1 score.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 27 of its 44 references that are in the map. First posted on arXiv 10 Jul 2024.

Builds on

27 of 44 references.

References · 27

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2020Language Models are Few-Shot Learnerscited by 32,199
  4. 2022Training language models to follow instructions with human feedbackcited by 15,712
  5. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  6. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  7. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,302
  8. 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
  9. 2022Large Language Models are Zero-Shot Reasonerscited by 4,323
  10. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
  11. 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,462
  12. 2023Lost in the Middle: How Language Models Use Long Contextscited by 3,383
15 more
  1. 2023Tree of Thoughts: Deliberate Problem Solving with Large Language Modelscited by 3,155
  2. 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,168
  3. 2021What Makes Good In-Context Examples for GPT-3?cited by 1,184
  4. 2021Fantastically Ordered Prompts and Where to Find Them: Overcoming Few-Shot Prompt Order Sensitivitycited by 1,122
  5. 2023Graph of Thoughts: Solving Elaborate Problems with Large Language Modelscited by 873
  6. 2023Instruction Tuning for Large Language Models: A Surveycited by 617
  7. 2016Neural Architectures for Named Entity Recognitioncited by 548
  8. 2023Larger language models do in-context learning differentlycited by 386
  9. 2023Large Language Models for Generative Information Extraction: A Surveycited by 183
  10. 2023GPT-NER: Named Entity Recognition via Large Language Modelscited by 158
  11. 2023Are Emergent Abilities in Large Language Models just In-Context Learning?cited by 109
  12. 2023Symbol tuning improves in-context learning in language modelscited by 72
  13. 2023Empirical Study of Zero-Shot NER with ChatGPTcited by 60
  14. 2023Investigating the Effectiveness of Task-Agnostic Prefix Prompt for Instruction Followingcited by 33
  15. 2022kNN-NER: Named Entity Recognition with Nearest Neighbor Searchcited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 3; 2026: 3.

6 papers.