Approximation of high-dimensional kernel matrices by multilevel circulant matrices
DOI10.1016/J.JCO.2010.02.003zbMATH Open1197.65045OpenAlexW2010916095MaRDI QIDQ990819FDOQ990819
Authors: Guohui Song, Yuesheng Xu 
Publication date: 1 September 2010
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2010.02.003
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
convergencecirculant matricesfast Fourier transformkernel matricesfast discrete algorithmsfast kernel-based methodsmultilevel circulant matrices
Theory of matrix inversion and generalized inverses (15A09) Numerical methods for discrete and fast Fourier transforms (65T50)
Cites Work
- Regularization networks and support vector machines
- Theory of Reproducing Kernels
- Title not available (Why is that?)
- 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)
- A practical guide to splines
- Title not available (Why is that?)
- Lectures on Fourier Integrals. (AM-42)
- Title not available (Why is that?)
- A unifying approach to some old and new theorems on distribution and clustering
- Reproducing kernel Banach spaces for machine learning
- Learning the kernel function via regularization
- Universal kernels
- Kernel techniques: From machine learning to meshless methods
- Title not available (Why is that?)
- Approximation theory in tensor product spaces
- Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
- Refinable kernels
- On a kernel-based method for pattern recognition, regression, approximation, and operator inversion
- The optimal recovery of smooth functions
- Approximation of kernel matrices by circulant matrices and its application in kernel selection methods
- Title not available (Why is that?)
Cited In (8)
- Generalized Mercer kernels and reproducing kernel Banach spaces
- Compression, inversion, and approximate PCA of dense kernel matrices at near-linear computational complexity
- Far-field compression for fast kernel summation methods in high dimensions
- Fast Deterministic Approximation of Symmetric Indefinite Kernel Matrices with High Dimensional Datasets
- 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
- On the minimal polynomials and the inverses of multilevel scaled factor circulant matrices
- Learning in high-dimensional feature spaces using ANOVA-based fast matrix-vector multiplication
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)
