TL;DR
This paper introduces ISD, a self-supervised learning method that uses iterative similarity distillation with soft similarity measures, improving feature learning especially in unbalanced, unlabeled datasets compared to traditional contrastive approaches.
Contribution
The paper proposes a novel self-supervised learning algorithm that employs iterative similarity distillation with soft similarity, allowing better handling of unbalanced and unlabeled data.
Findings
Achieves comparable results to state-of-the-art models.
Performs better on unbalanced unlabeled datasets.
Uses a slowly evolving teacher model for knowledge transfer.
Abstract
Recently, contrastive learning has achieved great results in self-supervised learning, where the main idea is to push two augmentations of an image (positive pairs) closer compared to other random images (negative pairs). We argue that not all random images are equal. Hence, we introduce a self supervised learning algorithm where we use a soft similarity for the negative images rather than a binary distinction between positive and negative pairs. We iteratively distill a slowly evolving teacher model to the student model by capturing the similarity of a query image to some random images and transferring that knowledge to the student. We argue that our method is less constrained compared to recent contrastive learning methods, so it can learn better features. Specifically, our method should handle unbalanced and unlabeled data better than existing contrastive learning methods, because…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsContrastive Learning · Bootstrap Your Own Latent · InfoNCE · Batch Normalization · Momentum Contrast
