paper-with-me

홈 › Papers

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

2025-01-16 · Yonghao Liu, Mengyu Li, Wei Pang, Fausto Giunchiglia, Lan Huang, Xiaoyue Feng, Renchu Guan

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.

📄 PDF Abstract BibTeX arXiv:2501.09214

Code (1)

keaml-jlu/mi-delight 공식 구현 pytorch

Tasks

Contrastive LearningGraph Learningtext-classificationText Classification

Methods 이 논문이 사용한 방법론

Contrastive Learning 설명 없음

Similar Papers 제목 키워드 기반

IPBoost -- Non-Convex Boosting via Integer Programming

2020-02-11 · Marc E. Pfetsch, Sebastian Pokutta

Recently non-convex optimization approaches for solving machine learning problems have gained significant attention. In this paper we explore non-convex boosting in classification by means of integer programming and demo…

BIG-bench Machine LearningGeneral Classification

IPBoost – Non-Convex Boosting via Integer Programming

2020-01-01 · ICML 2020 1 · Sebastian Pokutta, Marc Pfetsch

Recently non-convex optimization approaches for solving machine learning problems have gained significant attention. In this paper we explore non-convex boosting in classification by means of integer programming and demo…

BIG-bench Machine Learning

Astronomical source finding services for the CIRASA visual analytic platform

2021-10-15 · S. Riggi, C. Bordiu, F. Vitello, G. Tudisco 외

Innovative developments in data processing, archiving, analysis, and visualization are nowadays unavoidable to deal with the data deluge expected in next-generation facilities for radio astronomy, such as the Square Kilo…

AstronomyData Visualization

Fast Image Classification by Boosting Fuzzy Classifiers

2016-10-04 · Marcin Korytkowski, Leszek Rutkowski, Rafał Scherer

This paper presents a novel approach to visual objects classification based on generating simple fuzzy classifiers using local image features to distinguish between one known class and other classes. Boosting meta learni…

ClassificationGeneral Classificationimage-classificationImage Classification+1

Tricks and Plug-ins for Gradient Boosting with Transformers

2025-08-04 · Biyi Fang, Truong Vo, Jean Utke, Diego Klabjan arxiv

Transformer architectures dominate modern NLP but often demand heavy computational resources and intricate hyperparameter tuning. To mitigate these challenges, we propose a novel framework, BoostTransformer, that augment…

Text Classification