Aug 2026· Discover Computing· Vol 29· 0 citations· 57 references
TL;DR
This work proposes distilling the model into a probabilistic classifier, enabling lightweight deployment without repeated LLM calls, and demonstrates that LSR improves macro-F1 scores by an average of 7.0% compared to standard zero-shot classification baselines.
Abstract
Zero-shot classification enables models to assign labels to unseen classes without task-specific training and has become increasingly effective with the advent of Large Language Models (LLMs). However, existing zero-shot classification approaches typically present all candidate labels as a flat, unstructured list within the prompt. As the number of classes grows, this formulation exacerbates well-known limitations of LLMs, including attention dilution and positional bias, ultimately degrading classification performance. We present Label Space Reduction (LSR), a test-time training method for transductive zero-shot LLM classification. LSR uses LLM-generated pseudo-labels to iteratively refine the classification label space by systematically ranking and reducing candidate classes, enabling the model to concentrate on the most relevant options. By leveraging unlabeled data with the statistical learning capabilities of data-driven models, LSR dynamically optimizes the label space representation at test time. Our experiments across seven benchmarks demonstrate that LSR improves macro-F1 scores by an average of 7.0% (up to 14.2%) with Llama-3.1-70B and 3.3% (up to 11.1%) with Claude-3.5-Sonnet compared to standard zero-shot classification baselines. To reduce the computational overhead of LSR, which requires an additional LLM call at each iteration, we propose distilling the model into a probabilistic classifier, enabling lightweight deployment without repeated LLM calls.
It is demonstrated that coupling LLM-generated annotations with ordered label correction offers an effective means of addressing the joint effects of missing and noisy labels, providing a promising approach to financial text classification when expert annotations are scarce.
This paper proposes a novel Partial label-based Self-training framework (PaSta) that leverages partial label learning technique to overcome the limitations of existing methods and designs a partial label-based classification model with two well-crafted loss functions to guide the model learning at both label and repres...
Yu-Jing Liu, Yi-Xin Liu, Yu Zheng et al.· 0 citations
FETERS is proposed, a few-shot ETSC framework that selects a dataset-level stopping ratio through class-wise leave-one-out (LOO) evaluation on the support set and uses a penalty-based reward function to manage the accuracy-earliness trade-off, thereby avoiding the need to train an additional stopping module.
Chen-An Tai, Yujia Wu, Vincent S. Tseng· 0 citations
Support Vector Generation is introduced, a kernel-based framework that converts a frozen language model into an interpretable, training-free classifier for zero-and few-shot learning and suggests that SVG offers a viable path toward efficient, interpretable NLP systems under compute constraints.
Few-shot Open-set audio classification requires classifying query samples from known classes with a few labeled support samples while rejecting query samples from unknown classes. Transductive inference jointly observes the full unlabeled query set to improve prototype estimation, yet standard transductive updates do n...
A novel weakly supervised (WS) learning MLTC framework consisting of a novel category word selection method, namely category word selection with significance ranking and crowd-sourcing (Cws-src), and a generic WS learning MLTC method, namely WS multilabel text classification with correlation-aware label propagation (Wm...
Ximing Li, Yiming Wang, Chenglong Hu et al.· IEEE Transactions on Neural...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.