Approximation of high-dimensional kernel matrices by multilevel circulant matrices
From MaRDI portal
(Redirected from Publication:990819)
Recommendations
- Approximation of kernel matrices by circulant matrices and its application in kernel selection methods
- Learning in high-dimensional feature spaces using ANOVA-based fast matrix-vector multiplication
- Far-field compression for fast kernel summation methods in high dimensions
- Multidimensional butterfly factorization
- Compression, inversion, and approximate PCA of dense kernel matrices at near-linear computational complexity
Cites work
- scientific article; zbMATH DE number 3650737 (Why is no real title available?)
- scientific article; zbMATH DE number 89017 (Why is no real title available?)
- scientific article; zbMATH DE number 3601500 (Why is no real title available?)
- scientific article; zbMATH DE number 1249106 (Why is no real title available?)
- scientific article; zbMATH DE number 1391397 (Why is no real title available?)
- A practical guide to splines
- A unifying approach to some old and new theorems on distribution and clustering
- Approximation of kernel matrices by circulant matrices and its application in kernel selection methods
- Approximation theory in tensor product spaces
- Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
- Kernel techniques: From machine learning to meshless methods
- Learning the kernel function via regularization
- Lectures on Fourier Integrals. (AM-42)
- On a kernel-based method for pattern recognition, regression, approximation, and operator inversion
- Propriétés des matrices ``bien localisées près de leur diagonale et quelques applications. (Properties of matrices ``well localized near the diagonal and some applications)
- Refinable kernels
- Regularization networks and support vector machines
- Reproducing kernel Banach spaces for machine learning
- The optimal recovery of smooth functions
- Theory of Reproducing Kernels
- Universal kernels
Cited in
(10)- Compression, inversion, and approximate PCA of dense kernel matrices at near-linear computational complexity
- Generalized Mercer kernels and reproducing kernel Banach spaces
- Fast kernel summation in high dimensions via slicing and Fourier transforms
- Learning in high-dimensional feature spaces using ANOVA-based fast matrix-vector multiplication
- Far-field compression for fast kernel summation methods in high dimensions
- High-dimensional approximation with kernel-based multilevel methods on sparse grids
- Reproducing kernel Banach spaces with the \(\ell^{1}\) norm. II: Error analysis for regularized least square regression
- Approximation of kernel matrices by circulant matrices and its application in kernel selection methods
- Fast Deterministic Approximation of Symmetric Indefinite Kernel Matrices with High Dimensional Datasets
- On the minimal polynomials and the inverses of multilevel scaled factor circulant matrices
This page was built for publication: Approximation of high-dimensional kernel matrices by multilevel circulant matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990819)
