Understanding Prompt Tuning for V-L Models Through the Lens of Neural Collapse
Not on the map. Why?
Abstract (arXiv)
Large-scale vision-language (V-L) models have demonstrated remarkable generalization capabilities for downstream tasks through prompt tuning. However, the mechanisms behind the learned text representations are unknown, limiting further generalization gains, especially under class imbalance scenarios. Recent advances in the neural collapse (NC) phenomenon of vision-only models suggest that the optimal representation structure is the simplex ETF, which paves the way to study representations in V-L models. In this paper, we make the first attempt to use NC for examining the representations in V-L models via prompt tuning. It is found that NC optimality of text-to-image representations shows a positive correlation with downstream generalizability, which is more severe under class imbalance settings. To improve the representations, we propose Neural-collapse-anchored Prompt Tuning (NPT), a novel method that learns prompts with text and image representations that satisfy the same simplex ETF. NPT incorporates two regularization terms: language-modality collapse and multi-modality isomorphism; and it is compatible with other prompt tuning methods. Extensive experiments show that NPT can consistently help to improve existing prompt tuning techniques across 11 datasets for both balanced and imbalanced settings.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 28 of its 30 references that are in the map. First posted on arXiv 28 Jun 2023.
Builds on
28 of 30 references.
References · 28
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
- 2021Scaling Up Visual and Vision-Language Representation Learning With Noisy Text Supervisioncited by 3,848
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
- 2021Learning to Prompt for Vision-Language Modelscited by 2,269
- 2022Conditional Prompt Learning for Vision-Language Modelscited by 1,427
- 2021Florence: A New Foundation Model for Computer Visioncited by 802
- 2020Prevalence of Neural Collapse during the terminal phase of deep learning trainingcited by 713
- 2021P-Tuning v2: Prompt Tuning Can Be Comparable to Fine-tuning Universally Across Scales and Taskscited by 686
- 2022MaPLe: Multi-modal Prompt Learningcited by 685
- 2021FILIP: Fine-grained Interactive Language-Image Pre-Trainingcited by 626
- 2021LiT: Zero-Shot Transfer with Locked-image text Tuningcited by 572
16 more
- 2022Prompt-aligned Gradient for Prompt Tuningcited by 339
- 2023Visual-Language Prompt Tuning with Knowledge-guided Context Optimizationcited by 307
- 2022Prompt Distribution Learningcited by 235
- 2021A Geometric Analysis of Neural Collapse with Unconstrained Featurescited by 226
- 2021Exploring Deep Neural Networks via Layer-Peeled Model: Minority Collapse in Imbalanced Trainingcited by 166
- 2023Neural Collapse Inspired Feature-Classifier Alignment for Few-Shot Class Incremental Learningcited by 112
- 2022Extended Unconstrained Features Model for Exploring Deep Neural Collapsecited by 101
- 2021An Unconstrained Layer-Peeled Perspective on Neural Collapsecited by 87
- 2021Class-agnostic Object Detection with Multi-modal Transformercited by 85
- 2022Imbalance Trouble: Revisiting Neural-Collapse Geometrycited by 80
- 2023No Fear of Classifier Biases: Neural Collapse Inspired Federated Learning with Synthetic and Fixed Classifiercited by 55
- 2020On the emergence of simplex symmetry in the final and penultimate layers of neural network classifierscited by 51
- 2023Understanding Imbalanced Semantic Segmentation Through Neural Collapsecited by 46
- 2022Neural Collapse Inspired Attraction-Repulsion-Balanced Loss for Imbalanced Learningcited by 43
- 2022Understanding and Improving Transfer Learning of Deep Models via Neural Collapsecited by 24
- 2023Neural Collapse Inspired Federated Learning with Non-iid Datacited by 4
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.