SALSA: Single-pass Autoregressive LLM Structured Classification
Ruslan Berdichevsky, Shai Nahum-Gefen, Elad Ben Zaken
TL;DR
SALSA tackles the challenge of efficiently turning decoder-only instruction-tuned LLMs into effective text classifiers by mapping each label to a unique output token and performing a single forward pass with structured prompts. The method combines class-to-token mappings, structured prompting, and LoRA-based fine-tuning to achieve strong zero-shot and few-shot performance and fast convergence, while offering an extension to continuous values via discretization. Across GLUE subsets and domain-specific benchmarks (e.g., MedNLI, MedMCQA, HateXplain), SALSA achieves state-of-the-art results and demonstrates robustness and scalability for high-throughput, real-world classification tasks. The approach reduces inference latency and preserves the base model through parameter-efficient adapters, making it well-suited for resource-constrained settings and broad applicability in NLP classification tasks.
Abstract
Despite their impressive generalization capabilities, instruction-tuned Large Language Models often underperform on text classification benchmarks. We introduce SALSA, a coherent pipeline that combines structured prompting, class-to-token mapping, and parameter-efficient fine-tuning, thereby avoiding cold-start training. Each class label is mapped to a distinct output token, and prompts are constructed to elicit a single-token response. During inference, the model's output is projected only onto the logits of the relevant class tokens, enabling efficient and accurate classification in a single forward pass. SALSA achieves state-of-the-art results across diverse benchmarks, demonstrating its robustness and scalability for LLM-based classification applications.
