Boosting Short Text Classification with Multi-Source Information Exploration and Dual-Level Contrastive Learning
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908187030978560 |
|---|---|
| author | Liu, Yonghao Li, Mengyu Pang, Wei Giunchiglia, Fausto Huang, Lan Feng, Xiaoyue Guan, Renchu |
| author_facet | Liu, Yonghao Li, Mengyu Pang, Wei Giunchiglia, Fausto Huang, Lan Feng, Xiaoyue Guan, Renchu |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_09214 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Boosting Short Text Classification with Multi-Source Information Exploration and Dual-Level Contrastive Learning Liu, Yonghao Li, Mengyu Pang, Wei Giunchiglia, Fausto Huang, Lan Feng, Xiaoyue Guan, Renchu Computation and Language 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. |
| title | Boosting Short Text Classification with Multi-Source Information Exploration and Dual-Level Contrastive Learning |
| topic | Computation and Language |
| url | https://arxiv.org/abs/2501.09214 |