Transferring Knowledge via Neighborhood-Aware Optimal Transport for Low-Resource Hate Speech Detection
Tulika Bose, Irina Illina, Dominique Fohr

TL;DR
This paper introduces a flexible neighborhood-aware transfer learning method using Optimal Transport to improve hate speech detection in low-resource settings, leveraging data geometry for better knowledge transfer.
Contribution
It proposes a novel training strategy that combines neighborhood information with Optimal Transport to enhance transfer learning for hate speech detection.
Findings
Significant performance improvements over baselines in low-resource scenarios
Effective utilization of data geometry via Optimal Transport
Enhanced transfer learning across multiple hate speech datasets
Abstract
The concerning rise of hateful content on online platforms has increased the attention towards automatic hate speech detection, commonly formulated as a supervised classification task. State-of-the-art deep learning-based approaches usually require a substantial amount of labeled resources for training. However, annotating hate speech resources is expensive, time-consuming, and often harmful to the annotators. This creates a pressing need to transfer knowledge from the existing labeled resources to low-resource hate speech corpora with the goal of improving system performance. For this, neighborhood-based frameworks have been shown to be effective. However, they have limited flexibility. In our paper, we propose a novel training strategy that allows flexible modeling of the relative proximity of neighbors retrieved from a resource-rich corpus to learn the amount of transfer. In…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHate Speech and Cyberbullying Detection · Internet Traffic Analysis and Secure E-voting
