Research map / Optimization / Optimizers
Accelerate Learning of Deep Hashing With Gradient Attention
Long-Kai Huang, Jianda Chen, Sinno Jialin Pan
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 changed | Where | Measured | Effect |
|---|---|---|---|
| add gradient attention network instead of random weight on one gradient (B1) (ablation) | GAH · ImageNet (64 bits) | MAP: 0.6483 -> 0.6821 | Improved |
| add gradient attention instead of random weights (B2) (ablation) | GAH · ImageNet (64 bits) | MAP: 0.6536 -> 0.6821 | Improved |
| add gradient attention instead of weight 1 to larger gradient (B3) (ablation) | GAH · ImageNet (64 bits) | MAP: 0.5670 -> 0.6821 | Improved |
| add gradient attention instead of zeroing smaller gradient (B4) (ablation) | GAH · ImageNet (64 bits) | MAP: 0.6577 -> 0.6821 | Improved |
| add gradient attention network to HashNet-like loss (GAH vs HashNet) | deep hashing · CIFAR-10 (16 bits) | MAP: 0.6896 -> 0.6985 | Improved |
| add gradient attention (GAH vs HashNet) | deep hashing · ImageNet (16 bits) | MAP: 0.4633 -> 0.5034 | Improved |
| add gradient attention (GAH vs GH) | deep hashing · ImageNet (64 bits) | MAP: 0.4893 -> 0.6821 | Improved |
| add gradient attention (GAH vs GH) in unsupervised setting | deep hashing · CIFAR-10 unsupervised (16 bits) | MAP@5000: 0.4114 -> 0.4796 | Improved |
| add gradient attention (GAH vs GH) in unsupervised setting | deep hashing · CIFAR-10 unsupervised (64 bits) | MAP@5000: 0.5034 -> 0.5165 | Improved |
| add gradient attention to reduce bit pairs in dilemma (GAH0 vs GAH) (ablation) | GAH · CIFAR-10 | bit pairs in dilemma: 13.1% to 61.9% | Improved |
| add gradient attention to reduce bit pairs in dilemma (ablation) | GAH · NUS-WIDE | bit pairs in dilemma: at least 26.1% | Improved |
| add gradient attention to reduce bit pairs in dilemma (ablation) | GAH · ImageNet | bit pairs in dilemma: at least 10.8% | Improved |
Closest papers by meaning
- Deep Supervised Hashing for Fast Image Retrieval (CVPR 2016 · similarity 0.91)
- Deep Incremental Hashing Network for Efficient Image Retrieval (CVPR 2019 · similarity 0.91)
- Greedy Hash: Towards Fast Optimization for Accurate Hash Coding in CNN (NeurIPS 2018 · similarity 0.91)
- Deep Hashing Network for Efficient Similarity Retrieval (AAAI 2016 · similarity 0.90)
- Supervised Learning of Semantics-Preserving Hash via Deep Convolutional Neural Networks (TPAMI 2017 · similarity 0.90)
- Pairwise-Label-Based Deep Incremental Hashing with Simultaneous Code Expansion (AAAI 2024 · similarity 0.88)
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.
