pith. sign in

arxiv: 2202.13072 · v1 · pith:UVHUGE2Hnew · submitted 2022-02-26 · 💻 cs.CV · cs.AI· cs.LG· cs.NE

Adversarial Contrastive Self-Supervised Learning

classification 💻 cs.CV cs.AIcs.LGcs.NE
keywords learningself-superviseddatahardnegativeminingpairpairs
0
0 comments X
read the original abstract

Recently, learning from vast unlabeled data, especially self-supervised learning, has been emerging and attracted widespread attention. Self-supervised learning followed by the supervised fine-tuning on a few labeled examples can significantly improve label efficiency and outperform standard supervised training using fully annotated data. In this work, we present a novel self-supervised deep learning paradigm based on online hard negative pair mining. Specifically, we design a student-teacher network to generate multi-view of the data for self-supervised learning and integrate hard negative pair mining into the training. Then we derive a new triplet-like loss considering both positive sample pairs and mined hard negative sample pairs. Extensive experiments demonstrate the effectiveness of the proposed method and its components on ILSVRC-2012.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.