Boosting Short Text Classification with Multi-Source Information Exploration and Dual-Level Contrastive Learning

Yonghao Liu, Mengyu Li, Wei Pang, Fausto Giunchiglia, Lan Huang +2 more
1/16/2025
cs.CL

No official code found. Best implementation: KEAML-JLU/MI-DELIGHT (6 stars, last commit 2025-08-14).

Abstract

Short text classification, as a research subtopic in natural language processing, is more challenging due to its semantic sparsity and insufficient labeled samples in practical scenarios. We propose a novel model named MI-DELIGHT for short text classification in this work. Specifically, it first performs multi-source information (i.e., statistical information, linguistic information, and factual information) exploration to alleviate the sparsity issues. Then, the graph learning approach is adopted to learn the representation of short texts, which are presented in graph forms. Moreover, we introduce a dual-level (i.e., instance-level and cluster-level) contrastive learning auxiliary task to effectively capture different-grained contrastive information within massive unlabeled data. Meanwhile, previous models merely perform the main task and auxiliary tasks in parallel, without considering the relationship among tasks. Therefore, we introduce a hierarchical architecture to explicitly model the correlations between tasks. We conduct extensive experiments across various benchmark datasets, demonstrating that MI-DELIGHT significantly surpasses previous competitive models. It even outperforms popular large language models on several datasets.

View on arXivView PDF

Code Implementations(1)

The source code for "Boosting Short Text Classification with Multi-Source Information Exploration and Dual-Level Contrastive Learning"

61PythonDec 15, 20241 years ago

Similar Papers

Cite this paper

@article{liu2025boosting,
  title  = {Boosting Short Text Classification with Multi-Source Information Exploration and Dual-Level Contrastive Learning},
  author = {Yonghao Liu and Mengyu Li and Wei Pang and Fausto Giunchiglia and Lan Huang and Xiaoyue Feng and Renchu Guan},
  year   = {2025},
  eprint = {2501.09214},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2501.09214v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2501.09214.svg)](https://codeofpaper.com/paper/2501.09214)

Discussion