Related papers: How many moments does MMD compare?
Consider a set $P$ of $n$ points picked uniformly and independently from $[0,1]^d$ for a constant dimension $d$ -- such a point set is extremely well behaved in many aspects. For example, for a fixed $r \in [0,1]$, we prove a new…
Although recovering an Euclidean distance matrix from noisy observations is a common problem in practice, how well this could be done remains largely unknown. To fill in this void, we study a simple distance matrix estimate based upon the…
Persistence diagrams (PDs) play a key role in topological data analysis (TDA), in which they are routinely used to describe topological properties of complicated shapes. PDs enjoy strong stability properties and have proven their utility in…
Kernel Stein discrepancy (KSD) is a widely used kernel-based measure of discrepancy between probability measures. It is often employed in the scenario where a user has a collection of samples from a candidate probability measure and wishes…
Among dissimilarities between probability distributions, the Kernel Stein Discrepancy (KSD) has received much interest recently. We investigate the properties of its Wasserstein gradient flow to approximate a target probability distribution…
We analyse the performance of several iterative algorithms for the quantisation of a probability measure $\mu$, based on the minimisation of a Maximum Mean Discrepancy (MMD). Our analysis includes kernel herding, greedy MMD minimisation and…
Recently, a new distance has been introduced for the graphs of two point-to-set operators, one of which is maximally monotone. When both operators are the subdifferential of a proper lower semicontinuous convex function, this distance…
Kernel smoothers are considered near the boundary of the interval. Kernels which minimize the expected mean square error are derived. These kernels are equivalent to using a linear weighting function in the local polynomial regression. It…
Traditional measures of smoothness often fail to provide accurate $L_p$-error estimates for approximation by sampling or interpolation operators, especially for functions with low smoothness. To address this issue, we introduce a modified…
In this article we study the field of Hilbertian metrics and positive definit (pd) kernels on probability measures, they have a real interest in kernel methods. Firstly we will make a study based on the Alpha-Beta-divergence to have a…
For a limited range of indices $p$, we obtain $L^p(\mathbb{R}^n)$ boundedness for singular integral operators whose kernels satisfy a condition weaker than the typical H\"ormander smoothness estimate. These operators are assumed to be…
We study singular integral operators with kernels that are more singular than standard Calder\'on-Zygmund kernels, but less singular than bi-parameter product Calder\'on-Zygmund kernels. These kernels arise as restrictions to two dimensions…
We are interested in mesh-free formulas based on the Monte-Carlo methodology for the approximation of multi-dimensional integrals, and we investigate their accuracy when the functions belong to a reproducing-kernel space. A kernel typically…
In this work sufficient conditions on the order of the symbol are developed to ensure boundedness, compactness and r-nuclearity of pseudo-differential operators in $\hbar\mathbb{Z}^n$. In addition, these conditions allow us to obtain growth…
The widespread adoption of the \emph{maximum mean discrepancy} (MMD) in goodness-of-fit testing has spurred extensive research on its statistical performance. However, recent studies indicate that the inherent structure of MMD may constrain…
We study maximal averages associated with singular measures on $\rr$. Our main result is a construction of singular Cantor-type measures supported on sets of Hausdorff dimension $1 - \epsilon$, $0 \leq \epsilon < {1/3}$ for which the…
We shall consider the truncated singular integral operators T_{\mu, K}^{\epsilon}f(x)=\int_{\mathbb{R}^{n}\setminus B(x,\epsilon)}K(x-y)f(y)d\mu y and related maximal operators $T_{\mu,K}^{\ast}f(x)=\underset{\epsilon >0}{\sup}|…
We consider kernels of discrete convolution operators or, equivalently, homogeneous solutions of partial difference operators and show that these solutions always have to be exponential polynomials. The respective polynomial space in…
Motivated by the increasing availability of low- and mixed-precision arithmetic on modern hardware, we develop mixed-precision variants of Lloyd's algorithm for k-means clustering. The main ingredient is a family of mixed-precision kernels…
Maximum mean discrepancy (MMD) has been widely employed to measure the distance between probability distributions. In this paper, we propose using MMD to solve continuous multi-objective optimization problems (MOPs). For solving MOPs, a…