Bridging Modalities via Progressive Re-alignment for Multimodal Test-Time Adaptation
Not on the map. Why?
Abstract (arXiv)
Test-time adaptation (TTA) enables online model adaptation using only unlabeled test data, aiming to bridge the gap between source and target distributions. However, in multimodal scenarios, varying degrees of distribution shift across different modalities give rise to a complex coupling effect of unimodal shallow feature shift and cross-modal high-level semantic misalignment, posing a major obstacle to extending existing TTA methods to the multimodal field. To address this challenge, we propose a novel multimodal test-time adaptation (MMTTA) framework, termed as Bridging Modalities via Progressive Re-alignment (BriMPR). BriMPR, consisting of two progressively enhanced modules, tackles the coupling effect with a divide-and-conquer strategy. Specifically, we first decompose MMTTA into multiple unimodal feature alignment sub-problems. By leveraging the strong function approximation ability of prompt tuning, we calibrate the unimodal global feature distributions to their respective source distributions, so as to achieve the initial semantic re-alignment across modalities. Subsequently, we assign the credible pseudo-labels to combinations of masked and complete modalities, and introduce inter-modal instance-wise contrastive learning to further enhance the information interaction among modalities and refine the alignment. Extensive experiments on MMTTA tasks, including both corruption-based and real-world domain shift benchmarks, demonstrate the superiority of our method. Our source code is available at https://github.com/Luchicken/BriMPR.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 26 of its 43 references that are in the map. First posted on arXiv 28 Nov 2025.
Builds on
26 of 43 references.
References · 26
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
- 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,339
- 2017On Calibration of Modern Neural Networkscited by 4,860
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
- 2015Learning Transferable Features with Deep Adaptation Networkscited by 1,323
- 2017Learning to Generalize: Meta-Learning for Domain Generalizationcited by 762
- 2020VGGSound: A Large-scale Audio-Visual Datasetcited by 641
- 2014Deep Domain Confusion: Maximizing for Domain Invariancecited by 597
14 more
- 2022Efficient Test-Time Model Adaptation without Forgettingcited by 467
- 2023Towards Stable Test-Time Adaptation in Dynamic Wild Worldcited by 409
- 2021MEMO: Test Time Robustness via Adaptation and Augmentationcited by 376
- 2016Revisiting Batch Normalization For Practical Domain Adaptationcited by 285
- 2023Diverse Data Augmentation with Diffusions for Effective Test-time Prompt Tuningcited by 150
- 2024Entropy is not Enough for Test-Time Adaptation: From the Perspective of Disentangled Factorscited by 106
- 2022MM-TTA: Multi-Modal Test-Time Adaptation for 3D Semantic Segmentationcited by 76
- 2024Test-Time Model Adaptation with Only Forward Passescited by 74
- 2023Improving Visual Prompt Tuning for Self-supervised Vision Transformerscited by 57
- 2023Universality and Limitations of Prompt Tuningcited by 30
- 2024Historical Test-time Prompt Tuning for Vision Foundation Modelscited by 21
- 2024Distribution Alignment for Fully Test-Time Adaptation with Dynamic Online Data Streamscited by 13
- 2025Towards Robust Multimodal Open-set Test-time Adaptation via Adaptive Entropy-aware Optimizationcited by 11
- 2025Smoothing the Shift: Towards Stable Test-Time Adaptation under Complex Multimodal Noisescited by 9
Built on by
Citing papers per year: 2026: 2.
2 papers.