mlsanityData to 14 Oct 2026

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

arXiv 2610.05174 ↗First posted 4 Oct 2026cs.DS cs.CG cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

A kernel k(x,y) is LSHable if there exists a locality sensitive hashing scheme H such that k(x,y)=Prh~ 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)=exp(-lVert x-y rVertp) is LSHable in bounded regions for all 1<p≤2. 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.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 14 of its 49 references that are in the map. First posted on arXiv 4 Oct 2026.

Builds on

14 of 49 references.

References · 14

  1. 2018Hashing-Based-Estimators for Kernel Density in High Dimensionscited by 33
  2. 2020Kernel Density Estimation through Density Constrained Near Neighbor Searchcited by 29
  3. 2017A New Unbiased and Efficient Class of LSH-Based Samplers and Estimators for Partition Function Computation in Log-Linear Modelscited by 16
  4. 2019Sub-linear RACE Sketches for Approximate Kernel Density Estimation on Streaming Datacited by 14
  5. 2016The Mondrian Kernelcited by 11
  6. 2020Scaling up Kernel Ridge Regression via Locality Sensitive Hashingcited by 9
  7. 2023Fast Private Kernel Density Estimation via Locality Sensitive Quantizationcited by 9
  8. 2024Efficiently Computing Similarities to Private Datasetscited by 9
  9. 2021Faster Kernel Matrix Algebra via Density Estimationcited by 8
  10. 2020Stochastic geometry to generalize the Mondrian Processcited by 7
  11. 2020Strongly local p-norm-cut algorithms for semi-supervised learning and local graph clusteringcited by 6
  12. 2017Solving ℓp!-norm regularization with tensor kernelscited by 3
2 more
  1. 2025Learning from End User Data with Shuffled Differential Privacy over Kernel Densitiescited by 3
  2. 2026Positional LSH: Binary Block Matrix Approximation for Attention with Linear Biasescited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.