Fetching the paper…
Reading the bibliography…
Given a set of points $P\subset \mathbb{R}^{d}$ and a kernel $k$, the Kernel Density Estimate at a point $x\in\mathbb{R}^{d}$ is defined as $\mathrm{KDE}_{P}(x)=\frac{1}{|P|}\sum_{y\in P} k(x,y)$.
Monotone funktionen, stieltjessche integrale und harmonische analyse
S. Bochner · 1933
Earlier work this paper cites.
An Introduction to Probability Theory and Its Applications
W. Feller · 1968
Earlier work this paper cites.
A fast algorithm for particle simulations
L. Greengard and V. Rokhlin · 1987
Earlier work this paper cites.
The fast gauss transform
L. Greengard and J. Strain · 1991
Earlier work this paper cites.
On the learnability of discrete distributions
M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. E. Schapire, and L. Sellie · 1994
Earlier work this paper cites.
The space complexity of approximating the frequency moments
N. Alon, Y. Matias, and M. Szegedy · 1996
Earlier work this paper cites.
Local polynomial modelling and its applications: monographs on statistics and applied probability 66
J. Fan and I. Gijbels · 1996
Earlier work this paper cites.
Guest editors’ introduction: The top 10 algorithms
J. Dongarra and F. Sullivan · 2000
Earlier work this paper cites.
Learning with kernels: support vector machines, regularization, optimization, and beyond
B. Scholkopf and A. J. Smola · 2001
Earlier work this paper cites.
Covering the sphere by equal spherical balls
K. Böröczky Jr and G. Wintsche · 2003
Earlier work this paper cites.
Locality-sensitive hashing scheme based on p-stable distributions
M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni · 2004
Earlier work this paper cites.
A spectral algorithm for learning mixture models
S. Vempala and G. Wang · 2004
Earlier work this paper cites.
Probability and Computing: Randomized algorithms and probabilistic analysis
M. Mitzenmacher and E. Upfal · 2005
Earlier work this paper cites.
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
A. Andoni and P. Indyk · 2006
Earlier work this paper cites.
Dual-tree fast gauss transforms
D. Lee, A. Gray, and A. Moore · 2006
Cited alongside, same era.
Random features for large-scale kernel machines
A. Rahimi and B. Recht · 2007
Cited alongside, same era.
Lower bounds on near neighbor search via metric expansion
R. Panigrahy, K. Talwar, and U. Wieder · 2010
Cited alongside, same era.
Generalized density clustering
A. Rinaldo and L. Wasserman · 2010
Cited alongside, same era.
Bandwidth selection in kernel density estimation: oracle inequalities and adaptive minimax optimality
A. Goldenshluger and O. Lepski · 2011
Cited alongside, same era.
Comparing distributions and shapes using the kernel distance
S. Joshi, R. V. Kommaraji, J. M. Phillips, and S. Venkatasubramanian · 2011
Cited alongside, same era.
Optimal data-dependent hashing for approximate near neighbors
A. Andoni and I. Razenshteyn · 2015
Later among the works it cites.
On the estimation of the gradient lines of a density and the consistency of the mean-shift algorithm
E. Arias-Castro, D. Mason, and B. Pelletier · 2015
Later among the works it cites.
Askit: Approximate skeletonization kernel-independent treecode in high dimensions
W. B. March, B. Xiao, and G. Biros · 2015
Later among the works it cites.
Density level sets: Asymptotics, inference, and visualization
Y.-C. Chen, C. R. Genovese, and L. Wasserman · 2016
Later among the works it cites.
Robust estimators in high dimensions without the computational intractability
I. Diakonikolas, G. Kamath, D. M. Kane, J. Li, A. Moitra, and A. Stewart · 2016
Later among the works it cites.
Agnostic estimation of mean and covariance
K. A. Lai, A. B. Rao, and S. Vempala · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Combinatorial methods in density estimation
L. Devroye and G. Lugosi · 2012
Cited alongside, same era.
Random feature maps for dot product kernels
P. Kar and H. Karnick · 2012
Cited alongside, same era.
Finding correlations in subquadratic time, with applications to learning parities and juntas
G. Valiant · 2012
Cited alongside, same era.
Fast and scalable polynomial kernels via explicit feature maps
N. Pham and R. Pagh · 2013
Cited alongside, same era.
ε \varepsilon -samples for kernels
J. M. Phillips · 2013
Cited alongside, same era.
Efficient density estimation via piecewise polynomial approximation
S.-O. Chan, I. Diakonikolas, R. A. Servedio, and X. Sun · 2014
Cited alongside, same era.
Later among the works it cites.
Sample-optimal density estimation in nearly-linear time
J. Acharya, I. Diakonikolas, J. Li, and L. Schmidt · 2017
Later among the works it cites.
Optimal hashing-based time-space trade-offs for approximate near neighbors
A. Andoni, T. Laarhoven, I. Razenshteyn, and E. Waingarten · 2017
Later among the works it cites.
Faster kernel ridge regression using sketching and preconditioning
H. Avron, K. L. Clarkson, and D. P. Woodruff · 2017
Later among the works it cites.
On the fine-grained complexity of empirical risk minimization: Kernel methods and neural networks
A. Backurs, P. Indyk, and L. Schmidt · 2017
Later among the works it cites.
Hashing-based-estimators for kernel density in high dimensions
M. Charikar and P. Siminelakis · 2017
Later among the works it cites.
Recursive sampling for the nystrom method
C. Musco and C. Musco · 2017
Later among the works it cites.
R. Spring and A. Shrivastava · 2017
Later among the works it cites.
Coresets for kernel regression
Y. Zheng and J. M. Phillips · 2017
Later among the works it cites.