ASKIT: Approximate Skeletonization Kernel-Independent Treecode in High Dimensions
From MaRDI portal
Publication:5254484
DOI10.1137/140989546zbMath1320.65196arXiv1410.0260OpenAlexW2962906164MaRDI QIDQ5254484
William B. March, Bo Xiao, George Biros
Publication date: 9 June 2015
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.0260
kernel methodsmachine learning\(N\)-body problemstreecodeskernel independent fast multipole methodsmultiscale matrix approximationsrandomized matrix approximations
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (12)
Randomized numerical linear algebra: Foundations and algorithms ⋮ Far-field compression for fast kernel summation methods in high dimensions ⋮ Linear-Cost Covariance Functions for Gaussian Random Fields ⋮ Training very large scale nonlinear SVMs using alternating direction method of multipliers coupled with the hierarchically semi-separable kernel approximations ⋮ A Fast Tunable Blurring Algorithm for Scattered Data ⋮ An \(O(N \log N)\) hierarchical random compression method for kernel matrices by sampling partial matrix entries ⋮ A Kernel-Independent Treecode Based on Barycentric Lagrange Interpolation ⋮ Interpolative Decomposition via Proxy Points for Kernel Matrices ⋮ Parallel Algorithms for Nearest Neighbor Search Problems in High Dimensions ⋮ ASKIT: An Efficient, Parallel Library for High-Dimensional Kernel Summations ⋮ Learning in high-dimensional feature spaces using ANOVA-based fast matrix-vector multiplication ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- CUR matrix decompositions for improved data analysis
- A kernel-independent adaptive fast multipole algorithm in two and three dimensions
- A high-performance, portable implementation of the MPI message passing interface standard
- The black-box fast multipole method
- Approximation of boundary element matrices
- A fast adaptive multipole algorithm in three dimensions
- Fast approximation of the discrete Gauss transform in higher dimensions
- Far-field compression for fast kernel summation methods in high dimensions
- Randomized algorithms for the low-rank approximation of matrices
- An Accelerated Kernel-Independent Fast Multipole Method in One Dimension
- Fast Directional Multilevel Algorithms for Oscillatory Kernels
- Chaos control using least-squares support vector machines
- A Generalized Fast Multipole Method for Nonoscillatory Kernels
- A distributed kernel summation framework for general‐dimension machine learning
- On the Compression of Low Rank Matrices
- The Fast Gauss Transform
- A fast algorithm for particle simulations
This page was built for publication: ASKIT: Approximate Skeletonization Kernel-Independent Treecode in High Dimensions