Search Results for author:
Found 3 papers, 2 papers with code
Fast Evaluation of Additive Kernels: Feature Arrangement, Fourier Methods, and Kernel Derivatives
We here present a technique based on the non-equispaced fast Fourier transform (NFFT) with rigorous error analysis.
Fast and interpretable Support Vector Classification based on the truncated ANOVA decomposition
In small dimensional settings the Fast Fourier Transform (FFT) and related methods are a powerful tool in order to deal with the considered basis functions.
Learning in High-Dimensional Feature Spaces Using ANOVA-Based Fast Matrix-Vector Multiplication
We propose the use of an ANOVA kernel, where we construct several kernels based on lower-dimensional feature spaces for which we provide fast algorithms realizing the matrix-vector products.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
