Random Feature Maps for Dot Product Kernels
read the original abstract
Approximating non-linear kernels using feature maps has gained a lot of interest in recent years due to applications in reducing training and testing times of SVM classifiers and other kernel based learning algorithms. We extend this line of work and present low distortion embeddings for dot product kernels into linear Euclidean spaces. We base our results on a classical result in harmonic analysis characterizing all dot product kernels and use it to define randomized feature maps into explicit low dimensional Euclidean spaces in which the native dot product provides an approximation to the dot product kernel with high confidence.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
An Optimisation Framework for the Well-Conditioned Training of Physics-Informed Neural Networks
DSGNAR optimization framework for PINNs reaches relative L2 errors of 3e-16 in double precision and improves prior results by 5-8 orders of magnitude on Burgers' and high-dimensional Poisson problems while remaining faster.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.