How Hard is this Test Set? NLI Characterization by Exploiting Training Dynamics
Adrian Cosma, Stefan Ruseti, Mihai Dascalu, Cornelia Caragea

TL;DR
This paper introduces a method to categorize NLI test sets by difficulty using training dynamics, reducing spurious correlations and providing a more realistic evaluation of language understanding models.
Contribution
It presents an automated approach to create challenging NLI test sets and characterizes their difficulty levels without manual artificial example construction.
Findings
High difficulty examples show lower model performance.
The method reduces spurious correlation measures.
Models trained on less data with this characterization perform comparably to full-data models.
Abstract
Natural Language Inference (NLI) evaluation is crucial for assessing language understanding models; however, popular datasets suffer from systematic spurious correlations that artificially inflate actual model performance. To address this, we propose a method for the automated creation of a challenging test set without relying on the manual construction of artificial and unrealistic examples. We categorize the test set of popular NLI datasets into three difficulty levels by leveraging methods that exploit training dynamics. This categorization significantly reduces spurious correlation measures, with examples labeled as having the highest difficulty showing markedly decreased performance and encompassing more realistic and diverse linguistic phenomena. When our characterization method is applied to the training set, models trained with only a fraction of the data achieve comparable…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFault Detection and Control Systems
MethodsSparse Evolutionary Training
