Dynamic Task Vector Grouping for Efficient Multi-Task Prompt Tuning

Multi-task prompt tuning utilizes multiple highresource source tasks to improve performance on low-source target tasks.Existing approaches transfer the soft prompt trained by combining all source tasks or a single "high-similar" source task one-time-only.However, we find that the optimal transfer performance often comes from a combination of source tasks, which is neither one nor all.Further, we find that the similarity between source and target tasks also changes dynamically during fine-tuning after transfering, making similarity calculation in the initiation stage inadequate.To address these issues, we propose a method called Dynamic Task Vector Grouping (DTVG), whose core ideas contain (1) measuring the task similarity with task vectors instead of soft prompt, (2) grouping the optimal source task combination based on two metrics: target similarity and knowledge consistency;(3) dynamically updating the combination in each iteration step.Extensive experiments on the 26 NLP datasets under different settings demonstrate that DTVG effectively groups similar source tasks while reducing negative transfer, achieving the start-of-art performance.

Authors

Publication Details

Published
2025-01-01
DOI
https://doi.org/10.18653/v1/2025.findings-acl.1374
Citations
1
Primary Topic
Parallel Computing and Optimization Techniques
Type
article
Field-Weighted Citation Impact
2.27
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dynamic Task Vector Grouping for Efficient Multi-Task Prompt Tuning

Richong Zhang, Ziqiao Wang, Zhijie Nie, Pengfei Zhang
1 citations
Parallel Computing and Optimization Techniques
2.27
article

Dynamic Task Vector Grouping for Efficient Multi-Task Prompt Tuning

Richong Zhang, Ziqiao Wang, Zhijie Nie, Pengfei Zhang
article en
1 citations

Abstract

Multi-task prompt tuning utilizes multiple highresource source tasks to improve performance on low-source target tasks.Existing approaches transfer the soft prompt trained by combining all source tasks or a single "high-similar" source task one-time-only.However, we find that the optimal transfer performance often comes from a combination of source tasks, which is neither one nor all.Further, we find that the similarity between source and target tasks also changes dynamically during fine-tuning after transfering, making similarity calculation in the initiation stage inadequate.To address these issues, we propose a method called Dynamic Task Vector Grouping (DTVG), whose core ideas contain (1) measuring the task similarity with task vectors instead of soft prompt, (2) grouping the optimal source task combination based on two metrics: target similarity and knowledge consistency;(3) dynamically updating the combination in each iteration step.Extensive experiments on the 26 NLP datasets under different settings demonstrate that DTVG effectively groups similar source tasks while reducing negative transfer, achieving the start-of-art performance.

Openalex Percentile: Top 13%
Parallel Computing and Optimization Techniques
2.27
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Dynamic Task Vector Grouping for Efficient Multi-Task Prompt Tuning — Richong Zhang, Ziqiao Wang, et al. · (2025) | TGRS Research Map | TGRS