English

Maximal Matching Matters: Preventing Representation Collapse for Robust Cross-Modal Retrieval

Computer Vision and Pattern Recognition 2025-06-27 v1 Information Retrieval Machine Learning

Abstract

Cross-modal image-text retrieval is challenging because of the diverse possible associations between content from different modalities. Traditional methods learn a single-vector embedding to represent semantics of each sample, but struggle to capture nuanced and diverse relationships that can exist across modalities. Set-based approaches, which represent each sample with multiple embeddings, offer a promising alternative, as they can capture richer and more diverse relationships. In this paper, we show that, despite their promise, these set-based representations continue to face issues including sparse supervision and set collapse, which limits their effectiveness. To address these challenges, we propose Maximal Pair Assignment Similarity to optimize one-to-one matching between embedding sets which preserve semantic diversity within the set. We also introduce two loss functions to further enhance the representations: Global Discriminative Loss to enhance distinction among embeddings, and Intra-Set Divergence Loss to prevent collapse within each set. Our method achieves state-of-the-art performance on MS-COCO and Flickr30k without relying on external data.

Keywords

Cite

@article{arxiv.2506.21538,
  title  = {Maximal Matching Matters: Preventing Representation Collapse for Robust Cross-Modal Retrieval},
  author = {Hani Alomari and Anushka Sivakumar and Andrew Zhang and Chris Thomas},
  journal= {arXiv preprint arXiv:2506.21538},
  year   = {2025}
}

Comments

Accepted at the 63rd Annual Meeting of the Association for Computational Linguistics (ACL 2025 Main)

R2 v1 2026-07-01T03:34:59.591Z