Meta-Guided Adaptive Weight Learner for Noisy Correspondence
Chenyu Mu, Erkun Yang, Cheng Deng
Abstract
Cross-modal retrieval with noisy correspondences is a critical challenge, especially when data annotations for large-scale multimodal datasets are prone to systematic corruption. To mitigate the impact of noise, many existing methods rely on small-loss sample selection to filter out clean samples. However, these methods can ineluctably result in the inclusion of false positives, which significantly degrade the performance. To tackle this issue, we propose a novel method, named the Meta Similarity Importance Assignment Network (MSIAN), to achieve robust cross-modal retrieval. MSIAN employs a meta-learning strategy to dynamically learn the importance of each sample through a two-level optimization process. With adaptively guiding the learning process, MSIAN adjusts the importance weight of each sample based on its inherent trustworthiness. Thereby, thus iterative mechanism progressively shifts the network's focus on the most reliable data points, amplifying the impact of credible samples while diminishing the adaptive weight of noisy ones. Furthermore, MSIAN dynamically adapts the soft margin of each sample through continuously updated adaptive weights, thereby improving the robustness of the model. Extensive experiments on three widely used datasets, including Flickr30K, MS-COCO, and Conceptual Captions, demonstrate the effectiveness of our approach in improving cross-modal retrieval performance.
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.
Cited by top-tier papers3
- Air-Know: Arbiter-Calibrated Knowledge-Internalizing Robust Network for Composed Image RetrievalZhiheng Fu, Yupeng Hu, Qianyun Yang, Shiqi Zhang et al.CVPR 2026 · 16 citations
- HABIT: Chrono-Synergia Robust Progressive Learning Framework for Composed Image RetrievalZixu Li, Yupeng Hu, Zhiwei Chen, Shiqi Zhang et al.AAAI 2026 · 8 citations
- Meta-Learning Dynamic Center Distance: Hard Sample Mining for Learning with Noisy LabelsChenyu Mu, Yijun Qu, Jiexi Yan, Erkun Yang et al.ICCV 2025 · 2 citations
Related papers
- Noisy Correspondence Learning with Meta Similarity CorrectionHaochen Han, Kaiyao Miao, Qinghua Zheng, Minnan LuoCVPR 2023
- Meta-Guided Sample Reweighting for Robust Cross-Modal Hashing Retrieval with Noisy LabelsZiang Tan, Weitao An, Erkun YangAAAI 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
- Deep Evidential Learning with Noisy Correspondence for Cross-modal RetrievalYang Qin, Dezhong Peng, Xi Peng, Xu Wang et al.ACM MM 2022 · 101 citations
- PCSR: Pseudo-label Consistency-Guided Sample Refinement for Noisy Correspondence LearningZhuoyao Liu, Yang Liu, Wentao Feng, Shudong HuangAAAI 2026
