{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/the-power-of-asymmetry-in-binary-hashing","title":"The Power of Asymmetry in Binary Hashing","arxiv_id":"1311.7662","date":"2013-11-29","proceeding":"NeurIPS 2013 12","authors":["Behnam Neyshabur","Payman Yadollahpour","Yury Makarychev","Ruslan Salakhutdinov","Nathan Srebro"],"abstract":"When approximating binary similarity using the hamming distance between short\nbinary hashes, we show that even if the similarity is symmetric, we can have\nshorter and more accurate hashes by using two distinct code maps. I.e. by\napproximating the similarity between $x$ and $x'$ as the hamming distance\nbetween $f(x)$ and $g(x')$, for two distinct binary codes $f,g$, rather than as\nthe hamming distance between $f(x)$ and $f(x')$.","url_abs":"http://arxiv.org/abs/1311.7662v1","url_pdf":"http://arxiv.org/pdf/1311.7662v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"the-power-of-asymmetry-in-binary-hashing","repo_url":"https://github.com/bneyshabur/asymcode","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}