119 citations · 134 across the 7 of their papers we have counts for
7 papers
An Parallel Fast Direct Solver for Kernel Matrices
Chenhan D. Yu, William B. March, George Biros
Kernel matrices appear in machine learning and non-parametric statistics. Given points in dimensions and a kernel function that requires work to evaluate,…
Inv-ASKIT: A Parallel Fast Diret Solver for Kernel Matrices
Chenhan D. Yu, William B. March, Bo Xiao +1
We present a parallel algorithm for computing the approximate factorization of an -by- kernel matrix. Once this factorization has been constructed (with work),…
Plug-and-play dual-tree algorithm runtime analysis
Ryan R. Curtin, Dongryeol Lee, William B. March +1
Numerous machine learning algorithms contain pairwise statistical problems at their core---that is, tasks that require computations over all pairs of input points if implemented na…
ASKIT: Approximate Skeletonization Kernel-Independent Treecode in High Dimensions
William B. March, Bo Xiao, George Biros
We present a fast algorithm for kernel summation problems in high-dimensions. These problems appear in computational physics, numerical approximation, non-parametric statistics, an…
Far-Field Compression for Fast Kernel Summation Methods in High Dimensions
William B. March, George Biros
We consider fast kernel summations in high dimensions: given a large set of points in dimensions (with ) and a pair-potential function (the {\em kernel} function), we…
Tree-Independent Dual-Tree Algorithms
Ryan R. Curtin, William B. March, Parikshit Ram +3
Dual-tree algorithms are a widely used class of branch-and-bound algorithms. Unfortunately, developing dual-tree algorithms for use with different trees and problems is often compl…