We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We propose theoretical and empirical improvements for two-stage hashing methods. We first provide a theoretical analysis on the quality of the binary codes and show that, under mild assumptions, a residual learning scheme can construct binary codes that fit any neighborhood structure with arbitrary accuracy. Secondly, we show that with high-capacity hash functions such as CNNs, binary code inference can be greatly simplified for many standard neighborhood definitions, yielding smaller optimization problems and more robust codes. Incorporating our findings, we propose a novel two-stage hashing method that significantly outperforms previous hashing studies on widely used image retrieval benchmarks.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1808.01990")
get_code_for_paper("1808.01990")
have("1808.01990")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1808.01990.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1808.01990)
Connect an agent — have() is free.