Structured Learning Of Binary Codes With Column Generation

Abstract

Hashing methods aim to learn a set of hash functions which map the original features to compact binary codes with similarity preserving in the Hamming space. Hashing has proven a valuable tool for large-scale information retrieval. We propose a column generation based binary code learning framework for data-dependent hash function learning. Given a set of triplets that encode the pairwise similarity comparison information, our column generation based method learns hash functions that preserve the relative comparison relations within the large-margin learning framework. Our method iteratively learns the best hash functions during the column generation procedure. Existing hashing methods optimize over simple objectives such as the reconstruction error or graph Laplacian related loss functions, instead of the performance evaluation criteria of interest---multivariate performance measures such as the AUC and NDCG. Our column generation based method can be further generalized from the tripl

Stats

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

Related papers

• Compact Hash Code Learning With Binary Deep Neural Network (2017)9.03
• Simultaneous Feature Aggregating And Hashing For Compact Binary Code Learning (2019)9.92
• Collaborative Learning For Extremely Low Bit Asymmetric Hashing (2018)7.50
• Discriminative Supervised Hashing For Cross-modal Similarity Search (2018)7.81
• Scalable Discrete Supervised Hash Learning With Asymmetric Matrix Factorization (2016)4.52
• Learning To Hash With Semantic Similarity Metrics And Empirical KL Divergence (2020)0.00
• Bilinear Supervised Hashing Based On 2D Image Features (2019)8.60
• Learning Hash Function Through Codewords (2019)0.00