Mutual Learning For Hashing: Unlocking Strong Hash Functions From Weak Supervision

Abstract

Deep hashing has been widely adopted for large-scale image retrieval, with numerous strategies proposed to optimize hash function learning. Pairwise-based methods are effective in learning hash functions that preserve local similarity relationships, whereas center-based methods typically achieve superior performance by more effectively capturing global data distributions. However, the strength of center-based methods in modeling global structures often comes at the expense of underutilizing important local similarity information. To address this limitation, we propose Mutual Learning for Hashing (MLH), a novel weak-to-strong framework that enhances a center-based hashing branch by transferring knowledge from a weaker pairwise-based branch. MLH consists of two branches: a strong center-based branch and a weaker pairwise-based branch. Through an iterative mutual learning process, the center-based branch leverages local similarity cues learned by the pairwise-based branch. Furthermore, in

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyma2025mutual

Related papers

• Improved Deep Classwise Hashing With Centers Similarity Learning For Image Retrieval (2021)5.84
• Deep Self-adaptive Hashing For Image Retrieval (2021)8.35
• SSDH: Semi-supervised Deep Hashing For Large Scale Image Retrieval (2016)15.40
• Deep Hashing: A Joint Approach For Image Signature Learning (2016)5.24
• Coophash: Cooperative Learning Of Multipurpose Descriptor And Contrastive Pair Generator Via Variational MCMC Teaching For Supervised Image Hashing (2022)0.00
• Deep Discrete Hashing With Self-supervised Pairwise Labels (2017)9.49
• Weakly-paired Cross-modal Hashing (2019)0.00
• Deep Hashing With Semantic Hash Centers For Image Retrieval (2025)2.26