Related papers: Optimal non-gaussian Dvoretzky-Milman embeddings
A comprehensive approach to Sobolev-type embeddings, involving arbitrary rearrangement- invariant norms on the entire Euclidean space R^n, is offered. In particular, the optimal target space in any such embedding is exhibited. Crucial in…
Our first aim is to provide an analog of the Gabriel-Quillen embedding theorem for $n$-exact categories. Also we give an example of an $n$-exact category that is not an $n$-cluster tilting subcategory, and we suggest two possible ways for…
We study the problem of heavy-tailed mean estimation in settings where the variance of the data-generating distribution does not exist. Concretely, given a sample $\mathbf{X} = \{X_i\}_{i = 1}^n$ from a distribution $\mathcal{D}$ over…
In this paper, we consider the distribution of the supremum of non-stationary Gaussian processes, and present a new theoretical result on the asymptotic behaviour of this distribution. Unlike previously known facts in this field, our main…
In this paper, we first briefly review some recent results on the distribution of the maximal eigenvalue of a $(N\times N)$ random matrix drawn from Gaussian ensembles. Next we focus on the Gaussian Unitary Ensemble (GUE) and by suitably…
We study first-order optimization algorithms for computing the barycenter of Gaussian distributions with respect to the optimal transport metric. Although the objective is geodesically non-convex, Riemannian GD empirically converges…
The objective of ordinal embedding is to find a Euclidean representation of a set of abstract items, using only answers to triplet comparisons of the form "Is item $i$ closer to the item $j$ or item $k$?". In recent years, numerous…
Dimension reduction algorithms are a crucial part of many data science pipelines, including data exploration, feature creation and selection, and denoising. Despite their wide utilization, many non-linear dimension reduction algorithms are…
It has recently been established that the numerical solution of ordinary differential equations can be posed as a nonlinear Bayesian inference problem, which can be approximately solved via Gaussian filtering and smoothing, whenever a…
We study the sublinear multivariate mean estimation problem in $d$-dimensional Euclidean space. Specifically, we aim to find the mean $\mu$ of a ground point set $A$, which minimizes the sum of squared Euclidean distances of the points in…
A central result in statistical theory is Pinsker's theorem, which characterizes the minimax rate in the normal means model of nonparametric estimation. In this paper, we present an extension to Pinsker's theorem where estimation is carried…
This paper studies the Gaussian and bootstrap approximations for the probabilities of a non-degenerate U-statistic belonging to the hyperrectangles in $\mathbb{R}^d$ when the dimension $d$ is large. A two-step Gaussian approximation…
We establish the first mathematically rigorous link between Bayesian, variational Bayesian, and ensemble methods. A key step towards this it to reformulate the non-convex optimisation problem typically encountered in deep learning as a…
Gaussian Process regression is a kernel method successfully adopted in many real-life applications. Recently, there is a growing interest on extending this method to non-Euclidean input spaces, like the one considered in this paper,…
The goal of this article is to investigate nontrivial $m$-quasi-Einstein manifolds globally conformal to an $n$-dimensional Euclidean space. By considering such manifolds, whose conformal factors and potential functions are invariant under…
Using the $ku$- and $BP$-theoretic versions of Astey's cobordism obstruction for the existence of smooth Euclidean embeddings of stably almost complex manifolds, we prove that, for $e$ greater than or equal to $\alpha(n)$--the number of…
In this paper, we derive new, nearly optimal bounds for the Gaussian approximation to scaled averages of $n$ independent high-dimensional centered random vectors $X_1,\dots,X_n$ over the class of rectangles in the case when the covariance…
We give the first outlier-robust efficient algorithm for clustering a mixture of $k$ statistically separated d-dimensional Gaussians (k-GMMs). Concretely, our algorithm takes input an $\epsilon$-corrupted sample from a $k$-GMM and whp in…
A general theory is provided delivering convergence of maximal cyclically monotone mappings containing the supports of coupling measures of sequences of pairs of possibly random probability measures on Euclidean space. The theory is based…
We consider the problem of spherical Gaussian Mixture models with $k \geq 3$ components when the components are well separated. A fundamental previous result established that separation of $\Omega(\sqrt{\log k})$ is necessary and sufficient…