Modality-Consistent Prompt Tuning With Optimal Transport

Prompt tuning has been successfully used in leveraging the knowledge of Large-scale Vision-Language Pre-trained (VLP) models on downstream tasks. Most existing prompt tuning approaches learn prompts by maximizing the pairwise similarity. Although samples in different modalities might be relatively aligned pairwisely, such alignment does not fully utilize the information between samples, which can be less consistent on the modality level. In this paper, we propose a novel prompt tuning strategy by distributionally matching different modalities. Specifically, we minimize the distribution-wise distance between the image and text modalities with optimal transport (OT) theory. Simultaneously, we add a constraint on the learned transport plan during the modality matching to enhance the learning of vision and text prompts. Our proposed one can be applied to improve existing uni-modal and multi-modal prompt learning methods for being a plug-and-play method, which can generate modality-consistent representations. Experiments on eleven public datasets demonstrate that our proposed method has excellent performance, achieving substantial improvements on both uni-modal and multi-modal prompt tuning methods.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Circuits and Systems for Video Technology
Published
2024-10-31
DOI
https://doi.org/10.1109/tcsvt.2024.3489024
Citations
4
Primary Topic
VLSI and Analog Circuit Testing
Type
article
Field-Weighted Citation Impact
1.96
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Modality-Consistent Prompt Tuning With Optimal Transport

Yi Chang, Dandan Guo, Huangjie Zheng, Hairui Ren et al.
4 citations
IEEE Transactions on Circuits and Systems for Video Technology
VLSI and Analog Circuit Testing
1.96
article

Modality-Consistent Prompt Tuning With Optimal Transport

Yi Chang, Dandan Guo, Huangjie Zheng, Hairui Ren, He Zhao, Fan Tang
article en
4 citations

Abstract

Prompt tuning has been successfully used in leveraging the knowledge of Large-scale Vision-Language Pre-trained (VLP) models on downstream tasks. Most existing prompt tuning approaches learn prompts by maximizing the pairwise similarity. Although samples in different modalities might be relatively aligned pairwisely, such alignment does not fully utilize the information between samples, which can be less consistent on the modality level. In this paper, we propose a novel prompt tuning strategy by distributionally matching different modalities. Specifically, we minimize the distribution-wise distance between the image and text modalities with optimal transport (OT) theory. Simultaneously, we add a constraint on the learned transport plan during the modality matching to enhance the learning of vision and text prompts. Our proposed one can be applied to improve existing uni-modal and multi-modal prompt learning methods for being a plug-and-play method, which can generate modality-consistent representations. Experiments on eleven public datasets demonstrate that our proposed method has excellent performance, achieving substantial improvements on both uni-modal and multi-modal prompt tuning methods.

IEEE Transactions on Circuits and Systems for Video TechnologyVol. 35(3)
Commonwealth Scientific and Industrial Research Organisation (AU), Jilin University (CN), Chinese Academy of Sciences (CN), Institute of Computing Technology (CN), Jilin Medical University (CN), Jilin International Studies University (CN), Data61 (AU), The University of Texas at Austin (US)
Openalex Percentile: Top 12%
VLSI and Analog Circuit Testing
1.96
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.