Locality Sensitive Hashing for p-Exponential Kernels with Applications to Density Estimation
cs.DS, cs.CG, cs.LG
Submitted: 2026-10-04
Updated: 2026-10-04
Comments: NeurIPS 2026
Code: https://github.com/gorobarak/pExponentialLSH
License: http://creativecommons.org/licenses/by/4.0/
The gist: A kernel k(x,y) is LSHable if there exists a locality sensitive hashing scheme H such that k(x,y)= h about H[h(x)=h(y)] for all x,y.
Abstract
A kernel k(x,y) is LSHable if there exists a locality sensitive hashing scheme H such that k(x,y)= h about H[h(x)=h(y)] for all x,y. This notion plays a key role in efficient kernel methods in high dimensions. In this work, we show that the p-exponential kernel k(x,y)= (- x-y p) is LSHable in bounded regions for all 1<p at most2. Previously, this was known only for p=1. Our new "mosaic LSH" scheme is based on a Poisson hyperplane process with hyperplanes sampled as 1-biased p-stable vectors, for which we develop efficient sampling procedures. As applications, our results yield new and efficient density estimation methods based on LSHability for those p-exponential kernels.
Sources
- Efficiently Computing Similarities to Private Datasets
- The Mondrian Kernel
- Stable distributions
- Approximate Nearest Neighbor Search in $\ell_p$
- A New Unbiased and Efficient Class of LSH-Based Samplers and Estimators for Partition Function Computation in Log-Linear Models
Related papers
- Cascaded Learned Bloom Filter for Optimizing Model-Filter Size Balance and Fast Rejection
- Computational and Statistical Hardness of Calibration Distance
- Edge-Private Matching Kernels Through Local Decoding
- Tight Bounds for Equivalence Testing with Non-Adaptive Conditional Samples
- Local Node Differential Privacy
- Cheaper by the Batch: Shared Traversal for Genotype Graph Editing