Fully Symmetric Kernel Quadrature
From MaRDI portal
Publication:4607640
Abstract: Kernel quadratures and other kernel-based approximation methods typically suffer from prohibitive cubic time and quadratic space complexity in the number of function evaluations. The problem arises because a system of linear equations needs to be solved. In this article we show that the weights of a kernel quadrature rule can be computed efficiently and exactly for up to tens of millions of nodes if the kernel, integration domain, and measure are fully symmetric and the node set is a union of fully symmetric sets. This is based on the observations that in such a setting there are only as many distinct weights as there are fully symmetric sets and that these weights can be solved from a linear system of equations constructed out of row sums of certain submatrices of the full kernel matrix. We present several numerical examples that show feasibility, both for a large number of nodes and in high dimensions, of the developed fully symmetric kernel quadrature rules. Most prominent of the fully symmetric kernel quadrature rules we propose are those that use sparse grids.
Recommendations
- scientific article; zbMATH DE number 5795783
- Kernel based quadrature on spheres and other homogeneous spaces
- scientific article; zbMATH DE number 3846809
- Peano kernel behaviour and error bounds for symmetric quadrature formulas
- Gaussian kernel quadrature at scaled Gauss-Hermite nodes
- \(k\)-kernel symmetric matrices
- Interior-point methods based on kernel functions for symmetric optimization
- Quasi-convex reproducing kernel meshfree method
- scientific article; zbMATH DE number 3917660
- Symmetry reduction of Fourier kernels
Cites work
- scientific article; zbMATH DE number 3854294 (Why is no real title available?)
- scientific article; zbMATH DE number 4098703 (Why is no real title available?)
- scientific article; zbMATH DE number 3583145 (Why is no real title available?)
- scientific article; zbMATH DE number 1215244 (Why is no real title available?)
- scientific article; zbMATH DE number 1069610 (Why is no real title available?)
- scientific article; zbMATH DE number 1126861 (Why is no real title available?)
- scientific article; zbMATH DE number 6827443 (Why is no real title available?)
- scientific article; zbMATH DE number 749518 (Why is no real title available?)
- scientific article; zbMATH DE number 5055767 (Why is no real title available?)
- scientific article; zbMATH DE number 3321507 (Why is no real title available?)
- A dimension adaptive sparse grid combination technique for machine learning
- A stochastic algorithm for high-dimensional integrals over unbounded regions with Gaussian weight
- Algorithm 847
- An algorithm for selecting a good value for the parameter \(c\) in radial basis function interpolation
- Average-case analysis of numerical problems
- Bayes-Hermite quadrature
- Bayesian Probabilistic Numerical Methods
- Construction of fully symmetric numerical integration formulas
- Convergence analysis of deterministic kernel-based quadrature rules in misspecified settings
- Fully Symmetric Interpolatory Rules for Multiple Integrals
- Fully symmetric interpolatory rules for multiple integrals over infinite regions with Gaussian weight
- Gaussian measure in Hilbert space and applications in numerical analysis
- Gaussian processes for machine learning.
- High dimensional integration of smooth functions over cubes
- Higher-Dimensional Integration with Gaussian Weight for Applications in Probabilistic Design
- Multilevel quasi-interpolation on a sparse grid with the Gaussian
- Multilevel sparse kernel-based interpolation
- Numerical cubature on scattered data by radial basis functions
- Numerical integration using sparse grids
- On an interpolatory method for high dimensional integration
- On choosing ``optimal shape parameters for RBF approximation
- On multivariate polynomial interpolation
- Optimal Approximation in Hilbert Spaces with Reproducing Kernel Functions
- Probabilistic numerics and uncertainty in computations
- Scattered Data Approximation
- Simple cubature formulas with high polynomial exactness
- Sparse grid quadrature in high dimensions with applications in finance and insurance
- Sparse grids
- Stochastic Integration Rules for Infinite Regions
- Stochastic collocation methods on unstructured grids in high dimensions via interpolation
- Symmetric integration rules for hypercubes. I. Error coefficients
- Theory of Reproducing Kernels
- Toward real-time pricing of complex financial derivatives
- Tractability of multivariate problems. Volume II: Standard information for functionals.
Cited in
(9)- Probabilistic linear solvers: a unifying view
- On the equivalence between kernel quadrature rules and random feature expansions
- Probabilistic integration: a role in statistical computation?
- Symmetry exploits for Bayesian cubature methods
- On the positivity and magnitudes of Bayesian quadrature weights
- Gaussian kernel quadrature at scaled Gauss-Hermite nodes
- Rejoinder: ``Probabilistic integration: a role in statistical computation?
- Bayesian Probabilistic Numerical Methods
- Optimal Monte Carlo integration on closed manifolds
This page was built for publication: Fully Symmetric Kernel Quadrature
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607640)
