Hierarchically compositional kernels for scalable nonparametric learning
From MaRDI portal
Recommendations
Cites work
- A matrix version of the fast multipole method
- A matrix-free approach for solving the parametric Gaussian process maximum likelihood problem
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Anatomy of high-performance matrix multiplication
- ASKIT: an efficient, parallel library for high-dimensional kernel summations
- ASKIT: approximate skeletonization kernel-independent treecode in high dimensions
- Covariance tapering for likelihood-based estimation in large spatial data sets
- Extensions of Lipschitz mappings into a Hilbert space
- Fast approximate kNN graph construction for high dimensional data via recursive Lanczos bisection
- Gaussian processes for machine learning.
- Geostatistics. Modeling spatial uncertainty.
- scientific article; zbMATH DE number 1804115 (Why is no real title available?)
- scientific article; zbMATH DE number 4010067 (Why is no real title available?)
- scientific article; zbMATH DE number 3583145 (Why is no real title available?)
- scientific article; zbMATH DE number 1209388 (Why is no real title available?)
- scientific article; zbMATH DE number 635657 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 6781341 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Interpolation of scattered data: distance matrices and conditionally positive definite functions
- Interpolation of spatial data. Some theory for kriging
- LAPACK Users' Guide
- Multidimensional binary search trees used for associative searching
- On the Nyström method for approximating a gram matrix for improved kernel-based learning
- On the use of discrete Laplace operator for preconditioning kernel matrices
- Scattered Data Approximation
- Stochastic approximation of score functions for Gaussian processes
- Uncertainty quantification. Theory, implementation, and applications
Cited in
(8)- Faster kernel ridge regression using sketching and preconditioning
- Learning data-adaptive non-parametric kernels
- Block basis factorization for scalable kernel evaluation
- Hierarchical matrix approximation for kernel-based scattered data interpolation
- Factorization, Symmetrization, and Truncated Transformation of Radial Basis Function-GA Stabilized Gaussian Radial Basis Functions
- Scalable computations for nonstationary Gaussian processes
- Iterative kernel regression with preconditioning
- Construction and Monte Carlo estimation of wavelet frames generated by a reproducing kernel
This page was built for publication: Hierarchically compositional kernels for scalable nonparametric learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636971)
