Fast Deterministic Approximation of Symmetric Indefinite Kernel Matrices with High Dimensional Datasets
From MaRDI portal
Recommendations
- Randomized Low-Rank Approximation for Symmetric Indefinite Matrices
- Approximation of high-dimensional kernel matrices by multilevel circulant matrices
- Fast and accurate computation for kernel estimators
- Fast iterative kernel principal component analysis
- scientific article; zbMATH DE number 1928695
- Fast kernel smoothing by a low-rank approximation of the kernel Toeplitz matrix
- Computation of the regression kernel matrix using semidefinite programming
- Indefinite kernels in least squares support vector machines and principal component analysis
- An efficient kernel matrix evaluation measure
Cites work
- scientific article; zbMATH DE number 5797591 (Why is no real title available?)
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 3440485 (Why is no real title available?)
- scientific article; zbMATH DE number 823069 (Why is no real title available?)
- scientific article; zbMATH DE number 6276143 (Why is no real title available?)
- scientific article; zbMATH DE number 3310475 (Why is no real title available?)
- 10.1162/153244303768966085
- Adaptive cross approximation of multivariate functions
- Approximation of boundary element matrices
- CUR matrix decompositions for improved data analysis
- Continuous analogues of matrix factorizations
- Diversity sampling is an implicit regularization for kernel methods
- Eigenvalue problems for exponential-type kernels
- Error estimates for two-dimensional cross approximation
- Hierarchical matrices: algorithms and analysis
- High dimensional polynomial interpolation on sparse grids
- Kernel-independent adaptive construction of \(\mathcal{H}^2\)-matrix approximations
- On the Nyström method for approximating a gram matrix for improved kernel-based learning
- On the fast matrix multiplication in the boundary element method by panel clustering
- On the low-rank approximation by the pivoted Cholesky decomposition
- Pattern recognition and machine learning.
- Point sets and sequences with small discrepancy
- Quasi-Random Sequences and Their Discrepancies
- Revisiting the Nyström method for improved large-scale machine learning
- SMASH: structured matrix approximation by separation and hierarchy.
- Stable computation of multiquadric interpolants for all values of the shape parameter
- Training invariant support vector machines
Cited in
(9)- Posterior covariance structures in Gaussian processes
- Parametric kernel low-rank approximations using tensor train decomposition
- A generalized Nyström method with subspace iteration for low-rank approximations of large-scale nonsymmetric matrices
- An adaptive factorized Nyström preconditioner for regularized kernel matrices
- Accuracy and stability of CUR decompositions with oversampling
- Randomized Low-Rank Approximation for Symmetric Indefinite Matrices
- Efficient training of Gaussian processes with tensor product structure
- Physics-informed distribution transformers via molecular dynamics and deep neural networks
- Fast deterministic approximation of symmetric indefinite kernel matrices with high dimensional datasets
This page was built for publication: Fast Deterministic Approximation of Symmetric Indefinite Kernel Matrices with High Dimensional Datasets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088661)
