Pairwise Supervised Hashing With Bernoulli Variational Auto-encoder And Self-control Gradient Estimator

Abstract

Semantic hashing has become a crucial component of fast similarity search in many large-scale information retrieval systems, in particular, for text data. Variational auto-encoders (VAEs) with binary latent variables as hashing codes provide state-of-the-art performance in terms of precision for document retrieval. We propose a pairwise loss function with discrete latent VAE to reward within-class similarity and between-class dissimilarity for supervised hashing. Instead of solving the optimization relying on existing biased gradient estimators, an unbiased low-variance gradient estimator is adopted to optimize the hashing function by evaluating the non-differentiable loss function over two correlated sets of binary hashing codes to control the variance of gradient estimates. This new semantic hashing framework achieves superior performance compared to the state-of-the-arts, as demonstrated by our comprehensive experiments.

Stats

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

Related papers

• Self-supervised Bernoulli Autoencoders For Semi-supervised Hashing (2020)3.66
• NASH: Toward End-to-end Neural Architecture For Generative Semantic Hashing (2018)10.07
• Deep Class-wise Hashing: Semantics-preserving Hashing Via Class-wise Loss (2018)11.19
• Self-supervised Video Hashing With Hierarchical Binary Auto-encoder (2018)17.81
• Self-supervised Asymmetric Deep Hashing With Margin-scalable Constraint (2020)0.00
• Learning To Hash With Semantic Similarity Metrics And Empirical KL Divergence (2020)0.00
• Discriminative Supervised Hashing For Cross-modal Similarity Search (2018)7.81
• Auto-encoding Twin-bottleneck Hashing (2020)19.34