Unsupervised Domain-adaptive Hash For Networks

Abstract

Abundant real-world data can be naturally represented by large-scale networks, which demands efficient and effective learning algorithms. At the same time, labels may only be available for some networks, which demands these algorithms to be able to adapt to unlabeled networks. Domain-adaptive hash learning has enjoyed considerable success in the computer vision community in many practical tasks due to its lower cost in both retrieval time and storage footprint. However, it has not been applied to multiple-domain networks. In this work, we bridge this gap by developing an unsupervised domain-adaptive hash learning method for networks, dubbed UDAH. Specifically, we develop four \{task-specific yet correlated\} components: (1) network structure preservation via a hard groupwise contrastive loss, (2) relaxation-free supervised hashing, (3) cross-domain intersected discriminators, and (4) semantic center alignment. We conduct a wide range of experiments to evaluate the effectiveness and eff

Stats

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

Related papers

• One Network For Multi-domains: Domain Adaptive Hashing With Intersectant Generative Adversarial Network (2019)7.81
• Deep Hashing Network For Unsupervised Domain Adaptation (2017)6.77
• Deep Self-adaptive Hashing For Image Retrieval (2021)8.35
• Object Detection Based Deep Unsupervised Hashing (2018)6.34
• Adaptive Structural Similarity Preserving For Unsupervised Cross Modal Hashing (2022)10.97
• Unsupervised Semantic Deep Hashing (2018)10.48
• Deep Discrete Hashing With Self-supervised Pairwise Labels (2017)9.49
• Cascading Hierarchical Networks With Multi-task Balanced Loss For Fine-grained Hashing (2023)0.00