Metraipolis › archive › dc_cb58b704d4db
A General Kernel Framework for Non-CND Distance Measures Using |D|-Dimensional Sparse Landmark Embeddings — arXiv:2609.19083
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.19083
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T15:08:13.933Z
- SHA-256 of the archived text
82e07519b16120ad9c6fe42ef8c0b0f4ecf3b050f7f3528b1b20a88323556aa9- Stable URL of this page
https://metraipolis.com/documento/dc_cb58b704d4db
How to cite
A General Kernel Framework for Non-CND Distance Measures Using |D|-Dimensional Sparse Landmark Embeddings — arXiv:2609.19083 — arXiv (en), https://arxiv.org/abs/2609.19083 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cb58b704d4db (Metraipolis archive dc_cb58b704d4db, sha256 82e07519b16120ad9c6fe42ef8c0b0f4ecf3b050f7f3528b1b20a88323556aa9)
BibTeX
@misc{dccb58b704d4db,
title = {A General Kernel Framework for Non-CND Distance Measures Using |D|-Dimensional Sparse Landmark Embeddings — arXiv:2609.19083},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.19083},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cb58b704d4db; sha256 82e07519b16120ad9c6fe42ef8c0b0f4ecf3b050f7f3528b1b20a88323556aa9},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.19083. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Kernel methods, and Gaussian Processes (GPs) in particular, require a Hilbertian distance measure---one whose square is conditionally negative definite (CND)---to guarantee positive semi-definiteness (PSD) of the kernel matrix; a condition that fails for many natural input spaces, including smooth manifolds and spaces of probability distributions. We propose the Sparse Landmark Embedding (SLE) kernel, which eliminates this requirement entirely. Each input is embedded into a sparse feature vector via compactly supported bump functions centered at all |D| training points; applying any standard PSD kernel in this embedding space yields a kernel that is provably PSD for arbitrary distance measures. The compact support automatically controls embedding sparsity, keeping kernel matrices well-conditioned and computationally tractable despite the high ambient dimension. We provide theoretical guarantees on PSD, sparsity, stability, and universal approximation, and demonstrate, using geodesic and Wasserstein distances, that the SLE kernel matches or substantially exceeds domain-specific baselines in both predictive accuracy and uncertainty quantification. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-17 in cs.LG). Categorie arXiv: Machine Learning (stat.ML) ; Machine Learning (cs.LG); Probability (math.PR). Pagina del lavoro: https://arxiv.org/abs/2609.19083 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-15T14:08:19.295Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).