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

Please sign up or login with your details

Continue with:
Or login with email
Enter Password
Re-enter Password

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×
Pro

Consider DeepAI Pro

Subscribe to DeepAI Pro
DeepAI Pro
Provides a limited generation allowance each month. When exceeded, you are charged overage rates available at deepai.org/pricing. Also includes an ad-free experience and API access. Renews automatically until canceled. Non-refundable.
Subtotal
Total due today

Payment

Add DeepAI credits
DeepAI credits
One-time purchase. Credits are added to your wallet after payment.
Subtotal
Total due today

Payment