mlsanityData to 7 Oct 2026

Linking Representations with Multimodal Contrastive Learning

arXiv 2304.03464 ↗First posted 7 Apr 2023cs.CV cs.CL econ.GNcited by 1

Not on the map. Why?

Abstract (arXiv)

Many applications require linking individuals, firms, or locations across datasets. Most widely used methods, especially in social science, do not employ deep learning, with record linkage commonly approached using string matching techniques. Moreover, existing methods do not exploit the inherently multimodal nature of documents. In historical record linkage applications, documents are typically noisily transcribed by optical character recognition (OCR). Linkage with just OCR'ed texts may fail due to noise, whereas linkage with just image crops may also fail because vision models lack language understanding (e.g., of abbreviations or other different ways of writing firm names). To leverage multimodal learning, this study develops CLIPPINGS (Contrastively LInking Pooled Pre-trained Embeddings). CLIPPINGS aligns symmetric vision and language bi-encoders, through contrastive language-image pre-training on document images and their corresponding OCR'ed texts. It then contrastively learns a metric space where the pooled image-text embedding for a given instance is close to embeddings in the same class (e.g., the same firm or location) and distant from embeddings of a different class. Data are linked by treating linkage as a nearest neighbor retrieval problem with the multimodal embeddings. CLIPPINGS outperforms widely used string matching methods by a wide margin in linking mid-20th century Japanese firms across financial documents. A purely self-supervised model - trained only by aligning the embeddings for the image crop of a firm name and its corresponding OCR'ed text - also outperforms popular string matching methods. Fascinatingly, a multimodally pre-trained vision-only encoder outperforms a unimodally pre-trained vision-only encoder, illustrating the power of multimodal pre-training even if only one modality is available for linking at inference time.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 19 of its 48 references that are in the map. First posted on arXiv 7 Apr 2023.

Builds on

19 of 48 references.

References · 19

  1. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  2. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
  3. 2017Mask R-CNNcited by 7,259
  4. 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,893
  5. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
  6. 2020Supervised Contrastive Learningcited by 2,803
  7. 2017Billion-scale similarity search with GPUscited by 2,477
  8. 2021How to train your ViT? Data, Augmentation, and Regularization in Vision Transformerscited by 562
  9. 2020Autoregressive Entity Retrievalcited by 333
  10. 2020LUKE: Deep Contextualized Entity Representations with Entity-aware Self-attentioncited by 326
  11. 2022Unified Contrastive Learning in Image-Text-Label Spacecited by 194
  12. 2020Deep Entity Matching with Pre-Trained Language Modelscited by 143
7 more
  1. 2022SVTR: Scene Text Recognition with a Single Visual Modelcited by 86
  2. 2021LayoutParser: A Unified Toolkit for Deep Learning Based Document Image Analysiscited by 58
  3. 2022Contrastive Representation Learning for Cross-Document Coreference Resolution of Events and Entitiescited by 10
  4. 2023Efficient OCR for Building a Diverse Digital Historycited by 10
  5. 2019A Survey of Blocking and Filtering Techniques for Entity Resolutioncited by 8
  6. 2022TABi: Type-Aware Bi-Encoders for Open-Domain Entity Retrievalcited by 8
  7. 2014A Comparison of Blocking Methods for Record Linkagecited by 7

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.