cs.DSOct 4, 2026

Locality Sensitive Hashing for p-Exponential Kernels with Applications to Density Estimation

Authors: Barak Gorodissky, Tal Wagner

Organizations: Tel Aviv University

Abstract

A kernel k(x,y)k(x,y) is LSHable if there exists a locality sensitive hashing scheme HH such that k(x,y)=Pr⁡h∼H[h(x)=h(y)]k(x,y)=\Pr_{h\sim H}[h(x)=h(y)] for all x,yx,y. This notion plays a key role in efficient kernel methods in high dimensions. In this work, we show that the pp-exponential kernel k(x,y)=exp⁡(−∥x−y∥p)k(x,y)=\exp(-\lVert x-y \rVert_p) is LSHable in bounded regions for all 1<p≤21<p\leq2. Previously, this was known only for p=1p=1. Our new "mosaic LSH" scheme is based on a Poisson hyperplane process with hyperplanes sampled as ℓ1\ell_1-biased pp-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 pp-exponential kernels.

Explore similar work

CardsList
  1. Adaptive Kernel Density Estimation with Pre-training

    May 13, 2026Ruitong Zhang, Ke DengDensity Ratio EstimationKernel Method

  2. A General Kernel Framework for Non-CND Distance Measures Using |D|-Dimensional Sparse Landmark Embeddings

    Sep 16, 2026Marcus M. Noack, Maher B. Alghalayini, Mark D. RisserKernel MethodSpherical Latent Space

  3. Sublinear Sketches for Approximate Nearest Neighbor and Kernel Density Estimation

    Oct 27, 2025Ved Danait, Srijan Das, Sujoy BhoreApproximate Nearest-Neighbor SearchKernel Method