A new hashing framework learns multiple hash codes for each image to improve hash bucket search efficiency.
problem Existing hashing methods fail to handle complex image retrieval scenarios efficiently.
method Multiple Code Hashing (MCH) framework with deep reinforcement learning.
result Significant improvement in hash bucket search performance compared to single-code methods.
ADSH uses asymmetric deep hashing for faster training and better performance.
problem Efficiently utilizing supervised information for large-scale database in deep supervised hashing.
method ADSH learns a deep hash function only for query points and directly learns hash codes for database points.
result ADSH achieves state-of-the-art performance in real applications.
DSHL generates music using segment concatenation and hash learning.
problem Music generation using deep learning.
method Deep recurrent neural network and ranking-based hash learning.
result DSHL generates original and enjoyable music.
Generative approach learns hash functions for efficient binary search.
problem Challenges in learning discrete hash functions for fast search.
method Generative approach using Minimum Description Length principle and stochastic distributional gradient.
result Significantly better retrieval results than existing methods.
A new hashing method improves accuracy by learning an orthogonal transform.
problem Improving hashing accuracy for similarity search.
method Procrustean Orthogonal Sparse Hashing (POSH) method.
result POSH outperforms state-of-the-art hashing methods.
Efficient Discrete Supervised Hashing improves cross-modal retrieval by preserving semantic correlations and reducing quantization error.
problem Challenges in preserving semantic correlations and reducing quantization error in cross-modal hashing for large-scale retrieval.
method Collective matrix factorization on heterogenous features and semantic embedding with class labels to learn hash codes efficiently.
result EDSH produces superior performance in both accuracy and scalability over existing methods.
Fuzzy hashes learn from data to improve file similarity detection.
problem Measuring similarity between files, especially malware.
method Learned fuzzy hashes using a minimax training framework.
result Learned fuzzy hashes outperform traditional methods for file similarity.
A new framework THPI for hashing with auxiliary data.
problem Data sparsity in hashing for real-world applications.
method Transfer learning approach to extend ITQ method.
result Extensive experiments show the effectiveness of THPI.
FSDH is a fast supervised hashing method that outperforms existing methods.
problem Efficiently hashing large datasets for fast retrieval.
method FSDH uses a simple regression of class labels to hash codes, avoiding iterative discrete optimization.
result FSDH is significantly faster (12-151x) than existing methods like SDH and FastHash.
BioHash improves similarity search performance using sparse high-dimensional hash codes.
problem Improving similarity search performance in high-dimensional data.
method BioHash produces sparse high-dimensional hash codes through a data-driven approach based on synaptic plasticity.
result BioHash outperforms previous hashing methods in various similarity search tasks.
Hyperplane hashing aims at rapidly searching nearest points to a hyperplane, and has shown practical impact in scaling up active learning with SVMs. Unfortunately, the existing randomized methods need long hash codes to achieve reasonable search accuracy and thus suffer from reduced search speed and large memory overhe…
FlexCMH learns effective hashing codes from weakly-paired data.
problem Cross-modal hashing assumes perfect correspondence between samples, which is unrealistic.
method FlexCMH uses clustering-based matching to find potential correspondence and jointly optimizes it with hashing functions.
result FlexCMH achieves significantly better results than state-of-the-art methods.
The paper develops methods to optimize ranking metrics for hashing.
problem Improving hashing for better retrieval performance.
method Developed tie-aware learning to rank formulations for hashing.
result Established new state-of-the-art for image retrieval by Hamming ranking.
Enhances hashing for cross-modal retrieval using multi-view features.
problem Limited improvement in single-view hashing for cross-modal retrieval.
method Exploits multiple views to enrich feature information, learning discriminative hash codes.
result Superior performance compared to state-of-the-art methods on various datasets.
A novel hash learning approach using codewords in Hamming space.
problem Hash learning for supervised, unsupervised, and semi-supervised scenarios.
method Uses codewords inferred from data to capture grouping aspects of hash codes, with regularization for automatic codeword selection. Solves via Block Coordinate Descent and SVM.
result Demonstrates superior performance in content-based image retrieval.
Improves two-stage hashing methods for better image retrieval.
problem Developing efficient binary codes for image retrieval.
method Theoretical analysis and empirical improvements of two-stage hashing methods using high-capacity hash functions.
result Proposes a novel two-stage hashing method significantly outperforming previous studies.
New hashing method improves document retrieval precision.
problem Efficiently retrieving similar documents from large text databases.
method Pairwise supervised hashing with Bernoulli VAE and unbiased gradient estimator.
result Superior performance compared to existing methods.
In supervised binary hashing, one wants to learn a function that maps a high-dimensional feature vector to a vector of binary codes, for application to fast image retrieval. This typically results in a difficult optimization problem, nonconvex and nonsmooth, because of the discrete variables involved. Much work has sim…
The paper compares different hashing schemes for their performance on structured data.
problem The performance of hashing schemes on structured input is not well understood.
method The paper compares mixed tabulation hashing, multiply-mod-prime hashing, and MurmurHash3.
result Mixed tabulation hashing performs similarly to truly random hashing but is faster and has a proven guarantee.
Paper introduces EM-KSH and EM-SPLH methods for supervised hashing.
problem Efficiently optimize retrieval speed and storage cost while preserving semantic information.
method Convert supervised hashing formulations to CRF, solve consistency equations using linear approximation of sigmoid function.
result Experimental results show superior performance of EM-KSH and EM-SPLH.
We generated a dataset of 200 GB with 10^9 features, to test our recent b-bit minwise hashing algorithms for training very large-scale logistic regression and SVM. The results confirm our prior work that, compared with the VW hashing algorithm (which has the same variance as random projections), b-bit minwise hashing i…
Hash codes are a very efficient data representation needed to be able to cope with the ever growing amounts of data. We introduce a random forest semantic hashing scheme with information-theoretic code aggregation, showing for the first time how random forest, a technique that together with deep learning have shown spe…
Minwise hashing is the standard technique in the context of search and databases for efficiently estimating set (e.g., high-dimensional 0/1 vector) similarities. Recently, b-bit minwise hashing was proposed which significantly improves upon the original minwise hashing in practice by storing only the lowest b bits of e…
Probabilistic hash embeddings improve online learning of categorical features.
problem Online learning of categorical features with changing vocabulary.
method Probabilistic hash embedding (PHE) with Bayesian online learning.
result PHE mitigates forgetting and maintains high performance in online settings.
A new hashing method handles complex multi-level labels.
problem Handling complex multi-level labels in cross-modal data retrieval.
method Derives a semantic ranking list from feature and label information, integrates semantic ranking into deep cross-modal hashing.
result RDCMH outperforms other methods in cross-modal retrieval applications.
SDHR improves data hashing for better classification accuracy.
problem Efficient data hashing for high-dimensional data retrieval.
method Supervised Discrete Hashing with Relaxation (SDHR) using optimized regression targets.
result SDHR outperforms traditional methods in classification accuracy.
FROSH and DFROSH speed up online sketching hashing for big data.
problem Efficiency and scalability of hashing methods for streaming data.
method Online sketching hashing (OSH) and FasteR Online Sketching Hashing (FROSH) algorithm.
result FROSH reduces training time and maintains sketching precision.
In this paper, we propose to (seamlessly) integrate b-bit minwise hashing with linear SVM to substantially improve the training (and testing) efficiency using much smaller memory, with essentially no loss of accuracy. Theoretically, we prove that the resemblance matrix, the minwise hashing matrix, and the b-bit minwise…
New neural network outperforms existing methods in scene matching.
problem Automated scene matching with high accuracy and low false positives.
method Convolutional hashing using a new loss function and training scheme.
result Significantly higher true positive rate and 100-fold reduction in false positives.
A Bloom filter approach combined with Transformer models improves accuracy for machine learning tasks on opaque IDs.
problem Improving accuracy for machine learning tasks on opaque IDs with large vocabulary sizes.
method Applying hash functions to map opaque IDs to multiple hash tokens, similar to a Bloom filter, and using a multi-layer Transformer to process these digests.
result Models outperform those without hashing and sampled softmax, achieving high accuracy with a smaller computational budget.
An attractive approach for fast search in image databases is binary hashing, where each high-dimensional, real-valued image is mapped onto a low-dimensional, binary vector and the search is done in this binary space. Finding the optimal hash function is difficult because it involves binary constraints, and most approac…
A new DP algorithm improves privacy in hashing and sampling for search and learning.
problem Improving privacy in hashing and sampling for large-scale applications.
method Combines differential privacy with one permutation hashing and bin-wise consistent weighted sampling.
result Proposes DP-OPH and DP-BCWS algorithms that enhance privacy while maintaining utility.
In this paper, we first demonstrate that b-bit minwise hashing, whose estimators are positive definite kernels, can be naturally integrated with learning algorithms such as SVM and logistic regression. We adopt a simple scheme to transform the nonlinear (resemblance) kernel into linear (inner product) kernel; and hence…
A new hashing method handles large-scale data with flexible similarity measures.
problem Efficient nearest neighbour search in large-scale systems with variable labels.
method End-to-end trainable network transforming data to uniform distribution on product of spheres, then hashing to binary form maximizing entropy.
result Outperforms baseline approaches in limited capacity regime.
Distributed Collaborative Hashing improves recommendation efficiency in big data.
problem Efficiency in offline model training and online recommendation for collaborative filtering.
method Distributed Learning Framework + Hashing Technique.
result DCH model achieves comparable recommendation accuracy with fast convergence and real-time efficiency.
New loss function and training scheme improve binary hash codes for better similarity search.
problem Improving binary hash codes for better similarity search tasks.
method Log likelihood loss on Hamming distance target, novel training scheme, multi-indexing.
result Significant improvements in MAP (84%) and query cost reduction for ImageNet and SIFT 1M.
Large scale agglomerative clustering is hindered by computational burdens. We propose a novel scheme where exact inter-instance distance calculation is replaced by the Hamming distance between Kernelized Locality-Sensitive Hashing (KLSH) hashed values. This results in a method that drastically decreases computation tim…
Binary hashing is a well-known approach for fast approximate nearest-neighbor search in information retrieval. Much work has focused on affinity-based objective functions involving the hash functions or binary codes. These objective functions encode neighborhood information between data points and are often inspired by…
Efficiently learns quantizable embeddings for fast search.
problem Learning binary hamming code representations for search efficiency.
method Directly learns a quantizable embedding representation and sparse binary hash code end-to-end.
result Achieves state-of-the-art search accuracy and significant speedup.
The study predicts acute hypotensive episodes using unsupervised learning and hashing.
problem Early detection of acute hypotensive episodes in ICU.
method Unsupervised representation learning and stratified locality sensitive hashing applied to multivariate time-series data.
result The method accurately predicts upcoming acute hypotensive episodes.
Feature hashing reduces data dimensions while preserving norms, with tight bounds on performance.
problem Understanding the performance of feature hashing with precise parameters.
method Random sparse projection matrix A to reduce dimensions, using m≪n. result Tight asymptotic bounds on the exact tradeoff between parameters x∞/x2,m,ε,δ. Enhances hashing for fast retrieval with correlated bits.
problem Fast retrieval and small memory footprint for large-scale information retrieval.
method Employing Boltzmann machine distribution as variational posterior to model correlations among hash code bits.
result Significant performance gains achieved by effectively modeling correlations among hash code bits.
ForestHash combines random forests and CNNs for efficient data hashing.
problem Efficiently hashing large datasets while preserving similarity.
method Random forests with light-weight CNNs, grouping classes, and information-theoretic aggregation.
result Significantly outperforms state-of-the-art hashing methods for image retrieval.
This paper tackles scalable GLBs with improved online computation and hashing methods.
problem Existing GLBs scale poorly with time and number of arms, limiting practical applications.
method Proposes new scalable algorithms for GLBs with constant space and time complexity, and sublinear time complexity for large number of arms.
result Developed algorithms with improved time and memory complexity, and a new hash-amenable algorithm with better accuracy.
Hashing converts continuous graph attributes to discrete labels for scalable graph kernel computation.
problem Handling graphs with continuous attributes using scalable kernels.
method Hash graph kernels derived from discrete kernels using randomized hash functions.
result Hash graph kernels are scalable and effective for graphs with continuous attributes.
FSL-BM improves real-time classification with fuzzy logic and binary meta-features.
problem Real-time classification accuracy, memory consumption, and time complexity.
method FSL-BM integrates fuzzy logic, binary meta-features, Hamming Distance, and Hash function for efficient supervised learning.
result FSL-BM provides faster and more accurate real-time classification compared to existing algorithms.
PHAZE framework uses zkML and hashing for fast, verifiable LHC trigger decisions.
problem Inefficient inference on large machine learning models for LHC trigger performance.
method Cryptographic techniques like hashing and zkML for low latency, certifiable inference.
result Achieves nanosecond-order latency for LHC triggers, enabling dynamic low-level triggers.
Binary Hashing is widely used for effective approximate nearest neighbors search. Even though various binary hashing methods have been proposed, very few methods are feasible for extremely high-dimensional features often used in visual tasks today. We propose a novel highly sparse linear hashing method based on pairwis…