atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Greedy Hash: Towards Fast Optimization for Accurate Hash Coding in CNN

NeurIPS 2018 · Learning theory and algorithms › Combinatorial and search optimization · approach: Unsupervised neural combinatorial optimization · 123 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Greedy Hash (sign forward, straight-through backward) vs DSDHdeep supervised hashing · CIFAR-10 (I), 12 bitsMAP: 0.740 -> 0.774Helped
Greedy Hash vs HashNet at short codesdeep hashing · ImageNet, 16 bitsMAP@1000: 0.506 -> 0.625Helped
Greedy Hash vs HashNet at long codesdeep hashing · ImageNet, 64 bitsMAP@1000: 0.684 -> 0.688No clear effect
use exact sign with greedy gradient instead of tanh relaxation or penalty termAlexNet hashing, 16 bits · CIFAR-10MAP during trainingHelped
binary hash codes instead of unrestricted continuous features for retrievalAlexNet 16-dim features · CIFAR-10MAPHelped
use DPLM with deep CNN features instead of raw featuresDPLM · CIFAR-10 (II), 48 bitsMAP: 0.671 -> 0.843Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy