On the Size of the Online Kernel Sparsification Dictionary

06/18/2012
by   Yi Sun, et al.
0

We analyze the size of the dictionary constructed from online kernel sparsification, using a novel formula that expresses the expected determinant of the kernel Gram matrix in terms of the eigenvalues of the covariance operator. Using this formula, we are able to connect the cardinality of the dictionary with the eigen-decay of the covariance operator. In particular, we show that under certain technical conditions, the size of the dictionary will always grow sub-linearly in the number of data points, and, as a consequence, the kernel linear regressor constructed from the resulting dictionary is consistent.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/17/2023

Reduced Kernel Dictionary Learning

In this paper we present new algorithms for training reduced-size nonlin...
research
01/15/2013

Why Size Matters: Feature Coding as Nystrom Sampling

Recently, the computer vision and machine learning community has been in...
research
08/18/2021

Structure Parameter Optimized Kernel Based Online Prediction with a Generalized Optimization Strategy for Nonstationary Time Series

In this paper, sparsification techniques aided online prediction algorit...
research
08/16/2019

Kernel Sketching yields Kernel JL

The main contribution of the paper is to show that Gaussian sketching of...
research
09/03/2023

An analysis of Ermakov-Zolotukhin quadrature using kernels

We study a quadrature, proposed by Ermakov and Zolotukhin in the sixties...
research
07/13/2017

Improving Sparsity in Kernel Adaptive Filters Using a Unit-Norm Dictionary

Kernel adaptive filters, a class of adaptive nonlinear time-series model...
research
06/01/2020

LFTag: A Scalable Visual Fiducial System with Low Spatial Frequency

Visual fiducial systems are a key component of many robotics and AR/VR a...

Please sign up or login with your details

Forgot password? Click here to reset