arXiv (All)
open access
Locality Sensitive Hashing for p-Exponential Kernels with Applications to Density Estimation
A kernel $k(x,y)$ is LSHable if there exists a locality sensitive hashing scheme $H$ such that $k(x,y)=\Pr_{h\sim 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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The General Theory of Localization Methods#1069805
- Gaussian Comparison Theorems for High-Dimensional Posterior Inference#1109838
- Gaussian Approximation for High-Dimensional Weighted and Two-Sample $U$-statistics with Size-Dependent Kernels#1105935
- Sharp Gaussian Mixed-Norm Theory for Fock Spaces#1063032
- FEDRANN: effective long-read overlap detection based on dimensionality reduction and approximate nearest neighbors.#227793
Record · ID 1201187
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive