Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learning
Authors: Haokun Liu, Derek Tam, Mohammed Muqeeth, Jay Mohta, Tenghao Huang, Mohit Bansal, Colin Raffel
AI-generated Key Points
- Comparison of two methods for adapting pre-trained language models to new tasks: Few-shot in-context learning (ICL) and Parameter-efficient fine-tuning (PEFT)
- ICL processes all training examples for each prediction, leading to high computational costs
- PEFT focuses on training a small set of parameters for task performance with lower costs
- Introduction of a new PEFT method called (IA)$^3$ using learned vectors to scale activations and improve performance without adding many parameters
- Proposal of T-Few, a simple recipe based on the T0 model that can be applied to new tasks without task-specific tuning or modifications
- Rigorous comparison showing that PEFT offers better accuracy and significantly lower computational costs compared to ICL
- Validation of T-Few on unseen tasks by applying it to the RAFT benchmark, achieving super-human performance and outperforming existing methods by 6% absolute
- Highlighting the advantages of PEFT over ICL in terms of efficiency and performance when adapting pre-trained language models to new tasks
- Availability of code used in experiments for further exploration and validation
Abstract: Few-shot in-context learning (ICL) enables pre-trained language models to perform a previously-unseen task without any gradient-based training by feeding a small number of training examples as part of the input. ICL incurs substantial computational, memory, and storage costs because it involves processing all of the training examples every time a prediction is made. Parameter-efficient fine-tuning (PEFT) (e.g. adapter modules, prompt tuning, sparse update methods, etc.) offers an alternative paradigm where a small set of parameters are trained to enable a model to perform the new task. In this paper, we rigorously compare few-shot ICL and PEFT and demonstrate that the latter offers better accuracy as well as dramatically lower computational costs. Along the way, we introduce a new PEFT method called (IA)$^3$ that scales activations by learned vectors, attaining stronger performance while only introducing a relatively tiny amount of new parameters. We also propose a simple recipe based on the T0 model called T-Few that can be applied to new tasks without task-specific tuning or modifications. We validate the effectiveness of T-Few on completely unseen tasks by applying it to the RAFT benchmark, attaining super-human performance for the first time and outperforming the state-of-the-art by 6% absolute. All of the code used in our experiments is publicly available.
Tools for this paper
Ask questions about this paper to our AI assistant
You can also chat with multiple papers at once here.
The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.
Similar papers summarized with our AI tools
Navigate through even more similar papers through a
tree representationLook for similar papers (in beta version)
We compare the title and abstract with papers indexed in our database. For arXiv papers, we search within the same category; for DOI and other sources, we search across sources and subjects. You can rerun the search as our database grows.
Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.