Language Models for Text Classification: Is In-Context Learning Enough?
Aleksandra Edwards, Jose Camacho-Collados
TL;DR
The paper tackles the question of whether in-context learning with large language models can replace traditional fine-tuning for text classification in low-resource settings. It conducts a large-scale, cross-task comparison across 16 datasets and 7 domains, contrasting zero- and one-shot prompting of LLMs (LLaMA, Flan-T5, T5, GPT-3.5) with fine-tuned RoBERTa and FastText baselines. The findings show that while prompting with instruction-tuned models can outperform some baselines in low-resource scenarios, fine-tuned smaller models generally achieve higher accuracy, especially on multiclass and multilabel tasks, or when training data is available. The results emphasize that data efficiency and domain versatility of smaller, fine-tuned models currently surpass the out-of-the-box capabilities of prompting-based LLMs for text classification, though prompting remains a promising avenue in data-scarce contexts. These insights inform practical choices between prompt-based LLMs and traditional fine-tuning approaches in real-world, low-resource NLP applications.
Abstract
Recent foundational language models have shown state-of-the-art performance in many NLP tasks in zero- and few-shot settings. An advantage of these models over more standard approaches based on fine-tuning is the ability to understand instructions written in natural language (prompts), which helps them generalise better to different tasks and domains without the need for specific training data. This makes them suitable for addressing text classification problems for domains with limited amounts of annotated instances. However, existing research is limited in scale and lacks understanding of how text generation models combined with prompting techniques compare to more established methods for text classification such as fine-tuning masked language models. In this paper, we address this research gap by performing a large-scale evaluation study for 16 text classification datasets covering binary, multiclass, and multilabel problems. In particular, we compare zero- and few-shot approaches of large language models to fine-tuning smaller language models. We also analyse the results by prompt, classification type, domain, and number of labels. In general, the results show how fine-tuning smaller and more efficient language models can still outperform few-shot approaches of larger language models, which have room for improvement when it comes to text classification.
