MPrompt: Exploring Multi-level Prompt Tuning for Machine Reading Comprehension

Guoxin Chen, Yiming Qian, Bowen Wang, Liangzhi Li
10/27/2023
cs.CL

No official code found. Best implementation: Chen-GX/MPrompt (10 stars, last commit 2024-06-24). 1 more below.

Abstract

The large language models have achieved superior performance on various natural language tasks. One major drawback of such approaches is they are resource-intensive in fine-tuning new datasets. Soft-prompt tuning presents a resource-efficient solution to fine-tune the pre-trained language models (PLMs) while keeping their weight frozen. Existing soft prompt methods mainly focus on designing the input-independent prompts that steer the model to fit the domain of the new dataset. Those methods often ignore the fine-grained information about the task and context of the text. In this paper, we propose a multi-level prompt tuning (MPrompt) method for machine reading comprehension. It utilizes prompts at task-specific, domain-specific, and context-specific levels to enhance the comprehension of input semantics at different granularities. We also propose an independence constraint to steer each domain-specific prompt to focus on information within its domain to avoid redundancy. Moreover, we present a prompt generator that incorporates context-related knowledge in the prompt generation to enhance contextual relevancy. We conducted extensive experiments on 12 benchmarks of various QA formats and achieved an average improvement of 1.94\% over the state-of-the-art methods.

View on arXivView PDF

Code Implementations(2)

Chen-GX/MPromptCommunity100%
100Shell, PythonOct 14, 20232 years ago

Reproduce a prompt-learning technique: MPrompt, from the paper 《MPrompt: Exploring Multi-level Prompt Tuning for Machine Reading Comprehension》

00Shell, PythonJan 23, 20251 years ago

Similar Papers

Cite this paper

@article{chen2023mprompt,
  title  = {MPrompt: Exploring Multi-level Prompt Tuning for Machine Reading Comprehension},
  author = {Guoxin Chen and Yiming Qian and Bowen Wang and Liangzhi Li},
  year   = {2023},
  eprint = {2310.18167},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2310.18167v1}
}

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

Discussion