BloomCoreset: Fast Coreset Sampling using Bloom Filters for Fine-Grained Self-Supervised Learning
Prajwal Singh, Gautam Vashishtha, Indra Deep Mastan, Shanmuganathan Raman
TL;DR
Open-Set SSL for fine-grained recognition suffers from expensive coreset sampling from large unlabeled pools. BloomCoreset proposes a Counting Bloom Filter-based pipeline that indexes Open-Set and domain-specific Open-CLIP features to quickly retrieve semantically aligned samples, followed by top-k filtering to reduce false positives. It integrates with the SimCore framework to train a fine-grained SSL model, and experiments across 11 downstream datasets show substantial speedups with only a small average accuracy trade-off. The approach enables scalable, domain-specific SSL with limited labeled data and demonstrates robust cross-dataset performance.
Abstract
The success of deep learning in supervised fine-grained recognition for domain-specific tasks relies heavily on expert annotations. The Open-Set for fine-grained Self-Supervised Learning (SSL) problem aims to enhance performance on downstream tasks by strategically sampling a subset of images (the Core-Set) from a large pool of unlabeled data (the Open-Set). In this paper, we propose a novel method, BloomCoreset, that significantly reduces sampling time from Open-Set while preserving the quality of samples in the coreset. To achieve this, we utilize Bloom filters as an innovative hashing mechanism to store both low- and high-level features of the fine-grained dataset, as captured by Open-CLIP, in a space-efficient manner that enables rapid retrieval of the coreset from the Open-Set. To show the effectiveness of the sampled coreset, we integrate the proposed method into the state-of-the-art fine-grained SSL framework, SimCore [1]. The proposed algorithm drastically outperforms the sampling strategy of the baseline in SimCore [1] with a $98.5\%$ reduction in sampling time with a mere $0.83\%$ average trade-off in accuracy calculated across $11$ downstream datasets.
