Optimizing Ranking Measures for Compact Binary Code Learning
Hashing has proven a valuable tool for large-scale information retrieval. Despite much success, 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. Here we present a general framework (termed StructHash) that allows one to directly optimize multivariate performance measures. The resulting optimization problem can involve exponentially or infinitely many variables and constraints, which is more challenging than standard structured output learning. To solve the StructHash optimization problem, we use a combination of column generation and cutting-plane techniques. We demonstrate the generality of StructHash by applying it to ranking prediction and image retrieval, and show that it outperforms a few state-of-the-art hashing methods.
Code (0)
등록된 구현이 없습니다.
Tasks
Image RetrievalInformation RetrievalRetrievalSimilar Papers 제목 키워드 기반
Structured Learning of Binary Codes with Column Generation
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…
Image RetrievalInformation RetrievalRetrievalTripletDeep Semantic Ranking Based Hashing for Multi-Label Image Retrieval
With the rapid growth of web images, hashing has received increasing interests in large scale image retrieval. Research efforts have been devoted to learning compact binary codes that preserve semantic similarity based o…
Image RetrievalMulti-Label Image RetrievalRetrievalSemantic Similarity+1Ranking Preserving Hashing for Fast Similarity Search
Hashing method becomes popular for large scale similarity search due to its storage and computational efficiency. Many machine learning techniques, ranging from unsupervised to supervised, have been proposed to design co…
Computational EfficiencyFast Training of Triplet-based Deep Binary Embedding Networks
In this paper, we aim to learn a mapping (or embedding) from images to a compact binary space in which Hamming distances correspond to a ranking measure for the image retrieval task. We make use of a triplet loss becau…
Image RetrievalMulti-Label ClassificationMUlTI-LABEL-ClASSIFICATIONRetrieval+1Handling Class Imbalance in Link Prediction using Learning to Rank Techniques
We consider the link prediction problem in a partially observed network, where the objective is to make predictions in the unobserved portion of the network. Many existing methods reduce link prediction to binary classif…
Binary ClassificationLearning-To-RankLink PredictionPrediction