PromptBoosting: Black-Box Text Classification with Ten Forward Passes
원문 초록
We describe PromptBoosting, a query-efficient procedure for building a text classifier from a neural language model (LM) without access to the LM's parameters, gradients, or hidden representations. This form of "black-box" classifier training has become increasingly important as the cost of training and inference in large-scale LMs grows. But existing black-box LM classifier learning approaches are themselves computationally inefficient, typically specializing LMs to the target task by searching in a large space of (discrete or continuous) prompts using zeroth-order optimization methods. Instead of directly optimizing in prompt space, PromptBoosting obtains a small pool of prompts via a gradient-free approach and then constructs a large pool of weak learners by pairing these prompts with different elements of the LM's output distribution. These weak learners are then ensembled using the AdaBoost algorithm. The entire learning process requires only a small number of forward passes and no backward pass. Experiments show that PromptBoosting achieves state-of-the-art performance in multiple black-box few-shot classification tasks, and matches or outperforms full fine-tuning in both few-shot and standard learning paradigms, while training 10x faster than existing black-box methods.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Making Language Model a Hierarchical Classifier and Generator
Can Generated Images Serve as a Viable Modality for Text-Centric Multimodal Learning?
ICS: Total Freedom in Manual Text Classification Supported by Unobtrusive Machine Learning
AdaptText: A Novel Framework for Domain-Independent Automated Sinhala Text Classification
A Method for MBTI Classification Based on Impact of Class Components
Targeted Data-driven Regularization for Out-of-Distribution Generalization
토론
이 논문과 연결된 포럼 글이 아직 없습니다.