Multiplicity is an Inevitable and Inherent Challenge in Multimodal Learning


Abstract

Multimodal learning has seen remarkable progress, particularly with large-scale pre-training across various modalities. Most current approaches are built on the assumption of a deterministic one-to-one alignment between modalities. However, this oversimplifies real-world multimodal relationships, where their nature is inherently many-to-many. The many-to-many property, or multiplicity, is not a side-effect of noise or annotation error, but an inevitable outcome of intra-modal variability, representational asymmetry, and task-dependent ambiguity in multimodal tasks. We argue that multiplicity is a fundamental bottleneck that affects all stages of the multimodal learning pipeline: from data construction to model training and evaluation benchmarks. By formalizing its causes and consequences, we demonstrate how ignoring multiplicity leads to training uncertainty, unreliable evaluation, and degraded dataset quality. This position paper calls for new research directions on multimodal learning, including multiplicity-aware learning frameworks and dataset construction and evaluation protocols.

1 Introduction↩︎

Multimodal learning has emerged as a foundation in modern machine learning, showing recent breakthroughs in tasks involving vision, language, audio, action, and beyond [1][8]. The rise of large-scale pre-training has significantly expanded what these systems can achieve. However, this success relies on a fragile, simplifying assumption: that mappings across modalities are one-to-one. Whether for contrastive pre-training or retrieval-based evaluation, each instance in one modality is assumed to correspond to exactly one correct counterpart in another, e.g., one image to one caption. This one-to-one alignment assumption is fundamentally misaligned with the nature of real-world multimodal data. In practice, the relationship between modalities is inherently many-to-many, e.g., an image can be described by multiple captions and vice versa, a property we define as “multiplicity”, the existence of multiple plausible correspondences between modalities.

This position paper argues that multiplicity is an inevitable and inherent challenge in multimodal learning, and multimodal learning should be reframed around multiplicity. Throughout the paper, we will show how multiplicity affects the entire multimodal learning pipeline, from data construction, training (e.g., contrastive pre-training), to retrieval-based evaluation. Multiplicity is not a simple noise or side-effect, but a fundamental characteristic.

Figure 1: How does multiplicity occur? The source of multiplicity in multimodal datasets is diverse.

The roots of multiplicity are manifold and diverse. First, current multimodal dataset construction pipelines capture only a sparse sampling of the potential correspondence space, which grows quadratically with dataset scale. Second, there exists intra-modal variability: multiple instances in one modality correspond to the same semantic concept. For example, as shown in 1 (a), a single concept (e.g., cat) can be instantiated in diverse ways within an image modality. Third, there are asymmetries in information density and representation mechanisms (e.g., dense image exhaustively captured by photographic sensors versus sparse linguistic descriptions with selectively chosen concepts by humans). The same modality item can be interpreted in multiple valid ways when expressed in the other modality, and it makes complete and symmetric alignment infeasible. Ambiguity in what “counts” as a corresponding item leads to multiple valid alignments (See 1 (b)). Finally, the definition of correspondence depends on task objectives or context. Different tasks demand different alignment notions, e.g., for vision-language tasks, should an image be aligned to a caption describing its category, its background, its future implication, or its narrative framing? For audio-visual tasks, should a sound be aligned to on-screen actions, ambient context, or narrative tone? There is no single “true” counterpart. The set of valid correspondences varies by purpose, introducing conditional multiplicity as shown in 1 (c). Namely, there is no single “truly corresponding pair” for a given instance; it depends on how we define the task. 2 will discuss more details of the sources of multiplicity.

This multiplicity is unavoidable in practice for multimodal tasks. Unfortunately, the space of potentially valid cross-modal correspondences expands rapidly with scale, making it infeasible in practice to enumerate or verify all plausible matches. Therefore, cross-modal supervision is necessarily sparse, and multiplicity can induce false negatives (FNs) that affect both training and evaluation. We formalize this notion in 2 and discuss its implications throughout the pipeline. Considering these problems, multiplicity should be carefully considered during dataset construction, as design choices at this stage can either preserve or suppress the many-to-many nature of modality relationships.

2 Multiplicity: An inherent challenge↩︎

2.0.0.1 Definition.

Let \(\mathcal{R}\subseteq\mathcal{X}\times\mathcal{Y}\) denote valid cross-modal relations between two modalities \(\mathcal{X}\) and \(\mathcal{Y}\) (e.g., vision-language [1], audio-visual [5]). Note that we assume two modalities for simplicity, but this definition can be easily extended to \(n\) modalities, such as vision-language-action [6], [7] and video-language-audio [9], \(\mathcal{R}\subseteq\mathcal{X}_1\times\mathcal{X}_2\times\ldots\times\mathcal{X}_n\). Standard practice presumes one-to-one correspondence, i.e., \(|\{y\in\mathcal{Y}:(x,y)\in\mathcal{R}\}|=1\) for all \(x\in\mathcal{X}\) (and symmetrically, \(|\{x\in\mathcal{X}:(x,y)\in\mathcal{R}\}|=1\) for all \(y\in\mathcal{Y}\)). Multiplicity (or many-to-many correspondence) occurs when there exists some \(x\in\mathcal{X}\) such that \(|\{y\in\mathcal{Y}:(x,y)\in\mathcal{R}\}|>1\) (or symmetrically, some \(y\in\mathcal{Y}\) such that \(|\{x\in\mathcal{X}:(x,y)\in\mathcal{R}\}|>1\)).

In the worst case, \(|\mathcal{R}|\) can be as large as \(|\mathcal{X}|\cdot|\mathcal{Y}|\), i.e., the space of valid relations can grow rapidly when both modalities scale. Furthermore, cross-modal supervision is necessarily sparse: even when some correspondences are labeled as positives, additional plausible positives typically remain unobserved among pairs treated as “negatives.” In practice, multimodal datasets typically record only a sparse set of positive pairs and treat unobserved pairs as negatives, so valid but unannotated correspondences become false negatives (FNs). This property introduces challenges throughout the multimodal learning pipeline (we will discuss more details in later sections). This makes multiplicity a first-order concern when scaling multimodal datasets. On the other hand, unimodal tasks (e.g., single or multi-labeled classification with fixed label sets) do not directly suffer from the same issue. In [sec:sec:uni95vs95multi95app], we compare unimodal tasks with multimodal tasks for additional intuition.

We characterize origins of multiplicity in real-world data with three primary sources: intra-modal variability, asymmetry between modalities, and task-dependent alignment.

2.0.0.2 Property 1. Intra-modal variability.

Assume a data generation process (e.g., structural causal models [10]) from the underlying “concepts” to the actual data. For example, consider visual and textual instances generated from concepts “grey cat”, “santa hat”, and “striped rug” (e.g., 1 (b)). This generation process is inherently stochastic, with no uniquely determined instance. As a result, each modality realizes the concepts in various shapes, e.g., images with slightly different views or backgrounds, and diverse captions describing the same situation (See 1 (a)). Namely, if there exist two semantically similar multimodal pairs with overlapping concepts \((x_1, y_1)\) and \((x_2, y_2)\), their cross-relationships \((x_1, y_2)\) and \((x_2, y_1)\) should also be treated as valid positives even though they are treated as negative in the dataset. This problem becomes significant when we restrict the possible objects in the datasets and the data format (e.g., COCO Caption [11] is built upon COCO [12] images of 80 common objects).

2.0.0.3 Property 2. Asymmetry between modalities.

Modalities differ in how they encode and express information. For example, a photograph exhaustively records visual details, while a human-written caption selectively reflects only a few salient concepts. Although the same concept may appear in both modalities in varied forms, their information density differs significantly, especially in text, which is based on human cognition rather than sensor-based input. Cognition theories, such as dual-coding theory [13], suggest that the mind processes information along verbal and nonverbal systems. When a person writes “a grey cat wearing a Santa hat” the verbal code is followed by a private visual image that may include additional details (background, action) never lexicalized. Different annotators, therefore, generate distinct but equally valid sentences for the same scene, and a single sentence can evoke multiple mental images, immediately yielding many-to-many alignments. Even sensor inputs have different information density by the choice of the sensor. For example, visual inputs captured by RGB, RGB-D, non-visible light, video camera, and motion sensors have different information from each other; the same scene will be expressed differently by the sensors.

2.0.0.4 Property 3. Task-dependent alignment.

What counts as a correct alignment often depends on the task [14]. For example, in vision-language tasks, should a caption describe only the main object in the image [11]? Should it exhaustively describe all the local visual information [15]? Infer what happened before and what happens next [16]? In audio-visual settings in 1 (c), the notion of alignment could range from on-screen sounds (e.g., cat meowing sound) [17], off-screen sounds (e.g., TV sound), talking speech following lip movement [18], or ambient sounds (e.g., background music or foley effects) [19]. Namely, the definition of a “positive” pair is ambiguous, context-sensitive, and task-dependent; a pair that is positive under one task definition may be irrelevant or even negative under another (e.g., ambient sounds could be negative if we only focus on on-screen sounds).

The above sources are conceptually distinct, but they induce the same practical consequence: sparse one-to-one annotations fail to capture the full set of valid cross-modal correspondences (See 9.3 for related discussions). We next summarize empirical evidence from prior work showing that this mismatch appears in multimodal tasks.

2.0.0.5 Empirical evidence.

Recent studies implicitly support the existence of multiplicity and its potential effects in multimodal tasks, when we over-rely on the one-to-one assumption. For example, [20] empirically showed that a popular image-caption dataset misses many valid matches. This study showed that COCO Caption [11] contains many redundant captions, which results in FNs in the dataset; the average number of positive images (captions) for each caption (image) is 8.5 (17.9) rather than the original 1 (5) in the dataset. [20] also showed that re-evaluating VLMs with corrected associations can noticeably change model rankings (e.g., showing 0.47 Kendall’s ranking coefficient). In summary, one-to-one benchmarks can become unreliable under multiplicity.

On the training side, [21] showed that the existing training methods assuming a strong one-to-one correspondence can break down as model scale increases (e.g., achieving 40.0 mAP@R on ViT-B/32 but 20.2 mAP@R on ViT-L/14), while approaches that account for multiplicity remain much more stable (40.1 mAP@R on ViT-B/32, 42.1 mAP@R on ViT-L/14). In other words, if the effect of FNs (due to multiplicity) becomes more significant, conventional training strategies can fail.

[22] provided a relevant example on the dataset side. They improved training dataset quality by filtering out underspecified image-text pairs (i.e., pairs with a higher degree of multiplicity). This supports that multimodal dataset quality is highly affected by its multiplicity.

Overall, the nature of multimodal correspondences is many-to-many, and the existing works support that multiplicity is an important structural challenge in multimodal learning. In the next sections, we examine how this multiplicity impacts data collection, training, and evaluation in more detail.

3 Multiplicity in training↩︎

3.1 How does multiplicity induce ambiguity in training?↩︎

Mainstream multimodal architectures [1], [23][25] assume a one-to-one mapping, i.e., each instance is encoded into a unique representation vector. However, multimodal inputs are inherently polysemous: a single instance can correspond to multiple valid interpretations or alignments, each deserving a distinct representation. If we assume an ideal dataset that annotates all plausible matches as positives, this multiplicity cannot be faithfully captured by one-to-one encodings. For example, as shown in 2 (a), a cat image should simultaneously match multiple captions with different meanings, which is fundamentally impossible by a one-to-one mapping. This introduces input ambiguity, or aleatoric uncertainty; an input can be represented variously.

In practice, most multimodal datasets [15], [26][29] provide sparse one-to-one annotations because exhaustively annotating all plausible correspondences is infeasible. Importantly, this is not inherently flawed: a single caption or counterpart can be a valid sample from the set of acceptable correspondences. The problem arises when contrastive training or retrieval-style evaluation treats this sparse annotation as exhaustive, so that all unannotated but plausible pairs are used as negatives. Under this use, false negatives (FNs) naturally emerge.

While each input has only one “ground truth” (hence, the input-level ambiguity is collapsed in supervision), the ambiguity still exists at the level of pairwise relationships. In this case, models suffer from matching ambiguity: a given multimodal correspondence can be either positive or negative. This is another form of aleatoric uncertainty, not over the inputs themselves but over their cross-modal alignments. We examine how matching ambiguity arises.

As discussed in 2 intra-modal variability, multiple semantically similar items often exist within each modality. When we approximate such items (e.g., images of the same object in different views, or captions describing the same scene with varying detail) into a single representation (by assuming that the encoder maps similar inputs into a very close and almost the same space), the resulting cross-modal matching becomes intrinsically ambiguous. 2 (b) illustrates the overview.

Formally, suppose \(\{ x_1, x_2, \ldots, x_K \} \subset \mathcal{X}\) are semantically equivalent inputs, approximated as a single representative \(\tilde{x}\). Let \(\{ y_1, \ldots, y_K \} \subset \mathcal{Y}\) be their corresponding instances from another modality and the annotated positive relations are \(\{(x_i, y_i)\in\mathcal{R} \mid i=1,\ldots,K\}\). Assume we randomly sample \((x_i, y_j)\) from the mini-batch \(\{(x_i, y_i) ~|~ i=1\ldots K\}\). Then, the matching label \(m\) between \(\tilde{x}\) and \(y_j\) becomes a stochastic variable: \(m(\tilde{x}, y_j) = m(x_i, y_j) = 1\) if \(i=j\) and 0 otherwise. If we assume that \(y\) is approximated as \(\tilde{y}\), the probability of positive matching between \(\tilde{x}\) and \(\tilde{y}\) is \(1/K\).

Figure 2: Multiplicity induces ambiguity. (a) If we have an ideal dataset consists of the full pairwise annotations, an input should correspond to multiple instances from the other modality. The current one-to-one paradigm cannot handle this. (b) In practice, we have sparsely annotated pairwise annotations: each input only corresponds to one instance. In this case, multiplicity introduces a new uncertainty, named matching ambiguity.

3.1.0.1 Recap of current multimodal learning training algorithms.

Modern multimodal learning heavily relies on training objectives that assume well-defined, one-to-one multimodal correspondences. Approaches such as triplet loss with hard negative mining [30], [31], contrastive learning [1], [25], pairwise matching [23], [24], and instruction tuning [4] all follow a similar principle: bring positive pairs closer while pushing negatives apart. They work under the assumption that each input has a single, correct counterpart in the other modality. When this assumption fails due to the input ambiguity or matching ambiguity, the model is penalized for preserving the correct semantic structure. This misalignment leads to undesirable outcomes: (1) distances between semantically compatible items become exaggerated, and (2) models may overfit to arbitrary choices among positive matches by disrupting the stability of gradient signals, especially when only one ground-truth is used in training.

3.1.0.2 Settings.

Let \(x \in \mathcal{X}\) and \(y \in \mathcal{Y}\) be items from two modalities. Each mini-batch contains \(N\) instances, with \(N\) annotated positive pair \(\{(x_i, y_i) ~|~ i=1\ldots N\}\). We suppose that the first \(K\) pairs form a semantically equivalent cluster such that each \(x_i\) (\(i=1,\ldots,K\)) has \(K\) equally valid matches \(\mathbf{y_+}=\{y_1,\ldots,y_K\}\) in the mini-batch. In this case, the total number of true positive relations is \(N-K+K^2\), whereas the dataset may only annotate \(N\) of them as positive, leaving \(K^2-K\) relations unobserved and thus treated as negatives, i.e., FNs. Let \(f(x)\) and \(g(y)\) denote the normalized embedding by encoders \(f\) and \(g\).

3.1.0.3 Contrastive loss.

Let \(p_{j} := \frac{\exp(f(x_1)^\top g(y_j))}{\sum_{k=1}^N \exp(f(x_1)^\top g(y_k))}\), the softmax probability that \(x_1\) and \(y_j\) are matched. For \(x_1\), the original contrastive loss (i.e., only considering \(N\) positives) is defined by \(\mathcal{L}_{\text{sparse}} = -\log p_{1}\) and its gradient w.r.t. \(f(x_1)\) is \(\nabla_{f(x_1)} \mathcal{L}_{\text{sparse}} = \sum_{j=1}^N p_{j} g(y_j) - g(y_1)\); this gradient becomes 0 when \(p_1=1\), pushing \(f(x_1)\) and \(g(y_1)\) closer while pulling \(f(x_1)\) away from all other \(g(y_j)\). However, if we suppose that \(x_1\) has \(K>1\) actually valid positives but unannotated \(\mathbf{y_+}\). Then, the gradient pulls \(f(x_1)\) away from \(g(y_+)\) despite their semantic similarity.

In contrast, an ideal loss considering all positives uniformly account for all \(K\) positives: \(\mathcal{L}_{\text{ideal}} = \sum_{j=1}^K (-\frac{1}{K}\log p_{j})\). Let \(p_j^* = \frac{1}{K}\) for \(j=1 \ldots K\) and 0 otherwise. Then, the gradient of \(\mathcal{L}_{\text{ideal}}\) w.r.t. \(x_1\) becomes: \(\nabla_{f(x_1)} \mathcal{L}_{\text{ideal}} = \sum_{j=1}^N p_{j} g(y_j) - \sum_{j=1}^N p_j^* g(y_j)\); this gradient becomes 0 when \(p_j = \frac{1}{K}\) for all \(j=1 \ldots K\). More specifically, the discrepancy between the actual and ideal gradients becomes \(\sum_{j=1}^N (p_j - p_j^*) g(y_j)\). This mismatch makes the distance between \(x_1\) and its plausible matching \(y_+\) larger; despite \(x_1\) and \(y_+\) being actually positive, there exists a gap between the two modalities, which can lead to the modality gap [32]. As \(K\) increases, this mismatch amplifies, leading to slower convergence [33] and greater semantic fragmentation in the learned embeddings.

3.1.0.4 Hard negative mining (HNM).

HNM is a widely used technique in multimodal metric learning that focuses on the most challenging negatives [30], [31]. However, it is particularly vulnerable to FNs when their similarity \(f(x_i)^\top g(y_{+})\) is comparable to that of the true positive \(f(x_i)^\top g(y_1)\). In this case, HNM aggressively pushes \(f(x_i)\) away from \(g(y_{+})\), often more strongly than contrastive learning, resulting in a distorted embedding space that violates semantic consistency.

3.1.0.5 Extension to generative and instruction-tuned VLMs.

The same issue arises in generative multimodal training, such as instruction tuning of VLMs [4], where the model learns a conditional distribution \(p_\theta(y \mid x, t)\) over textual outputs \(y\) given multimodal context \((x,t)\). In practice, datasets provide only a single reference output \(y^\star\) per context, even though there may exist a set of valid responses \(\mathcal{Y}_+(x,t)\). Maximizing \(\log p_\theta(y^\star\mid x,t)\) therefore implicitly suppresses probability mass on other valid but unobserved responses, yielding an under-dispersed distribution and reduced output diversity. In this sense, one-reference supervision in generation plays an analogous role to FNs in contrastive learning: it penalizes plausible alternatives that are not annotated. This matters beyond retrieval. As an example, [34] suggested that strong MLLMs (e.g., GPT-4 [35], Gemini [36]) still struggle once evaluation explicitly allows multiple correct answers, i.e., when multiplicity is introduced in the benchmark.

3.2 Current attempts and future directions↩︎

Despite its significance, the impact of multiplicity during training remains underexplored, particularly in large-scale settings such as vision-language embeddings [1], [25] or multimodal LLMs [4]. Several attempts have been made using a smooth loss [37], pseudo-label [21], [38], or mixed label [21] using mixing augmentations [39], [40], but their impacts are yet limited. While smaller-scale datasets [11] have been used to study the issue, existing approaches show limited scalability and generalizability.

One line of work treats multimodal alignments as noisy correspondence (NC) [41] (i.e., considering that a specific portion of annotations are noisy), leveraging techniques from learning with noisy labels [42]. However, this approach has shown limited success in large-scale settings; for example, [21] reported that this direction shows negligible benefits over standard contrastive learning. Moreover, architectures and training objectives for NC still assume the one-to-one mapping, limiting in representing inherent input ambiguity. Nonetheless, rethinking a multimodal task with sparsely annotated many-to-many pairwise datasets as learning with noisy labels or positive-unlabeled learning [43] will be an interesting future research direction.

Another direction focuses on producing multiple embeddings, rather than a single embedding for each instance [44], [45], where an instance is mapped to a set of representations to capture polysemous context, and similarity is defined via set-to-set relationships. This method assumes a fixed number of latent components per input (e.g., two embeddings for each instance), each intended to capture a distinct concept. While this direction conceptually fits with both input uncertainty and matching uncertainty, it lacks flexibility when there exists more concepts than the pre-defined components and remains unproven at scale. Conceptually, mixture-of-experts (MoE) [46], [47] can be an alternative of this direction, but the link between MoE and multiplicity is still underexplored.

Probabilistic embeddings [21], [48][53] offer a more scalable alternative by modeling each instance as a probabilistic distribution, thereby naturally capturing uncertainty in both representation and alignment. This family of methods has been extended to large-scale VL models [52], [53], achieving performance competitive with CLIP. However, the empirical gains from probabilistic modeling remain modest in real-world applications, and their practical utility is still subject to debate.

Despite these directions, the field lacks a unified framework that systematically addresses multiplicity in multimodal training. We encourage rethinking multimodal training, including architecture, representation space, and training objectives, with the inherent input and matching uncertainties.

4 Multiplicity in evaluation↩︎

4.1 Multiplicity makes benchmarks unreliable↩︎

Most multimodal benchmarks rely on sparse one-to-one annotations as a practical simplifying assumption, given the datasets and annotation tools available. However, evaluation metrics often treat this simplification as exhaustive ground truth, making them vulnerable to multiplicity. More specifically, multimodal models are often evaluated by one of the following approaches: (1) zero-shot evaluation by defining tasks via modality-specific information; (2) cross-modal retrieval, where the goal is to retrieve corresponding items across modalities (e.g., image-to-text, text-to-audio); and (3) evaluation of generated outputs, such as captioning, audio synthesis, or robotic action plans. Multiplicity undermines benchmark reliability in two ways: it transforms valid, unannotated correspondences into false negatives (FNs) and creates a disconnect between evaluation metrics and human relevance. Cross-modal retrieval and generation evaluation are particularly vulnerable to multiplicity because they rely on sparse pairwise annotations or limited references. Zero-shot evaluation can be relatively more robust to this problem, but we still need a careful task definition.

Zero-shot evaluation defines tasks using modality-specific information (mostly based on textual description). For example, language-driven models perform zero-shot classification tasks by treating class labels as textual descriptions and performing classification via cross-modal similarity [1]. As another example, vision-language-action (VLA) models perform tasks based on text instruction sets, and evaluate the plan success rate [6]. This paradigm relaxes the pre-defined and fixed task condition by modality-specific information (mostly based on text descriptions, but not mandatory to be language, e.g., task can be defined by audio, such as speech [54]). While zero-shot classification can sometimes avoid the pitfalls of multiplicity, this is largely contingent on how the label space is constructed. If class labels are distinct and mutually exclusive, the evaluation remains stable. However, in the case of taxonomic hierarchies (e.g., “Cat” vs. “Russian Blue”) or lexical ambiguity (e.g., “laptop computer” vs. “notebook computer” in ImageNet classes [55]), the presence of multiple valid labels per instance challenges the assumption of single-label correctness [56][58]. To make zero-shot evaluation more reliable, the task should be carefully designed considering multiplicity.

In contrast, cross-modal retrieval is directly and severely impacted by multiplicity. Multiplicity inherently leads to false negatives, while most datasets assume a single correct target for each query. However, as the space of plausible correspondences grows rapidly with scale, it is infeasible to densely annotate all the possible matches between two modalities. Specifically, when a dataset is built upon limited objects (e.g., 80 common objects) and a fixed format (e.g., describing the main object), cross-modal retrieval results are often unreliable. For instance, the ECCV Caption benchmark [20] demonstrates that a significant portion of COCO Caption [11] treated as negatives are in fact semantically correct for human annotators (\(\approx\times\)​4.4 positive matches than the original dataset). Furthermore, if we consider multiple positives for each query, the evaluation metric also matters in cross-modal retrieval benchmarks; the convention is Recall@K (R@K), but it is often misaligned with human judgments when multiple relevant matches exist.

Most cross-modal retrieval benchmarks assume that each query corresponds to exactly one positive target. This leads to the widespread use of R@K, which simply check whether the positive appears within the top-K retrieved items. Prior work shows that single-positive R@K can be misleading under multiplicity, while ranking-sensitive metrics (e.g., mAP@R) better reflect overall ranking quality and correlate more strongly with human preference [20], [59]. We provide a detailed discussion and examples in 8.

Finally, evaluating generated outputs under multiplicity introduces a different set of challenges. Generative tasks are inherently open-ended, and the space of plausible outputs is vast and diverse [60]. Traditional automatic metrics evaluate generated outputs by comparing them to a limited set of reference outputs [61], typically using surface-level measures like n-gram overlap [62][64] or latent-level comparison [65]. Image captioning is a canonical example of this issue: many descriptions can be valid for the same image, and recent surveys discuss how evaluation metrics have attempted to handle this diversity across lexical, semantic, and MLLM-based criteria [66]. However, limited references still fail to cover many semantically appropriate generations. For example, “a grey cat in the house” and “a Russian Blue playing inside” are different phrasing but equally valid; automatic metrics cannot distinguish them. In this setting, multiplicity leads to systematic underestimation of model quality, as diverse but valid outputs are treated as incorrect. As a result, evaluation can systematically underestimate both correctness and diversity. This highlights a fundamental limitation of current generation-based evaluation protocols in the presence of multimodal ambiguity.

4.2 Current attempts and future directions↩︎

The most direct way to address multiplicity in evaluation is to exhaustively annotate all plausible cross-modal pairs. However, this is infeasible in practice due to the quadratic growth in the number of possible correspondences. Instead, existing work has explored two main directions.

The first is to automatically identify additional positives using side information such as attributes or semantic similarity. For instance, [48] introduced densely annotated retrieval benchmarks on CUB [67] and COCO [12] datasets with fine-grained attributes and object labels. This approach helps mitigate FNs and enables the use of precision metrics, thanks to multiple positives per query. However, it may suffer from false positives, especially when captions refer to scene elements not captured by the predefined object labels. As another example, [68] considered semantic similarity proxies computed on captions (e.g., bag-of-words or part-of-speech overlap) for a more reliable video retrieval evaluation. This highly relies on the quality of the similarity proxies.

The second direction is to manually annotate a reduced set of candidate pairs, selected via automatic methods [20], [69]. For example, [20] used five different retrieval models to select up to 25 candidate matches per query. Human annotators then verified whether each candidate was a true match. This is significantly cheaper than full annotation, but still has a risk of FNs if valid matches are omitted during candidate selection. Also, the scalability of this approach is not promising.

While multiplicity has been relatively actively discussed in retrieval evaluation, its implications are even less explored in other settings. In generation-based evaluation, human judgment remains the de facto standard to handle semantic diversity, as automatic metrics are often unreliable under open-ended outputs. Although human evaluation better reflects real-world diversity, the lack of scalable and reliable automatic metrics continues to slow progress. More broadly, this suggests that evaluation should move beyond single-reference correctness and explicitly assess set- or distribution-level fidelity, i.e., whether a model can capture a range of valid outputs while avoiding invalid ones.

In zero-shot tasks, multiplicity can be partially addressed with ideas from classification. Previous works [56][58] have proposed rethinking single-label benchmarks, such as ImageNet [70], as multi-label tasks or refining label sets to reduce ambiguity. Similar strategies could be applied to zero-shot multimodal evaluation, such as revisiting prompts or category definitions in benchmarks. More generally, because relevance is task-dependent, benchmark design should explicitly specify what notion of correspondence is being evaluated (e.g., object identity vs. attributes vs. narrative context), rather than leaving it implicit.

Ultimately, a faithful evaluation framework must explicitly account for the many-to-many nature of multimodal relationships, both in how relevance is defined (task-dependent correspondence) and how performance is measured (crediting multiple valid outputs rather than a single target).

5 Multiplicity in dataset construction↩︎

5.1 Multiplicity and multimodal dataset quality↩︎

Recent studies have shown that multimodal model performance is closely tied to both model and dataset scale [71]. As traditional dataset construction is labor-intensive (e.g., manual captions written by human annotators [11]), recent approaches focus on collecting large-scale but noisy multimodal pairs (typically crawled from the web) and filtering them to remove low-quality examples [26], [29]. Specifically, the existing dataset construction process concentrates on “alignment”, measured by a large-scale pre-trained model [72][74]. For example, large-scale image-text datasets, such as LAION-5B [29], discard image-text pairs whose CLIP similarity is smaller than a pre-defined threshold. This heuristic has become a rule-of-thumb for scalable multimodal dataset construction.

However, as dataset size increases, the strategy that discards or keeps pairs with CLIP similarity may not be enough. Adding a new multimodal pair can introduce many additional plausible correspondences with existing instances and can influence the multiplicity structure of the entire dataset. For example, underspecified instances (e.g., “photo” or “a person is standing”) tend to align with a large number of items (e.g., all general photos or human figures), amplifying multiplicity (i.e., increasing the number of plausible matches), leading to input- and matching-ambiguity as discussed in 3. Several studies attempted to avoid this challenge by training multimodal models solely with unimodal datasets (e.g., text-only training) [75][78], but this cannot be a fundamental solution.

Whether a dataset preserves or suppresses this multiplicity depends on design choices of multimodal pair collection and task definition: retaining only specific, narrowly defined examples may reduce some matching ambiguity, but this does not eliminate multiplicity and can be misaligned with general-purpose objectives. Bringing VL tasks as an example, we can reduce the potential matches of the given image by increasing specificity with long-form [79] or all the localized details in the image [15]; this may reduce some spurious matches, but multiple unannotated long captions can still be valid for the same input, and the added detail is not always beneficial for general-purpose downstream tasks, such as zero-shot classification. On the other hand, if we focus on the salient objects in the image [11], the captioning process becomes cheaper, but the possible matching images per each caption will dramatically increase [20].

Lastly, recent dataset construction is increasingly automated via recaptioning or synthetic generation using (multimodal) large language models [80]. While this can improve scale and consistency, the generators themselves are not multiplicity-aware, often collapsing a set of valid alternatives into a single canonical description. When such synthetic pairs are further filtered by a fixed alignment scorer (e.g., CLIP), a self-reinforced scorer-generator feedback loop can emerge: the scorer selects data that match its own inductive biases, and the next generation step amplifies them. This loop risks cascading multiplicity-related failures by suppressing diverse but valid correspondences and reinforcing underspecified or stylistically narrow annotations.

5.2 Current attempts and future directions↩︎

Despite its importance, multiplicity has received limited attention in the context of dataset construction. While multiplicity-aware modeling and architecture design may eventually need to account multiplicity, minimizing unnecessary multiplicity at the dataset level remains a critical and cost-effective strategy, especially in the current paradigm where scaling-law still holds [71].

Multiplicity should be considered even before data collection, i.e., starting from task definition. Cross-modal alignment is inherently task-dependent. Previous works [81], [82] showed that collecting task-relevant instances improves multimodal training. Without clear criteria for valid matches, datasets may introduce unintended multiplicity, causing downstream instability.

In addition, a careful multimodal pair collection process will be helpful to reduce the level of multiplicity. For example, filtering strategies should go beyond coarse alignment scores (e.g., CLIP similarity) and explicitly target instances that amplify multiplicity (e.g., underspecified inputs). One possible direction is a filtering based on specificity, such as HYPE [22]. By selecting more specific instances (defined by the embedding property), HYPE leads to higher-quality datasets and improved downstream performance. This supports the broader hypothesis that reducing multiplicity at the data level yields tangible benefits throughout the multimodal pipeline.

Finally, we can also consider explicitly multiplicity-aware data collection: instead of collecting paired instances, we can collect as many plausible counterparts as possible for each instance. For example, [83] asked multiple participants to draw abstract images depicting the same sentence description, thereby collecting multiple semantically similar visual realizations of the same abstract description. This strategy preserves the many-to-many structure, but its scalability remains an open challenge, especially for large-scale, open-ended multimodal corpora.

6 Alternative Views↩︎

6.0.0.1 Scaling under one-to-one supervision is sufficient.

Practitioners can argue that simply scaling models and datasets under sparse one-to-one annotations is enough to obtain strong multimodal systems [1], [2], [71], [72]. We agree that scaling can continue to improve average benchmark performance in the near term. However, our claim is that this trend does not resolve multiplicity; it often masks it. As models become stronger, evaluation increasingly hinges on the fidelity of supervision and metrics: unobserved-but-valid correspondences create FNs and distort both training signals (3) and retrieval-style evaluation (4). This resembles how dataset imperfections become more consequential at high performance regimes in classification benchmarks [56]. These limitations are not purely hypothetical. For instance, [20] shows that under sparse one-to-one annotations, many pairs treated as negatives are in fact valid matches for human annotators, revealing a larger set of positives than the original benchmark. Moreover, when evaluation accounts for multiple positives and precision metrics, the relative ranking of retrieval models and their correlation with human judgments can differ markedly from single-positive R@K evaluation. These observations support our claim that as models improve, benchmark reliability becomes increasingly limited by sparse supervision and metric choice under multiplicity.

Our view is that scale may reduce some symptoms of multiplicity, but it does not remove the underlying supervision mismatch. As observed by [34], even a strong MLLM, trained on large-scale data with many parameters (e.g., GPT-4 [35] or Gemini [36]), still struggles when multiplicity is introduced in the benchmark. We believe that scaling may alleviate some effects in practice, but not truly address the problem.

In addition, as data pipelines increasingly rely on automated generation and filtering, the one-to-one paradigm risks reinforcing a narrow notion of “alignment” by scorer-generator feedback loops, potentially suppressing valid alternatives rather than capturing them. Thus, scaling may improve scores, while multiplicity remains a structural bottleneck for robustness, uncertainty, and human-aligned behavior.

6.0.0.2 Multiplicity is an avoidable issue with good design.

A common alternative view is that multiplicity is not inherent: with cleaner data and better curation, it can be treated as noise; with well-defined, task-specific deployments it becomes practically irrelevant; and with more specific or long-form annotations the space of plausible matches shrinks enough that one-to-one supervision is “close enough”. A good design can reduce unnecessary multiplicity. However, these arguments do not eliminate multiplicity. First, even under high-quality annotation, intra-modal variability, representational asymmetry, and task-dependent alignment imply that multiple correspondences can remain valid (2). Second, practical deployments still face changing contexts and distribution shift, where latent multiplicity resurfaces as vulnerable evaluation or suppressed valid alternatives. Last, increasing specificity or constraining tasks reduces some spurious matches but introduces a specificity-generality trade-off: what is “correct” depends on the intended notion of correspondence, and overly specific supervision can be misaligned with broad reuse (e.g., zero-shot settings). Therefore, the key question is not whether multiplicity can be engineered away, but how to explicitly define correspondence and build training and evaluation protocols that remain faithful under a many-to-many structure. In other words, multiplicity can be mitigated by fixing a narrow notion of correspondence (e.g., higher specificity or tighter task constraints), but this inevitably trades off generality and does not eliminate the existence of multiple valid alignments in open-ended multimodal use.

7 Call to Action: A multiplicity-aware pipeline↩︎

Multiplicity is unlikely to be fully resolved generally, because its causes, such as modality asymmetry and task-dependent ambiguity, are structural properties of multimodal tasks rather than temporary artifacts or annotation noise. Our view is that the goal is not to recover perfect one-to-one correspondences (which is very difficult, as discussed in [sec:sec:uni95vs95multi95app]), but to better account for multiplicity in practice. If multiplicity is not modeled directly, we still cannot tell which unobserved matches are valid, which negatives are actually false negatives, or when benchmark annotations are incomplete.

From this perspective, multiplicity can still be addressed to a meaningful extent: dataset construction can reduce underspecified pairs, training objectives can avoid treating all unobserved pairs as negatives, and evaluation can move from single-positive matching to multi-positive or ranking-sensitive protocols. These steps may not eliminate multiplicity, but they can substantially reduce the mismatch it creates. As we argue throughout the paper, multiplicity yields predictable failure modes under the one-to-one paradigm. We discuss these failure modes more in 9.1. Now, we outline actionable directions that collectively sketch a multiplicity-aware pipeline.

Our main principle is simple: even if multiplicity cannot be resolved perfectly, it should be taken into account when designing datasets, methods, and benchmarks.

7.0.0.1 Guidelines for practice.

(i) Benchmark organizers: for each query, publish a small candidate pool (e.g., top-\(M\) retrieved items from diverse baseline models), verify multiple positives, and report ranking-sensitive metrics. (ii) Model builders: report results under multiplicity-aware evaluation alongside standard one-to-one metrics. (iii) Dataset builders: explicitly filter underspecified instances (e.g., overly generic captions) and release a “specificity” diagnostic so downstream users can control the trade-off between generality and matching ambiguity. (iv) Reviewers/readers: approach claims based on sparse one-to-one metrics with caution when multiplicity is likely; look for evidence across precision-based metrics or verified multi-positive subsets.

7.0.0.2 For modeling researchers.

(i) Treat alignments as latent or set-valued: develop objectives that consider multiple positives (or positive-unlabeled structure), mitigating FNs without assuming one-to-one. (ii) Represent uncertainty and multiplicity: explore multi- and distributional representations that can encode input and matching ambiguity. (iii) Model beyond one-to-one mapping: incorporate additional context to specify the intended correspondence, more discussions are in 9.2.

7.0.0.3 For benchmark designers.

(i) Make relevance explicit: benchmarks should specify the intended notion of correspondence, especially in task-dependent settings. (ii) Move beyond single-positive: whenever feasible, annotate or validate multiple positives and adopt ranking-sensitive metrics that reward multiple relevant matches (e.g., mAP@R) rather than relying solely on R@K, which can be misleading under multiplicity. (iii) Use human preference strategically: human judgments provide a robust signal under semantic diversity and can be used to assist automatic metrics.

7.0.0.4 For dataset builders.

(i) Filter underspecified instances explicitly: go beyond coarse alignment scores and target examples that amplify spurious correspondences (e.g., overly generic captions). (ii) Avoid scorer-generator collapse: when using (M)LLM generation, reduce dependence on a single alignment scorer by using diverse scorers, holding out human audits, and incorporating diversity-aware constraints; otherwise, feedback loops can progressively suppress valid alternatives. (iii) Embrace task-conditioned data views: when a dataset is intended for broad reuse, consider releasing multiple task-conditioned subsets or annotation views that reflect different correspondence notions, rather than forcing a single global alignment definition.

7.0.0.5 Across the pipeline.

Iterative development cycles: treat dataset collection, filtering, modeling, and evaluation as a coupled loop, under multiplicity-aware frameworks. As shown in the unimodal dataset construction [84], such iteration will significantly improve dataset quality and system robustness over time.

Acknowledgements↩︎

This work is supported by the Princeton Francis Robbins Upton Fellowship to S.C. We are grateful to Esin Tureci, Tyler Zhu, Junsuk Choe, and Song Park for valuable feedback that helped shape this work.

In this section, we provide an overview of the difference between the unimodal classification and the multimodal data pipelines. We will show that the multimodal dataset construction pipeline is fundamentally brittle to the multiplicity problem, while a carefully designed unimodal dataset pipeline can often suppress the effect of multiplicity.

In unimodal classification, \(\mathcal{Y}\) is a fixed and pre-defined label set (e.g., class labels), i.e., \(|\mathcal{Y}|\) is constant. Furthermore, unimodal label sets are usually well-defined; there are few cases where \(x\in\mathcal{X}\) belongs to multiple \(y\in\mathcal{Y}\). Although some studies argued that popular classification benchmarks can be viewed as multi-labeled [56][58], the degree of multiplicity is relatively limited compared to multimodal tasks. For example, [58] showed that while ImageNet images may correspond to multiple valid labels, roughly five labels per image can account for most of the semantic ambiguity. Hence, adding a new instance \(x\) does not change “ground-truths” of existing data points, since labels come from a fixed set (See [fig:uni95vs95multi95appendix] (a)).

In contrast, multimodal datasets define ground truth through cross-modal relations and are typically collected as a sparse set of annotated positive pairs \((x,y)\), under an one-to-one correspondence assumption. Since multimodal tasks rely on pairwise matching, adding a new pair can create \(O(N)\) additional plausible correspondences with existing instances, even though only a tiny subset is annotated. Moreover, unlike unimodal label sets that can be curated to reduce overlap (e.g., via WordNet hierarchies [70] or balanced popularity [85]), the nature of multimodal data collection is highly diverse, introducing multiple sources of multiplicity. Consequently, new annotations can induce additional implicit matches with many existing instances. For example, adding a caption like “a photo” introduces plausible matches not just with one image, but potentially with many photographic images in the dataset (see [fig:uni95vs95multi95appendix] (b)). Thus, the set of plausible correspondences can expand rapidly as the dataset scales. In practice, many instances have multiple valid counterparts in the other modality, i.e., \(|\{y\in\mathcal{Y}:(x,y)\in\mathcal{R}\}|>1\) for some \(x\). This contrast makes multiplicity particularly problematic in multimodal learning: scaling the dataset changes not only the number of examples, but also the space of plausible cross-modal relations to be learned and evaluated.

8 Human preference vs. evaluation metrics↩︎

Figure 3: Human preference vs. evaluation metrics under multiplicity. [20] asked human annotators to compare four retrieval scenarios: (A) only top-1 is wrong, (B) only top-1 is correct, (C) top-1 to top-5 are wrong, and (D) only top-5 is correct. mAP@R [59] is highly correlated to human preference (HP), while R@Ks are often irrelevant.

Previous studies [20], [59] have shown that R@K is not only less informative than ranking-based metrics such as mAP@R (where \(R\) denotes the number of positives), but can also be misleading. In particular, R@K ignores the overall ranking quality and fails to reward models that retrieve multiple semantically appropriate items, making it insensitive to models that produce coherent and diverse outputs; it makes a case when R@K is 100% but mAP@R is not 100% (See 3 (B)).

We borrow the experimental result and the figure from [20]. 3 shows the overview of a human preference study with four different retrieval scenarios. Given a text query (e.g., “A train on a train track near many trees”), assume there are four retrieval systems that return top-k similar items in four different precisions: (A) only the top-1 item is wrong, while the other items are correct, (B) only the top-1 item is correct, but the others are wrong, (C) items from top-1 to top-5 are wrong, but the others are correct, (D) only the top-5 item is correct. In 3, R@1, R@5, and mAP@R scores of each system are shown. For example, System A shows 0% R@1, but the best mAP@R among the systems; while System B shows 100% R@1 and R@5, while its mAP@R is significantly lower then system A. [20] asked human annotators to choose a more preferable system by pairwise comparison. After the pairwise comparison, they reconstruct the underlying human preference by the linear BT model [86]. Interestingly, the human preference (HP) score is highly aligned with mAP@R, while R@K cannot capture the human preference. Unfortunately, enlarging \(K\) cannot be a solution; [20] showed that the rankings by R@K with different \(K\)s are highly correlated with each other, while the ranking by mAP@R is less correlated with them. This indicates the need for carefully annotated cross-modal retrieval benchmarks and more reliable evaluation metrics for retrieval benchmarks under multiplicity.

This suggests that evaluation under multiplicity should verify multiple positives whenever feasible and report ranking-sensitive metrics in addition to (or instead of) R@K.

9 More discussions↩︎

9.1 Predictable failure modes of one-to-one supervision↩︎

Throughout the paper, we argue that multiplicity yields predictable failure modes under the one-to-one paradigm: (i) as datasets and models scale, the rate of unobserved-but-valid correspondences grows, increasing training instability and degrading representation quality; and (ii) evaluation benchmarks with sparse annotations become increasingly unreliable. These predictions are empirically testable by varying dataset scale and annotation density, and they motivate concrete changes to how we design training, evaluation, and dataset construction pipelines.

We provide suggestive empirical evidence for these predictions. For example, [20] has shown that re-annotating unobserved-but-valid correspondences as positives and using precision-based metrics can substantially change the ranking of models. Specifically, models with high R@K scores (which focus on exact matching) often degrade under precision-based metrics such as mAP@R. Similarly, the authors show that even at the relatively small scale of image-text pairs in COCO Caption, the number of hidden false negatives is nontrivial.

9.2 More discussions on novel modeling↩︎

We suggest to incorporate additional context to specify the intended correspondence (e.g., text-conditioned transformations [87], spatial grounding via local regions/masks [88], [89], or lexically specifying the characteristic of the corresponding audio from the video [9]), and explore compositional representations that model an instance as a composition of underlying concepts [90].

As another example, distribution-aware (or multi-prompt) adaptation methods [91][93] are relevant as evidence that downstream VLM adaptation often benefits from representing a class or concept with multiple prompts or distributions, which is consistent with our broader claim that multimodal semantics are often non-unique.

Also, we suggest extending the multiplicity-aware pipeline to generative VLMs: one-reference supervision can suppress valid alternatives; future work should investigate multi-reference protocols, preference-based objectives, or distribution-aware training signals that better reflect the space of valid outputs.

9.3 Relation to existing work↩︎

Multiplicity is closely related to several phenomena previously studied in multimodal learning, including modality asymmetry, ambiguity, information imbalance, and modality gap. These phenomena are important in their own right, and prior work has provided valuable evidence that multimodal representations can be affected by the mismatch between modalities. Our perspective is complementary: we view these phenomena as distinct mechanisms that can induce the same downstream structural problem, namely that an observed one-to-one pair often under-specifies the full set of valid cross-modal correspondences.

This distinction is important because mitigating one source of mismatch does not necessarily eliminate multiplicity. For example, reducing intra-modal variability or partially mitigating modality asymmetry may still leave multiple plausible correspondences due to task-dependent notions of relevance. Similarly, even if a benchmark is carefully curated for a particular notion of alignment, hidden valid matches can remain whenever relevance is many-to-many. Thus, multiplicity is not simply a collection of isolated issues, but a structural property of multimodal correspondence that affects data construction, training, and evaluation.

This perspective also clarifies the relation between multiplicity and modality gap studies [32], [94], [95]. These works primarily analyze representational mismatch between modalities, especially in CLIP-style contrastive vision-language models. Such analyses are highly relevant to our argument because the modality gap and information imbalance can be viewed as representation-level manifestations of modality asymmetry, one of the sources of multiplicity. However, multiplicity is broader than the modality gap alone. While modality gap concerns the geometry of learned embeddings, multiplicity concerns the underlying correspondence structure: before any model is trained, a single image, caption, audio clip, or instruction may already admit multiple valid counterparts depending on semantic overlap, modality asymmetry, and task context.

Consequently, solutions that reduce the modality gap do not necessarily resolve the many-to-many nature of multimodal correspondence. Existing modality-gap analyses typically remain within a one-to-one training or evaluation paradigm, whereas our position is that this paradigm itself becomes insufficient when multiple plausible correspondences exist. Moreover, modality gap studies mainly focus on CLIP-style training, while multiplicity affects a broader multimodal pipeline, including dataset construction, contrastive and generative training, and evaluation protocols. Our contribution is therefore to unify these related phenomena under a single structural view and to argue that multiplicity should be treated as a first-class consideration throughout the multimodal learning pipeline.

References↩︎

[1]
Radford, A., Kim, J. W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., Krueger, G., and Sutskever, I. Learning transferable visual models from natural language supervision. In International Conference on Machine Learning (ICML), pp. 8748–8763. PMLR, 2021.
[2]
Jia, C., Yang, Y., Xia, Y., Chen, Y.-T., Parekh, Z., Pham, H., Le, Q., Sung, Y.-H., Li, Z., and Duerig, T. Scaling up visual and vision-language representation learning with noisy text supervision. In International Conference on Machine Learning (ICML), pp. 4904–4916. PMLR, 2021.
[3]
Li, J., Li, D., Xiong, C., and Hoi, S. : Bootstrapping language-image pre-training for unified vision-language understanding and generation, 2022.
[4]
Liu, H., Li, C., Wu, Q., and Lee, Y. J. Visual instruction tuning. Advances in Neural Information Processing Systems (NeurIPS), 36: 34892–34916, 2023.
[5]
Elizalde, B., Deshmukh, S., Al Ismail, M., and Wang, H. Clap learning audio concepts from natural language supervision. In ICASSP, pp. 1–5. IEEE, 2023.
[6]
Ahn, M., Brohan, A., Brown, N., Chebotar, Y., Cortes, O., David, B., Finn, C., Fu, C., Gopalakrishnan, K., Hausman, K., et al. Do as i can, not as i say: Grounding language in robotic affordances. In Conference on robot learning, pp. 287–318. PMLR, 2023.
[7]
Driess, D., Xia, F., Sajjadi, M. S., Lynch, C., Chowdhery, A., Wahid, A., Tompson, J., Vuong, Q., Yu, T., Huang, W., et al. Palm-e: An embodied multimodal language model. In International Conference on Machine Learning (ICML), 2023.
[8]
Kim, M. J., Pertsch, K., Karamcheti, S., Xiao, T., Balakrishna, A., Nair, S., Rafailov, R., Foster, E., Lam, G., Sanketi, P., et al. Openvla: An open-source vision-language-action model. arXiv preprint arXiv:2406.09246, 2024.
[9]
Jeong, Y., Kim, Y., Chun, S., and Lee, J. Read, watch and scream! sound generation from text and video. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 2025.
[10]
Pearl, J. et al. Causality: Models, reasoning, and inference. Cambridge, UK: CambridgeUniversityPress, 19 (2): 3, 2000.
[11]
Chen, X., Fang, H., Lin, T.-Y., Vedantam, R., Gupta, S., Dollár, P., and Zitnick, C. L. Microsoft COCO captions: Data collection and evaluation server. arXiv preprint arXiv:1504.00325, 2015.
[12]
Lin, T.-Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollár, P., and Zitnick, C. L. Microsoft COCO: Common objects in context. In European Conference on Computer Vision (ECCV), 2014.
[13]
Paivio, A. Mental representations: A dual coding approach. Oxford university press, 1990.
[14]
Chun, S., Yang, W., Dharmasiri, A., and Russakovsky, O. : Context and multiplicity decomposition for multimodal uncertainty estimation. arXiv preprint arXiv:2606.32012, 2026.
[15]
Pont-Tuset, J., Uijlings, J., Changpinyo, S., Soricut, R., and Ferrari, V. Connecting vision and language with localized narratives. In European Conference on Computer Vision (ECCV), 2020.
[16]
Park, J. S., Bhagavatula, C., Mottaghi, R., Farhadi, A., and Choi, Y. Visualcomet: Reasoning about the dynamic context of a still image. In European Conference on Computer Vision (ECCV), 2020.
[17]
Chen, H., Xie, W., Vedaldi, A., and Zisserman, A. Vggsound: A large-scale audio-visual dataset. In ICASSP, pp. 721–725. IEEE, 2020.
[18]
Nagrani, A., Chung, J. S., and Zisserman, A. Voxceleb: a large-scale speaker identification dataset. arXiv preprint arXiv:1706.08612, 2017.
[19]
Owens, A., Isola, P., McDermott, J., Torralba, A., Adelson, E. H., and Freeman, W. T. Visually indicated sounds. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 2405–2413, 2016.
[20]
Chun, S., Kim, W., Park, S., Chang, M. C., and Oh, S. J. : Correcting false negatives by collecting machine-and-human-verified image-caption associations for MS-COCO. In European Conference on Computer Vision (ECCV), 2022.
[21]
Chun, S. Improved probabilistic image-text representations. In International Conference on Learning Representations (ICLR), 2024.
[22]
Kim, W., Chun, S., Kim, T., Han, D., and Yun, S. : Hyperbolic entailment filtering for underspecified images and texts. In European Conference on Computer Vision (ECCV), 2024.
[23]
Lu, J., Batra, D., Parikh, D., and Lee, S. Vilbert: Pretraining task-agnostic visiolinguistic representations for vision-and-language tasks. In Advances in Neural Information Processing Systems (NeurIPS), pp. 13–23, 2019.
[24]
Kim, W., Son, B., and Kim, I. Vilt: Vision-and-language transformer without convolution or region supervision. In International Conference on Machine Learning (ICML), 2021.
[25]
Zhai, X., Mustafa, B., Kolesnikov, A., and Beyer, L. Sigmoid loss for language image pre-training. In International Conference on Computer Vision (ICCV), pp. 11975–11986, 2023.
[26]
Changpinyo, S., Sharma, P., Ding, N., and Soricut, R. Conceptual 12m: Pushing web-scale image-text pre-training to recognize long-tail visual concepts. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 3558–3568, 2021.
[27]
Desai, K., Kaul, G., Aysola, Z., and Johnson, J. . In NeurIPS Dataset and Benchmark (NeurIPS D&B), 2021.
[28]
Schuhmann, C., Vencu, R., Beaumont, R., Kaczmarczyk, R., Mullis, C., Katta, A., Coombes, T., Jitsev, J., and Komatsuzaki, A. Laion-400m: Open dataset of clip-filtered 400 million image-text pairs. arXiv preprint arXiv:2111.02114, 2021.
[29]
Schuhmann, C., Beaumont, R., Vencu, R., Gordon, C., Wightman, R., Cherti, M., Coombes, T., Katta, A., Mullis, C., Wortsman, M., Schramowski, P., Kundurthy, S., Crowson, K., Schmidt, L., Kaczmarczyk, R., and Jitsev, J. Laion-5b: An open large-scale dataset for training next generation image-text models. Advances in Neural Information Processing Systems (NeurIPS), 35: 25278–25294, 2022.
[30]
Faghri, F., Fleet, D. J., Kiros, J. R., and Fidler, S. : Improving visual-semantic embeddings with hard negatives. In British Machine Vision Conference (BMVC), 2018.
[31]
Chen, J., Hu, H., Wu, H., Jiang, Y., and Wang, C. Learning the best pooling strategy for visual semantic embedding. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 15789–15798, 2021.
[32]
Liang, V. W., Zhang, Y., Kwon, Y., Yeung, S., and Zou, J. Y. Mind the gap: Understanding the modality gap in multi-modal contrastive representation learning. Advances in Neural Information Processing Systems (NeurIPS), 35: 17612–17625, 2022.
[33]
Huynh, T., Kornblith, S., Walter, M. R., Maire, M., and Khademi, M. Boosting contrastive self-supervised learning with false negative cancellation. In IEEE/CVF Winter Conference on Applications of Computer Vision (WACV), pp. 2785–2795, 2022.
[34]
Sterz, H., Pfeiffer, J., and Vulić, I. : Diverse visual question answering with robustness evaluation. Transactions of the Association for Computational Linguistics (TACL), 13: 1121–1145, 2025. . URL https://aclanthology.org/2025.tacl-1.52/.
[35]
Achiam, J., Adler, S., Agarwal, S., Ahmad, L., Akkaya, I., Aleman, F. L., Almeida, D., Altenschmidt, J., Altman, S., Anadkat, S., et al. Gpt-4 technical report. arXiv preprint arXiv:2303.08774, 2023.
[36]
Team, G., Anil, R., Borgeaud, S., Alayrac, J.-B., Yu, J., Soricut, R., Schalkwyk, J., Dai, A. M., Hauth, A., Millican, K., et al. Gemini: a family of highly capable multimodal models. arXiv preprint arXiv:2312.11805, 2023.
[37]
Byun, J., Kim, D., and Moon, T. Mafa: Managing false negatives for vision-language pre-training. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 27314–27324, 2024.
[38]
Li, Y., Liang, F., Zhao, L., Cui, Y., Ouyang, W., Shao, J., Yu, F., and Yan, J. Supervision exists everywhere: A data efficient contrastive language-image pre-training paradigm. In International Conference on Learning Representations (ICLR), 2022. URL https://openreview.net/forum?id=zq1iJkNk3uN.
[39]
Zhang, H., Cisse, M., Dauphin, Y. N., and Lopez-Paz, D. mixup: Beyond empirical risk minimization. In International Conference on Learning Representations (ICLR), 2018.
[40]
Yun, S., Han, D., Oh, S. J., Chun, S., Choe, J., and Yoo, Y. : Regularization strategy to train strong classifiers with localizable features. In International Conference on Computer Vision (ICCV), 2019.
[41]
Huang, Z., Niu, G., Liu, X., Ding, W., Xiao, X., hua wu, and Peng, X. Learning with noisy correspondence for cross-modal matching. In Beygelzimer, A., Dauphin, Y., Liang, P., and Vaughan, J. W. (eds.), Advances in Neural Information Processing Systems (NeurIPS), 2021. URL https://openreview.net/forum?id=S9ZyhWC17wJ.
[42]
Song, H., Kim, M., Park, D., Shin, Y., and Lee, J.-G. Learning from noisy labels with deep neural networks: A survey. IEEE transactions on neural networks and learning systems, 34 (11): 8135–8153, 2022.
[43]
Bekker, J. and Davis, J. Learning from positive and unlabeled data: A survey. Machine Learning, 109 (4): 719–760, 2020.
[44]
Song, Y. and Soleymani, M. Polysemous visual-semantic embedding for cross-modal retrieval. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1979–1988, 2019.
[45]
Kim, D., Kim, N., and Kwak, S. Improving cross-modal retrieval with set of diverse embeddings. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 23422–23431, 2023.
[46]
Shazeer, N., Mirhoseini, A., Maziarz, K., Davis, A., Le, Q., Hinton, G., and Dean, J. Outrageously large neural networks: The sparsely-gated mixture-of-experts layer. arXiv preprint arXiv:1701.06538, 2017.
[47]
Dai, D., Deng, C., Zhao, C., Xu, R., Gao, H., Chen, D., Li, J., Zeng, W., Yu, X., Wu, Y., et al. Deepseekmoe: Towards ultimate expert specialization in mixture-of-experts language models. arXiv preprint arXiv:2401.06066, 2024.
[48]
Chun, S., Oh, S. J., De Rezende, R. S., Kalantidis, Y., and Larlus, D. Probabilistic embeddings for cross-modal retrieval. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2021.
[49]
Upadhyay, U., Karthik, S., Mancini, M., and Akata, Z. Probvlm: Probabilistic adapter for frozen vision-language models. In International Conference on Computer Vision (ICCV), pp. 1899–1910, 2023.
[50]
Li, H., Song, J., Gao, L., Zhu, X., and Shen, H. Prototype-based aleatoric uncertainty quantification for cross-modal retrieval. Advances in Neural Information Processing Systems (NeurIPS), 36: 24564–24585, 2023.
[51]
Baumann, A., Li, R., Klasson, M., Mentu, S., Karthik, S., Akata, Z., Solin, A., and Trapp, M. Post-hoc probabilistic vision-language models. In International Conference on Learning Representations (ICLR), 2026.
[52]
Chun, S., Kim, W., Park, S., and Yun, S. Probabilistic language-image pre-training. In International Conference on Learning Representations (ICLR), 2025.
[53]
Chun, S. and Yun, S. : A probabilistic vision-language model with long context text. In ICLR Workshop on Quantify Uncertainty and Hallucination in Foundation Models, 2025.
[54]
Lee, J., Park, S., Chun, S., and Chung, S.-W. Seeing what you say: Expressive image generation from speech. In 1st Workshop on Generative AI for Audio-Visual Content Creation, 2025. URL https://openreview.net/forum?id=g9AZgNiniS.
[55]
Kisel, N., Volkov, I., Hanzelková, K., Janouskova, K., and Matas, J. Flaws of imagenet, computer vision’s favorite dataset. In ICLR Blogposts 2025, 2025. URL https://d2jud02ci9yv69.cloudfront.net/2025-04-28-imagenet-flaws-135/blog/imagenet-flaws/. https://d2jud02ci9yv69.cloudfront.net/2025-04-28-imagenet-flaws-135/blog/imagenet-flaws/.
[56]
Beyer, L., Hénaff, O. J., Kolesnikov, A., Zhai, X., and Oord, A. v. d. Are we done with ImageNet? arXiv preprint arXiv:2006.07159, 2020.
[57]
Shankar, V., Roelofs, R., Mania, H., Fang, A., Recht, B., and Schmidt, L. Evaluating machine accuracy on imagenet. In International Conference on Machine Learning (ICML), pp. 8634–8644. PMLR, 2020.
[58]
Yun, S., Oh, S. J., Heo, B., Han, D., Choe, J., and Chun, S. Re-labeling imagenet: from single to multi-labels, from global to localized labels. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2021.
[59]
Musgrave, K., Belongie, S., and Lim, S.-N. A metric learning reality check. In European Conference on Computer Vision (ECCV), 2020.
[60]
Lee, T., Yasunaga, M., Meng, C., Mai, Y., Park, J. S., Gupta, A., Zhang, Y., Narayanan, D., Teufel, H., Bellagente, M., et al. Holistic evaluation of text-to-image models. Advances in Neural Information Processing Systems (NeurIPS), 36: 69981–70011, 2023.
[61]
Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., and Hochreiter, S. Gans trained by a two time-scale update rule converge to a local nash equilibrium. Advances in Neural Information Processing Systems (NeurIPS), 30, 2017.
[62]
Papineni, K., Roukos, S., Ward, T., and Zhu, W.-J. Bleu: a method for automatic evaluation of machine translation. In Association for Computational Linguistics (ACL), pp. 311–318, 2002.
[63]
Lin, C.-Y. Rouge: A package for automatic evaluation of summaries. In Text summarization branches out, pp. 74–81, 2004.
[64]
Banerjee, S. and Lavie, A. Meteor: An automatic metric for mt evaluation with improved correlation with human judgments. In Proceedings of the acl workshop on intrinsic and extrinsic evaluation measures for machine translation and/or summarization, pp. 65–72, 2005.
[65]
Zhang, R., Isola, P., Efros, A. A., Shechtman, E., and Wang, O. The unreasonable effectiveness of deep features as a perceptual metric. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 586–595, 2018.
[66]
Sarto, S., Cornia, M., and Cucchiara, R. Image captioning evaluation in the age of multimodal llms: Challenges and future perspectives. arXiv preprint arXiv:2503.14604, 2025.
[67]
Wah, C., Branson, S., Welinder, P., Perona, P., and Belongie, S. . Technical Report CNS-TR-2011-001, California Institute of Technology, 2011.
[68]
Wray, M., Doughty, H., and Damen, D. On semantic similarity in video retrieval. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 3650–3660, 2021.
[69]
Parekh, Z., Baldridge, J., Cer, D., Waters, A., and Yang, Y. Crisscrossed captions: Extended intramodal and intermodal semantic similarity judgments for MS-COCO. In Conference of the European Chapter of the Association for Computational Linguistics (EACL), 2021.
[70]
Russakovsky, O., Deng, J., Su, H., Krause, J., Satheesh, S., Ma, S., Huang, Z., Karpathy, A., Khosla, A., Bernstein, M., Berg, A. C., and Fei-Fei, L. large scale visual recognition challenge. International Journal of Computer Vision (IJCV), 115 (3): 211–252, 2015.
[71]
Cherti, M., Beaumont, R., Wightman, R., Wortsman, M., Ilharco, G., Gordon, C., Schuhmann, C., Schmidt, L., and Jitsev, J. Reproducible scaling laws for contrastive language-image learning. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 2818–2829, 2023.
[72]
Gadre, S. Y., Ilharco, G., Fang, A., Hayase, J., Smyrnis, G., Nguyen, T., Marten, R., Wortsman, M., Ghosh, D., Zhang, J., et al. Datacomp: In search of the next generation of multimodal datasets. Advances in Neural Information Processing Systems (NeurIPS), 36, 2024.
[73]
Maini, P., Goyal, S., Lipton, Z. C., Kolter, J. Z., and Raghunathan, A. T-mars: Improving visual representations by circumventing text feature learning. In International Conference on Learning Representations (ICLR), 2024.
[74]
Fang, A., Jose, A. M., Jain, A., Schmidt, L., Toshev, A., and Shankar, V. Data filtering networks. In International Conference on Learning Representations (ICLR), 2024.
[75]
Nukrai, D., Mokady, R., and Globerson, A. Text-only training for image captioning using noise-injected clip. In Conference on Empirical Methods in Natural Language Processing (EMNLP), 2022.
[76]
Gu, S., Clark, C., and Kembhavi, A. I can’t believe there’s no images! learning visual tasks using only language supervision. In International Conference on Computer Vision (ICCV), pp. 2672–2683, 2023.
[77]
Li, W., Zhu, L., Wen, L., and Yang, Y. Decap: Decoding clip latents for zero-shot captioning via text-only training. In International Conference on Learning Representations (ICLR), 2023.
[78]
Gu, G., Chun, S., Kim, W., Kang, Y., and Yun, S. Language-only efficient training of zero-shot composed image retrieval. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2024.
[79]
Zhang, B., Zhang, P., Dong, X., Zang, Y., and Wang, J. Long-clip: Unlocking the long-text capability of clip. In European Conference on Computer Vision (ECCV), pp. 310–325. Springer, 2024.
[80]
Li, X., Tu, H., Hui, M., Wang, Z., Zhao, B., Xiao, J., Ren, S., Mei, J., Liu, Q., Zheng, H., Zhou, Y., and Xie, C. What if we recaption billions of web images with LLaMA-3? In International Conference on Machine Learning (ICML), 2025. URL https://openreview.net/forum?id=Hntp7s2YfF.
[81]
Yu, H., Tian, Y., Kumar, S., Yang, L., and Wang, H. The devil is in the details: A deep dive into the rabbit hole of data filtering. arXiv preprint arXiv:2309.15954, 2023.
[82]
Wu, X., Xia, M., Shao, R., Deng, Z., Koh, P. W., and Russakovsky, O. Icons: Influence consensus for vision-language data selection. arXiv preprint arXiv:2501.00654, 2024.
[83]
Zitnick, C. L. and Parikh, D. Bringing semantics into focus using visual abstraction. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 3009–3016, 2013.
[84]
Benenson, R., Popov, S., and Ferrari, V. Large-scale interactive object segmentation with human annotators. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 11700–11709, 2019.
[85]
Kuznetsova, A., Rom, H., Alldrin, N., Uijlings, J., Krasin, I., Pont-Tuset, J., Kamali, S., Popov, S., Malloci, M., Kolesnikov, A., et al. The open images dataset v4: Unified image classification, object detection, and visual relationship detection at scale. International Journal of Computer Vision (IJCV), 128 (7): 1956–1981, 2020.
[86]
Bradley, R. A. and Terry, M. E. Rank analysis of incomplete block designs: I. the method of paired comparisons. Biometrika, 39 (3/4): 324–345, 1952.
[87]
Gu, G., Chun, S., Jun, H., Kang, Y., Kim, W., and Yun, S. : Versatile composed image retrieval with latent diffusion. Transactions on Machine Learning Research (TMLR), 2024. URL https://openreview.net/forum?id=mKtlzW0bWc.
[88]
Lee, J., Chun, S., and Yun, S. Toward interactive regional understanding in vision-large language models. In Annual Conference of the North American Chapter of the Association for Computational Linguistics (NAACL), 2024.
[89]
Cai, M., Liu, H., Mustikovela, S. K., Meyer, G. P., Chai, Y., Park, D., and Lee, Y. J. Vip-llava: Making large multimodal models understand arbitrary visual prompts. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 12914–12923, 2024.
[90]
Ma, Z., Hong, J., Gul, M. O., Gandhi, M., Gao, I., and Krishna, R. Crepe: Can vision-language foundation models reason compositionally? In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 10910–10921, 2023.
[91]
Wang, D., Li, M., Liu, X., Xu, M., Chen, B., and Zhang, H. Tuning multi-mode token-level prompt alignment across modalities. In Advances in Neural Information Processing Systems (NeurIPS), 2023. URL https://openreview.net/forum?id=A253n2EXCd.
[92]
Cho, E., Kim, J., and Kim, H. J. Distribution-aware prompt tuning for vision-language models. In International Conference on Computer Vision (ICCV), pp. 22004–22013, 2023.
[93]
Liu, X., Wang, D., Fang, B., Li, M., Xu, Y., Duan, Z., Chen, B., and Zhou, M. Patch-prompt aligned bayesian prompt tuning for vision-language models. In Association for Uncertainty in Artificial Intelligence (UAI), 2024. URL https://openreview.net/forum?id=DJa8rxF67Y.
[94]
Levi, M. Y. and Gilboa, G. The double-ellipsoid geometry of CLIP. In Forty-second International Conference on Machine Learning, 2025. URL https://openreview.net/forum?id=QGUju9B68Z.
[95]
Schrodi, S., Hoffmann, D. T., Argus, M., Fischer, V., and Brox, T. Two effects, one trigger: On the modality gap, object bias, and information imbalance in contrastive vision-language models. In International Conference on Learning Representations (ICLR), 2025. URL https://openreview.net/forum?id=uAFHCZRmXk.