Randomized sketches for kernels: Fast and optimal non-parametric regression

01/25/2015
by   Yun Yang, et al.
0

Kernel ridge regression (KRR) is a standard method for performing non-parametric regression over reproducing kernel Hilbert spaces. Given n samples, the time and space complexity of computing the KRR estimate scale as O(n^3) and O(n^2) respectively, and so is prohibitive in many cases. We propose approximations of KRR based on m-dimensional randomized sketches of the kernel matrix, and study how small the projection dimension m can be chosen while still preserving minimax optimality of the approximate KRR estimate. For various classes of randomized sketches, including those based on Gaussian and randomized Hadamard matrices, we prove that it suffices to choose the sketch dimension m proportional to the statistical dimension (modulo logarithmic factors). Thus, we obtain fast and minimax optimal approximations to the KRR estimate for non-parametric regression.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/12/2023

On the Optimality of Misspecified Kernel Ridge Regression

In the misspecified kernel ridge regression problem, researchers usually...
research
03/12/2018

Optimal Rates of Sketched-regularized Algorithms for Least-Squares Regression over Hilbert Spaces

We investigate regularized algorithms combining with projection for leas...
research
01/23/2018

Non-parametric sparse additive auto-regressive network models

Consider a multi-variate time series (X_t)_t=0^T where X_t ∈R^d which ma...
research
05/25/2018

Early Stopping for Nonparametric Testing

Early stopping of iterative algorithms is an algorithmic regularization ...
research
11/05/2018

Kernel Conjugate Gradient Methods with Random Projections

We propose and study kernel conjugate gradient methods (KCGM) with rando...
research
08/10/2020

Deterministic error bounds for kernel-based learning techniques under bounded noise

We consider the problem of reconstructing a function from a finite set o...
research
09/24/2021

Estimating Rényi's α-Cross-Entropies in a Matrix-Based Way

Conventional information-theoretic quantities assume access to probabili...

Please sign up or login with your details

Forgot password? Click here to reset