A Gentle Introduction to the Kernel Distance

Abstract

This document reviews the definition of the kernel distance, providing a gentle introduction tailored to a reader with background in theoretical computer science, but limited exposure to technology more common to machine learning, functional analysis and geometric measure theory. The key aspect of the kernel distance developed here is its interpretation as an L_2 distance between probability measures or various shapes (e.g. point sets, curves, surfaces) embedded in a vector space (specifically an RKHS). This structure enables several elegant and efficient solutions to data analysis problems. We conclude with a glimpse into the mathematical underpinnings of this measure, highlighting its recent independent evolution in two separate fields.

References in corpus (1)

• Comparing Distributions and Shapes using the Kernel Distance

Cited by in corpus (9)

• Geometric Inference on Kernel Density Estimates
• The Kernel-SME Filter for Multiple Target Tracking
• A Multi-Scale Spatial Model for RSS-based Device-Free Localization
• The Initial Properties of Young Star Clusters in M83
• Improving Vehicle Re-Identification using CNN Latent Spaces: Metrics Comparison and Track-to-track Extension
• Comparing Distributions and Shapes using the Kernel Distance
• The GaussianSketch for Almost Relative Error Kernel Distance
• A Critical Reexamination of Intra-List Distance and Dispersion
• Soft and subspace robust multivariate rank tests based on entropy regularized optimal transport