ArXiv: 2102.08981

🎯 Pitch

Loosening the strict data filters from Conceptual Captions yields a 12M-pair pre-training corpus that boosts novel object captioning CIDEr by 14 points over the 3M versionβ€”just by keeping more noise from web alt-texts, which turns out to carry rare visual concepts like sumo and mangosteen that clean datasets miss. This scale-to-noise trade-off directly benefits long-tail recognition, but the raw model still needs fine-tuning on cleaner data to satisfy n-gram overlap metrics.


1. Executive Summary

This paper introduces Conceptual 12M (CC12M), a dataset of 12.4 million image-text pairs designed for vision-and-language pre-training, constructed by relaxing the overly restrictive image and text filters from the Conceptual Captions 3M pipeline β€” removing data processing steps such as hypernymization of named entities and digit substitution, while retaining only person-name substitution for privacy. Using a Transformer-based encoder-decoder architecture pre-trained with an image captioning objective on CC12M and fine-tuned on COCO Captions, the authors evaluate on the nocaps benchmark for novel object captioning and on Flickr30K for zero-shot and fine-tuned image retrieval, emphasizing long-tail visual concept recognition. Pre-training on CC12M yields a +14.2 CIDEr point improvement over CC3M on nocaps (87.4 vs. 73.2 overall CIDEr), achieves state-of-the-art results with a combined CC3M+CC12M model at 90.2 CIDEr on the nocaps validation set, and improves zero-shot image retrieval recall@1 by +7.1 percentage points over CC3M (42.5 vs. 35.4), establishing that scaling pre-training data with higher-recall, less-processed web alt-texts substantially benefits downstream vision-and-language performance β€” particularly on out-of-domain and long-tail concepts β€” while simultaneously demonstrating that such noisy data requires a subsequent fine-tuning step on cleaner, task-specific data to match the style expected by automatic evaluation metrics.

2. Context and Motivation

The Core Problem: Vision-and-Language Datasets Are Too Small and Too Narrow

By 2020, when this paper was written, transfer learning through pre-training and fine-tuning had become the dominant paradigm in vision-and-language (V+L) research. Architectures inspired by BERT β€” multi-layer Transformers with self-attention mechanisms combined with self-supervised objectives like masked language modeling β€” had proven remarkably effective across tasks ranging from visual question answering to image-text retrieval to referring expression comprehension. The architectural side of V+L research was advancing rapidly, with new model variants appearing at a steady clip.

However, the paper identifies a fundamental bottleneck that was receiving far less attention: the datasets used for V+L pre-training were severely limited in both scale and visual diversity compared to what had become standard in the vision-only and language-only communities. This gap is the core problem the paper sets out to address.

To appreciate the magnitude of this gap, the paper draws explicit contrasts with both the vision and NLP communities (Section 1). In vision, datasets like JFT-300M (with 300 million images) and Instagram-scale collections had demonstrated that massive, weakly-labeled image datasets could dramatically outperform the order-of-magnitude-smaller ImageNet on downstream classification and detection tasks. In NLP, the trajectory was even starker: pre-training corpora grew from the 20GB BooksCorpus + English Wikipedia combination used in BERT, to the 570GB dataset behind GPT-3, to the 745GB C4 corpus in T5. The lesson from both fields was unambiguous β€” scaling up pre-training data works, and works well.

In contrast, V+L datasets suffered from two distinct limitations. First, their effective sizes were low: the number of images in popular V+L datasets ranged from fewer than a few hundred thousand (Flickr30K, COCO Captions, Visual Genome, VizWiz) to at most a few million (Conceptual Captions 3M, at 3.3 million pairs). Second, and perhaps more critically, many of the smaller datasets shared the same, limited visual domain. COCO Captions, Visual Genome, VQA2, GQA, RefCOCO, and several others are all built on top of the same COCO images β€” a collection of roughly 100,000 photographs depicting 80 common object categories in everyday scenes. This means that a model pre-trained on these datasets has been exposed to a remarkably narrow slice of the visual world.

The practical consequence of this narrowness is that V+L models struggle to perform adequately on long-tail visual concepts β€” objects, scenes, and entities that fall outside the common categories covered by existing datasets. If a model has never seen a mangosteen, a sumo wrestler, or a jellyfish during pre-training (or has seen them only a handful of times, as in the hypernymized CC3M where "sumo" appeared exactly once), it will be unable to generate or understand captions involving these concepts at test time. This is not a niche concern: real-world applications of V+L systems β€” assistive technology for the visually impaired, content moderation, visual search, robotic perception β€” routinely encounter the long tail of visual concepts that fall outside curated dataset distributions.

Why This Problem Matters: Practical and Scientific Significance

The limitations of V+L pre-training data carry both practical and scientific consequences.

Practical impact. The paper focuses its evaluation on tasks that explicitly require generalization beyond training distributions, particularly novel object captioning on the nocaps benchmark. nocaps evaluates models on Open Images, which contains roughly 600 object classes compared to COCO's 80. The majority of these classes are never seen during standard COCO-based training, making nocaps a direct test of whether pre-training data can fill the gap. Models trained only on COCO Captions produce generic, often incorrect captions on nocaps images β€” guessing "microphone" when seeing bagpipes, or defaulting to "people" when seeing sumo wrestlers. This failure mode has real consequences for any application where precise, informative descriptions matter.

The paper also evaluates zero-shot image retrieval, where a pre-trained model must match captions to images without any task-specific fine-tuning. This tests whether the visual-linguistic representations learned during pre-training capture enough visual diversity to connect novel textual queries to novel visual content β€” a capability that is directly relevant to search engines, content discovery systems, and any application where the query distribution is open-ended.

Scientific significance. The paper addresses a deeper question about the nature of vision-and-language learning: what kind of supervision signal is most valuable for learning transferable multimodal representations? Prior to this work, the dominant assumption (implicit in the construction of CC3M) was that high-precision, carefully cleaned captions were necessary for effective pre-training. CC3M was built with substantial filtering β€” image size and aspect ratio constraints, text quality heuristics (part-of-speech requirements, capitalization checks, sentiment analysis), image-text overlap verification via Google Cloud Vision API tags, and aggressive text transformations including hypernymization of all named entities and deletion of time-related spans. Each of these steps improved caption precision at the cost of recall, discarding potentially useful image-text pairs.

The paper's central hypothesis challenges this assumption: for pre-training specifically (as opposed to end-task image captioning), higher recall may be more important than higher precision. The intuition is that pre-training is fundamentally about building broad visual-linguistic associations, and that noisy but diverse examples may contribute more to this goal than clean but narrow ones. If true, this would represent a significant shift in how the community thinks about constructing V+L pre-training data β€” analogous to the shift in NLP from carefully curated corpora (BookCorpus + Wikipedia) to massive web-scraped datasets (C4, Common Crawl).

Prior Approaches and Where They Fall Short

The paper situates itself against several categories of prior work, each with identifiable limitations.

Small, high-quality curated datasets. COCO Captions (106K images), Visual Genome (108K images with region-level captions), and Flickr30K (31K images) provided the foundation for early V+L research. These datasets feature human-written captions that are grammatically clean and precisely descriptive. However, their limited scale and narrow visual domain make them unsuitable as the primary source of visual knowledge for pre-training. A model trained only on COCO learns about 80 object categories in a restricted set of photographic contexts; it has no exposure to the vast majority of visual concepts that appear in the real world. The paper quantifies this limitation in its supplementary analysis (Table 9, Appendix B.1): across the 394 nocaps out-of-domain classes, COCO Captions contains a median frequency of only 37 instances per class, compared to 3,110 for CC12M. Even after normalizing for dataset size (per 1M instances), COCO provides only 62.3 instances per OOD class vs. 250.3 for CC12M β€” a 4Γ— gap in relative coverage.

Conceptual Captions 3M (CC3M). CC3M represented a major advance by demonstrating that alt-text from the web could be filtered and processed into a dataset suitable for training image captioning models. At 3.3 million image-text pairs, it was roughly 30Γ— larger than COCO Captions and covered a much wider range of visual concepts. The paper readily acknowledges CC3M's importance: it had become "the most popular for pre-training" by the time this paper was written, adopted by ViLBERT, UNITER, VL-BERT, Oscar, and many others.

However, CC3M was explicitly designed for the end task of image caption generation, not for pre-training. This design choice manifested in two ways that the paper argues are suboptimal for pre-training:

  1. Aggressive filtering for precision. CC3M applies image-based filters (aspect ratio ≀ 2, JPEG only, size > 400px), text-based filters (language detection, part-of-speech requirements including the presence of prepositions, capitalization heuristics, unique-word ratio constraints, sentiment/polarity checks, adult content filtering), and image-text-based filters (requiring overlap between Google Cloud Vision API tags and caption text). Each filter removes potentially useful data to ensure high caption precision. The paper estimates CC3M's precision at 90.3% (Table 2 in the original CC3M paper), but this comes at the cost of discarding many image-text pairs that are "good enough" for learning visual-linguistic associations.

  2. Text transformations that erase information. CC3M performs hypernymization β€” replacing fine-grained named entities with their hypernyms (e.g., "Harrison Ford" β†’ "actor", "Chevrolet" β†’ "car", "Tokyo" β†’ "city"). It also deletes time-related spans and substitutes digits with a "#" abstraction token. These transformations were motivated by the difficulty of learning ultrafine-grained entities for image captioning: if a model generates "Harrison Ford" when the image shows Calista Flockhart, that's a clear error. But from a pre-training perspective, these transformations destroy valuable information about visual concepts. The paper provides concrete examples of what is lost: "luffy" (0β†’152), "mangosteen" (0β†’212), "zanzibar" (0β†’1138), "sumo" (1β†’661), "pokemon" (1β†’8615), where the numbers show frequency in CC3M vs. CC12M. These are precisely the long-tail concepts that pre-training should expose the model to.

SBU Captions. At roughly 1 million images, SBU Captions sits between COCO and CC3M in scale. It was collected from Flickr using a similar alt-text approach but with less extensive filtering than CC3M. The paper includes SBU in its analysis of OOD concept coverage (Appendix B.1, Figure 5) and shows that it provides better coverage than COCO or Visual Genome but substantially less than CC3M or CC12M. SBU had also been used for V+L pre-training (by LXMERT, UNITER, Unicoder-VL, and Oscar), but its intermediate scale and coverage position it as a stepping stone rather than a solution.

VQA and dense captioning datasets. VQA2, GQA, Visual Genome (for dense captioning), and RefCOCOg provide different forms of visual-linguistic supervision β€” question-answer pairs, region-level captions, referring expressions. These datasets have been used to augment pre-training (LXMERT, UNITER, Oscar). However, as the paper's analysis shows, they provide even worse coverage of long-tail visual concepts than captioning datasets, since their text is typically shorter and more task-constrained (Table 9, Figure 5). For example, VQA2 has a median frequency of 37 per OOD class β€” identical to COCO Captions since both are built on COCO images. RefCOCOg has a median of just 1 instance per OOD class.

The deeper problem: shared visual domain. Beyond the limitations of individual datasets, the paper identifies a systemic issue: many of the most popular V+L datasets β€” COCO Captions, Visual Genome, VQA2, GQA, RefCOCOg, Visual7W, GuessWhat β€” are all built on top of the same COCO images or subsets thereof. A model that pre-trains on Visual Genome + VQA2 + COCO Captions and then fine-tunes on RefCOCOg has essentially never left the COCO ecosystem. The authors warn that this can result in "transfer learning between (almost) identical sets of images" (Appendix A), inflating apparent transfer performance while masking genuine generalization failures. This is a subtle but important critique: the field's standard evaluation practices may be systematically overestimating models' ability to generalize, because pre-training and fine-tuning datasets share not just similar visual domains but literally the same images.

How This Paper Positions Itself

The paper positions itself as a data-centric intervention in the V+L pre-training landscape β€” not proposing a new architecture or training objective, but rather arguing that the community has been optimizing the wrong thing in its choice of pre-training data.

The key insight: different downstream tasks impose different requirements on pre-training data. CC3M was constructed with image captioning as the target task, so its filters were tuned to produce high-precision captions suitable for supervised training of captioning models. But the paper observes that CC3M had been "increasingly adopted for V+L pre-training, arguably beyond its original purpose." The requirements for pre-training are fundamentally different: precision matters less than coverage and diversity, because the goal is to expose the model to as many visual-linguistic associations as possible. A noisy example linking "jellyfish" to an image of a jellyfish is still useful for learning the jellyfish concept, even if the alt-text also contains hashtags and social media handles β€” the example that would have been filtered from CC3M but is included in CC12M (Figure 1).

The methodological approach: relax filters, measure impact. Rather than designing a new data collection pipeline from scratch, the paper takes the pragmatic approach of starting from the proven CC3M pipeline and systematically relaxing its constraints. The changes are described in concrete terms (Section 2.2):

  • Image-based filtering: aspect ratio maximum relaxed from 2.0 to 2.5, allowing slightly non-standard image dimensions through.
  • Text-based filtering: word count range expanded to 3–256 (vs. CC3M's narrower range); preposition requirement dropped; capitalization and unique-word ratio heuristics removed; maximum word repetition fraction set to 0.2; rare word threshold raised from 5 to 20 occurrences (reflecting the larger corpus size).
  • Image-text filtering: kept intact.
  • Text transformation: hypernymization and digit substitution removed entirely, with the sole exception of person-name substitution (replaced with a <PERSON> token) for privacy protection.

The result is a dataset that is 4Γ— larger (12.4M vs. 3.3M pairs), has a much longer-tailed token distribution (token/type ratio of 370.0 vs. 804.8), has longer average captions (20.2 vs. 10.3 words), but has lower precision (76.6% vs. 90.3% rated as good fit or better).

Positioning relative to the "scaling up data" trend. The paper explicitly connects itself to the broader trend of scaling up pre-training data that had transformed NLP and vision. The opening of the Introduction cites JFT-300M, Instagram-scale pre-training, GPT-3, and T5 as evidence that "scaling up training data is useful." CC12M is positioned as bringing this same insight to V+L β€” not at the scale of GPT-3 or JFT-300M (12 million is modest by those standards), but representing a significant step forward from the 3-million-pair ceiling that had constrained V+L pre-training up to that point.

What the paper is NOT claiming. It's worth clarifying what this paper does not attempt. It does not propose that CC12M should replace CC3M for all purposes β€” indeed, the results show that CC3M+CC12M together outperform either alone. It does not claim that raw alt-text is as good as human-written captions for end-task training β€” the paper consistently fine-tunes on clean, task-specific data (COCO Captions, Flickr30K) after pre-training. And it does not claim to have solved the long-tail recognition problem β€” the hardest examples still challenge the model, and the paper acknowledges that "injecting novel concepts into longer texts is harder" (Section 4.1, discussing LocNar results).

A contemporaneous context. The paper acknowledges in a footnote that concurrent or shortly-after work β€” ALIGN, CLIP, WIT, WenLan β€” had independently arrived at similar conclusions about the value of web-scale V+L pre-training data, some at even larger scales (CLIP used 400M pairs, ALIGN used 1.8B). This context actually strengthens the paper's contribution: it shows that the insight was "in the air" and that CC12M, released publicly with detailed analysis, provided a concrete, reproducible resource for the community at a time when most such datasets remained proprietary.

The Paper's Core Thesis

The thesis can be stated succinctly: for vision-and-language pre-training, recall matters more than precision, and the field's existing datasets have been overly optimized for precision at the expense of the long-tail visual diversity needed for robust generalization. CC12M is both a test of this thesis (showing that the relaxed dataset outperforms the stricter one) and a resource for the community (providing a larger-scale, higher-diversity pre-training corpus that can be combined with existing datasets).

This thesis matters because it challenges the default assumption β€” inherited from supervised learning on clean benchmarks β€” that cleaner data is always better. In the pre-training regime, where the model needs to build broad capabilities rather than optimize a specific metric, the calculus changes. The paper's experimental design, which compares CC3M and CC12M head-to-head across multiple downstream tasks while controlling for model architecture and training procedure, is specifically structured to test whether the precision-recall tradeoff favors recall for pre-training. The positive results β€” across generation and matching tasks, zero-shot and fine-tuned settings, in-domain and out-of-domain evaluation β€” provide consistent evidence that it does.

3. Technical Approach

3.1 Reader Orientation

This paper is primarily a data contribution with an extensive experimental validation β€” it introduces a new, larger-scale dataset (CC12M) and then benchmarks its effectiveness for vision-and-language pre-training against the existing, smaller CC3M dataset. The system being built is not a novel architecture but rather a V+L pre-training and fine-tuning pipeline that uses either CC3M or CC12M as the source of image-text pairs for learning transferable multimodal representations. The core problem the pipeline solves is: given a fixed model architecture and downstream task, how do we pre-train the model so that it generalizes well to long-tail visual concepts that it will encounter at test time but that are absent from the fine-tuning dataset? The "shape" of the solution is deceptively simple β€” replace the high-precision, lower-recall CC3M pre-training data with the lower-precision, higher-recall CC12M data, pre-train the same architecture with the same objective, fine-tune on the same downstream data, and observe whether the increased scale and diversity of pre-training concepts translates into better generalization.

3.2 Big-Picture Architecture (Diagram in Words)

The overall system has four major components connected in a sequential pipeline:

  1. Data Collection and Processing Pipeline β€” takes raw web pages with images and alt-text as input, applies a series of relaxed image, text, and image-text filters (relative to CC3M's stricter pipeline), performs minimal text transformations (person-name substitution only), and outputs 12.4 million ⟨image, text⟩ pairs as CC12M. This component is the paper's primary contribution.

  2. Feature Extraction (Frozen) β€” takes an image from either pre-training or downstream data, runs a pre-trained Faster R-CNN object detector to extract 16 region proposals, featurizes each region and the whole image using Graph-RISE, extracts up to 16 image tags from Google Cloud Vision API, and outputs a bag of 1+16+16 feature vectors. Text is tokenized and embedded via a learned embedding layer.

  3. Transformer-Based Pre-Training Model β€” for vision-to-language generation tasks, this is an encoder-decoder Transformer that takes the bag of image features as input to the encoder and produces caption tokens autoregressively via the decoder, trained with a cross-entropy image captioning (ic) objective. For vision-and-language matching tasks, it uses a dual-encoder architecture (one Transformer encoder for images, one for text) that produces fixed-length representations, trained with a contrastive softmax loss (vlm). The same architecture is used regardless of whether pre-training data is CC3M or CC12M β€” the only variable is the data source.

  4. Downstream Fine-Tuning and Evaluation β€” takes the pre-trained model, fine-tunes it on task-specific data (COCO Captions for nocaps, Flickr30K for image retrieval), and evaluates on held-out test sets using standard metrics (CIDEr, SPICE, BLEU, ROUGE, METEOR for captioning; Recall@K for retrieval). This component is identical across CC3M and CC12M conditions, isolating the effect of pre-training data.

Information flows linearly: web data β†’ filtering pipeline β†’ CC12M pairs β†’ feature extraction β†’ pre-training β†’ fine-tuning β†’ evaluation. The key experimental manipulation is swapping CC3M for CC12M at step four while holding everything else constant.

3.3 Roadmap for the Deep Dive

  • First, the CC12M data collection pipeline β€” exactly which filters from CC3M are kept, which are relaxed, and which are removed, with concrete thresholds and justification for each choice. This is the paper's core contribution, so understanding it precisely is essential.
  • Second, the feature extraction pipeline β€” how images and text are converted into the vector representations that feed into the Transformer, including the object detector, Graph-RISE featurizer, and tag extraction system. This is shared across all experiments.
  • Third, the image captioning (ic) pre-training objective β€” the encoder-decoder Transformer architecture, the cross-entropy loss, and why this objective is chosen over masked alternatives.
  • Fourth, the visual-linguistic matching (vlm) pre-training objective β€” the dual-encoder architecture, the contrastive loss, and how it differs from the generation setup.
  • Fifth, the fine-tuning protocols β€” how pre-trained models are adapted to nocaps, Flickr30K, and the Conceptual Captions benchmark, including hyperparameter search ranges and stopping criteria.
  • Sixth, the key design choices and their justifications β€” why specific decisions were made (no hypernymization, simple ic objective over masked variants, late fusion for retrieval) and what alternatives were considered and rejected.

3.4 Detailed, Sentence-Based Technical Breakdown

This is primarily a data and empirical evaluation paper whose core idea is that relaxing the precision-oriented filters from CC3M produces a larger, more diverse pre-training dataset (CC12M) that yields better transfer to downstream V+L tasks, particularly on long-tail visual concepts. The technical approach has two halves: constructing the dataset, and then using it in a standard pre-training-and-fine-tuning pipeline whose architecture and training procedures are held constant to isolate the effect of the data.


CC12M Data Collection Pipeline: From Web Alt-Text to Image-Text Pairs

The data collection pipeline is a modified version of the four-step process used to build CC3M, described in Section 3 of the original Conceptual Captions paper. The authors follow this pipeline "closely" but introduce a series of relaxations and simplifications. The core design principle is: keep the image-text alignment filter (which ensures some minimum semantic correspondence) but substantially relax the unimodal image and text quality filters that were designed for captioning-style precision.

Step 1: Image-based filtering (relaxed relative to CC3M). The original CC3M pipeline filtered images based on size, aspect ratio, encoding format, and the presence of offensive content. CC12M retains the core safety and quality requirements but relaxes one dimension:

  • Aspect ratio constraint: CC3M required the ratio of larger dimension to smaller dimension to be ≀ 2.0. CC12M relaxes this to ≀ 2.5, allowing slightly more non-standard image shapes through. This is a modest relaxation β€” it admits images that are roughly 2.5:1 rather than 2:1, capturing more panoramic or tall-cropped images without admitting extremely skewed content.
  • Preserved constraints: Only JPEG images are kept. Images must be larger than 400 pixels on their smaller dimension (ensuring minimum resolution). Images that trigger pornography detectors are excluded. These constraints are identical to CC3M.

The aspect ratio relaxation increases recall modestly β€” some valid images were being excluded solely because of their shape, and shape is largely orthogonal to visual content diversity.

Step 2: Text-based filtering (substantially relaxed relative to CC3M). This is where the largest changes occur. CC3M's text filters were extensive: they required specific part-of-speech patterns (including the presence of prepositions), enforced capitalization heuristics, checked unique-word ratios across various POS tags, applied sentiment and polarity detection, and filtered out pre-defined unwanted phrases. CC12M strips most of these heuristics away, keeping only the most basic structural requirements:

  • Word count range: CC12M allows alt-text between 3 and 256 words. This is substantially wider than CC3M's range. The upper bound of 256 words is generous β€” it admits alt-text that is more like a paragraph than a caption β€” while the lower bound of 3 words ensures there is some minimal content.
  • Noun and determiner requirement: The text "must contain at least one noun and at least one determiner." A determiner is a word like "the," "a," "an," "this," or "that" β€” requiring one ensures the alt-text has some grammatical structure beyond a bare list of nouns. This heuristic is retained from CC3M.
  • Preposition requirement dropped: CC3M required the presence of prepositions (words like "in," "on," "at," "with") as a signal of well-formed descriptive language. CC12M drops this requirement entirely. The example in Figure 1 illustrates the consequence: "#jellyfish #blue #ocean #pretty Sea Turtle Wallpaper, Aquarius Aesthetic..." β€” this alt-text has no prepositions (it is primarily hashtags and noun phrases), so it would have been filtered from CC3M. But it still provides a useful visual-linguistic association: jellyfish, ocean, and related concepts are visually present in the image.
  • Capitalization heuristics removed: CC3M checked that the text had reasonable capitalization patterns (e.g., not all-caps, not all-lowercase with proper nouns). CC12M drops these checks entirely, accepting whatever capitalization is present in the alt-text.
  • Unique-word ratio heuristics removed: CC3M required that a sufficient fraction of words be unique (to filter out repetitive or spam-like text). CC12M drops these checks, replacing them with a single, simpler constraint: the maximum fraction of word repetition is set to 0.2 (i.e., no more than 20% of words can be repetitions). This is a looser constraint that still prevents obviously degenerate text.
  • Rare word threshold adjusted: In vocabulary construction, a word type is counted as "rare" and potentially excluded if it appears fewer than a threshold number of times. CC3M used a threshold of 5. CC12M raises this to 20, reflecting the larger corpus size β€” with 4Γ— more data, the same 5-occurrence threshold would admit many more rare terms, and the increased threshold compensates. In practice, this means very rare tokens (appearing 5–19 times) are still filtered out despite the larger corpus.

Step 3: Image-text-based filtering (unchanged from CC3M). This filter computes the overlap between the image tags predicted by the Google Cloud Vision API and the tokens in the alt-text, and requires some minimum level of overlap. The authors state they "keep the image-text filtering intact" β€” this is the one filter that directly assesses semantic correspondence between modalities, and retaining it ensures that the image-text pairs in CC12M have at least some meaningful relationship, even if the text is noisy.

This is a critical design choice. By preserving the image-text filter while relaxing the unimodal filters, the pipeline trades precision in text quality for recall in visual concept coverage while maintaining a floor on multimodal relevance. The risk of including completely unrelated image-text pairs is mitigated, but the text itself may be hashtags, social media handles, or grammatically awkward prose.

Step 4: Text transformations (almost entirely removed). CC3M performed extensive text transformations to make captions suitable for image captioning model training:

  • Hypernymization: All named entities of type PERSON, ORGANIZATION, and LOCATION were replaced with their hypernyms (e.g., "Harrison Ford" β†’ "actor", "Chevrolet" β†’ "car", "Tokyo" β†’ "city"). This was done because fine-grained named entities are extremely difficult to predict correctly in a captioning model β€” getting the exact name right from visual appearance alone is often impossible (you cannot distinguish Harrison Ford from Calista Flockhart by looking at their faces unless you have memorized both).
  • Time-related span deletion: Spans referring to dates, times, or temporal expressions were removed.
  • Digit substitution: All digits were replaced with a "#" abstraction token (e.g., "2019" β†’ "####").

CC12M removes hypernymization of organizations and locations entirely. Person-name hypernymization is replaced with a simpler privacy-preserving mechanism: person-name substitution, where all named entities of type PERSON are detected using Google Cloud Natural Language APIs and replaced with a special <PERSON> token. This is done purely for privacy protection, not for task simplification. Around 25% of all alt-texts in CC12M are transformed in this way β€” a substantial fraction, indicating how frequently person names appear in web alt-text.

Digit substitution and time-related span deletion are removed entirely. This means CC12M captions contain raw numbers, dates, and proper names for non-person entities (organizations, locations, brands, products). The consequence, as the paper notes in its analysis, is that tokens like "france," "africa," "dc," "toronto," "2019," "10," "2018," and "2020" become very frequent β€” these were suppressed or abstracted away in CC3M but are preserved in CC12M.

Why this design? The authors' reasoning is explicit: "our intuition is that relatively more difficult pre-training data would lead to better transferability." In other words, making the pre-training task harder β€” by including fine-grained entities, raw numbers, and less-polished text β€” forces the model to learn richer visual-linguistic associations rather than relying on the simplified vocabulary of hypernymized captions. This is a bet on the value of diversity and difficulty during pre-training, even at the cost of precision.

De-duplication with CC3M. For the experimental comparison, the authors "do not include the images that appear in CC3M in CC12M in our experiments" β€” meaning the two datasets are treated as disjoint for pre-training purposes, and the CC3M+CC12M combined setting uses their union. This prevents overlap from inflating the apparent benefit of CC12M.


Feature Extraction Pipeline: From Raw Images and Text to Model-Ready Vectors

The feature extraction pipeline converts each image into a fixed set of region-level and global feature vectors, and each text into a sequence of token embeddings. This pipeline is shared across all experiments (pre-training and fine-tuning, CC3M and CC12M conditions) and is described in Section 3.3 and Appendix E.

Object detection and region proposal. The first stage uses a Faster R-CNN object detector with a ResNet101 backbone. The backbone is pre-trained on JFT (a large internal Google image dataset) and fine-tuned on ImageNet. The detector itself is trained on Visual Genome to predict object bounding boxes and class labels. For each input image, the detector produces a set of region proposals with associated confidence scores, and the top-16 box proposals (by confidence) are selected. These 16 regions are intended to cover the most salient objects and entities in the image.

Region featurization with Graph-RISE. Each of the 16 selected bounding boxes is featurized using Graph-RISE, which produces a rich visual-semantic embedding for the image region. Graph-RISE is a graph-regularized image semantic embedding model that leverages knowledge graph information during training to produce embeddings that capture both visual appearance and semantic category information. The authors also featurize the entire image with Graph-RISE, producing one global feature vector. This gives a total of 1 + 16 = 17 visual feature vectors per image.

Image tags from Google Cloud Vision API. In addition to the region features, the system extracts up to 16 image tags using the Google Cloud Vision API. These are text labels that the Vision API predicts for the image β€” for example, "jellyfish," "ocean," "blue" for the jellyfish image in Figure 1. These tags are treated as text tokens and embedded using the same text embedding layer as the caption tokens. The authors state this is "inspired by" Oscar, which demonstrated that incorporating object tags as additional text input improves V+L model performance.

Geometric feature encoding. For each of the 16 bounding boxes, the system extracts geometric features: the coordinates of the top-left corner, the coordinates of the bottom-right corner, and the relative area of the box (fraction of the total image area). All five values are normalized to the range [0, 1]. Each value is linearly projected to an embedding of size $E = 512$, and the five resulting embeddings are concatenated into a vector of size $E \times 5 = 2560$. This concatenated vector is then passed through: Linear(512) β†’ ReLU β†’ Dropout(0.3) β†’ Linear(512), producing the final geometric embedding for each box.

Semantic-geometric fusion. For each bounding box, the geometric embedding and the Graph-RISE semantic embedding (both size 512) are combined:

  1. LayerNorm is applied to each independently.
  2. The two are added element-wise.
  3. The sum is passed through: Linear(512) β†’ ReLU β†’ Dropout(0.3) β†’ Linear(512) β†’ LayerNorm.

This produces a single 512-dimensional vector per region that fuses visual appearance information with spatial location information. The LayerNorm operations ensure that the two modalities are on comparable scales before addition.

Text tokenization. Text (captions during pre-training, alt-text tags, and captions during fine-tuning) is tokenized using the COCO tokenizer β€” a standard tokenizer from the coco-caption evaluation toolkit that splits on whitespace and punctuation. A vocabulary of subword tokens is built from the tokenized corpus. Each token is mapped to a learned embedding of size $E = 512$ via a randomly initialized lookup table, then passed through: Linear(512) β†’ ReLU β†’ Dropout(0.3) β†’ Linear(512).

Final input representation. For the image captioning (ic) objective, the input to the Transformer encoder is a bag of vectors: 1 global image feature, 16 region features (each with fused geometric+semantic information), and up to 16 tag feature vectors β€” all of dimension 512. The use of a bag (unordered set) rather than a spatial grid or sequence means the Transformer relies entirely on self-attention to discover spatial and semantic relationships among the regions, without explicit positional encoding of 2D layout.


Pre-Training Objective 1: Image Captioning (ic)

The image captioning objective is the primary pre-training task for the vision-to-language generation experiments. It is a standard supervised sequence-to-sequence learning problem: given the bag of image feature vectors, generate the target caption autoregressively, one token at a time.

Architecture. The model is a Transformer encoder-decoder, following the design of prior work in image captioning with Transformers (specifically, the authors cite their own prior work as a starting point). The configuration is detailed in Appendix E.2:

  • Transformer encoder: $L = 6$ layers, embedding size $E = 512$, hidden size $H = 1024$, feedforward/filter size $F = 4H = 4096$, number of attention heads $A = H / 64 = 8$. The encoder takes the bag of 1+16+16 image feature vectors as input and produces contextualized representations for each.
  • Transformer decoder: Same $L, E, H, F, A$ configuration as the encoder. The decoder generates caption tokens autoregressively β€” at each step, it attends to the encoder outputs (via cross-attention) and to previously generated tokens (via causal self-attention).
  • Parameter count: The authors mention in Section 4.2 that their model is "much smaller" than ViLBERT β€” specifically, 6 layers of hidden size 512 with 8 attention heads, versus ViLBERT's 12 layers of size 768 with 12 attention heads. This is a deliberate choice to keep the computational cost manageable while still being competitive.

Training loss. The model is trained to minimize the standard cross-entropy loss between the predicted token distribution and the ground-truth caption tokens:

Lic=βˆ’1Tβˆ‘t=1Tlog⁑P(yt∣y<t,I;ΞΈ)\mathcal{L}_{\text{ic}} = -\frac{1}{T} \sum_{t=1}^{T} \log P(y_t | y_{<t}, \mathbf{I}; \theta)

where $T$ is the caption length in tokens, $y_t$ is the $t$-th ground-truth token, $y_{<t}$ are the preceding tokens, $\mathbf{I}$ represents the image features (the bag of vectors), and $\theta$ represents all trainable model parameters.

What it computes: For each position $t$ in the caption, the model produces a probability distribution over the entire vocabulary given the image and the previously generated tokens. The cross-entropy loss penalizes the model when it assigns low probability to the actual ground-truth token at that position. The average over all $T$ positions gives the per-token loss, which is minimized by gradient descent.

Why this form: Cross-entropy is the maximum-likelihood objective for categorical distributions and is the standard loss for autoregressive sequence generation. The teacher-forcing regime (feeding ground-truth previous tokens rather than model-generated ones during training) makes the loss factorizable and computationally efficient, though it creates a train-test discrepancy (exposure bias) that is addressed during inference via beam search.

Generation at inference. At inference time, the decoder generates captions token by token. Beam search is used with:

  • Beam width = 5
  • Beam search alpha (length normalization parameter) = 0.6
  • Maximum output length = 36 tokens for all datasets except LocNar, which uses 180 tokens (reflecting its much longer captions, averaging 41.8 words)

Why ic over masked language modeling? The paper includes a detailed comparison of pre-training objectives in Appendix D.2. Masked language modeling (mlm) and masked sequence-to-sequence modeling (mass) β€” both of which encode both image and text through a shared Transformer encoder and mask some fraction of text tokens β€” are tested at various masking rates. The key finding is that ic matches or outperforms these masked objectives, particularly at low masking rates, where masked models substantially underperform ic. The authors' explanation (drawing on concurrent analysis work) is that when text masking rates are low, the model learns to rely primarily on the unmasked text context rather than the image to predict the masked tokens β€” essentially, it becomes a language model that ignores the visual input. At very high masking rates (80%), the masked objectives approach ic performance because the model is forced to use the image. Since ic forces image-conditioned generation by design (there is no text context to fall back on), it avoids this failure mode entirely.

Why ic over BERT-style generation? The paper explicitly contrasts its approach with UnifiedVL and similar methods that adapt BERT encoders for generation by iteratively appending mask tokens. The authors argue this approach is "inefficient as the number of passes over the input image is linear in the desired caption length," and that it is "unclear how to incorporate advanced decoding schemes such as beam search, top-k sampling, or nucleus sampling." The Transformer decoder in ic avoids both problems: the image is encoded once, and standard autoregressive decoding techniques apply directly.


Pre-Training Objective 2: Visual-Linguistic Matching (vlm)

For the vision-and-language matching experiments, a different pre-training objective is used that is designed to produce aligned multimodal representations suitable for retrieval tasks.

Architecture. The model uses a dual-encoder design:

  • Image encoder: A Transformer encoder with the same configuration as the ic model's encoder ($L=6$, $E=512$, $H=1024$, $F=4096$, $A=8$). It takes the bag of image feature vectors as input and produces contextualized representations.
  • Text encoder: A separate Transformer encoder with identical configuration. It takes the sequence of text token embeddings as input and produces contextualized representations.
  • Pooling: Mean pooling is applied to the output of each encoder to produce a single fixed-length vector per modality. For the image encoder, this means averaging the output representations of all image feature vectors (global, regions, tags). For the text encoder, it means averaging across all token positions.
  • Fusion: The image vector and text vector are each linearly transformed, and their dot product is computed. This is "late fusion" β€” the two modalities are encoded independently before being compared, rather than being attended to jointly as in early-fusion architectures.

Training loss. The model is trained with a contrastive softmax loss over the mini-batch:

Lvlm=βˆ’1Bβˆ‘i=1Blog⁑exp⁑(s(Ii,Ti)/Ο„)βˆ‘j=1Bexp⁑(s(Ii,Tj)/Ο„)\mathcal{L}_{\text{vlm}} = -\frac{1}{B} \sum_{i=1}^{B} \log \frac{\exp(s(\mathbf{I}_i, \mathbf{T}_i) / \tau)}{\sum_{j=1}^{B} \exp(s(\mathbf{I}_i, \mathbf{T}_j) / \tau)}

where $B$ is the batch size, $\mathbf{I}_i$ and $\mathbf{T}_i$ are the image and text representations for the $i$-th pair in the batch, $s(\cdot, \cdot)$ is the dot-product similarity function, and $\tau$ is a temperature parameter.

What it computes: For each image-text pair in the batch (a positive example β€” the text actually describes the image), the model computes the cosine-like similarity between their vector representations and compares it, via softmax, against the similarities between that image and all other texts in the batch (negative examples). The loss is minimized when the model assigns high probability to the true pairing and low probability to all impostor pairings.

Why this form: The contrastive formulation turns the matching problem into a classification problem over the batch: "which text goes with this image?" This is more scalable than approaches that require explicit negative mining, because the batch itself provides negatives β€” every other text in the batch is treated as a negative for a given image. The dot product followed by softmax is the standard formulation from prior work in V+L matching (the authors cite Lu et al. and Tan and Bansal). Using late fusion (separate encoders) makes the representations individually useful for retrieval: the image encoder can pre-compute representations for a gallery of images, and the text encoder can encode queries on-the-fly, enabling efficient cosine-similarity-based search at query time.

At inference time. For image retrieval, the text encoder produces a query vector, and the image encoder produces vectors for all images in the retrieval pool. Images are ranked by dot-product similarity to the query. This is computationally efficient because image representations can be pre-computed and indexed.


Fine-Tuning Protocols

After pre-training, models are fine-tuned on downstream task data. The fine-tuning procedure is identical regardless of whether pre-training used CC3M or CC12M, ensuring a fair comparison.

Fine-tuning for novel object captioning (nocaps). The pre-trained ic model is fine-tuned on the COCO Captions training set (the train2017 split). The fine-tuning uses the same cross-entropy loss as pre-training, with gradient updates applied to all model parameters. Key hyperparameter ranges (Appendix E.5):

  • Initial learning rate: searched over $\{3.2 \times 10^{-9}, 3.2 \times 10^{-8}, 3.2 \times 10^{-7}\}$
  • Maximum training steps: searched over $\{5000, 10000\}$ β€” the authors note they "also lightly tune the maximum number of training steps as we observe the model overfitting on COCO Captions." The overfitting concern is significant because COCO Captions has only ~100K images, and a model pre-trained on 12M images can easily memorize its narrow distribution if fine-tuned too long.
  • Batch size per TPU core: 128, with 32 cores for a total batch size of 4096.
  • Warm-up: 20 epochs.
  • Learning rate decay: 0.95 every 25 epochs.

The authors observe that varying the number of fine-tuning steps reveals a tradeoff (Table 5): at 5K steps, the model achieves 108.1 CIDEr on COCO val2017 and 87.4 CIDEr on nocaps val; at 10K steps, COCO performance improves to 110.9 CIDEr but nocaps performance drops slightly to 87.1 CIDEr. This suggests that over-fine-tuning on COCO narrows the model's output distribution, improving its fit to COCO's captioning style but reducing its ability to generate diverse captions for out-of-domain images. The implication is that the optimal stopping point for generalization is earlier than the optimal point for in-domain performance.

Fine-tuning for LocNar novel object captioning. For the Localized Narratives experiments, the model is fine-tuned on the LocNar COCO portion (train split, ~130K images) and evaluated on the LocNar Open Images portion (val split, ~40K images). The same ic architecture is used, but the maximum output length is increased to 180 tokens (vs. 36 for nocaps/CC3M) to accommodate LocNar's longer captions (averaging 41.8 words). The fine-tuning hyperparameter search follows the same ranges as nocaps.

Fine-tuning for Conceptual Captions (CC3M) benchmark. The pre-trained ic model (on CC12M) is fine-tuned on the CC3M training split and evaluated on the CC3M dev split. The key observation here is that a model trained on CC12M and evaluated directly on CC3M dev (without fine-tuning) achieves only 39.3 CIDEr β€” dramatically lower than the from-scratch CC3M model's 100.9 CIDEr. This gap indicates that CC12M's raw alt-text captions differ substantially in style from CC3M's hypernymized, cleaned captions, necessitating a fine-tuning step to adapt. After fine-tuning, the CC12M-pre-trained model achieves 105.4 CIDEr on CC3M dev, surpassing the from-scratch model's 100.9.

Fine-tuning for image retrieval. For the matching experiments, the pre-trained vlm model is fine-tuned on Flickr30K (using the standard train/test split: 29K train, 1K val, 1K test) or LocNar Flickr30K (30,546 train, 1,000 test). Both splits use 1,000 images each for validation and testing. The fine-tuning uses the same contrastive loss as pre-training. Key hyperparameter ranges (Appendix E.5):

  • Initial learning rate: searched over $\{3.2 \times 10^{-8}, 3.2 \times 10^{-7}, 3.2 \times 10^{-6}\}$
  • Maximum training steps: fixed at 10,000.
  • Batch size per TPU core: 128 (total 4096).

For zero-shot image retrieval, the pre-trained model is applied "as-is" without any fine-tuning on the target dataset. This is a strict test of how well the pre-training data covers the visual and textual concepts needed for the retrieval task.


Key Design Choices and Their Justifications

Choice 1: Relax filters rather than start from scratch. The authors inherit CC3M's proven pipeline rather than designing a new collection method from scratch. This has several advantages: it ensures comparability (differences between CC3M and CC12M are attributable to the specific relaxing of filters, not to a fundamentally different data source or collection strategy); it leverages the substantial engineering investment in CC3M's pipeline; and it makes the transition from CC3M to CC12M conceptually simple for the community β€” "use the same pipeline but with these specific filters relaxed."

Choice 2: Preserve image-text filtering while relaxing unimodal filters. The image-text filter checks that the Google Cloud Vision API tags for the image have some overlap with the caption text, ensuring that the two modalities are at least somewhat related. This is the one filter that directly addresses the multimodal nature of the data, and preserving it prevents the dataset from being flooded with image-text pairs that have no semantic connection. In contrast, the unimodal filters (text quality heuristics, image aspect ratio) assess each modality independently, and relaxing them trades text fluency and image framing quality for concept coverage β€” a tradeoff the authors argue is favorable for pre-training.

Choice 3: Keep person-name substitution but drop all other text transformations. Person names are substituted with a <PERSON> token for privacy protection, which the authors identify as "necessary to protect the privacy of the individuals in these images." Other transformations β€” hypernymization of organizations and locations, digit substitution, time-span deletion β€” are removed. The justification is that these transformations destroy information that is valuable for learning fine-grained visual associations. A caption mentioning "Chevrolet" teaches the model about a specific car brand; replacing it with "car" teaches a more generic association. The generic association may be sufficient for captioning benchmarks where precision on fine-grained entities is not evaluated, but the specific association is more valuable for building rich visual representations. The removal of person-name hypernymization in favor of <PERSON> substitution is a compromise: privacy is preserved, but the model still learns that a person entity is present in the image (the <PERSON> token is a visual concept in its own right).

Choice 4: Simple ic objective over masked alternatives. The extensive comparison in Appendix D.2 (Table 11) shows that ic is competitive with or superior to masked language modeling and masked sequence-to-sequence modeling, particularly at the low masking rates commonly used in V+L understanding work (10–20%). The authors' explanation β€” that low-masking-rate masked models become overly reliant on text context and ignore images β€” is supported by their data and by concurrent work identifying this as a broader issue in multimodal pre-training. The ic objective avoids this problem by construction: the decoder has no access to the target text during generation, so it must use the image encoder's output.

Choice 5: Late fusion for retrieval, not early fusion. The vlm model uses independent image and text encoders with a dot-product similarity at the end, rather than the cross-attention between modalities that is common in V+L understanding models (e.g., ViLBERT, LXMERT). The authors note that this makes their model "much smaller" and enables efficient retrieval via pre-computed image representations. The tradeoff is that late fusion cannot capture fine-grained cross-modal interactions (e.g., a specific word attending to a specific image region), which may limit performance on tasks requiring detailed grounding. However, for the image retrieval benchmarks considered here, late fusion proves sufficient and competitive.

Choice 6: Rich visual features from multiple sources. The combination of Graph-RISE region features, global image features, geometric coordinates, and Vision API tags provides the model with multiple complementary views of the image. The Graph-RISE features capture visual-semantic information learned from knowledge graphs; the geometric features provide spatial grounding; the Vision API tags provide a direct textual bridge between the visual and language domains. This richness is likely important for learning from noisy web data, where the caption text may only loosely describe the image content β€” having multiple visual signals helps the model identify which aspects of the image are relevant to the text.

4. Key Insights and Innovations

Innovation 1: Reframing V+L Pre-Training Data Collection as a Precision-Recall Tradeoff, Not a Caption-Quality Problem

The paper's most fundamental conceptual move is to decouple the requirements of pre-training data from the requirements of end-task training data, and to argue that the field has been optimizing for the wrong objective. Prior to this work, the dominant assumption β€” embedded in the construction of CC3M and reflected in its widespread adoption β€” was that high-precision, grammatically clean, task-appropriate captions were necessary for effective V+L pre-training. CC3M's pipeline was explicitly designed to produce captions suitable for training image captioning models, with filters and transformations that optimized for caption-quality metrics. The paper's key reframing is that pre-training is not captioning: the goal of pre-training is to build broad visual-linguistic associations across as many concepts as possible, and for this purpose, recall (the fraction of useful image-text pairs retained from the raw web data) matters more than precision (the fraction of retained pairs that are clean, grammatical captions).

This reframing is significant because it inverts the design principle that had governed the most widely used V+L pre-training dataset. CC3M made the natural assumption that cleaner data produces better learning. The paper demonstrates that this assumption is wrong for pre-training β€” at least for the specific difficulty of long-tail concept recognition β€” and that deliberately accepting noisier, less-polished text in exchange for 4Γ— more data and dramatically better coverage of rare concepts yields substantially stronger downstream performance. The precision-recall tradeoff is not new as a concept (it is fundamental to information retrieval and data engineering), but applying it as the organizing principle for V+L pre-training data construction β€” and providing empirical evidence that the optimal operating point for pre-training is further toward the recall end of the spectrum than the field had assumed β€” is this paper's distinctive intellectual contribution.

The evidence for this reframing is most visible in the dataset construction choices (Section 2.2) and their consequences. The decision to drop the preposition requirement, remove capitalization heuristics, eliminate unique-word ratio checks, and strip away hypernymization of organizations and locations β€” all steps that CC3M used to ensure caption quality β€” is a direct operationalization of the precision-for-recall trade. The jellyfish example in Figure 1 makes this concrete: an alt-text consisting of hashtags and noun phrases ("#jellyfish #blue #ocean #pretty Sea Turtle Wallpaper...") fails CC3M's text quality filters but is retained in CC12M because it still provides a valid visual-linguistic association between the image and the concept "jellyfish." This is not an edge case β€” it is the central case for long-tail concepts, where hashtag-style alt-text is common and informative.

Compare this to the dominant approach at the time. ViLBERT, LXMERT, UNITER, VL-BERT, and Oscar all used CC3M as their primary pre-training data source, implicitly accepting its precision-optimized design. The concurrent works that the paper acknowledges (ALIGN, CLIP, WIT, WenLan) independently arrived at similar conclusions about web-scale data, but their focus was on pushing scale to orders of magnitude beyond CC12M (400M to 1.8B pairs) rather than on providing a controlled, A/B-test-style comparison between precision-optimized and recall-optimized versions of the same underlying data source. CC12M's contribution is the controlled experiment: same pipeline architecture, different filter settings, 4Γ— more data, measurably better long-tail coverage. This makes the precision-recall tradeoff visible and quantifiable in a way that the concurrent scale-focused work does not.

The significance of this reframing extends beyond the specific dataset. It suggests that the V+L community should think about pre-training data construction as a design problem with task-specific optimal points, not as a one-size-fits-all cleaning pipeline. Different downstream tasks may benefit from different points on the precision-recall curve. The paper's experiments with LocNar (Table 6) hint at this: the improvement from CC12M over CC3M on LocNar novel object captioning is smaller (+2.9 CIDEr points on OID val, vs. +26.0 on nocaps out-of-domain), which the authors attribute to LocNar's tendency toward "more generic terms" rather than the fine-grained concepts that CC12M excels at capturing. This suggests that the optimal precision-recall tradeoff point is itself task-dependent β€” a finding with practical implications for dataset design that the paper opens up but does not fully explore.

Innovation 2: Demonstrating That Noisy Pre-Training Data Benefits Long-Tail Generalization Disproportionately, Not Uniformly

A superficially similar claim β€” "more data helps" β€” was already well-established in the vision and NLP communities. The paper's more specific and intellectually distinctive finding is that the benefit of scaling up V+L pre-training data is highly non-uniform across the difficulty spectrum: the gains are concentrated overwhelmingly on out-of-domain, long-tail visual concepts, while in-domain performance is relatively stable. This is not the trivial observation that bigger datasets contain more rare concepts. It is the empirical demonstration that the marginal value of an additional pre-training example is much higher for rare concepts than for common ones, which has implications for how pre-training data should be collected, filtered, and scaled.

The evidence for this disproportionate benefit is clearest in the nocaps results (Tables 3 and 4). When moving from CC3M pre-training to CC12M pre-training (both fine-tuned on COCO Captions), the improvement on the nocaps in-domain split is +6.5 CIDEr points (81.8 β†’ 88.3), while the improvement on the out-of-domain split is +26.0 CIDEr points (65.3 β†’ 91.3). The out-of-domain gain is 4Γ— larger than the in-domain gain. On the nocaps test set, the pattern is similar: the CC3M+CC12M model achieves 87.2 CIDEr on in-domain, 87.4 on near-domain, and 87.2 on out-of-domain β€” essentially equal performance across the three difficulty tiers, whereas prior methods show a sharp drop from in-domain to out-of-domain (e.g., VIVO + SCST + CBS: 89.0 in-domain, 87.8 near-domain, 80.1 out-of-domain β€” a gap of nearly 9 CIDEr points). The larger pre-training dataset does not just improve performance; it equalizes performance across domain shifts.

This has a deeper implication for what pre-training actually accomplishes. The standard view of pre-training is that it provides a good initialization that makes fine-tuning more sample-efficient or helps the model converge to a better local optimum. The CC12M results suggest something more specific: pre-training on a diverse, noisy dataset functions as a form of concept-level immunization against distribution shift. The model that has seen thousands of examples of "sumo" (661 in CC12M vs. 1 in CC3M) during pre-training does not just recognize sumo wrestlers better β€” it develops a general capacity to handle novel visual concepts at test time, because the pre-training signal has taught it to attend to fine-grained visual features rather than relying on the coarse category-level distinctions that suffice for in-domain COCO captioning.

This finding connects to a broader literature on long-tail recognition and out-of-distribution generalization, but it makes a specific claim that prior V+L work had not established: that the mechanism driving improved long-tail performance is not better modeling of the tail per se (e.g., re-weighting loss functions or using data augmentation), but rather exposure to a sufficiently diverse pre-training distribution that covers the tail in the first place. The paper's analysis of OOD concept frequency (Table 9, Appendix B.1) quantifies this: CC12M has a median of 3,110 instances per OOD class vs. 462 for CC3M β€” a 6.7Γ— increase. The sub-sampling experiment in Appendix B.2 provides a dose-response curve: 25% of CC12M (3.1M pairs) performs similarly to all of CC3M (3.3M pairs) on both nocaps CIDEr and zero-shot IR recall@1, while 50% and 100% of CC12M show progressively better performance. This suggests that CC12M's advantage is driven by both its larger size and its higher concept density β€” a 3.1M subset of CC12M roughly matches all of 3.3M CC3M, indicating that CC12M's pairs are more informative per-example for long-tail concepts.

This is not an incremental finding. It shifts the conversation from "how do we design models that handle the long tail?" (the dominant framing, leading to methods like constrained beam search, copying mechanisms, and slot-filling templates) to "how do we build pre-training datasets that cover the long tail?" β€” a data-centric rather than model-centric approach to the same problem.

Innovation 3: Establishing Image Captioning (ic) as a Sufficient and Arguably Superior Pre-Training Objective for Vision-to-Language Generation

While not the paper's primary contribution, the systematic comparison of pre-training objectives in Appendix D.2 produces a finding with significant implications for V+L pre-training methodology: the simple image captioning objective, in which the model generates the full caption autoregressively from image features alone, matches or outperforms masked language modeling and masked sequence-to-sequence objectives across multiple masking rates, while avoiding their failure modes. This finding is important because it challenges the BERT-inspired consensus that had come to dominate V+L pre-training.

At the time this paper was written, the overwhelming majority of V+L pre-training work used masked language modeling as the primary (or sole) pre-training objective, following the influence of BERT in NLP and ViLBERT/LXMERT in V+L. The standard approach was to concatenate image region features and text token features, randomly mask some fraction of the text tokens (typically 15–20%), and train the model to predict the masked tokens from the combined context. This had proven effective for V+L understanding tasks like VQA, visual entailment, and referring expression comprehension.

The paper's experiments (Table 11) show that this standard configuration (mlm [.2], corresponding to 20% masking, which the authors note is "widely-used ... in the VLP literature") achieves only 76.8 overall CIDEr on nocaps, compared to 87.4 for the ic objective β€” a 10.6 point gap. Even more tellingly, the gap is largest on out-of-domain performance: 76.2 CIDEr for mlm [.2] vs. 91.3 for ic β€” a 15.1 point gap. As the masking rate increases, masked objectives approach ic performance (mlm [.8] achieves 88.5 overall, slightly ahead of ic's 87.4), but this configuration is essentially turning the task into image-conditioned generation β€” the high masking rate forces the model to rely on the image because the text context is mostly destroyed.

The authors' interpretation β€” that low-masking-rate masked models learn to rely primarily on text context and ignore the image, a form of visual neglect during pre-training β€” is supported by concurrent work they cite (Cao et al., "Behind the Scene: Revealing the Secrets of Pre-trained Vision-and-Language Models," ECCV 2020) and by the well-documented problem of language priors in VQA. The implication is that masked language modeling, as conventionally configured, is a poor pre-training objective for tasks that require the model to actually use visual information to generate outputs β€” which includes image captioning and, by extension, any task where the image must drive the response rather than merely modulate a text-driven prediction.

This finding is not just about architecture choice. It is about the alignment between pre-training objective and downstream task structure. Masked language modeling teaches the model to fill in missing words in a caption given the image and the surrounding text β€” a task that can often be solved using linguistic context alone. Image captioning teaches the model to produce the entire caption from the image β€” a task that forces visual grounding by construction. For downstream generation tasks where the model must produce text from images (captioning, visual storytelling) or where the model must encode images independently of text (retrieval), the ic objective provides better-aligned training signal. For downstream understanding tasks where text is available at inference time and the model must reason about image-text relationships (VQA, entailment), the masked objective's text-conditioning may be more appropriate β€” but this is an empirical question the paper does not fully resolve.

This is an incremental finding (it refines rather than overturns existing practice) and is not the paper's main contribution, but it has practical significance for anyone designing V+L pre-training pipelines: if the goal is generation or retrieval, ic pre-training is at least as good as masked approaches and conceptually simpler, requiring only an encoder-decoder Transformer with a standard cross-entropy loss.

Innovation 4: Identifying Over-Fine-Tuning as a Measurable Phenomenon with Consequences for Out-of-Domain Generalization

A subtle but practically important finding emerges from the fine-tuning step-count experiment reported in Table 5. When the CC12M-pre-trained model is fine-tuned on COCO Captions for 5,000 steps, it achieves 108.1 CIDEr on COCO val2017 and 87.4 CIDEr on nocaps val. Extending fine-tuning to 10,000 steps improves COCO performance to 110.9 CIDEr but reduces nocaps performance to 87.1 CIDEr. The modest degradation (-0.3 CIDEr points) is less striking than the pattern it reveals: the model's in-domain performance and out-of-domain performance move in opposite directions as fine-tuning progresses, which means the optimal stopping point for generalization is earlier than the optimal stopping point for in-domain task performance.

This is a familiar phenomenon in transfer learning (overfitting to the fine-tuning distribution), but the paper's contribution is to quantify it in the specific context of V+L pre-training with noisy web data and to connect it to the precision-recall tradeoff that motivates the dataset itself. The interpretation is that COCO Captions represents a narrow, high-precision captioning distribution (short, clean, human-written captions focused on 80 common object categories), and that extended fine-tuning on this distribution gradually overwrites the broad visual-linguistic knowledge acquired during CC12M pre-training. The model learns to produce captions that better match COCO's style and vocabulary, but at the cost of losing some of its ability to recognize and describe the long-tail concepts that CC12M taught it.

This finding has direct practical implications for practitioners: it suggests that early stopping should be determined by out-of-domain validation performance, not in-domain performance, when generalization is the goal. It also reframes the relationship between pre-training and fine-tuning data as an interference effect rather than a purely additive one β€” the fine-tuning distribution can actively suppress knowledge from the pre-training distribution, not just fail to benefit from it.

The paper does not fully explore this phenomenon (it is reported in a single table with two step-count values), but the finding is conceptually significant because it parallels observations in NLP about catastrophic forgetting during fine-tuning and suggests that the V+L community's standard practice β€” fine-tuning to convergence on the downstream training set β€” may be systematically suboptimal for tasks requiring generalization. This is an incremental but diagnostically useful contribution that opens up questions about fine-tuning protocols (early stopping, multi-task fine-tuning, regularization) that the paper does not pursue but that its data clearly motivate.

5. Experimental Analysis

Evaluation Methodology

  • Dataset. The primary evaluation benchmark is nocaps (Agrawal et al., 2019), a novel object captioning benchmark with 4,500 validation images and 10,600 test images. Images come from Open Images (600+ object classes), while fine-tuning uses COCO Captions (80 classes), creating a deliberate train-test domain shift. Hidden reference captions (10 per image) are used for automatic metric computation. The paper also evaluates on Flickr30K (Plummer et al., 2015) for image retrieval β€” 31,000 images with 5 captions each, split into 29K train, 1K validation, and 1K test following prior work (Lee et al., 2018; Lu et al., 2019). Localized Narratives (Pont-Tuset et al., 2020) provides an additional novel object captioning benchmark using COCO for training (~130K images) and Open Images for evaluation (~40K images), with much longer captions (averaging 41.8 words) than standard datasets. The Conceptual Captions 3M benchmark (Sharma et al., 2018) is used as both a pre-training data source and a downstream captioning task, evaluated on its dev split.

  • Base model. All experiments use a Transformer-based encoder-decoder architecture (Vaswani et al., 2017) for generation tasks, and a dual-encoder Transformer for matching tasks. The configuration is consistent across all conditions: 6 layers, embedding size 512, hidden size 1024, feedforward size 4096, 8 attention heads. This model is described as "much smaller" than ViLBERT (which uses 12 layers of size 768 with 12 attention heads), chosen deliberately to keep computational cost manageable while remaining competitive. The model is trained from scratch for each pre-training condition (no pre-existing weights), with the only variable being the pre-training data source (CC3M, CC12M, or CC3M+CC12M). A Faster R-CNN with ResNet101 backbone (pre-trained on JFT, fine-tuned on ImageNet, detection-trained on Visual Genome) provides frozen region features. Graph-RISE produces visual-semantic embeddings for regions and the global image. Google Cloud Vision API provides up to 16 image tags.

  • Metrics. For image captioning, the paper reports BLEU-1, BLEU-4 (Papineni et al., 2002), ROUGE-L (Lin, 2004), METEOR (Banerjee and Lavie, 2005), CIDEr-D (Vedantam et al., 2015), and SPICE (Anderson et al., 2016). CIDEr is treated as the primary metric for comparisons, consistent with the nocaps benchmark's emphasis. For image retrieval, the paper reports Recall@1 (R1), Recall@5 (R5), and Recall@10 (R10) β€” the fraction of queries for which the correct image appears in the top-K retrieved results. All captioning metrics are computed using the standard coco-caption evaluation code through the nocaps evaluation server. Retrieval metrics are computed on the standard Flickr30K test splits.

  • Baselines. The paper's primary baseline is a model pre-trained on CC3M (Sharma et al., 2018) using the identical architecture and training procedure as the CC12M models, providing a controlled comparison that isolates the effect of pre-training data. For the from-scratch baseline, the model is trained directly on the downstream task data (COCO Captions or Flickr30K) with no pre-training, representing the lower bound of what pre-training adds. On the nocaps benchmark, the paper compares against published results: UpDown (Agrawal et al., 2019) β€” a standard bottom-up top-down attention model with and without constrained beam search (CBS); UpDown + ELMo + CBS; Oscar_L (Li et al., 2020) with and without CBS and self-critical sequence training (SCST); and VIVO (Hu et al., 2020) with and without CBS and SCST. VIVO is a concurrent work that pre-trains directly on Open Images (which nocaps is based on), making it a particularly strong comparison. On the CC3M benchmark, baselines include the FRCNN model from Changpinyo et al. (2019) and TTiC+BIU results from the Conceptual Captions leaderboard. For image retrieval, the from-scratch baseline (trained only on Flickr30K) provides the lower bound, while the zero-shot setting compares against ViLBERT's reported zero-shot performance (Lu et al., 2019).

  • Generation budget / compute accounting. The paper does not explicitly account for compute in terms of FLOPs or training time. Instead, fairness is maintained by holding model architecture, training procedures, and hyperparameter search ranges constant across CC3M and CC12M pre-training conditions. For pre-training, both CC3M and CC12M models are trained for 2M steps for vision-to-language generation (1M steps for vision-and-language matching on CC3M). For fine-tuning, the same hyperparameter search ranges are allocated to both pre-training conditions: initial learning rates searched over {3.2 Γ— 10⁻⁹, 3.2 Γ— 10⁻⁸, 3.2 Γ— 10⁻⁷} for generation and {3.2 Γ— 10⁻⁸, 3.2 Γ— 10⁻⁷, 3.2 Γ— 10⁻⁢} for matching; maximum training steps searched over {5K, 10K} for generation. All experiments use Google Cloud 32-core TPUs with batch size 128 per core (total 4096). The paper explicitly notes that it ensures "similar resources to any two settings that we make a comparison between."

  • Cross-validation / statistical protocol. The paper does not employ cross-validation or report confidence intervals. For nocaps, results are submitted to the official evaluation server, which computes metrics against hidden reference captions. The nocaps benchmark has specific participation rules: models must not use Open Images ground-truth object detection annotations or image-caption data collected via additional annotation protocols. The paper satisfies both requirements (detector trained on Visual Genome; CC3M and CC12M are automatically harvested from web alt-text). For CC3M benchmark evaluation, results on the test split are taken from the official leaderboard. For the CC12M pre-training data, the experimental comparison excludes images that appear in CC3M to prevent overlap from inflating CC12M's apparent benefit. When fine-tuning on COCO Captions, the authors tune the maximum number of training steps because they "observe the model overfitting on COCO Captions" β€” a pragmatic form of early stopping.

Main Quantitative Results

Vision-to-Language Generation: Novel Object Captioning on nocaps

The central result for the paper's primary claim is presented in Table 3, which compares pre-training data sources on the nocaps validation set after fine-tuning on COCO Captions.

Headline result. Fine-tuning a model pre-trained on CC12M with the image captioning objective achieves an overall CIDEr score of 87.4, compared to 73.2 for the CC3M-pre-trained model β€” a gain of +14.2 CIDEr points (Row 5 vs. Row 4). The from-scratch baseline (no pre-training, trained only on COCO Captions) achieves 54.7 CIDEr (Row 1), meaning pre-training on CC12M contributes +32.7 CIDEr points over no pre-training. The best result β€” combining CC3M + CC12M for pre-training β€” achieves an overall CIDEr of 90.2, which the paper reports as state-of-the-art on nocaps val (Row 6, bolded).

Difficulty-dependent gains. The improvement from CC12M over CC3M is highly non-uniform across the nocaps domain splits:

  • In-domain (object classes seen in COCO): 88.3 vs. 81.8 CIDEr (+6.5 points)
  • Near-domain (classes related to COCO classes): 86.0 vs. 73.7 CIDEr (+12.3 points)
  • Out-of-domain (classes entirely absent from COCO): 91.3 vs. 65.3 CIDEr (+26.0 points)

The out-of-domain gain is 4Γ— larger than the in-domain gain and 2.1Γ— larger than the near-domain gain. This is the paper's core empirical finding: CC12M's benefit is concentrated on the hardest, most distribution-shifted examples. On the combined CC3M+CC12M model, the three domain splits achieve remarkably balanced performance: 92.6 in-domain, 88.3 near-domain, and 94.5 out-of-domain CIDEr β€” a spread of only 6.2 points compared to 16.5 points for the CC3M-pre-trained model (81.8, 73.7, 65.3).

Zero-shot performance (no COCO fine-tuning). Without fine-tuning on COCO Captions, both pre-trained models underperform the from-scratch baseline on most metrics (Rows 2–3 vs. Row 1). The CC3M zero-shot model achieves 29.7 overall CIDEr vs. 27.1 for CC12M β€” CC3M is slightly better in this setting, which the paper attributes to CC3M's "data processing and bias toward high-precision captions" being more aligned with the COCO captioning style that automatic metrics reward. This is an important nuance: CC12M's raw alt-text style is poorly matched to the COCO-style reference captions that metrics compare against, making fine-tuning essential to bridge the style gap.

Comparison to state-of-the-art (Table 4). On the nocaps validation set, the CC3M+CC12M model at 90.2 overall CIDEr surpasses all existing methods, including the concurrent VIVO + SCST + CBS at 88.3 CIDEr. The gap is concentrated in out-of-domain performance: 94.5 vs. 87.5 CIDEr (+7.0 points). On the nocaps test set, the CC3M+CC12M model achieves 87.3 overall CIDEr, slightly ahead of VIVO + SCST + CBS at 86.6 CIDEr. Critically, the CC12M-pre-trained models do not use constrained beam search (CBS), which all top prior methods rely on. CBS requires knowing which object classes to constrain toward, which limits its applicability in truly open-world settings. The paper's results demonstrate that data diversity can substitute for algorithmic constraints: "our approach works more robustly across in- and out-of-domain scenarios and is simpler than the state-of-the-art techniques that utilize constrained beam search."

Fine-tuning duration tradeoff (Table 5). The paper reports an important interaction between fine-tuning duration and generalization. At 5,000 fine-tuning steps on COCO Captions, the CC12M-pre-trained model achieves 108.1 CIDEr on COCO val2017 and 87.4 CIDEr on nocaps val. Extending to 10,000 steps improves COCO performance to 110.9 CIDEr (+2.8 points) but reduces nocaps performance to 87.1 CIDEr (βˆ’0.3 points). While the nocaps degradation is small, the pattern β€” in-domain and out-of-domain performance moving in opposite directions β€” is diagnostic of over-fitting to the fine-tuning distribution. The paper interprets this as evidence that "over-fine-tuning on COCO Captions may incur a cost in terms of poor generalization."

Qualitative evidence (Figure 4). The paper provides examples illustrating the mechanism of improvement. In one example, the from-scratch model describes bagpipes as a person "holding a microphone" β€” a hallucination because the model has never seen bagpipes in training. The CC3M-pre-trained model says "playing a musical instrument" β€” correct but generic. The CC12M-pre-trained model says "playing bagpipes" β€” both correct and specific, demonstrating recognition of a long-tail concept that CC3M's filters would have suppressed.

Vision-to-Language Generation: Novel Object Captioning on Localized Narratives (Table 6)

The Localized Narratives benchmark tests a different aspect of generalization: captions are much longer (averaging 41.8 words vs. ~10 for nocaps), and the annotation protocol does not prime annotators to mention specific object classes, resulting in more generic descriptions.

On the LocNar Open Images validation split, CC12M pre-training achieves 38.6 CIDEr, compared to 35.7 for CC3M and 33.8 for the from-scratch baseline. The gain of +2.9 CIDEr points over CC3M is substantially smaller than the +26.0 out-of-domain gain on nocaps. The paper attributes this to two factors: the difficulty of "injecting novel concepts into longer texts" and the tendency of LocNar annotations to use "more generic terms in their annotation ('musical instruments' vs. 'trumpets')," which reduces the value of CC12M's fine-grained concept coverage. On the in-domain LocNar COCO validation split, CC12M achieves 30.0 CIDEr vs. 29.1 for CC3M β€” a similarly modest gain (+0.9 points). This result qualifies the paper's main claim: CC12M's advantage is largest when the evaluation explicitly requires fine-grained, long-tail concept recognition, and diminishes when the task permits or rewards generic descriptions.

Vision-to-Language Generation: Conceptual Captions Benchmark (Table 7)

When fine-tuned on CC3M training data and evaluated on the CC3M dev split, the CC12M-pre-trained model achieves 105.4 CIDEr, surpassing the from-scratch model's 100.9 CIDEr by +4.5 points. This is notable because the from-scratch model is already trained on the target data distribution β€” CC12M pre-training provides additional benefit even when the downstream data is the same as the baseline pre-training data (CC3M).

The paper also reports a diagnostic result: applying the CC12M-pre-trained model directly to the CC3M dev set without fine-tuning yields only 39.3 CIDEr, dramatically lower than the from-scratch model's 100.9. This 61.6-point gap quantifies the style mismatch between CC12M's raw alt-text captions and CC3M's hypernymized, cleaned captions. It underscores that CC12M is useful for pre-training but not as a direct substitute for task-specific data β€” the fine-tuning step is essential to adapt the model's output distribution.

Vision-and-Language Matching: Image Retrieval (Table 8)

The retrieval experiments test whether CC12M pre-training benefits tasks beyond generation. Results are reported for both zero-shot retrieval (no fine-tuning on the target dataset) and standard fine-tuned retrieval on Flickr30K and LocNar Flickr30K.

Zero-shot image retrieval on Flickr30K. This is the strictest test: the pre-trained model is evaluated directly on Flickr30K without seeing any Flickr30K training data. The CC3M-pre-trained model achieves R1 = 35.4, R5 = 65.2, R10 = 76.2. The CC12M-pre-trained model achieves R1 = 42.5 (+7.1 points), R5 = 73.1 (+7.9 points), R10 = 83.4 (+7.2 points). The combined CC3M+CC12M model achieves R1 = 47.1 (+11.7 points over CC3M, +4.6 over CC12M alone). The paper notes that the CC3M zero-shot R1 of 35.4 already outperforms ViLBERT's reported zero-shot R1 of 31.9, despite using a smaller model with late fusion rather than early fusion. The CC3M+CC12M zero-shot result of 47.1 R1 even surpasses the from-scratch model trained on the full Flickr30K training set (43.7 R1) β€” meaning pre-training with no task-specific data at all outperforms supervised training on the target data.

Fine-tuned image retrieval on Flickr30K. After fine-tuning on Flickr30K, the CC3M-pre-trained model achieves R1 = 52.3, R5 = 81.7, R10 = 88.4. The CC12M-pre-trained model achieves R1 = 58.5 (+6.2 points), R5 = 86.6 (+4.9 points), R10 = 92.1 (+3.7 points). The combined CC3M+CC12M model achieves R1 = 61.5 (+9.2 over CC3M, +3.0 over CC12M alone). The from-scratch baseline achieves only 43.7 R1, meaning CC3M+CC12M pre-training contributes +17.8 R1 points over no pre-training.

Fine-tuned image retrieval on LocNar Flickr30K. The LocNar Flickr30K benchmark tests a different caption distribution (longer, more narrative captions). The from-scratch baseline achieves R1 = 54.5. CC3M pre-training improves this to R1 = 61.1 (+6.6). CC12M pre-training achieves R1 = 70.2 (+9.1 over CC3M). The combined CC3M+CC12M model achieves R1 = 71.0 (+9.9 over CC3M). The CC12M gain on LocNar Flickr30K (+9.1 R1) is actually larger in absolute terms than on standard Flickr30K (+6.2 R1), despite the different caption style β€” suggesting that CC12M's diverse pre-training signal benefits retrieval even when the downstream captions are longer and more narrative.

Consistency across settings. Across all retrieval configurations (zero-shot, fine-tuned, standard Flickr30K, LocNar Flickr30K), the pattern is identical: from-scratch < CC3M < CC12M < CC3M+CC12M. The combined dataset always performs best, indicating that the precision of CC3M and the coverage of CC12M are complementary rather than redundant β€” there is value in retaining both. The paper provides qualitative examples in Appendix C (Figure 7), showing cases where CC12M pre-training corrects retrieval rankings, which the authors suspect is "due to the model getting more familiar with the rare words."

Ablation Studies and Robustness Checks

  • Pre-training data subsampling (Figure 6, Appendix B.2): The paper tests whether CC12M's advantage is driven purely by its larger size or also by its higher concept diversity. Models are pre-trained on randomly subsampled versions of CC12M: 25% (3.1M pairs) and 50% (6.2M pairs). On nocaps, the 25% subset achieves similar CIDEr to full CC3M (3.3M pairs), while 50% and 100% show progressively better performance. On zero-shot image retrieval (Flickr30K R1), the same monotonic trend holds: 25% CC12M performs similarly to CC3M, and full CC12M achieves the best result. This dose-response curve demonstrates that both scale and concept density contribute to CC12M's advantage β€” a 3.1M subset of CC12M roughly matches all of 3.3M CC3M, suggesting CC12M pairs are more informative per example.

  • Pre-training on LocNar Open Images instead of CC12M (Table 10, Appendix D.1): To test whether the benefit of CC12M is simply due to using a larger dataset with Open Images visual domain (which nocaps is based on), the paper pre-trains on LocNar Open Images β€” a dataset from the same visual domain as nocaps. The result is 63.9 overall CIDEr on nocaps val, substantially worse than both CC3M (73.2) and CC12M (87.4). The paper attributes this to LocNar's long narrative style being a poor match for COCO/nocaps-style captions, and to its annotation protocol producing "more generic terms" rather than the fine-grained concepts that CC12M's noisy alt-text preserves. This ablation shows that visual domain overlap alone is insufficient β€” text style and concept granularity matter as much or more.

  • Masked pre-training objectives at varying masking rates (Table 11, Appendix D.2.1): The paper compares the ic objective against masked language modeling (mlm) and masked sequence-to-sequence modeling (mass) at four masking rates (0.1, 0.2, 0.4, 0.8). At the standard 0.2 masking rate widely used in V+L pre-training, mlm achieves only 76.8 overall CIDEr vs. 87.4 for ic β€” a 10.6 point gap. At 0.8 masking, mlm achieves 88.5 CIDEr, slightly surpassing ic's 87.4. The pattern is monotonic: higher masking rates produce better downstream performance for both mlm and mass. The paper attributes low-masking-rate underperformance to overreliance on text context (visual neglect). mass consistently outperforms mlm at low masking rates, which the paper attributes to its better alignment between pre-training and fine-tuning (both involve generating consecutive text spans). This ablation justifies the choice of ic as the primary pre-training objective.

  • Multi-task pre-training with auxiliary losses (Table 12, Appendix D.2.2): Adding a visual-linguistic matching (vlm) loss (weighted 0.1) to the main ic loss produces 87.1 overall CIDEr, slightly below ic-only at 87.4 β€” a small degradation. Adding a masked object classification (moc) loss (predicting cluster IDs of masked visual regions, weighted 0.1) produces 89.9 overall CIDEr, a +2.5 point improvement over ic-only. The beneficial effect of moc is notable because it is a purely visual objective that does not require text, suggesting that strengthening visual representations during pre-training helps downstream generation. The negative effect of vlm is more surprising β€” the paper does not elaborate on why adding a matching objective would hurt captioning performance, but it may be that the image-text matching signal encourages representations that are less useful for fine-grained visual description.

  • Out-of-domain concept coverage analysis (Table 9, Figure 5, Appendix B.1): The paper quantifies the coverage of nocaps' 394 out-of-domain classes across eight V+L datasets. CC12M has a median frequency of 3,110 instances per OOD class, compared to 462 for CC3M (6.7Γ— higher), 37 for COCO Captions (84Γ— higher), and 1 for RefCOCOg (3,110Γ— higher). Even after normalizing for dataset size (per 1M instances), CC12M leads at 250.3 instances per OOD class vs. 139.2 for CC3M (1.8Γ— higher). Figure 5 shows the number of OOD classes with at least K instances per 1M captions, as K varies: CC12M dominates at all thresholds, while captioning datasets (solid curves) consistently outperform non-captioning datasets (VQA2, RefCOCOg, NLVR2 β€” dashed curves) in OOD coverage. This analysis establishes that CC12M's long-tail advantage is not merely a consequence of its larger size β€” it has higher OOD concept density even after normalization.

  • CC3M+CC12M combination. Across all experimental settings, the combined dataset always outperforms either dataset alone: nocaps overall CIDEr 90.2 vs. 87.4 (CC12M) and 73.2 (CC3M); zero-shot IR R1 47.1 vs. 42.5 and 35.4; fine-tuned IR R1 61.5 vs. 58.5 and 52.3; LocNar IR R1 71.0 vs. 70.2 and 61.1. This is not strictly an ablation but a robustness check confirming that the two datasets' information content is complementary β€” CC12M's broad coverage and CC3M's precision both contribute to downstream performance, and using both is better than using either alone.

Critical Assessment

The paper's central claim is that CC12M, constructed by relaxing the precision-oriented filters from CC3M, produces a 4Γ— larger and more visually diverse pre-training dataset that yields substantially better downstream performance, particularly on long-tail visual concepts. The experimental evidence supporting this claim is strong but operates within a well-defined scope that imposes several important boundary conditions.

The claim that CC12M substantially improves long-tail recognition is well-supported. The nocaps results (Tables 3 and 4) provide the most direct evidence: the +26.0 CIDEr gain on out-of-domain performance (65.3 β†’ 91.3) from CC3M to CC12M pre-training, with all other factors held constant, is large and unambiguous. The dose-response curve from the subsampling experiment (Appendix B.2, Figure 6) shows that performance improves monotonically with increasing CC12M size, ruling out the possibility that the effect is driven by some idiosyncratic property of the full dataset rather than by scale and diversity. The OOD concept coverage analysis (Table 9, Appendix B.1) provides a plausible mechanism: CC12M contains 6.7Γ— more instances of nocaps out-of-domain classes than CC3M, and this coverage advantage persists even after normalizing for dataset size (1.8Γ— higher density). The qualitative examples (Figure 4) make the mechanism vivid β€” the model transitions from guessing "microphone" (no pre-training) to saying "musical instrument" (CC3M pre-training) to correctly identifying "bagpipes" (CC12M pre-training).

However, the extent to which these gains generalize beyond the specific evaluation setup deserves scrutiny. The nocaps benchmark evaluates on Open Images, and nocaps' out-of-domain classes are explicitly listed (394 classes). The paper's OOD coverage analysis uses this same list of 394 classes as the definition of "long-tail" β€” meaning the evaluation is measuring success on a pre-specified set of rare concepts, not on an open-ended sample from the full long tail of all possible visual concepts. This is a reasonable evaluation choice given nocaps' design, but it means the finding is that CC12M helps with known rare concepts that happen to be represented in Open Images, not necessarily that it helps with any rare concept. The LocNar results (Table 6) provide a partial counterpoint: when the downstream task does not force fine-grained concept naming (LocNar annotations use generic terms), CC12M's advantage shrinks from +26.0 to +2.9 CIDEr points. This is not a weakness of CC12M β€” it makes sense that better concept coverage matters most when concepts are explicitly tested β€” but it qualifies the claim: CC12M's benefits are largest when the downstream task demands fine-grained visual recognition, and more modest when generic descriptions suffice.

The claim that CC12M achieves state-of-the-art results on nocaps is well-supported but requires contextualization. The CC3M+CC12M model's 90.2 CIDEr on nocaps val and 87.3 on nocaps test are indeed the highest reported at the time. The comparison to VIVO (Hu et al., 2020), which pre-trains directly on Open Images (the same visual domain as nocaps) and uses constrained beam search, is particularly informative: CC12M pre-training outperforms VIVO on out-of-domain CIDEr (94.5 vs. 87.5 on val) without using CBS or knowing which object classes to constrain toward. This supports the paper's argument that data diversity can substitute for algorithmic constraints.

The qualification is that the combined CC3M+CC12M model is compared against single models that use only one pre-training dataset. VIVO pre-trains on Open Images; Oscar pre-trains on COCO + VG + CC3M + SBU + etc. The fairest comparison would combine CC12M with the same additional datasets that other methods use, but the paper does not run this experiment. It is possible that adding CC12M to any existing multi-dataset pre-training pipeline would similarly boost performance β€” a hypothesis the paper's data supports but does not test. The state-of-the-art claim is thus relative to published single-model results on the nocaps leaderboard, not relative to an exhaustive combination of all available pre-training data sources.

The claim that pre-training on CC12M benefits image retrieval as well as captioning is well-supported. The retrieval results (Table 8) show consistent and substantial improvements across zero-shot and fine-tuned settings, on both standard Flickr30K and LocNar Flickr30K. The zero-shot result β€” where CC3M+CC12M pre-training with no task-specific data (R1 = 47.1) outperforms supervised training on the full Flickr30K training set (R1 = 43.7) β€” is genuinely striking and unlikely to be an artifact. The consistency of the pattern (from-scratch < CC3M < CC12M < CC3M+CC12M) across four retrieval configurations strengthens confidence that the effect is real.

The claim that noisy web data is "better" for pre-training requires careful interpretation. The paper is careful not to claim that noisy data is universally better β€” the zero-shot captioning results (Table 3, Rows 2–3) show CC3M slightly outperforming CC12M when no fine-tuning is performed, because CC3M's cleaned captions better match the COCO style that automatic metrics reward. The paper also explicitly notes that CC12M requires fine-tuning on clean data to achieve its best results (the 39.3 vs. 105.4 CIDEr on CC3M dev without vs. with fine-tuning). The correct interpretation, which the paper does articulate but could emphasize more strongly, is that CC12M is a superior pre-training dataset but a poor end-task dataset β€” its noise is beneficial for building broad visual-linguistic knowledge but detrimental for producing the style of output that standard benchmarks expect. This is a nuanced finding that the paper's experiments support but that a casual reading might miss.

Genuine weaknesses in the experimental design include:

  • Single visual domain for features. All experiments use the same Graph-RISE features from a Faster R-CNN trained on Visual Genome with a ResNet101 backbone pre-trained on JFT and ImageNet. This feature extraction pipeline is frozen and identical across all conditions, but it means the experiments test CC12M's value specifically for this choice of visual features. A model that learned visual representations end-to-end from pixels (like ViT or CLIP-style approaches that were emerging concurrently) might benefit differently from pre-training data diversity. The paper's architecture choices were standard for the time, but the results are conditioned on this specific visual feature pipeline.

  • Single architecture at a single scale. All experiments use a 6-layer, 512-dimensional Transformer β€” a deliberately small model. The paper notes this relative to ViLBERT and acknowledges the size difference, but does not test whether CC12M's advantage grows, shrinks, or stays constant with model scale. This is a meaningful gap: if CC12M primarily helps by exposing the model to more concepts, larger models might benefit even more (by having greater capacity to store the additional concepts) or might benefit less (by being better at learning from fewer examples). The paper cannot distinguish these possibilities.

  • No text-only or image-only baselines. The paper does not report what performance a text-only model or an image-only model would achieve on the downstream tasks. Such baselines would help separate the contribution of visual knowledge from linguistic knowledge acquired during pre-training β€” for example, does CC12M help nocaps performance because the model learns to recognize mangosteens visually, or because it learns that "mangosteen" is a type of fruit from text context, or both? The paper's emphasis on visual concept coverage implies the former, but the experimental design does not isolate the visual vs. textual contributions.

  • Difficulty estimation is not formally analyzed. The paper uses nocaps' pre-defined domain splits (in-domain, near-domain, out-of-domain) as proxies for difficulty, and the OOD coverage analysis uses nocaps' 394 out-of-domain classes. This is reasonable for the nocaps benchmark, but it does not constitute a general analysis of how pre-training data benefits vary with concept frequency, image complexity, or other difficulty dimensions. The LocNar results hint at task-dependent variation, but the paper does not systematically analyze which concepts benefit most from CC12M pre-training or what properties of a downstream task predict the magnitude of CC12M's benefit. This limits the practical guidance the paper can offer: a practitioner cannot easily predict whether CC12M will help their specific task without running the experiment.

  • The "12M" scale is modest by subsequent standards. The paper acknowledges in a footnote that concurrent work (ALIGN with 1.8B pairs, CLIP with 400M pairs, WIT, WenLan) was exploring much larger scales. CC12M's contribution is the controlled comparison and public release, not absolute scale. However, the experimental results do not address whether the precision-recall tradeoff characterized here would hold at 100M or 1B pairs β€” it is possible that at much larger scales, the additional recall from relaxed filtering becomes redundant because even strict filters leave enough data to cover the long tail. This is not a flaw in the paper (which was submitted before those concurrent works appeared), but it means the findings are most applicable to the 1M–10M pair regime and may not extrapolate indefinitely.

Experiments that would have strengthened the paper:

  • Training a model end-to-end from pixels rather than using frozen Graph-RISE features, to test whether CC12M's text diversity translates to better visual representations at the pixel level, or whether the benefit is primarily in the text-visual mapping layer.
  • A direct comparison to SBU Captions (1M pairs) as a pre-training dataset with intermediate noise levels, to better characterize the precision-recall tradeoff curve rather than just two points (CC3M at high precision, CC12M at high recall).
  • Per-class breakdown of nocaps out-of-domain performance, showing which of the 394 OOD classes benefit most from CC12M pre-training and correlating this with their frequency in CC12M, to provide more mechanistic evidence that increased concept coverage is the causal driver of improved performance.
  • Larger-scale experiments to test whether CC12M's advantage grows or shrinks with model capacity β€” the paper uses a deliberately small model, and the interaction between data scale and model scale is a central question in the scaling laws literature that this paper's setup could address but does not.
  • Statistical significance testing. The nocaps test set has 10,600 images, which provides reasonable statistical power, but the paper reports only point estimates without confidence intervals. Given that some comparisons (e.g., the 87.4 vs. 87.1 CIDEr difference between 5K and 10K fine-tuning steps on nocaps) involve small differences, knowing whether these are statistically reliable would strengthen the conclusions.

6. Limitations and Trade-offs

The Cost of Difficulty Estimation Is Unaccounted for and Dominates Practical Deployment

The paper's headline result β€” that CC12M pre-training yields substantial gains on long-tail visual concepts β€” is demonstrated in a setting where the model is pre-trained once on the full dataset and then fine-tuned. The experiments do not involve any form of difficulty estimation, adaptive allocation, or test-time strategy selection, so this limitation manifests differently than in the compute-optimal scaling paper. However, a closely analogous issue arises with the paper's OOD concept coverage analysis (Appendix B.1) and the fine-tuning step-count tradeoff (Table 5).

The assumption. The paper implicitly assumes that the practitioner knows which downstream tasks will benefit from CC12M pre-training and that the cost of obtaining and pre-training on 12.4M image-text pairs is acceptable. The paper does not model the cost of determining whether CC12M is the right pre-training dataset for a given task, nor does it account for the computational cost of the pre-training itself in the efficiency calculations. Pre-training on CC12M for 2 million steps on 32-core TPUs with batch size 4096 represents a substantial compute investment that the paper does not quantify in FLOPs, GPU-hours, or dollar cost.

The consequence. A practitioner cannot determine from the paper's results whether the +14.2 CIDEr improvement on nocaps justifies the additional pre-training cost relative to CC3M, which also requires pre-training but on a 4Γ— smaller dataset. The paper establishes that CC12M is better than CC3M, but not whether it is cost-effective in an absolute sense β€” particularly for tasks where the long-tail benefit is modest (e.g., the +2.9 CIDEr gain on LocNar OID in Table 6). The subsampling experiment (Figure 6, Appendix B.2) shows that 25% of CC12M (3.1M pairs) performs similarly to full CC3M (3.3M pairs), suggesting that CC12M is more data-efficient per example. However, this analysis does not translate into a cost model: pre-training on 3.1M pairs for a fixed number of steps (2M) is different from pre-training on 12.4M pairs for the same number of steps, and the paper does not report whether the 25% subset was trained for proportionally fewer steps or the same 2M steps.

What evidence exists. The paper provides no FLOP accounting, no wall-clock time measurements, and no cost-effectiveness analysis. The subsampling experiment (Figure 6) is the closest proxy but does not include any measure of compute spent. The fine-tuning step-count experiment (Table 5) demonstrates that over-fine-tuning on COCO Captions degrades out-of-domain performance, but this finding is about avoiding unnecessary fine-tuning rather than about the cost-benefit tradeoff of pre-training itself. The paper also does not discuss the cost of running the Google Cloud Vision API for tag extraction and image-text overlap filtering during dataset construction, nor the cost of the Faster R-CNN + Graph-RISE feature extraction pipeline that must be run on all 12.4M images.

Mitigation status. Not addressed. The paper provides the dataset as a public resource and demonstrates its effectiveness, but makes no claims about cost-effectiveness and does not attempt to model the tradeoff between pre-training data scale and computational budget. A practitioner must run their own cost-benefit analysis. The paper also does not provide pre-trained model checkpoints (only the dataset is released), meaning downstream users must bear the full pre-training cost themselves.


Single Dataset, Single Feature Pipeline, Single Model Scale

All experiments use the nocaps benchmark (with supplementary results on Flickr30K and LocNar), a single frozen visual feature extraction pipeline (Faster R-CNN with ResNet101 backbone trained on Visual Genome, featurized with Graph-RISE, augmented with Google Cloud Vision API tags), and a single model architecture at a single scale (6-layer Transformer, embedding size 512, 8 attention heads). The paper acknowledges that this model is "much smaller" than ViLBERT (Section 4.2), but does not test whether the findings generalize across these dimensions.

The assumption. The paper assumes that the benefit of CC12M over CC3M for long-tail visual concepts is a property of the data rather than an interaction between the data and the specific feature extraction pipeline, model architecture, or model scale. The controlled experimental design (keeping everything constant except the pre-training data source) is appropriate for testing the data effect in isolation, but it cannot distinguish between "CC12M helps this specific model" and "CC12M helps vision-and-language pre-training in general."

The consequence. Several specific failure modes are possible:

  • Feature pipeline dependence. The frozen Graph-RISE features are trained on Visual Genome, which covers roughly 1,500 object classes and 7,000 relation types. If CC12M's long-tail advantage comes primarily from visual concepts outside the Visual Genome ontology, the frozen feature extractor may not be able to represent those concepts well, and the benefit is coming from the text side (the model learning linguistic associations) rather than from improved visual representations. An end-to-end trained model that learns visual features directly from pixels during pre-training might benefit differently β€” possibly more (by learning visual features for the long-tail concepts directly) or less (if the text-side benefit dominates and the feature extractor is already sufficient).

  • Architecture dependence. The encoder-decoder Transformer with a bag-of-regions input may interact with pre-training data differently than architectures that use grid features (e.g., ViT-based approaches), early fusion (e.g., ViLBERT, LXMERT), or different attention mechanisms. The paper's retrieval experiments use a late-fusion dual-encoder design, which the authors note is "much smaller" and simpler than early-fusion alternatives β€” it is possible that the relative benefit of CC12M over CC3M is inflated for retrieval because the simpler architecture depends more heavily on having seen diverse concepts during pre-training, whereas a more expressive early-fusion model might extract more value from the cleaner CC3M data.

  • Model scale dependence. The 6-layer, 512-dimensional Transformer has limited capacity. It is plausible that a larger model (12 layers, 768 dimensions, as in ViLBERT) would benefit more from CC12M because it has greater capacity to store the additional long-tail concepts. Conversely, it is plausible that a larger model would benefit less because it can learn more from each example, making the cleaner CC3M data sufficient. The paper cannot distinguish between these hypotheses. The subsampling experiment (Figure 6) shows a monotonic improvement with dataset size for the small model, but does not show whether this curve shifts with model scale.

What evidence exists. The paper provides no cross-architecture, cross-feature-pipeline, or cross-model-scale experiments. The retrieval experiments use a different architecture (dual-encoder vs. encoder-decoder) and a different pre-training objective (vlm vs. ic) from the generation experiments, and CC12M consistently outperforms CC3M in both settings β€” this provides some evidence that the benefit is not purely an artifact of the generation architecture. The LocNar results (Table 6) and retrieval results (Table 8) show that the benefit persists across different downstream tasks and caption styles, providing some evidence of task-generality. However, these are still within the same feature pipeline and model scale.

Mitigation status. Partially addressed. The paper's framing acknowledges the scope limitation implicitly through its design β€” it is a study of pre-training data, not a study of architectures or features. The supplementary experiments with masked pre-training objectives (Appendix D.2.1), multi-task pre-training (Appendix D.2.2), and LocNar pre-training (Appendix D.1) test alternative training configurations but all within the same architecture and feature pipeline. The paper does not discuss model scale as a variable or suggest that future work should test the interaction.


The Fine-Tuning Step Is Essential, and the Optimal Fine-Tuning Protocol Is Task-Specific and Underexplored

A recurring finding throughout the paper is that CC12M pre-training alone is insufficient β€” the model must be fine-tuned on clean, task-specific data to achieve competitive performance. The paper quantifies this explicitly in several places: the zero-shot CC12M model achieves only 27.1 overall CIDEr on nocaps vs. 87.4 after fine-tuning on COCO Captions (Table 3); the CC12M-pre-trained model applied directly to CC3M dev without fine-tuning achieves 39.3 CIDEr vs. 105.4 after fine-tuning (Table 7). The fine-tuning step-count experiment (Table 5) further shows that the optimal amount of fine-tuning is task-dependent β€” extending fine-tuning improves in-domain COCO performance but degrades out-of-domain nocaps performance.

The assumption. The paper assumes that fine-tuning on the downstream task's training data is always available and that the practitioner can determine the optimal fine-tuning duration. In practice, this means the CC12M approach requires: (1) access to a clean, task-specific training dataset, (2) the ability to run a hyperparameter search over fine-tuning learning rates and step counts, and (3) a validation set that reflects the desired generalization target (since in-domain validation performance and out-of-domain generalization performance can move in opposite directions, as Table 5 demonstrates).

The consequence. The approach is not usable in settings where task-specific training data is unavailable (true zero-shot deployment). The zero-shot captioning results (Table 3, Row 3) show that CC12M pre-training without fine-tuning underperforms a simple from-scratch model trained on COCO Captions β€” the raw CC12M-pre-trained model generates captions in a style so different from COCO reference captions that automatic metrics penalize it heavily. This means CC12M pre-training is not a replacement for task-specific data but rather an augmentation that amplifies its effectiveness β€” a fundamentally different deployment profile from pre-training approaches that aim for strong zero-shot performance (like CLIP, which the paper acknowledges as concurrent work).

The over-fine-tuning phenomenon (Table 5) creates a practical difficulty: the practitioner must monitor both in-domain and out-of-domain validation performance and make a deliberate choice about which to optimize. The paper shows that the gap is modest in this case (87.4 vs. 87.1 CIDEr on nocaps for 5K vs. 10K steps), but does not characterize how this gap varies with the pre-training dataset, the fine-tuning dataset size, or the domain shift magnitude. A practitioner facing a larger domain shift or a smaller fine-tuning dataset might see a much larger gap, making the fine-tuning duration a critical and potentially expensive hyperparameter to tune.

What evidence exists. The paper provides direct evidence of the fine-tuning requirement through the zero-shot vs. fine-tuned comparisons in Table 3 (Rows 2–3 vs. Rows 4–5) and Table 7 (39.3 vs. 105.4 CIDEr). The over-fine-tuning phenomenon is documented in Table 5, though with only two step-count values (5K and 10K) β€” a coarse characterization. The paper does not experiment with fine-tuning dataset size as a variable, so it is unknown whether CC12M's benefit is larger or smaller when fine-tuning data is scarce (e.g., 1K vs. 100K examples).

Mitigation status. The paper acknowledges the fine-tuning requirement implicitly through its experimental design (all headline results use fine-tuning) and explicitly in the text: "This again indicates that the additional processing steps done for CC3M (e.g., hypernimization) result in captions that are different enough from the ones in CC12M to require a fine-tuning step" (Section 4.1, discussing Table 7). However, the paper does not frame this as a limitation or discuss deployment scenarios where fine-tuning data is unavailable. The over-fine-tuning tradeoff is noted but not explored in depth β€” the paper reports the observation and moves on without suggesting mitigation strategies (e.g., multi-task fine-tuning, regularization, or validation protocols).


The Dataset's Noise May Be Beneficial for Pre-Training but Introduces Risks the Paper Only Partially Characterizes

CC12M is constructed by relaxing filters that CC3M used to ensure caption quality, precision, and safety. The paper quantifies the precision drop (76.6% rated 4–5 on a 1–5 quality scale, vs. 90.3% for CC3M) and argues that this tradeoff is favorable for pre-training. However, the paper's characterization of what is in the noisier data β€” beyond the beneficial long-tail concepts β€” is incomplete, and the risks that the noise introduces for downstream models are underexplored.

The assumption. The paper assumes that the primary consequence of relaxing filters is to admit more diverse visual concepts, and that any accompanying increase in harmful or misleading content is adequately addressed by the retained safety filters (pornography detection, person-name substitution for privacy, and the perserved image-text overlap filter). The paper states: "We take the steps in Sect. 2.2 of the main text to mitigate both of these risks by applying the necessary image and text filtering steps and replacing each person name (celebrities' included) with the special <PERSON> token" (Appendix A).

The consequence. Several categories of risk are either unaddressed or only partially addressed:

  • Misaligned image-text pairs. The retained image-text overlap filter (Step 3 of the CC3M pipeline) requires some minimum overlap between Google Cloud Vision API tags and alt-text tokens. However, the paper does not characterize the false positive rate of this filter β€” how many pairs pass the filter despite the text being unrelated or only tangentially related to the image? With 12.4M pairs and a precision of 76.6%, roughly 2.9 million pairs (23.4%) have captions rated below 4 on the 1–5 quality scale by human annotators. Some of these may be benignly noisy (vague or incomplete descriptions), but some may be actively misleading (text that describes something not present in the image). Pre-training on misaligned pairs could teach the model spurious associations β€” for example, learning that images of a certain visual texture are associated with a brand name that appears in the alt-text for unrelated reasons.

  • Hateful, toxic, or biased content. The paper performs a "preliminary study" of biases related to gender, age, race, and ethnicity by examining co-occurrence patterns of sensitive terms and checking web domain distributions (Section 2.3). The authors report "no large biases in the distribution of these terms, either in terms of co-occurrence between sensitive term pairs or with other tokens" and that the domain distribution is "diverse and long-tail." However, this analysis is explicitly described as "preliminary" and is limited to a small set of pre-selected sensitive terms. It does not examine whether the dataset contains hate speech, racial slurs, or other toxic content in the alt-text; whether the images themselves contain offensive or stereotyped depictions that the text analysis would miss; or whether the model trained on CC12M reproduces or amplifies any biases present in the data. The paper's Broader Impact statement (Appendix A) acknowledges that "datasets curated from the Web could come with risks such as unsuitable content (adult content, profanity) and unintended privacy leakage," but the only mitigations described are the same image and text filters inherited from CC3M β€” which the paper has relaxed relative to CC3M.

  • Memorization and privacy. The paper addresses person-name privacy by substituting all PERSON entities with a <PERSON> token, covering approximately 25% of alt-texts. However, the removal of hypernymization for organizations and locations means that company names, brand names, and specific place names remain in the dataset. If images contain personally identifiable information (license plates, addresses, faces of non-public figures whose names do not trigger the PERSON entity detector), the dataset provides no protection beyond what the initial web crawl captured. The paper does not assess whether models trained on CC12M can memorize and regurgitate specific alt-texts or image-text pairs, a privacy concern that was actively studied in language models at the time (Carlini et al., 2019, 2020, cited in the paper's references).

What evidence exists. The paper provides: (1) a precision estimate based on 100 human-annotated examples (Section 2.3), (2) a word cloud comparison of top tokens in CC3M vs. CC12M (Figure 2), (3) a list of long-tail concept frequency increases (Section 2.3), (4) a preliminary bias analysis of sensitive term co-occurrence and web domain distribution (Section 2.3 and Table 1), and (5) the Broader Impact statement (Appendix A) which acknowledges risks in general terms. The paper does not: measure the rate of factually incorrect or misleading captions in CC12M; benchmark a CC12M-trained model on bias or toxicity evaluation datasets; test for memorization of training data; or compare the bias/safety properties of CC12M-trained models to CC3M-trained models.

Mitigation status. Partially addressed. The paper retains the core safety filters from CC3M (pornography detection, minimum image size, JPEG-only) and adds person-name substitution. The preliminary bias analysis and Broader Impact statement show awareness of the risks. However, the mitigation is incomplete β€” the risks introduced by relaxing text quality filters are not specifically assessed, and the paper does not provide guidance to downstream users about how to evaluate or mitigate bias, toxicity, or privacy risks in models trained on CC12M. The public release of the dataset (a stated contribution) means these risks are shared with all downstream users, not just the paper's authors.


The Evaluation Regime Rewards COCO-Style Captioning and May Understate the Benefit for Truly Open-World Description

The paper's primary evaluation benchmark, nocaps, uses hidden reference captions collected from human annotators who were shown COCO-style captions as examples and asked to describe images from Open Images. While nocaps explicitly tests generalization to novel object classes, the style of the reference captions β€” short, single-sentence, focused on salient objects β€” remains heavily influenced by the COCO captioning paradigm. The paper's supplementary LocNar experiments (Table 6) test a different caption style (longer, narrative captions averaging 41.8 words), but the evaluation metrics still compare against human-written reference captions collected under specific annotation protocols.

The assumption. The paper assumes that improvement on nocaps CIDEr (and related automatic metrics) reflects genuine improvement in the model's ability to describe images with long-tail visual concepts. While this is partially true β€” the examples in Figure 4 convincingly show better concept naming β€” the evaluation does not capture whether the model's improvements generalize to captioning styles, lengths, or detail levels that differ from the COCO paradigm that all evaluation datasets inherit.

The consequence. The following failure modes are possible but undetected by the evaluation:

  • Style overfitting to COCO. The model pre-trained on CC12M and fine-tuned on COCO Captions learns to produce COCO-style captions (short, single-sentence, focused on one or two salient objects or actions). The paper shows that CC12M pre-training helps the model name more specific objects within this style ("bagpipes" instead of "musical instrument"), but it does not test whether the model can produce longer, more detailed descriptions that would be useful for real-world applications like assistive technology for the visually impaired. The LocNar experiments (Table 6) partially address this, but the gain from CC12M over CC3M on LocNar is much smaller (+2.9 CIDEr on OID val), suggesting that CC12M's benefit does not straightforwardly transfer to longer-form captioning.

  • Metric bias toward n-gram overlap. CIDEr, BLEU, ROUGE, and METEOR all reward n-gram overlap with reference captions. If CC12M-pre-trained models produce captions that use more specific vocabulary (more "bagpipes," fewer "musical instrument"), they score higher on these metrics when the reference captions also use specific vocabulary. However, in open-world settings, there may be multiple valid descriptions at different levels of specificity β€” a model that says "sumo wrestlers" and a model that says "two athletes competing in a traditional Japanese sport" might both be correct, but the metrics will reward whichever one matches the reference more closely. The paper's finding that zero-shot CC12M underperforms zero-shot CC3M on nocaps (27.1 vs. 29.7 CIDEr, Table 3) is attributed to style mismatch, but this very phenomenon means that the metrics may systematically penalize models that produce valid but stylistically different captions β€” potentially understating CC12M's true benefit in open-world settings.

  • No human evaluation. The paper relies entirely on automatic metrics. While this is standard practice for the nocaps benchmark, it means there is no direct evidence that human judges prefer CC12M-trained model outputs. The paper's qualitative examples (Figure 4, Figure 7) are cherry-picked positives. A human evaluation study β€” even a small one β€” would substantially strengthen the claim that the CIDEr improvements reflect genuine quality improvements rather than metric-specific artifacts.

What evidence exists. The paper acknowledges the style mismatch issue explicitly in discussing the zero-shot results (Section 4.1): "which is indicative of the need for the model to learn the COCO captioning style, to which the existing automatic metrics are quite sensitive." However, this acknowledgment is used to explain away a negative result (zero-shot CC12M < zero-shot CC3M) rather than to critically examine the evaluation regime's limitations. The LocNar experiments (Table 6) provide a partial robustness check with a different caption style, but the results show a much smaller CC12M benefit, which could indicate either that CC12M genuinely helps less for longer captions or that the evaluation (still automatic metrics) fails to capture CC12M's improvements in this setting.

Mitigation status. Not addressed. The paper does not conduct human evaluation, does not analyze per-example metric behavior to identify cases where automatic metrics may be misleading, and does not discuss the limitations of COCO-style evaluation for measuring long-tail concept recognition in the wild. The paper accepts the nocaps evaluation protocol as given and reports results within that framework, which is reasonable for a benchmark paper but limits the strength of the conclusions that can be drawn about open-world captioning quality.


The Paper Does Not Isolate Whether the Benefit Comes from Visual Learning or Textual Learning

The paper frames CC12M's advantage as enabling better visual recognition of long-tail concepts β€” the introduction emphasizes that the dataset helps with "recognizing long-tail visual concepts" and the examples highlight visual recognition (sumo, mangosteen, jellyfish, bagpipes). However, the experimental design does not isolate whether the improvement comes from the model learning to visually recognize these concepts during pre-training, or from the model learning linguistic associations from the alt-text that help it name concepts it could already visually recognize but did not have the vocabulary for.

The assumption. The paper implicitly assumes that the pre-training data provides a visual grounding signal β€” that seeing images paired with the word "mangosteen" teaches the model what a mangosteen looks like. The feature extraction pipeline, which freezes visual features from a detector trained on Visual Genome, complicates this assumption: if the frozen features already contain sufficient visual information to distinguish a mangosteen from other round purple fruits, then CC12M's contribution is primarily in teaching the model to name the visual pattern "mangosteen" rather than in teaching it to see the visual pattern. Conversely, if Visual Genome does not contain mangosteens (it likely does not, given its COCO-based ontology), the frozen features may not capture the visual distinctiveness of mangosteens, and the model is learning a textual association between the word "mangosteen" and whatever visual features happen to co-occur with it β€” which may be spurious.

The consequence. If the benefit is primarily textual (learning that "mangosteen" is a type of fruit and that images with certain visual patterns tend to have "mangosteen" in their alt-text), then:

  • The model may not genuinely recognize mangosteens in images that lack strongly associated visual context β€” it might rely on correlated features (e.g., tropical foliage, market settings) rather than the mangosteen's visual appearance.
  • The benefit may not transfer to models with different visual feature extractors β€” if the frozen Graph-RISE features are a key enabler, switching to a different visual backbone could reduce or eliminate the CC12M advantage.
  • The model may be learning spurious correlations between words and visual features that happen to co-occur in web data but do not reflect genuine visual recognition β€” for example, learning that "pokemon" is associated with certain cartoon-like visual styles rather than with the specific visual features of Pokemon characters.

The paper's emphasis on visual concept recognition is thus stronger than the experimental design can fully justify β€” the experiments demonstrate that CC12M pre-training improves concept naming in captions, but they do not isolate the visual recognition component from the linguistic knowledge component.

What evidence exists. The paper provides no experiments that separate visual from textual contributions. Possible experiments that would have addressed this include: (1) testing the model on a purely visual task (e.g., object classification on the long-tail concepts) to see if visual recognition improves; (2) comparing CC12M pre-training against a text-only baseline that sees the same captions but no images, to estimate the textual contribution; (3) analyzing whether the benefit is concentrated on concepts where the frozen visual features are known to be informative vs. concepts where they are not; (4) training with a different visual backbone to test robustness of the finding. None of these are performed.

Mitigation status. Not addressed. The paper's framing consistently emphasizes visual concept recognition without acknowledging this ambiguity. The analysis of OOD concept coverage (Appendix B.1) counts text occurrences of concept words, which reflects textual exposure rather than visual learning. The qualitative examples (Figure 4) are suggestive but do not constitute evidence that the visual representations themselves have improved β€” the model could be correctly naming "bagpipes" because it learned the word from CC12M text and the frozen visual features already distinguished bagpipes from other objects, with CC12M merely providing the text-to-visual-feature mapping.

This limitation interacts with the feature pipeline limitation discussed above: because all experiments use the same frozen visual features, the paper cannot determine whether CC12M pre-training improves visual representations, textual representations, or the mapping between them. For practitioners building end-to-end trained systems, this ambiguity matters β€” if CC12M primarily helps the text side, then investing in better language model pre-training data might be more cost-effective than investing in larger image-text datasets.

7. Implications and Future Directions

How This Work Changes the Landscape

This paper shifts the conversation around vision-and-language pre-training from a model-centric enterprise to a data-centric one, but with a specific and falsifiable claim that distinguishes it from generic "more data is better" arguments. The core reframing is: the construction of V+L pre-training datasets should be optimized for recall and visual concept diversity, not for caption-level precision, because the requirements of pre-training β€” building broad multimodal associations β€” differ fundamentally from the requirements of end-task training. This reframing challenges the default assumption, inherited from supervised learning on clean benchmarks and embedded in the design of CC3M, that cleaner data always produces better models.

The conceptual shift is best characterized as a diagnostic contribution with a design principle attached. The diagnostic is that CC3M, the most widely used V+L pre-training dataset at the time, was systematically optimized for the wrong objective β€” caption quality rather than concept coverage β€” and that this optimization created a bottleneck for long-tail generalization. The design principle is that pre-training data pipelines should be deliberately tuned toward the recall end of the precision-recall tradeoff, accepting noisier text in exchange for broader visual concept coverage. This is not a paradigm-shifting insight on the order of "attention is all you need" or "pre-training works," but it is more than an incremental refinement β€” it is a re-orientation of how the community thinks about dataset construction for multimodal pre-training, backed by a clean controlled experiment (same pipeline, different filter settings) that makes the tradeoff visible and quantifiable.

The paper's reconciliation of prior contradictory tendencies in the literature deserves explicit recognition. On one side, the V+L community had embraced CC3M as a pre-training mainstay, implicitly accepting its precision-oriented design as appropriate for all purposes. On the other side, the broader vision and NLP communities had demonstrated massive gains from scaling up noisy, weakly-labeled data (JFT-300M, Instagram pre-training, Common Crawl, C4). The tension between these two positions β€” "clean data is necessary for V+L" vs. "scale matters more than cleanliness" β€” was unresolved. This paper provides a resolution that is more nuanced than either pole: cleanliness matters for end-task style matching, but scale and diversity matter more for pre-training concept coverage, and the two are complementary rather than competing. The finding that combining CC3M (clean, precise) and CC12M (noisy, diverse) outperforms either alone β€” consistently, across every experimental setting β€” is the empirical signature of this complementarity. It suggests that the optimal pre-training data mixture is not a single point on the precision-recall curve but a portfolio that includes both high-precision and high-recall sources.

The work makes certain research directions more attractive and others less so:

More attractive:

  • Data-centric pre-training research. The paper's demonstration that relaxing filters yields +14.2 CIDEr points on nocaps out-of-domain performance, with no change to model architecture or training procedure, strongly suggests that data engineering is a high-leverage activity for V+L pre-training β€” potentially higher-leverage than architectural innovations, at least at the scale regimes tested. This encourages systematic studies of how different data filtering strategies, text transformations, and dataset mixtures affect downstream generalization.
  • Long-tail recognition through pre-training data rather than algorithmic constraints. The paper shows that CC12M pre-training achieves state-of-the-art nocaps performance without constrained beam search, copying mechanisms, or slot-filling templates β€” methods that prior work (UpDown + ELMo + CBS, Neural Baby Talk, VIVO + CBS) relied on heavily. The implication is that data diversity can substitute for algorithmic complexity in addressing the long-tail problem, which is a simpler and more scalable solution.
  • Controlled comparisons of pre-training data sources. The paper's methodology β€” keep architecture, training procedure, and fine-tuning protocol constant while varying only the pre-training data source, with a subset experiment to characterize the dose-response curve β€” provides a template for how the community should evaluate future pre-training datasets. This kind of controlled experiment was rare in V+L research at the time but became more common subsequently.

Less attractive:

  • Heavy reliance on COCO-centric pre-training. The paper's analysis of OOD concept coverage (Appendix B.1) demonstrates that COCO, Visual Genome, VQA2, and other COCO-based datasets have dramatically worse long-tail coverage than web-sourced data, even after normalizing for dataset size. This weakens the case for pre-training on these datasets as a primary source of visual knowledge, though they remain valuable for other purposes (region-level grounding, question-answer supervision).
  • Masked language modeling with low masking rates for generation tasks. The extensive comparison in Appendix D.2.1 shows that the standard configuration of masked language modeling (15–20% masking), widely used in V+L understanding work, substantially underperforms the simple image captioning objective for downstream generation. This finding, combined with concurrent work on visual neglect in multimodal models, suggests that low-masking-rate MLM is a poor choice when the downstream task requires the model to actually use visual information to generate outputs.
  • Constrained beam search as the primary solution for novel object captioning. The paper's results demonstrate that broad pre-training on noisy web data achieves competitive or superior out-of-domain performance without CBS, which requires knowing the target object classes in advance. This reduces the appeal of CBS-based approaches for truly open-world settings where the set of possible novel objects is unknown or unbounded.

Follow-Up Research This Work Enables

Cheap difficulty estimation for pre-training data β€” predicting which examples are most valuable for long-tail learning. The paper demonstrates that CC12M's benefit is concentrated on out-of-domain visual concepts (the +26.0 CIDEr gain on nocaps out-of-domain vs. +6.5 on in-domain), but it does not characterize which specific examples in CC12M drive this improvement. A natural follow-up would train a lightweight model to predict, given only the alt-text (or a combination of alt-text and image features), how much a particular image-text pair will improve long-tail concept recognition in a downstream pre-trained model. This is analogous to data valuation or influence function approaches, but applied to the pre-training regime where the "downstream task" may not be known in advance. The paper makes this newly tractable because it provides a controlled setting (CC3M vs. CC12M, with precisely known filter differences) where the marginal contribution of the relaxed-filter examples can be isolated β€” examples that pass CC12M's relaxed filters but would have been excluded by CC3M's stricter ones. A strong follow-up would: (1) identify which relaxed-filter examples correlate most strongly with improvements on specific nocaps out-of-domain classes, (2) build a predictor of example "value" that generalizes to unseen concepts, and (3) test whether a targeted dataset constructed from high-value examples outperforms a random sample of the same size, potentially enabling more compute-efficient pre-training by focusing the data budget on the most informative examples.

Characterizing the interaction between pre-training data diversity and model scale β€” does CC12M's advantage grow, shrink, or stay constant with larger models? The paper uses a deliberately small model (6 layers, 512 dimensions) and acknowledges that it is "much smaller" than ViLBERT. The subsampling experiment (Figure 6) shows that performance improves monotonically with dataset size for this model size, but it is unknown whether this curve shifts with model capacity. A strong follow-up would replicate the CC3M vs. CC12M comparison at multiple model scales (e.g., 50M, 200M, 1B parameters) and on multiple downstream tasks, measuring whether the absolute gain from CC12M increases (larger models can absorb more diverse concepts), decreases (larger models extract more value from cleaner data), or stays constant. This experiment would connect the paper's findings to the emerging literature on scaling laws for multimodal models, providing the first evidence on whether data diversity and model capacity are complements or substitutes in V+L pre-training. The paper's public release of CC12M and the controlled comparison methodology make this experiment straightforward for any group with sufficient compute.

End-to-end trained visual representations β€” testing whether CC12M's text diversity translates to better visual features when learned jointly. All experiments in the paper use frozen visual features from a Faster R-CNN trained on Visual Genome. A critical open question is whether CC12M pre-training with an end-to-end architecture (where visual features are learned from pixels jointly with the text-visual mapping, as in CLIP, ALIGN, or ViT-based captioning models) would produce visual representations that are genuinely better at recognizing long-tail concepts β€” as opposed to the current setup, where the frozen features may already contain the necessary visual information and CC12M primarily teaches the text-to-visual-feature mapping. A strong follow-up would: (1) train a ViT-based captioning model from scratch on CC12M vs. CC3M, using pixel inputs rather than frozen region features, (2) evaluate the learned visual encoder on a long-tail object classification task (e.g., zero-shot classification on the nocaps out-of-domain classes using the visual encoder's representations directly), and (3) compare the improvement in visual recognition accuracy to the improvement in caption naming accuracy. If CC12M pre-training improves visual recognition, that would validate the paper's implicit claim about visual concept learning; if it only improves naming, that would reframe CC12M's benefit as primarily linguistic, with important implications for how the community thinks about multimodal pre-training data.

The precision-recall tradeoff curve β€” mapping the full continuum between CC3M and CC12M, and beyond. The paper compares two points on the precision-recall curve: CC3M (high precision, 90.3% quality, 3.3M pairs) and CC12M (lower precision, 76.6% quality, 12.4M pairs). This leaves open the question of where the optimal operating point lies. Is CC12M already past the point of diminishing returns, where further relaxing of filters would add mostly noise? Or would an even higher-recall, lower-precision dataset (e.g., 50M pairs with 50% precision) yield even better pre-training? A strong follow-up would construct a family of datasets at multiple points on the precision-recall curve (by systematically varying filter thresholds in the CC3M/CC12M pipeline), pre-train models on each, and map the resulting downstream performance as a function of both dataset size and precision. The dose-response experiment in Appendix B.2 (25%, 50%, 100% of CC12M) is a step in this direction but confounds size and precision β€” the subsampled datasets have the same precision as full CC12M, just fewer examples. A clean separation of the two variables would provide a design curve for future dataset construction efforts, answering the question: "given a fixed annotation budget, should we collect fewer high-quality pairs or more lower-quality pairs?"

Negative result that would refine understanding β€” testing whether CC12M's benefit survives adversarial distribution shift. The paper evaluates on nocaps, where the domain shift from COCO to Open Images is known and the out-of-domain classes are a predefined set. This is a structured distribution shift, not an adversarial one. A stress-test follow-up would evaluate CC12M-pre-trained models on a challenge set specifically constructed to break models that rely on superficial text-image correlations rather than genuine visual recognition β€” for example, images of rare concepts in atypical contexts (a mangosteen on a desk rather than in a market), or images where the visual appearance conflicts with the typical textual context (a fruit that looks like a mangosteen but is labeled with a different rare fruit name). If CC12M-pre-trained models fail on such examples despite their strong nocaps performance, that would indicate that the benefit is partly driven by learning textual co-occurrence patterns ("mangosteen" tends to appear near "tropical" and "fruit") rather than robust visual recognition, narrowing the paper's claims about visual concept learning. Conversely, if they succeed, that would strengthen the visual grounding interpretation.

Scaling CC12M-style data collection to video, audio, or other modalities with natural weak supervision. The paper's insight β€” that relaxing precision-oriented filters yields a higher-recall dataset that improves long-tail concept recognition β€” is modality-agnostic. Web video with ASR transcripts, audio with metadata, or 3D models with textual descriptions all present similar precision-recall tradeoffs in their data collection pipelines. A strong follow-up would adapt the CC12M filtering philosophy to video-text pre-training, testing whether relaxing transcript quality filters (e.g., accepting noisier ASR output, dropping requirements for grammatical completeness) yields a larger, more diverse dataset that improves long-tail action or object recognition in video understanding benchmarks. The paper provides both the conceptual framework (precision-for-recall) and the methodology (controlled filter relaxation with downstream evaluation) to make this extension straightforward.

Practical Applications and Downstream Use Cases

Accessible image captioning for the visually impaired with better long-tail recognition. Assistive technology applications β€” where a user points their phone at an object and asks "what is this?" β€” routinely encounter objects outside the COCO vocabulary. A model pre-trained on CC12M and fine-tuned on COCO is far more likely to correctly identify a sumo wrestler, a mangosteen, or a pair of bagpipes than a model trained on COCO alone or pre-trained on CC3M. The paper's results quantify this: the CC12M-pre-trained model achieves 91.3 CIDEr on nocaps out-of-domain images vs. 34.1 for a from-scratch COCO model β€” a nearly 3Γ— improvement in the metric most correlated with contentful, specific descriptions. The qualitative examples (Figure 4) make the practical benefit vivid: the from-scratch model hallucinates "microphone" for bagpipes (a potentially confusing error for a visually impaired user), while the CC12M-pre-trained model correctly identifies the instrument. The model's ability to name concepts like "sumo wrestlers" rather than defaulting to "men" or "people" provides the kind of specific, informative description that makes assistive technology genuinely useful rather than merely functional.

Content moderation and visual search at scale, where the long tail of concepts matters disproportionately. In content moderation, harmful or policy-violating content often involves rare visual concepts that are poorly covered by standard pre-training datasets β€” specific symbols, objects in unusual contexts, or niche products. A model pre-trained on CC12M will have seen orders of magnitude more diverse visual concepts (e.g., 8615 instances of "pokemon" in CC12M vs. 1 in CC3M), making it more likely to recognize novel problematic content rather than defaulting to the nearest common concept. Similarly, in visual search (e.g., e-commerce, stock photography), users frequently query for specific, long-tail items β€” a particular model of car ("chevrolet" appears 12,181 times in CC12M vs. 1 time in CC3M), a specific dish ("quiche" 1109 vs. 50), or a particular location ("zanzibar" 1138 vs. 0). The paper's retrieval results (Table 8) demonstrate that CC12M pre-training improves zero-shot image retrieval recall@1 by +7.1 percentage points over CC3M (42.5 vs. 35.4) and by +11.7 points when combined with CC3M (47.1) β€” improvements that translate directly to more relevant search results for long-tail queries without requiring task-specific training data.

Cost-efficient pre-training for organizations that cannot afford 400M-pair datasets. The concurrent work the paper acknowledges (CLIP at 400M pairs, ALIGN at 1.8B pairs) operates at scales that are infeasible for most academic and many industrial research groups. CC12M, at 12.4M publicly available image-text pairs, provides a middle ground: large enough to substantially improve long-tail recognition over CC3M (as the paper demonstrates), but small enough to be pre-trained on with modest computational resources. The subsampling experiment (Figure 6) shows that even 25% of CC12M (3.1M pairs) performs similarly to the full 3.3M-pair CC3M on nocaps CIDEr and zero-shot IR, while 50% and 100% yield additional gains. This means that practitioners with limited compute can still benefit by pre-training on a subset of CC12M, getting CC3M-equivalent long-tail coverage at similar data scale but with a public, freely available dataset that they can further scale up as resources permit. The paper's demonstration that CC12M's per-example informativeness for long-tail concepts is higher than CC3M's (3.1M CC12M pairs β‰ˆ 3.3M CC3M pairs) means that switching to CC12M is strictly beneficial at any scale the practitioner can afford.

When to Prefer This Method

The paper does not frame CC12M as a "method" that competes against named alternatives in a way that maps cleanly onto a decision rule. CC12M is a dataset resource, and its demonstrated use case β€” pre-training on CC12M followed by fine-tuning on task-specific data β€” is evaluated against pre-training on CC3M and against no pre-training (from-scratch). The relevant tradeoff is therefore about when to use CC12M (or its underlying design principle of recall-optimized data collection) rather than, or in addition to, clean, precision-optimized pre-training data. The paper's results support the following guidance:

  • Prefer pre-training on CC12M (or similarly recall-optimized data) when the target task requires recognizing long-tail or out-of-domain visual concepts that are poorly covered by COCO, Visual Genome, or CC3M. The paper's nocaps results show +26.0 CIDEr out-of-domain improvement over CC3M, with the gain directly attributable to CC12M's 6.7Γ— higher median frequency of OOD concepts. The dose-response curve (Figure 6) indicates that even partial use of CC12M (25% subset) matches CC3M's long-tail coverage, while the full dataset yields substantially more benefit.

  • Prefer combining CC12M with CC3M (or another clean, stylistically appropriate dataset) when the downstream evaluation uses automatic metrics that are sensitive to caption style and vocabulary distribution. Across all experimental settings β€” nocaps CIDEr, zero-shot IR recall, fine-tuned IR recall β€” CC3M+CC12M outperforms either dataset alone. The paper's finding that zero-shot CC12M captions score poorly on CC3M-style metrics (39.3 CIDEr vs. 100.9 for CC3M-trained, Table 7) indicates that CC12M's raw alt-text style is a poor match for benchmark reference captions without a fine-tuning step, and combining it with CC3M (which provides style-aligned pre-training signal) mitigates this. If style-aligned pre-training data is available, include it alongside CC12M rather than replacing it entirely.

  • Do not use CC12M as a direct substitute for fine-tuning data β€” the zero-shot captioning results (27.1 CIDEr on nocaps vs. 54.7 for from-scratch COCO training and 87.4 for fine-tuned CC12M) demonstrate that CC12M pre-training without task-specific fine-tuning underperforms even a simple from-scratch model trained on the downstream task. CC12M is a pre-training resource, not a task dataset, and its benefit is realized through the pre-training-then-fine-tuning paradigm, not through direct application.