about
GPT Understands, Too (arxiv.org)
2 points by optimalsolver on Mar 26, 2021 | hide | past | pdf | discuss on HN

In plain words: Instead of hand-writing a fixed question and hoping the model answers well, this trains learnable word-like pieces beside the hand-written words. It steadied performance across wordings and beat the fixed-question setup on knowledge and language tasks, even when the model itself is not updated.

Abstract

Prompting a pretrained language model with natural language patterns has been proved effective for natural language understanding (NLU). However, our preliminary study reveals that manual discrete prompts often lead to unstable performance -- e.g., changing a single word in the prompt might result in substantial performance drop. We propose a novel method P-Tuning that employs trainable continuous prompt embeddings in concatenation with discrete prompts. Empirically, P-Tuning not only stabilizes training by minimizing the gap between various discrete prompts, but also improves performance by a sizeable margin on a wide range of NLU tasks including LAMA and SuperGLUE. P-Tuning is generally effective for both frozen and tuned language models, under both the fully-supervised and few-shot settings.

Xiao Liu, Yanan Zheng, Zhengxiao Du, Ming Ding, Yujie Qian, Zhilin Yang, Jie Tang
arXiv:2103.10385 · cs.CL, cs.LG · submitted Mar 18, 2021 · updated Oct 25, 2023
abstract · pdf · html

add comment on HN