Easy Adaptation: An Efficient Task-Specific Knowledge Injection Method for Large Models in Resource-Constrained Environments
Not on the map. Why?
Abstract (arXiv)
While the enormous parameter scale endows Large Models (LMs) with unparalleled performance, it also limits their adaptability across specific tasks. Parameter-Efficient Fine-Tuning (PEFT) has emerged as a critical approach for effectively adapting LMs to a diverse range of downstream tasks. However, existing PEFT methods face two primary challenges: (1) High resource cost. Although PEFT methods significantly reduce resource demands compared to full fine-tuning, it still requires substantial time and memory, making it impractical in resource-constrained environments. (2) Parameter dependency. PEFT methods heavily rely on updating a subset of parameters associated with LMs to incorporate task-specific knowledge. Yet, due to increasing competition in the LMs landscape, many companies have adopted closed-source policies for their leading models, offering access only via Application Programming Interface (APIs). Whereas, the expense is often cost-prohibitive and difficult to sustain, as the fine-tuning process of LMs is extremely slow. Even if small models perform far worse than LMs in general, they can achieve superior results on particular distributions while requiring only minimal resources. Motivated by this insight, we propose Easy Adaptation (EA), which designs Specific Small Models (SSMs) to complement the underfitted data distribution for LMs. Extensive experiments show that EA matches the performance of PEFT on diverse tasks without accessing LM parameters, and requires only minimal resources.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 24 of its 29 references that are in the map. First posted on arXiv 19 Dec 2025.
Builds on
24 of 29 references.
References · 24
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,795
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
- 2018XNLI: Evaluating Cross-lingual Sentence Representationscited by 915
- 2016Abstractive Text Summarization Using Sequence-to-Sequence RNNs and Beyondcited by 812
- 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 788
- 2024Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Surveycited by 656
- 2021Explaining Neural Scaling Lawscited by 363
12 more
- 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 357
- 2022DyLoRA: Parameter Efficient Tuning of Pre-trained Models using Dynamic Search-Free Low-Rank Adaptationcited by 233
- 2021Training Neural Networks with Fixed Sparse Maskscited by 214
- 2021Composable Sparse Fine-Tuning for Cross-Lingual Transfercited by 144
- 2016Yelp Dataset Challenge: Review Rating Predictioncited by 84
- 2021Cross-Attention is All You Need: Adapting Pretrained Transformers for Machine Translationcited by 74
- 2023Conditional Adapters: Parameter-efficient Transfer Learning with Fast Inferencecited by 69
- 2023Distributed Inference and Fine-tuning of Large Language Models Over The Internetcited by 42
- 2024Large Language Models for Medicine: A Surveycited by 38
- 2023Unified Low-Resource Sequence Labeling by Sample-Aware Dynamic Sparse Finetuningcited by 21
- 2024Improving Large Models with Small models: Lower Costs and Better Performancecited by 14
- 2024Logic Distillation: Learning from Code Function by Function for Decision-making Taskscited by 5
Built on by
Citing papers per year: 2026: 1.
1 paper.