The Power Of Asymmetry In Binary Hashing

Behnam Neyshabur, Nati Srebro, Russ R. Salakhutdinov, Yury Makarychev, Payman Yadollahpour. Neural Information Processing Systems 2013

[Paper]    
NEURIPS

When approximating binary similarity using the hamming distance between short binary hashes, we shown that even if the similarity is symmetric, we can have shorter and more accurate hashes by using two distinct code maps. I.e.~by approximating the similarity between $x$ and $x^{\prime }$ as the hamming distance between $f(x)$ and $g(x^{\prime })$, for two distinct binary codes $f,g$, rather than as the hamming distance between $f(x)$ and $f(x^{\prime })$.

Similar Work

• The Power Of Asymmetry In Binary Hashing
• Adaptive And Dynamic Multi-resolution Hashing For Pairwise Summations
• Balanced Allocations And Double Hashing
• Set Similarity Search Beyond Minhash