Pith. sign in

REVIEW 1 cited by

Evolutionary Data Measures: Understanding the Difficulty of Text Classification Tasks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1811.01910 v2 pith:UTITDBCI submitted 2018-11-05 cs.CL cs.AIcs.LGcs.NE

classification cs.CLcs.AIcs.LGcs.NE
keywords datasetsmeasureclassificationdatadatasetdifficultytextanalyse
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Small Language Models in the Real World: Insights from Industrial Text Classification

    cs.CL 2025-05 conditional novelty 4.0 of 10

    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.

Pith tools