Related papers: Sharp Rates of MMD Empirical Estimation with Power…

Marginal maximum likelihood estimation (MMLE) in item response theory (IRT) is highly sensitive to aberrant responses, such as careless answering and random guessing, which can reduce estimation accuracy. To address this issue, this study…

Estimating the rate of convergence of the empirical measure of an i.i.d. sample to the reference measure is a classical problem in probability theory. Extending recent results of Ambrosio, Stra and Trevisan on 2-dimensional manifolds, in…

We propose a nonparametric two-sample test procedure based on Maximum Mean Discrepancy (MMD) for testing the hypothesis that two samples of functions have the same underlying distribution, using kernels defined on function spaces. This…

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…

We consider a symmetric mixture of linear regressions with random samples from the pairwise comparison design, which can be seen as a noisy version of a type of Euclidean distance geometry problem. We analyze the expectation-maximization…

We characterize the asymptotic performance of nonparametric one- and two-sample testing. The exponential decay rate or error exponent of the type-II error probability is used as the asymptotic performance metric, and an optimal test…

The distribution closeness testing (DCT) assesses whether the distance between a distribution pair is at least $\epsilon$-far. Existing DCT methods mainly measure discrepancies between a distribution pair defined on discrete one-dimensional…

Let $\mu$ be an Ahlfors-David probability measure on $\mathbb{R}^q$, namely, there exist some constants $s_0>0$ and $\epsilon_0,C_1,C_2>0$ such that \[ C_1\epsilon^{s_0}\leq\mu(B(x,\epsilon))\leq…

Let $(X,d,\mu)$ be a $RCD^\ast(K, N)$ space with $K\in \mathbb{R}$ and $N\in [1,\infty]$. For $N\in [1,\infty)$, we derive the upper and lower bounds of the heat kernel on $(X,d,\mu)$ by applying the parabolic Harnack inequality and the…

We introduce kernel thinning, a new procedure for compressing a distribution $\mathbb{P}$ more effectively than i.i.d. sampling or standard thinning. Given a suitable reproducing kernel $\mathbf{k}_{\star}$ and $O(n^2)$ time, kernel…

Distance metrics are central to machine learning, yet distances between ensembles of quantum states remain poorly understood due to fundamental quantum measurement constraints. We introduce a hierarchy of integral probability metrics,…

Nonparametric two sample testing is a decision theoretic problem that involves identifying differences between two random variables without making parametric assumptions about their underlying distributions. We refer to the most common…

Distances between probability distributions are a key component of many statistical machine learning tasks, from two-sample testing to generative modeling, among others. We introduce a novel distance between measures that compares them…

Given an isotropic probability measure $\mu$ on ${\mathbb R}^d$ with ${\rm d}\mu \left( x \right) = {\left( {\varrho \left( x \right)} \right)^{ - \alpha }}{\rm d}x$, where $\alpha > d + 1$ and $\varrho :{{\mathbb R}^d} \to \left( {0, +…

An important feature of kernel mean embeddings (KME) is that the rate of convergence of the empirical KME to the true distribution KME can be bounded independently of the dimension of the space, properties of the distribution and smoothness…

We propose conditional flows of the maximum mean discrepancy (MMD) with the negative distance kernel for posterior sampling and conditional generative modeling. This MMD, which is also known as energy distance, has several advantageous…

We consider the problem of approximating an analytic function on a compact interval from its values at $M+1$ distinct points. When the points are equispaced, a recent result (the so-called impossibility theorem) has shown that the best…

Negative distance kernels $K(x,y) := - \|x-y\|$ were used in the definition of maximum mean discrepancies (MMDs) in statistics and lead to favorable numerical results in various applications. In particular, so-called slicing techniques for…

Let $\Xi$ be the adjacency matrix of an Erd\H{o}s-R\'enyi graph on $n$ vertices and with parameter $p$ and consider $A$ a $n\times n$ centered random symmetric matrix with bounded i.i.d. entries above the diagonal. When the mean degree $np$…

Maximum Mean Discrepancy (MMD) is a widely used concept in machine learning research which has gained popularity in recent years as a highly effective tool for comparing (finite-dimensional) distributions. Since it is designed as a…