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

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.Setbased 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-theart performance on MS-COCO and Flickr30k without relying on external data.

Authors

Institutions

Publication Details

Published
2025-01-01
DOI
https://doi.org/10.18653/v1/2025.acl-long.1533
Citations
1
Primary Topic
Natural Language Processing Techniques
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Andrew Zhang, Hani Al-Omari, Christopher Thomas, Anushka Sivakumar
1 citations
Natural Language Processing Techniques
2.48
article

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

Andrew Zhang, Hani Al-Omari, Christopher Thomas, Anushka Sivakumar
article en
1 citations

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.Setbased 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-theart performance on MS-COCO and Flickr30k without relying on external data.

D-Tech (United States) (US)
Openalex Percentile: Top 9%
Natural Language Processing Techniques
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.