Concentration of kernel matrices with application to kernel spectral clustering
Arash A. Amini, Zahra S. Razaee

TL;DR
This paper establishes nonasymptotic concentration inequalities for random kernel matrices, including Lipschitz and Euclidean kernels, and applies these results to analyze the high-dimensional consistency of kernel spectral clustering.
Contribution
It derives sharp, dimension-free concentration bounds for kernel matrices under broad distributional assumptions and demonstrates their use in proving the consistency of kernel spectral clustering in high dimensions.
Findings
Dimension-free concentration inequalities for Lipschitz kernels.
High-dimensional consistency of kernel spectral clustering.
Applicability to nonparametric mixture models and noisy manifold data.
Abstract
We study the concentration of random kernel matrices around their mean. We derive nonasymptotic exponential concentration inequalities for Lipschitz kernels assuming that the data points are independent draws from a class of multivariate distributions on , including the strongly log-concave distributions under affine transformations. A feature of our result is that the data points need not have identical distributions or zero mean, which is key in certain applications such as clustering. Our bound for the Lipschitz kernels is dimension-free and sharp up to constants. For comparison, we also derive the companion result for the Euclidean (inner product) kernel for a class of sub-Gaussian distributions. A notable difference between the two cases is that, in contrast to the Euclidean kernel, in the Lipschitz case, the concentration inequality does not depend on the mean of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsSpectral Clustering
