Learning Easily Updated General Purpose Text Representations with Adaptable Task-Specific Prefixes

Kuan-Hao Huang, Liang Tan, Rui Hou, Sinong Wang, Amjad Almahairi +1 more
5/22/2023
cs.CL

No confident code implementation found for this paper.

Abstract

Many real-world applications require making multiple predictions from the same text. Fine-tuning a large pre-trained language model for each downstream task causes computational burdens in the inference time due to several times of forward passes. To amortize the computational cost, freezing the language model and building lightweight models for downstream tasks based on fixed text representations are common solutions. Accordingly, how to learn fixed but general text representations that can generalize well to unseen downstream tasks becomes a challenge. Previous works have shown that the generalizability of representations can be improved by fine-tuning the pre-trained language model with some source tasks in a multi-tasking way. In this work, we propose a prefix-based method to learn the fixed text representations with source tasks. We learn a task-specific prefix for each source task independently and combine them to get the final representations. Our experimental results show that prefix-based training performs better than multi-tasking training and can update the text representations at a smaller computational cost than multi-tasking training.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{huang2023learning,
  title  = {Learning Easily Updated General Purpose Text Representations with Adaptable Task-Specific Prefixes},
  author = {Kuan-Hao Huang and Liang Tan and Rui Hou and Sinong Wang and Amjad Almahairi and Ruty Rinott},
  year   = {2023},
  eprint = {2305.13499},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.13499v2}
}

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/2305.13499.svg)](https://codeofpaper.com/paper/2305.13499)

Discussion