A Lower Bound of Hash Codes' Performance. (arXiv:2210.05899v1 [cs.CV])

As a crucial approach for compact representation learning, hashing has
achieved great success in effectiveness and efficiency. Numerous heuristic
Hamming space metric learning objectives are designed to obtain high-quality
hash codes. Nevertheless, a theoretical analysis of criteria for learning good
hash codes remains largely unexploited. In this paper, we prove that
inter-class distinctiveness and intra-class compactness among hash codes
determine the lower bound of hash codes' performance. Promoting these two
characteristics could lift the bound and improve hash learning. We …

arxiv hash performance