Related papers: Structure of average distance minimizers in genera…
In this paper, we consider the one-dimensional interaction energy $\frac{1}{2}\int_{\mathbb{R}}(W*\rho)(x)d\rho(x) + \int_{\mathbb{R}}U(x)d\rho(x)$ where the interaction potential $W(x)= -\frac{|x|^b}{b},\,1\le b \le 2$ and the external…
We study an isoperimetric problem described by a functional that consists of the standard Gaussian perimeter and the norm of the barycenter. This second term has a repulsive effect, and it is in competition with the perimeter. Because of…
Persistence diagrams (PDs) are used as signatures of point cloud data. Two clouds of points can be compared using the bottleneck distance d_B between their PDs. A potential drawback of this pipeline is that point clouds sampled from…
For arbitrary two probability measures on real d-space with given means and variances (covariance matrices), we provide lower bounds for their total variation distance. In the one-dimensional case, a tight bound is given.
Let X be a normed space. A subset A of X is approximately convex if $d(ta+(1-t)b,A) \le 1$ for all $a,b \in A$ and $t \in [0,1]$ where $d(x,A)$ is the distance of $x$ to $A$. Let $\Co(A)$ be the convex hull and $\diam(A)$ the diameter of…
We introduce and study the minimum distance function of a graded ideal in a polynomial ring with coefficients in a field, and show that it generalizes the minimum distance of projective Reed-Muller-type codes over finite fields. This gives…
Upper bounds for the $L_p$-discrepancies of point distributions in compact metric measure spaces for $0<p\le\infty$ have been established in the paper [6] by Brandolini, Chen, Colzani, Gigante and Travaglini. In the present paper we show…
Obtaining guarantees on the convergence of the minimizers of empirical risks to the ones of the true risk is a fundamental matter in statistical learning. Instead of deriving guarantees on the usual estimation error, the goal of this paper…
The support measures of a convex body are a common generalization of the curvature measures and the area measures. With respect to the Hausdorff metric on the space of convex bodies, they are weakly continuous. We provide a quantitative…
We solve the problem of best approximation by partial isometries of given rank to an arbitrary rectangular matrix, when the distance is measured in any unitarily invariant norm. In the case where the norm is strictly convex, we parametrize…
Rotation Averaging is a non-convex optimization problem that determines orientations of a collection of cameras from their images of a 3D scene. The problem has been studied using a variety of distances and robustifiers. The intrinsic (or…
We investigate the average minimum cost of a bipartite matching between two samples of n independent random points uniformly distributed on a unit cube in d $\ge$ 3 dimensions, where the matching cost between two points is given by any…
Using probabilistic ideas, we prove that the packing dimension of a mean porous measure is strictly smaller than the dimension of the ambient space. Moreover, we give an explicit bound for the packing dimension, which is asymptotically…
The design of a metric between probability distributions is a longstanding problem motivated by numerous applications in Machine Learning. Focusing on continuous probability distributions on the Euclidean space $\mathbb{R}^d$, we introduce…
We prove that for any $E\subset{\Bbb R}^2$, $\dim_{\mathcal{H}}(E)>1$, there exists $x\in E$ such that the Hausdorff dimension of the pinned distance set $$\Delta_x(E)=\{|x-y|: y \in E\}$$ is no less than…
Let $G$ be a connected unimodular group equipped with a (left and hence right) Haar measure $\mu_G$, and suppose $A, B \subseteq G$ are nonempty and compact. An inequality by Kemperman gives us…
We introduce a new distance, a Lipschitz-Prokhorov distance $d_{LP}$, on the set $\mathcal {PM}$ of isomorphism classes of pairs $(X, P)$ where $X$ is a compact metric space and $P$ is the law of a continuous stochastic process on $X$. We…
The hypothesis that high dimensional data tend to lie in the vicinity of a low dimensional manifold is the basis of manifold learning. The goal of this paper is to develop an algorithm (with accompanying complexity guarantees) for fitting a…
Given a sample of i.i.d. high-dimensional centered random vectors, we consider a problem of estimation of their covariance matrix $\Sigma$ with an additional assumption that $\Sigma$ can be represented as a sum of a few Kronecker products…
In this paper, we use algorithmic tools, effective dimension and Kolmogorov complexity, to study the fractal dimension of distance sets. We show that, for any analytic set $E\subseteq\R^2$ of Hausdorff dimension strictly greater than one,…