For 1B to 3B models, prompting alone is near random, while training a small classification head on frozen weights is the most accurate and VRAM-efficient path, with data volume and pretraining domain as the main bottlenecks.
Evolutionary Data Measures: Understanding the Difficulty of Text Classification Tasks
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Classification tasks are usually analysed and improved through new model architectures or hyperparameter optimisation but the underlying properties of datasets are discovered on an ad-hoc basis as errors occur. However, understanding the properties of the data is crucial in perfecting models. In this paper we analyse exactly which characteristics of a dataset best determine how difficult that dataset is for the task of text classification. We then propose an intuitive measure of difficulty for text classification datasets which is simple and fast to calculate. We show that this measure generalises to unseen data by comparing it to state-of-the-art datasets and results. This measure can be used to analyse the precise source of errors in a dataset and allows fast estimation of how difficult a dataset is to learn. We searched for this measure by training 12 classical and neural network based models on 78 real-world datasets, then use a genetic algorithm to discover the best measure of difficulty. Our difficulty-calculating code ( https://github.com/Wluper/edm ) and datasets ( http://data.wluper.com ) are publicly available.
fields
cs.CL 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Small Language Models in the Real World: Insights from Industrial Text Classification
For 1B to 3B models, prompting alone is near random, while training a small classification head on frozen weights is the most accurate and VRAM-efficient path, with data volume and pretraining domain as the main bottlenecks.