mlsanityData to 7 Oct 2026

CoViews: Adaptive Augmentation Using Cooperative Views for Enhanced Contrastive Learning

arXiv 2405.07116 ↗First posted 12 May 2024cs.CVcited by 0

Not on the map. Why?

Abstract (arXiv)

Data augmentation plays a critical role in generating high-quality positive and negative pairs necessary for effective contrastive learning. However, common practices involve using a single augmentation policy repeatedly to generate multiple views, potentially leading to inefficient training pairs due to a lack of cooperation between views. Furthermore, to find the optimal set of augmentations, many existing methods require extensive supervised evaluation, overlooking the evolving nature of the model that may require different augmentations throughout the training. Other approaches train differentiable augmentation generators, thus limiting the use of non-differentiable transformation functions from the literature. In this paper, we address these challenges by proposing a framework for learning efficient adaptive data augmentation policies for contrastive learning with minimal computational overhead. Our approach continuously generates new data augmentation policies during training and produces effective positives/negatives without any supervision. Within this framework, we present two methods: acIndepViews, which generates augmentation policies used across all views, and acCoViews, which generates dependent augmentation policies for each view. This enables us to learn dependencies between the transformations applied to each view and ensures that the augmentation strategies applied to different views complement each other, leading to more meaningful and discriminative representations. Through extensive experimentation on multiple datasets and contrastive learning frameworks, we demonstrate that our method consistently outperforms baseline solutions and that training with a view-dependent augmentation policy outperforms training with an independent policy shared across views, showcasing its effectiveness in enhancing contrastive learning performance.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 20 of its 24 references that are in the map. First posted on arXiv 12 May 2024.

Builds on

20 of 24 references.

References · 20

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  3. 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
  4. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
  5. 2022Generative Adversarial Networkscited by 5,603
  6. 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
  7. 2020Exploring Simple Siamese Representation Learningcited by 2,853
  8. 2020Improved Baselines with Momentum Contrastive Learningcited by 2,282
  9. 2019RandAugment: Practical automated data augmentation with a reduced search spacecited by 2,261
  10. 2018Unsupervised Representation Learning by Predicting Image Rotationscited by 1,586
  11. 2018Glow: Generative Flow with Invertible 1x1 Convolutionscited by 1,539
  12. 2020What Makes for Good Views for Contrastive Learning?cited by 843
8 more
  1. 2018AutoAugment: Learning Augmentation Policies from Datacited by 728
  2. 2019Fast AutoAugmentcited by 243
  3. 2019Population Based Augmentation: Efficient Learning of Augmentation Policy Schedulescited by 153
  4. 2019Adversarial AutoAugmentcited by 111
  5. 2021Contrastive Learning with Stronger Augmentationscited by 100
  6. 2017Learning to Compose Domain-Specific Transformations for Data Augmentationcited by 91
  7. 2020Viewmaker Networks: Learning Views for Unsupervised Representation Learningcited by 48
  8. 2020Embedded Encoder-Decoder in Convolutional Networks Towards Explainable AIcited by 23

Built on by

Not cited yet.