SaCo Loss: Sample-wise Affinity Consistency for Vision-Language Pre-training
Vision-language pre-training (VLP) aims to learn joint representations of vision and language modalities. The contrastive paradigm is currently dominant in this field. However we observe a notable misalignment phenomenon that is the affinity between samples has an obvious disparity across different modalities namely "Affinity Inconsistency Problem". Our intuition is that for a well-aligned model two images that look similar to each other should have the same level of similarity as their corresponding texts that describe them. In this paper we first investigate the reason of this inconsistency problem. We discover that the lack of consideration for sample-wise affinity consistency across modalities in existing training objectives is the central cause. To address this problem we propose a novel loss function named Sample-wise affinity Consistency (SaCo) loss which is designed to enhance such consistency by minimizing the distance between image embedding similarity and text embedding similarity for any two samples. Our SaCo loss can be easily incorporated into existing vision-language models as an additional loss due to its complementarity for most training objectives. In addition considering that pre-training from scratch is computationally expensive we also provide a more efficient way to continuously pre-train on a converged model by integrating our loss. Experimentally the model trained with our SaCo loss significantly outperforms the baseline on a variety of vision and language tasks.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Joint Class-Affinity Loss Correction for Robust Medical Image Segmentation with Noisy Labels
Noisy labels collected with limited annotation cost prevent medical image segmentation algorithms from learning precise semantic correlations. Previous segmentation arts of learning with noisy labels merely perform a pix…
Image SegmentationLearning with noisy labelsMedical Image SegmentationSegmentation+1MuSACo: Multimodal Subject-Specific Selection and Adaptation for Expression Recognition with Co-Training
Personalized expression recognition (ER) involves adapting a machine learning model to subject-specific data for improved recognition of expressions with considerable interpersonal variability. Subject-specific ER can be…
Domain AdaptationExploiting Inter-Sample Affinity for Knowability-Aware Universal Domain Adaptation
Universal domain adaptation (UniDA) aims to transfer the knowledge of common classes from the source domain to the target domain without any prior knowledge on the label set, which requires distinguishing in the target d…
Domain AdaptationUniversal Domain AdaptationA General Multi-Graph Matching Approach via Graduated Consistency-regularized Boosting
This paper addresses the problem of matching $N$ weighted graphs referring to an identical object or category. More specifically, matching the common node correspondences among graphs. This multi-graph matching problem i…
Graph MatchingAsyInst: Asymmetric Affinity with DepthGrad and Color for Box-Supervised Instance Segmentation
The weakly supervised instance segmentation is a challenging task. The existing methods typically use bounding boxes as supervision and optimize the network with a regularization loss term such as pairwise color affinity…
Box-supervised Instance SegmentationInstance SegmentationSegmentationSemantic Segmentation+1