Fast kernel summation in high dimensions via slicing and Fourier transforms
From MaRDI portal
Hilbert spaces with reproducing kernels (= (proper) functional Hilbert spaces, including de Branges-Rovnyak and other structured spaces) (46E22) Numerical radial basis function approximation (65D12) Algorithms for approximation of functions (65D15) Numerical methods for discrete and fast Fourier transforms (65T50)
Recommendations
- ASKIT: approximate skeletonization kernel-independent treecode in high dimensions
- Far-field compression for fast kernel summation methods in high dimensions
- Learning in high-dimensional feature spaces using ANOVA-based fast matrix-vector multiplication
- Approximation of high-dimensional kernel matrices by multilevel circulant matrices
- A fast summation tree code for Matérn kernel
Cites work
- A fast algorithm for particle simulations
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- An Improved Fast Multipole Algorithm for Potential Fields on the Line
- ASKIT: approximate skeletonization kernel-independent treecode in high dimensions
- Cramer-Wold auto-encoder
- Dithering by differences of convex functions
- Equivalence of distance-based and RKHS-based statistics in hypothesis testing
- Far-field compression for fast kernel summation methods in high dimensions
- Fast convolution with radial kernels at nonequispaced knots
- Fast evaluation of radial basis functions. I
- Fast Fourier Transforms for Nonequispaced Data
- Fast Gauss transforms with complex parameters using NFFTs
- Fast spatial Gaussian process maximum likelihood estimation via skeletonization factorizations
- Gaussian processes for machine learning.
- Generalization bounds for sparse random feature expansions
- scientific article; zbMATH DE number 438987 (Why is no real title available?)
- scientific article; zbMATH DE number 2015778 (Why is no real title available?)
- Monotone Funktionen, Stieltjessche Integrale und harmonische Analyse.
- NIST handbook of mathematical functions
- Numerical Fourier analysis
- On Estimation of a Probability Density Function and Mode
- On the equivalence between kernel quadrature rules and random feature expansions
- On the fast Fourier transform of functions with singularities
- Probability Inequalities for Sums of Bounded Random Variables
- Remarks on Some Nonparametric Estimates of a Density Function
- Some Extensions of W. Gautschi's Inequalities for the Gamma Function
- Some triple integral equations
- Spherical harmonics and approximations on the unit sphere. An introduction
- Support Vector Machines
- Table of integrals, series, and products. Translated from the Russian. Translation edited and with a preface by Alan Jeffrey and Daniel Zwillinger. With one CD-ROM (Windows, Macintosh and UNIX)
- The Fast Gauss Transform
- Towards a unified analysis of random Fourier features
- Using NFFT 3 -- a software library for various nonequispaced fast Fourier transforms
- Variable transformations in combination with wavelets and ANOVA for high-dimensional approximation
- VECTOR VALUED REPRODUCING KERNEL HILBERT SPACES OF INTEGRABLE FUNCTIONS AND MERCER THEOREM
- Wasserstein steepest descent flows of discrepancies with Riesz kernels
Cited in
(4)- Deep learning for PDE-based inverse problems. Abstracts from the workshop held October 27 -- November 1, 2024
- Slicing of radial functions: a dimension walk in the Fourier space
- Smoothed distance kernels for MMDs and applications in Wasserstein gradient flows
- Kernel interpolation on generalized sparse grids
This page was built for publication: Fast kernel summation in high dimensions via slicing and Fourier transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6655077)
