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
- Qiuchi Li (ORCID: https://orcid.org/0000-0002-8219-0869)
- Prayag Tiwari (ORCID: https://orcid.org/0000-0002-2851-4260)
- Jing Qin (ORCID: https://orcid.org/0000-0002-7059-0929)
- Yazhou Zhang (ORCID: https://orcid.org/0000-0002-5699-0176)
- Mengyao Wang (ORCID: https://orcid.org/0009-0003-3810-8164)
Institutions
- Hong Kong Polytechnic University (HK)
- Chongqing University (CN)
- Tianjin University (CN)
- Zhengzhou University of Light Industry (CN)
- Halmstad University (SE)
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
- Chongqing University
- Hong Kong Polytechnic University
- Natural Science Foundation of Henan Province