Binary LSH codes found by Hamming distance provide hard negatives for supervised contrastive learning at a fraction of the compute cost of exact pre-epoch sampling, with comparable or better accuracy on six benchmarks.
Debiased contrastive learning
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CV 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning
Binary LSH codes found by Hamming distance provide hard negatives for supervised contrastive learning at a fraction of the compute cost of exact pre-epoch sampling, with comparable or better accuracy on six benchmarks.