Cost-Aware Model Selection for Text Classification: Multi-Objective Trade-offs Between Fine-Tuned Encoders and LLM Prompting in Production
Not on the map. Why?
Abstract (arXiv)
Large language models (LLMs) such as GPT-4o and Claude Sonnet 4.5 have demonstrated strong capabilities in open-ended reasoning and generative language tasks, leading to their widespread adoption across a broad range of NLP applications. However, for structured text classification problems with fixed label spaces, model selection is often driven by predictive performance alone, overlooking operational constraints encountered in production systems. In this work, we present a systematic comparison of two contrasting paradigms for text classification: zero- and few-shot prompt-based large language models, and fully fine-tuned encoder-only architectures. We evaluate these approaches across four canonical benchmarks (IMDB, SST-2, AG News, and DBPedia), measuring predictive quality (macro F1), inference latency, and monetary cost. We frame model evaluation as a multi-objective decision problem and analyze trade-offs using Pareto frontier projections and a parameterized utility function reflecting different deployment regimes. Our results show that fine-tuned encoder-based models from the BERT family achieve competitive, and often superior, classification performance while operating at one to two orders of magnitude lower cost and latency compared to zero- and few-shot LLM prompting. Overall, our findings suggest that indiscriminate use of large language models for standard text classification workloads can lead to suboptimal system-level outcomes. Instead, fine-tuned encoders emerge as robust and efficient components for structured NLP pipelines, while LLMs are better positioned as complementary elements within hybrid architectures. We release all code, datasets, and evaluation protocols to support reproducibility and cost-aware NLP system design.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 17 of its 34 references that are in the map. First posted on arXiv 6 Feb 2026.
Builds on
17 of 34 references.
References · 17
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,307
- 2021On the Opportunities and Risks of Foundation Modelscited by 4,033
- 2017Axiomatic Attribution for Deep Networkscited by 3,384
- 2023Sparks of Artificial General Intelligence: Early experiments with GPT-4cited by 2,592
- 2015Character-level Convolutional Networks for Text Classificationcited by 2,330
- 2019Energy and Policy Considerations for Deep Learning in NLPcited by 1,254
- 2022Atlas: Few-shot Learning with Retrieval Augmented Language Modelscited by 952
- 2021Carbon Emissions and Large Neural Network Trainingcited by 567
5 more
- 2020Evaluation: from precision, recall and F-measure to ROC, informedness, markedness and correlationcited by 425
- 2022Measuring the Carbon Intensity of AI in Cloud Instancescited by 111
- 2024Fine-Tuned 'Small' LLMs (Still) Significantly Outperform Zero-Shot Generative AI Models in Text Classificationcited by 70
- 2025Large Language Models For Text Classification: Case Study And Comprehensive Reviewcited by 12
- 2024Advancing Single and Multi-task Text Classification through Large Language Model Fine-tuningcited by 7
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026The Embedder's Dilemma: LLMs Are Better, but at What Cost?13 Aug 2026