paper-with-me

홈 › Papers

Data-Efficient Contrastive Learning by Differentiable Hard Sample and Hard Positive Pair Generation

2021-09-29 · Yawen Wu, Zhepeng Wang, Dewen Zeng, Yiyu Shi, Jingtong Hu

Contrastive learning (CL), a self-supervised learning approach, can effectively learn visual representations from unlabeled data. However, CL requires learning on vast quantities of diverse data to achieve good performance, without which the performance of CL will greatly degrade. To tackle this problem, we propose a framework with two approaches to improve the data efficiency of CL training by generating beneficial samples. The first approach generates hard samples for the main model. In the training process, hard samples are dynamically customized to the training state of the main model, rather than fixed throughout the whole training process. With the progressively growing knowledge of the main model, the generated samples also become harder to constantly encourage the main model to learn better representations. Besides, a pair of data generators are proposed to generate similar but distinct samples as positive pairs. The hardness of positive pair is progressively increased by decreasing the similarity between a positive pair. In this way, the main model learns to cluster hard positives by pulling the representations of similar yet distinct samples together, by which the representations of similar samples are well-clustered and better representations can be learned. Comprehensive experiments show superior accuracy of the proposed approaches over the state-of-the-art on multiple datasets. For example, about 5% and 6% improvements are achieved on CIFAR-10/100 and ImageNet-100/10 with limited training data, respectively. Besides, about 2x data efficiency is achieved when reaching a similar accuracy as other methods.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Contrastive LearningSelf-Supervised Learning

Similar Papers 제목 키워드 기반

Hard Sample Aware Network for Contrastive Deep Graph Clustering

2022-12-16 · Yue Liu, Xihong Yang, Sihang Zhou, Xinwang Liu 외

Contrastive deep graph clustering, which aims to divide nodes into disjoint groups via contrastive mechanisms, is a challenging research spot. Among the recent works, hard sample mining-based algorithms have achieved gre…

AttributeClusteringGraph Clustering

Synthetic Hard Negative Samples for Contrastive Learning

2023-04-06 · Hengkui Dong, Xianzhong Long, Yun Li, Lei Chen

Contrastive learning has emerged as an essential approach for self-supervised learning in visual representation learning. The central objective of contrastive learning is to maximize the similarities between two augmente…

Contrastive LearningRepresentation LearningSelf-Supervised Learning

Contrastive Learning with Hard Negative Samples

2020-10-09 · ICLR 2021 1 · Joshua Robinson, Ching-Yao Chuang, Suvrit Sra, Stefanie Jegelka

How can you sample good negative examples for contrastive learning? We argue that, as with metric learning, contrastive learning of representations benefits from hard negative samples (i.e., points that are difficult to …

Contrastive LearningMetric Learning

DropMix: Better Graph Contrastive Learning with Harder Negative Samples

2023-10-15 · Yueqi Ma, Minjie Chen, Xiang Li

While generating better negative samples for contrastive learning has been widely studied in the areas of CV and NLP, very few work has focused on graph-structured data. Recently, Mixup has been introduced to synthesize …

Contrastive Learning

Label-aware Hard Negative Sampling Strategies with Momentum Contrastive Learning for Implicit Hate Speech Detection

2024-06-12 · JaeHoon Kim, Seungwan Jin, SoHyun Park, Someen Park 외

Detecting implicit hate speech that is not directly hateful remains a challenge. Recent research has attempted to detect implicit hate speech by applying contrastive learning to pre-trained language models such as BERT a…

Contrastive LearningHate Speech Detection