Identifying Semantically Difficult Samples to Improve Text Classification
Not on the map. Why?
Abstract (arXiv)
In this paper, we investigate the effect of addressing difficult samples from a given text dataset on the downstream text classification task. We define difficult samples as being non-obvious cases for text classification by analysing them in the semantic embedding space; specifically - (i) semantically similar samples that belong to different classes and (ii) semantically dissimilar samples that belong to the same class. We propose a penalty function to measure the overall difficulty score of every sample in the dataset. We conduct exhaustive experiments on 13 standard datasets to show a consistent improvement of up to 9% and discuss qualitative results to show effectiveness of our approach in identifying difficult samples for a text classification model.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 9 of its 21 references that are in the map. First posted on arXiv 13 Feb 2023.
Builds on
9 of 21 references.
References · 9
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
- 2016Enriching Word Vectors with Subword Informationcited by 1,578
- 2017Automated Hate Speech Detection and the Problem of Offensive Languagecited by 724
- 2019Data Shapley: Equitable Valuation of Data for Machine Learningcited by 617
- 2020Dataset Cartography: Mapping and Diagnosing Datasets with Training Dynamicscited by 423
- 2019Data Valuation using Reinforcement Learningcited by 115
- 2019Improving Neural Conversational Models with Entropy-Based Data Filteringcited by 30
- 2019SemEval-2016 Task 4: Sentiment Analysis in Twittercited by 14
- 2018Evolutionary Data Measures: Understanding the Difficulty of Text Classification Taskscited by 11
Built on by
Not cited yet.