Relative concentration bounds for the kernel matrix spectrum

12/05/2018
by   Ernesto Araya Valdivia, et al.
0

In this paper, we study the concentration properties of the kernel matrix associated to a kernel function. Specifically, we derive new concentration inequalities for the spectrum of an kernel matrix, quantifying its deviation with respect to an associated integral operator. The main difference with most results in the literature is that we do not assume the positive definiteness of the kernel. Instead, we introduce Sobolev type hypothesis on the regularity of the kernel. We show how this is well suited to the study of kernels depending only on the distance between two points in a metric space, in which case the regularity depends only on the decay of the eigenvalues. This is connected with geometric random graphs, which we study further, exhibiting explicit formulas for the spectrum and its fluctuation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/14/2012

New Probabilistic Bounds on Eigenvalues and Eigenvectors of Random Kernel Matrices

Kernel methods are successful approaches for different machine learning ...
research
08/30/2012

An Improved Bound for the Nystrom Method for Large Eigengap

We develop an improved bound for the approximation error of the Nyström ...
research
01/10/2018

Approximation beats concentration? An approximation view on inference with smooth radial kernels

Positive definite kernels and their associated Reproducing Kernel Hilber...
research
04/11/2018

Weighted Poincaré inequalities, concentration inequalities and tail bounds related to the behavior of the Stein kernel in dimension one

We investigate the links between the so-called Stein's density approach ...
research
09/07/2009

Kernels for Measures Defined on the Gram Matrix of their Support

We present in this work a new family of kernels to compare positive meas...
research
09/07/2019

Concentration of kernel matrices with application to kernel spectral clustering

We study the concentration of random kernel matrices around their mean. ...
research
06/18/2019

Kernel quadrature with DPPs

We study quadrature rules for functions living in an RKHS, using nodes s...

Please sign up or login with your details

Forgot password? Click here to reset