Related papers: Gaussian Approximation for High-Dimensional $U$-st…
The density deconvolution problem involves recovering a target density g from a sample that has been corrupted by noise. From the perspective of Le Cam's local asymptotic normality theory, we show that non-parametric density deconvolution…
In this paper, we introduce a novel bond-based peridynamic model that utilizes a Gaussian kernel function. Previous peridynamic models, when directly discretized, have exhibited a lack of asymptotically compatibility with their…
We propose a new \textit{quadratic programming-based} method of approximating a nonstandard density using a multivariate Gaussian density. Such nonstandard densities usually arise while developing posterior samplers for unobserved…
The accuracy and effectiveness of Hermite spectral methods for the numerical discretization of partial differential equations on unbounded domains, are strongly affected by the amplitude of the Gaussian weight function employed to describe…
Kernel methods are one of the mainstays of machine learning, but the problem of kernel learning remains challenging, with only a few heuristics and very little theory. This is of particular importance in methods based on estimation of…
We consider nonparametric estimation of the derivative of a probability density function with the bounded support on $[0,\infty)$. Estimates are looked up in the class of estimates with asymmetric gamma kernel functions. The use of gamma…
Consider a Gaussian nonparametric regression problem having both an unknown mean function and unknown variance function. This article presents a class of difference-based kernel estimators for the variance function. Optimal convergence…
The paper considers so-called adaptive estimations of regression, distribution density and spectral density of a Gaussian stationary sequence, asymptotically optimal in order at a growing number of observation on any regular subspace…
We consider the nonparametric regression estimation problem of recovering an unknown response function f on the basis of spatially inhomogeneous data when the design points follow a known compactly supported density g with a finite number…
We give an order-explicit large deviation bound for the difference between a high-dimensional $U$-statistic and its H\'{a}jek projection. In particular, we show that any $U$-statistic of order $b$ on $n$ observations, with a $d$-dimensional…
The Gaussian kernel plays a central role in machine learning, uncertainty quantification and scattered data approximation, but has received relatively little attention from a numerical analysis standpoint. The basic problem of finding an…
Kernel density estimation, a.k.a. Parzen windows, is a popular density estimation method, which can be used for outlier detection or clustering. With multivariate data, its performance is heavily reliant on the metric used within the…
Kernel methods have recently attracted resurgent interest, showing performance competitive with deep neural networks in tasks such as speech recognition. The random Fourier features map is a technique commonly used to scale up kernel…
This work studies the problem of estimating a two-dimensional superposition of point sources or spikes from samples of their convolution with a Gaussian kernel. Our results show that minimizing a continuous counterpart of the $\ell_1$ norm…
Hoeffding's U-statistics model combinatorial-type matrix parameters (appearing in CS theory) in a natural way. This paper proposes using these statistics for analyzing random compressed sensing matrices, in the non-asymptotic regime…
A fundamental step in many data-analysis techniques is the construction of an affinity matrix describing similarities between data points. When the data points reside in Euclidean space, a widespread approach is to from an affinity matrix…
Infinite-order U-statistics (IOUS) has been used extensively on subbagging ensemble learning algorithms such as random forests to quantify its uncertainty. While normality results of IOUS have been studied extensively, its variance…
``Benign overfitting'', the ability of certain algorithms to interpolate noisy training data and yet perform well out-of-sample, has been a topic of considerable recent interest. We show, using a fixed design setup, that an important class…
We derive sharp, local and dimension dependent hypercontractive bounds on the Markov kernel of a large class of diffusion semigroups. Unlike the dimension free ones, they capture refined properties of Markov kernels, such as trace…
In this work, we investigate Gaussian Processes indexed by multidimensional distributions. While directly constructing radial positive definite kernels based on the Wasserstein distance has been proven to be possible in the unidimensional…