Linear-time Algorithms for Pairwise Statistical Problems

no code implementations • NeurIPS 2009 • Parikshit Ram, Dongryeol Lee, William March, Alexander G. Gray

Several key computational bottlenecks in machine learning involve pairwise distance computations, including all-nearest-neighbors (finding the nearest neighbor(s) for each point, e. g. in manifold learning) and kernel summations (e. g. in kernel density estimation or kernel machines).

BIG-bench Machine Learning Density Estimation