UGNCL: Uncertainty-Guided Noisy Correspondence Learning for Efficient Cross-Modal Matching
Quanxing Zha, Xin Liu, Yiu-ming Cheung, Xing Xu, Nannan Wang, Jianjia Cao
Abstract
Cross-modal matching has recently gained significant popularity to facilitate retrieval across multi-modal data, and existing works are highly relied on an implicit assumption that the training data pairs are perfectly aligned. However, such an ideal assumption is extremely impossible due to the inevitably mismatched data pairs, a.k.a. noisy correspondence, which can wrongly enforce the mismatched data to be similar and thus induces the performance degradation. Although some recent methods have attempted to address this problem, they still face two challenging issues: 1) unreliable data division for training inefficiency and 2) unstable prediction for matching failure. To address these problems, we propose an efficient Uncertainty-Guided Noisy Correspondence Learning (UGNCL) framework to achieve noise-robust cross-modal matching. Specifically, a novel Uncertainty Guided Division (UGD) algorithm is reliably designed leverage the potential benefits of derived uncertainty to divide the data into clean, noisy and hard partitions, which can effortlessly mitigate the impact of easily-determined noisy pairs. Meanwhile, an efficient Trusted Robust Loss (TRL) is explicitly designed to recast the soft margins, calibrated by confident yet error soft correspondence labels, for the data pairs in the hard partition through the uncertainty, leading to increase/decrease the importance of matched/mismatched pairs and further alleviate the impact of noisy pairs for robustness improvement. Extensive experiments conducted on three public datasets highlight the superiorities of the proposed framework, and show its competitive performance compared with the state-of-the-arts. The code is available at https://github.com/qxzha/UGNCL.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 53d6ed93-85c0-4e99-8dc6-ef08f91c5605Cited by top-tier papers11
- Interactive Cross-modal Learning for Text-3D Scene RetrievalYanglin Feng, Yongxiang Li, Yuan Sun, Yang Qin et al.NeurIPS 2025 · 9 citations
- Noisy Correspondence Rectification via Asymmetric Similarity LearningYunbo Wang, YuJie Wu, Zhien Dai, Can Tian et al.AAAI 2025 · 4 citations
- UGG-ReID: Uncertainty-Guided Graph Model for Multi-Modal Object Re-IdentificationXixi Wan, Aihua Zheng, Bo Jiang, Beibei Wang et al.NeurIPS 2025 · 4 citations
- Revisiting Uncertainty: On Evidential Learning for Partially Relevant Video RetrievalJun Li, Peifeng Lai, Xuhang Lou, Jinpeng Wang et al.ICML 2026
- ReCon: Enhancing True Correspondence Discrimination through Relation Consistency for Robust Noisy Correspondence LearningQuanxing Zha, Xin Liu, Shu-Juan Peng, Yiu-ming Cheung et al.CVPR 2025
Related papers
- Deep Evidential Learning with Noisy Correspondence for Cross-modal RetrievalYang Qin, Dezhong Peng, Xi Peng, Xu Wang et al.ACM MM 2022 · 101 citations
- Deep Evidential Hashing for Trustworthy Cross-Modal RetrievalYuan Li, Liangli Zhen, Yuan Sun, Dezhong Peng et al.AAAI 2025 · 8 citations
- Cross-modal Active Complementary Learning with Self-refining CorrespondenceYang Qin, Yuan Sun, Dezhong Peng, Joey Tianyi Zhou et al.NeurIPS 2023 · 49 citations
- Noisy Correspondence Learning with Modality Gap Direction CorrectionWuyuqing Wang, Zeyuan Gu, Erkun YangAAAI 2026
- Uncover Underlying Correspondence for Robust Multi-view ClusteringHaochen Zhou, Guofeng Ding, Mouxing Yang, Peng Hu et al.ICLR 2026
