ASKIT: An Efficient, Parallel Library for High-Dimensional Kernel Summations

DOI10.1137/15M1026468zbMath1416.65578MaRDI QIDQ2830640

Bo Xiao, George Biros, William B. March, Chenhan D. Yu

Publication date: 28 October 2016

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

zbMATH Keywords

linear algebramachine learningkernel machinestreecodes\(N\)-body methodsrandomized matrix approximation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Parallel algorithms in computer science (68W10) Parallel numerical computation (65Y05) Approximation algorithms (68W25) Packaged methods for numerical algorithms (65Y15)

Related Items

Far-field compression for fast kernel summation methods in high dimensions, Algorithmic patterns for \(\mathcal {H}\)-matrices on many-core processors, Fast Approximation of the Gauss--Newton Hessian Matrix for the Multilayer Perceptron, ASKIT, Unnamed Item

Uses Software

• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• 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 randomized algorithm for the decomposition of matrices
• Kernel methods in machine learning
• Variable kernel density estimation
• A randomized approximate nearest neighbors algorithm
• Fast approximation of the discrete Gauss transform in higher dimensions
• Far-field compression for fast kernel summation methods in high dimensions
• The Fast Generalized Gauss Transform
• Fast Algorithms for Classical Physics
• Randomized Algorithms for Matrices and Data
• Adaptive Sampling and Fast Low-Rank Matrix Approximation
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
• A distributed kernel summation framework for general‐dimension machine learning
• ASKIT: Approximate Skeletonization Kernel-Independent Treecode in High Dimensions
• On the Compression of Low Rank Matrices
• A Fast Summation Tree Code for Matérn Kernel
• Fast monte-carlo algorithms for finding low-rank approximations
• Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
• The Fast Gauss Transform
• A fast algorithm for particle simulations