Fast High-dimensional Kernel Summations Using the Monte Carlo Multipole Method

By Alexander G. Gray. 2008

38 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Parikshit Ram
2. Samory Kpotufe
3. William B. March
4. Alexander G. Gray
5. Rafael Izbicki
6. Anshumali Shrivastava
7. L. V. D. van der Maaten
8. Barnab'as P'oczos

Citations in the corpus

• Fast, smooth and adaptive regression in metric spaces (2009, methodology): “We note that there exist many heuristics for speeding up kernel regression, which generally combine fast proximity search procedures with other elaborate methods for approximating the kernel weights (see e.g. [13] [14] [15]).”
• Linear-time Algorithms for Pairwise Statistical Problems (2009, methodology): “These dual-tree algorithmshave been shown to be significantly more efficient in practice than the corresponding single-tree algorithms for nearest neighbor se a ch and kernel summations [9, 10, 11].”