Improving memory banks for unsupervised learning with large mini-batch, consistency and hard negative mining
Not on the map. Why?
Abstract (arXiv)
An important component of unsupervised learning by instance-based discrimination is a memory bank for storing a feature representation for each training sample in the dataset. In this paper, we introduce 3 improvements to the vanilla memory bank-based formulation which brings massive accuracy gains: (a) Large mini-batch: we pull multiple augmentations for each sample within the same batch and show that this leads to better models and enhanced memory bank updates. (b) Consistency: we enforce the logits obtained by different augmentations of the same sample to be close without trying to enforce discrimination with respect to negative samples as proposed by previous approaches. (c) Hard negative mining: since instance discrimination is not meaningful for samples that are too visually similar, we devise a novel nearest neighbour approach for improving the memory bank that gradually merges extremely similar data samples that were previously forced to be apart by the instance level classification loss. Overall, our approach greatly improves the vanilla memory-bank based instance discrimination and outperforms all existing methods for both seen and unseen testing categories with cosine similarity.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 18 of its 24 references that are in the map. First posted on arXiv 8 Feb 2021.
Builds on
18 of 24 references.
References · 18
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
- 2018Unsupervised Feature Learning via Non-Parametric Instance-level Discriminationcited by 1,838
- 2019Contrastive Multiview Codingcited by 1,297
- 2018Deep Clustering for Unsupervised Learning of Visual Featurescited by 1,020
- 2017Virtual Adversarial Training: A Regularization Method for Supervised and Semi-Supervised Learningcited by 918
- 2019Self-Supervised Learning of Pretext-Invariant Representationscited by 806
- 2019Learning Representations by Maximizing Mutual Information Across Viewscited by 733
- 2019Data-Efficient Image Recognition with Contrastive Predictive Codingcited by 672
- 2015Deep Metric Learning via Lifted Structured Feature Embeddingcited by 449
6 more
- 2016Regularization With Stochastic Transformations and Perturbations for Deep Semi-Supervised Learningcited by 441
- 2019ReMixMatch: Semi-Supervised Learning with Distribution Alignment and Augmentation Anchoringcited by 349
- 2019Unsupervised Embedding Learning via Invariant and Spreading Instance Featurecited by 231
- 2017No Fuss Distance Metric Learning using Proxiescited by 225
- 2018Mining on Manifolds: Metric Learning without Labelscited by 36
- 2015Stacked What-Where Auto-encoderscited by 20
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 1; 2025: 2.
4 papers.
- 2021Cross Modal Retrieval with Querybank Normalisationcited by 71
- 2025Graph Your Own Promptcited by 2
- 2024A deep cut into Split Federated Self-supervised Learningcited by 0
- 2025Learning More with Less: A Generalizable, Self-Supervised Framework for Privacy-Preserving Capacity Estimation with EV Charging Datacited by 0
- 2025Learning More with Less: A Generalizable, Self-Supervised Framework for Privacy-Preserving Capacity Estimation with EV Charging Data5 Oct 2025
- 2025Graph Your Own Prompt27 Sep 2025
- 2024A deep cut into Split Federated Self-supervised Learning12 Jun 2024
- 2021Cross Modal Retrieval with Querybank Normalisation23 Dec 2021