mlsanityData to 14 Oct 2026

One Network, Many Masks: Towards More Parameter-Efficient Transfer Learning

arXiv 2305.17682 ↗First posted 28 May 2023cs.CL cs.AIcited by 18

Not on the map. Why?

Abstract (arXiv)

Fine-tuning pre-trained language models for multiple tasks tends to be expensive in terms of storage. To mitigate this, parameter-efficient transfer learning (PETL) methods have been proposed to address this issue, but they still require a significant number of parameters and storage when being applied to broader ranges of tasks. To achieve even greater storage reduction, we propose PROPETL, a novel method that enables efficient sharing of a single PETL module which we call prototype network (e.g., adapter, LoRA, and prefix-tuning) across layers and tasks. We then learn binary masks to select different sub-networks from the shared prototype network and apply them as PETL modules into different layers. We find that the binary masks can determine crucial information from the network, which is often ignored in previous studies. Our work can also be seen as a type of pruning method, where we find that overparameterization also exists in the seemingly small PETL modules. We evaluate PROPETL on various downstream tasks and show that it can outperform other PETL methods with approximately 10% of the parameter storage required by the latter.

Key facts. Cited by 18 papers in the map (data through 14 Oct 2026). Builds on 29 of its 39 references that are in the map. First posted on arXiv 28 May 2023.

Builds on

29 of 39 references.

References · 29

  1. 2017Attention Is All You Needcited by 60,361
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  3. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  4. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  5. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  6. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  7. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  8. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
  9. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
  10. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,790
  11. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  12. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
17 more
  1. 2018A Call for Clarity in Reporting BLEU Scorescited by 1,799
  2. 2018Don't Give Me the Details, Just the Summary! Topic-Aware Convolutional Neural Networks for Extreme Summarizationcited by 1,317
  3. 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 872
  4. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
  5. 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 788
  6. 2021Datasets: A Community Library for Natural Language Processingcited by 530
  7. 2020AdapterHub: A Framework for Adapting Transformerscited by 444
  8. 2021Parameter-efficient Multi-task Fine-tuning for Transformers via Shared Hypernetworkscited by 284
  9. 2019Massively Multilingual Neural Machine Translation in the Wild: Findings and Challengescited by 257
  10. 2020Revisiting Few-sample BERT Fine-tuningcited by 238
  11. 2019What's Hidden in a Randomly Weighted Neural Network?cited by 237
  12. 2019Deconstructing Lottery Tickets: Zeros, Signs, and the Supermaskcited by 207
  13. 2021UniPELT: A Unified Framework for Parameter-Efficient Language Model Tuningcited by 162
  14. 2021Raise a Child in Large Language Model: Towards Effective and Generalizable Fine-tuningcited by 146
  15. 2022SparseAdapter: An Easy Approach for Improving the Parameter-Efficiency of Adapterscited by 83
  16. 2022Rare Gems: Finding Lottery Tickets at Initializationcited by 34
  17. 2022XPrompt: Exploring the Extreme of Prompt Tuningcited by 30

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 6; 2024: 9; 2025: 2; 2026: 1.

18 papers.

Sort:

By area:

  1. 2024Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Surveycited by 656
  2. 2023Parameter-Efficient Fine-Tuning Methods for Pretrained Language Models: A Critical Review and Assessmentcited by 230
  3. 2024Parameter-Efficient Fine-Tuning in Large Models: A Survey of Methodologiescited by 47
  4. 2023IncreLoRA: Incremental Parameter Allocation Method for Parameter-Efficient Fine-tuningcited by 45
  5. 2024DoRA: Enhancing Parameter-Efficient Fine-Tuning with Dynamic Rank Distributioncited by 43
  6. 2023Survival of the Most Influential Prompts: Efficient Black-Box Prompt Search via Clustering and Pruningcited by 17
  7. 2024Propulsion: Steering LLM with Tiny Fine-Tuningcited by 14
  8. 2024RST-LoRA: A Discourse-Aware Low-Rank Adaptation for Long Document Abstractive Summarizationcited by 11
  9. 2023Decomposed Prompt Tuning via Low-Rank Reparameterizationcited by 8
  10. 2024RoCoFT: Efficient Finetuning of Large Language Models with Row-Column Updatescited by 8
  11. 2023Prototype-based HyperAdapter for Sample-Efficient Multi-task Tuningcited by 6
  12. 2024Increasing Model Capacity for Free: A Simple Strategy for Parameter Efficient Fine-tuningcited by 6
6 more
  1. 2024What the Weight?! A Unified Framework for Zero-Shot Knowledge Compositioncited by 4
  2. 2024Read to Play (R2-Play): Decision Transformer with Multimodal Game Instructioncited by 4
  3. 2023ScaLearn: Simple and Highly Parameter-Efficient Task Transfer by Learning to Scalecited by 2
  4. 2025SliceFine: The Universal Winning-Slice Hypothesis for Pretrained Networkscited by 2
  5. 2025GenFT: A Generative Parameter-Efficient Fine-Tuning Method for Pretrained Foundation Modelscited by 0
  6. 2026SAPE: Sandwich Adapters for Parameter Efficiency in Large Language Model Fine-Tuningcited by 0