Sub-Billion, Super-Frontier: Small Language Models Rival Zero-Shot Frontier LLMs on General and Literary Relation Extraction

📅 2026-06-21
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
This study addresses the high computational cost and reliance on proprietary APIs of large language models (LLMs) in relation extraction, which hinder deployment in resource-constrained or privacy-sensitive settings. The authors systematically evaluate small language models ranging from 360M to 3B parameters, exploring their potential to replace state-of-the-art LLMs through supervised fine-tuning, prompt-conditioned tuning, 4-bit quantization, and cross-domain data pooling on both general and literary texts. Experimental results demonstrate that task-adapted sub-billion-parameter models—such as Qwen2.5-0.5B—significantly outperform GPT-5.4 and Claude Sonnet 4.6 in zero-shot settings, achieving micro F1 scores of 0.83 on general-domain data and 0.92 on literary texts. These models can be efficiently deployed on a single consumer-grade GPU, underscoring the critical role of task-specific fine-tuning in achieving high performance.
📝 Abstract
Large language models (LLMs) achieve strong relation extraction (RE), but their computational demands and reliance on proprietary APIs limit deployment in resource-constrained or privacy-sensitive settings. We investigate how far small language models (SLMs) can close this gap across general-domain and literary text. We evaluate five models from 360M to 3B parameters under three domain-composition regimes and two prompt-conditioned tuning styles (30 configurations), comparing them with zero-shot frontier LLMs and a discriminative RoBERTa baseline. Across nine benchmarks, the best sub-billion model, Qwen2.5-0.5B fine-tuned on pooled general-domain data, achieves a general-domain positive-class micro-F1 of 0.83, versus 0.69 for GPT-5.4 and 0.66 for Claude Sonnet 4.6 evaluated zero-shot. This does not imply that SLMs are intrinsically stronger; rather, targeted task adaptation enables 4-bit models deployable on a single consumer GPU to outperform general-purpose frontier systems under this protocol. An in-domain RoBERTa baseline also exceeds both frontier models, indicating that the gain stems from task adaptation rather than generative decoding. On literary RE, tuned SLMs reach 0.92 on the human-annotated Biographical benchmark versus 0.83 for GPT-5.4, and 0.833 versus 0.578 on the two-benchmark literary average. A targeted domain-adaptive pretraining case study yields no practically meaningful gain over supervised fine-tuning, while the cleanest within-family scale comparison shows only marginal improvement. These results show that, when task-specific data are available, compact task-adapted models can provide accurate, private, and hardware-efficient RE.
Problem

Research questions and friction points this paper is trying to address.

relation extraction
small language models
large language models
task adaptation
resource-constrained deployment
Innovation

Methods, ideas, or system contributions that make the work stand out.

small language models
relation extraction
task-specific fine-tuning
zero-shot LLMs
efficient deployment
🔎 Similar Papers
No similar papers found.