Signals 4 · free daily AI digest

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

Paper recorded by Signals 4 on 2026-09-16 in cs.LG. Abstract reproduced from arXiv; link to the original below.

Published 2026-09-16 on arXiv · recorded by Signals 4 on 2026-09-17

Category: cs.LG · 机器学习 · first seen 2026-09-17

Abstract

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) ker

Read on arXiv →

#19 most recent of 215 cs.LG papers we have recorded · ↑ newer: Evidence-Grounded Agentic Formulation Development in an Autonomous Lab · ↓ older: Comprehensive reconstruction of collider events with hypergraph repres
Cite this page: A General Kernel Framework for Non-CND Distance Measures Using |D|-Dimensional Sparse Landmark Embeddings: the #19 most recent of 215 cs.LG papers we have recorded (as of 2026-09-16). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/a-general-kernel-framework-for-non-cnd-distance-measures-using-d-dimensional-spa.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable: papers.json
Related: More cs.LG papers · arXiv signals · All papers · Today in AI
Get 4 AI signals a day by email — free.
Subscribe free → See all plans →
Get 4 AI signals a day by email — free
All models · All repos · By company · Daily editions