Mercer Large-Scale Kernel Machines from Ridge Function Perspective

07/21/2023
by   Karol Dziedziul, et al.
0

To present Mercer large-scale kernel machines from a ridge function perspective, we recall the results by Lin and Pinkus from Fundamentality of ridge functions. We consider the main theorem of the recent paper by Rachimi and Recht, 2008, Random features for large-scale kernel machines in terms of the Approximation Theory. We study which kernels can be approximated by a sum of cosine function products with arguments depending on x and y and present the obstacles of such an approach. The results of this article may have various applications in Deep Learning, especially in problems related to Image Processing.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/17/2023

Snacks: a fast large-scale kernel SVM solver

Kernel methods provide a powerful framework for non parametric learning....
research
02/26/2019

Efficient online learning with kernels for adversarial large scale problems

We are interested in a framework of online learning with kernels for low...
research
10/22/2019

Kernel computations from large-scale random features obtained by Optical Processing Units

Approximating kernel functions with random features (RFs)has been a succ...
research
11/03/2020

Towards a Unified Quadrature Framework for Large-Scale Kernel Machines

In this paper, we develop a quadrature framework for large-scale kernel ...
research
03/21/2020

Scaling up Kernel Ridge Regression via Locality Sensitive Hashing

Random binning features, introduced in the seminal paper of Rahimi and R...
research
02/06/2023

Toward Large Kernel Models

Recent studies indicate that kernel machines can often perform similarly...
research
11/26/2021

Unsupervised MKL in Multi-layer Kernel Machines

Kernel based Deep Learning using multi-layer kernel machines(MKMs) was p...

Please sign up or login with your details

Forgot password? Click here to reset