Prototype-based HyperAdapter for Sample-Efficient Multi-task Tuning

Hao Zhao, Jie Fu, Zhaofeng He
10/18/2023
cs.CLcs.AI

No official code found. Best implementation: Bumble666/PHA (7 stars, Apache-2.0, last commit 2023-10-16).

Abstract

Parameter-efficient fine-tuning (PEFT) has shown its effectiveness in adapting the pre-trained language models to downstream tasks while only updating a small number of parameters. Despite the success, most existing methods independently adapt to each task without considering knowledge transfer between tasks and are limited to low-data regimes. To overcome this issue, we propose Prototype-based HyperAdapter (PHA), a novel framework built on the adapter-tuning and hypernetwork. It introduces an instance-dense retriever and a prototypical hypernetwork to generate the conditional modules in a sample-efficient manner. This leads to comparable performance improvements against existing PEFT methods on multi-task learning and few-shot transfer learning. More importantly, when the available data size gets smaller, our method outperforms other strong baselines by a large margin. Based on our extensive empirical experiments across various datasets, we demonstrate that PHA strikes a better trade-off between trainable parameters, accuracy on stream tasks, and sample efficiency.

View on arXivView PDF

Code Implementations(1)

Bumble666/PHACommunity100%
Apache-2.0

The official implementation of the paper "Prototype-based HyperAdapter for Sample-Efficient Multi-task Tuning"

71PythonOct 11, 20233 years agoApache-2.0

Similar Papers

Cite this paper

@article{zhao2023prototypebased,
  title  = {Prototype-based HyperAdapter for Sample-Efficient Multi-task Tuning},
  author = {Hao Zhao and Jie Fu and Zhaofeng He},
  year   = {2023},
  eprint = {2310.11670},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2310.11670v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2310.11670.svg)](https://codeofpaper.com/paper/2310.11670)

Discussion