Combating high variance in Data-Scarce Implicit Hate Speech Classification
Not on the map. Why?
Abstract (arXiv)
Hate speech classification has been a long-standing problem in natural language processing. However, even though there are numerous hate speech detection methods, they usually overlook a lot of hateful statements due to them being implicit in nature. Developing datasets to aid in the task of implicit hate speech classification comes with its own challenges; difficulties are nuances in language, varying definitions of what constitutes hate speech, and the labor-intensive process of annotating such data. This had led to a scarcity of data available to train and test such systems, which gives rise to high variance problems when parameter-heavy transformer-based models are used to address the problem. In this paper, we explore various optimization and regularization techniques and develop a novel RoBERTa-based model that achieves state-of-the-art performance.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 9 of its 19 references that are in the map. First posted on arXiv 29 Aug 2022.
Builds on
9 of 19 references.
References · 9
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2019What do you learn from context? Probing for sentence structure in contextualized word representationscited by 436
- 2020HateXplain: A Benchmark Dataset for Explainable Hate Speech Detectioncited by 403
- 2020Fine-Tuning Pretrained Language Models: Weight Initializations, Data Orders, and Early Stoppingcited by 377
- 2020Revisiting Few-sample BERT Fine-tuningcited by 237
- 2021Latent Hatred: A Benchmark for Understanding Implicit Hate Speechcited by 216
- 2019Mixout: Effective Regularization to Finetune Large-scale Pretrained Language Modelscited by 141
- 2016Analyzing the Targets of Hate in Online Social Mediacited by 48
- 2022Hidden behind the obvious: misleading keywords and implicitly abusive language on social mediacited by 6
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 1.
2 papers.