Pushing The Limit of LLM Capacity for Text Classification

In this era of open-ended language modeling, where task boundaries are gradually fading, an urgent question emerges: have we made significant progress in text classification with the full benefit of LLMs? To answer this question, we propose RGPT, an adaptive boosting framework tailored to produce a specialized text classification LLM by recurrently ensembling a pool of base learners. The base learners are constructed by adaptively adjusting the distribution of training samples and iteratively fine-tuning LLMs with them. Such base learners are then ensembled to be a specialized text classification LLM, by recurrently incorporating the historical predictions from the previous learners. Through a comprehensive empirical comparison, we show that RGPT significantly outperforms 8 state-of-the-art (SoTA) PLMs and 7 SoTA LLMs on four benchmarks by 2.90% on average. Further evaluation experiments reveal a clear superiority of RGPT over average human classification performance.

Authors

Institutions

Publication Details

Published
2025-05-08
DOI
https://doi.org/10.1145/3701716.3715528
Citations
27
Primary Topic
Mathematics, Computing, and Information Processing
Type
article
Field-Weighted Citation Impact
40.62

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Pushing The Limit of LLM Capacity for Text Classification

Qiuchi Li, Prayag Tiwari, Jing Qin, Yazhou Zhang et al.
27 citations
Mathematics, Computing, and Information Processing
40.62
article

Pushing The Limit of LLM Capacity for Text Classification

Qiuchi Li, Prayag Tiwari, Jing Qin, Yazhou Zhang, Mengyao Wang
article en
27 citations

Abstract

In this era of open-ended language modeling, where task boundaries are gradually fading, an urgent question emerges: have we made significant progress in text classification with the full benefit of LLMs? To answer this question, we propose RGPT, an adaptive boosting framework tailored to produce a specialized text classification LLM by recurrently ensembling a pool of base learners. The base learners are constructed by adaptively adjusting the distribution of training samples and iteratively fine-tuning LLMs with them. Such base learners are then ensembled to be a specialized text classification LLM, by recurrently incorporating the historical predictions from the previous learners. Through a comprehensive empirical comparison, we show that RGPT significantly outperforms 8 state-of-the-art (SoTA) PLMs and 7 SoTA LLMs on four benchmarks by 2.90% on average. Further evaluation experiments reveal a clear superiority of RGPT over average human classification performance.

Hong Kong Polytechnic University (HK), Chongqing University (CN), Tianjin University (CN), Zhengzhou University of Light Industry (CN), Halmstad University (SE)
Chongqing University, Hong Kong Polytechnic University, Natural Science Foundation of Henan Province
Openalex Percentile: Top 0%
Mathematics, Computing, and Information Processing
40.62
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.