Related papers: Sharp High-dimensional Central Limit Theorems for …
We study the problem of sampling an approximately uniformly random satisfying assignment for atomic constraint satisfaction problems i.e. where each constraint is violated by only one assignment to its variables. Let $p$ denote the maximum…
Concentration inequalities for the sample mean, like those due to Bernstein, Hoeffding, and Bentkus, are valid for any sample size but overly conservative, yielding confidence intervals that are unnecessarily wide. The central limit theorem…
In this article, we are interested in the high dimensional normal approximation of $T_n =\Big(\sum_{i=1}^{n}X_{i1}/\Big(\sqrt{\sum_{i=1}^{n}X_{i1}^2}\Big),\dots,$ $\sum_{i=1}^{n}X_{ip}/\Big(\sqrt{\sum_{i=1}^{n}X_{ip}^2}\Big)\Big)$ in…
In the paper [25], written in collaboration with Gesine Reinert, we proved a universality principle for the Gaussian Wiener chaos. In the present work, we aim at providing an original example of application of this principle in the…
Small regularizers can preserve linear programming solutions exactly. This paper provides the first average-case analysis of exact regularization: with a standard Gaussian cost vector and fixed constraint set, bounds are established for the…
We consider channel coding for Gaussian channels with the recently introduced mean and variance cost constraints. Through matching converse and achievability bounds, we characterize the optimal first- and second-order performance. The main…
In this paper we study constrained subspace approximation problem. Given a set of $n$ points $\{a_1,\ldots,a_n\}$ in $\mathbb{R}^d$, the goal of the {\em subspace approximation} problem is to find a $k$ dimensional subspace that best…
In this paper, we establish the convergence rate in central limit theorem (CLT) for linearly extended negative quadrant dependent (LENQD) random variables (rv's). Under some weak conditions, the rate of normal approximation is shown as…
We study the {\em robust proper learning} of univariate log-concave distributions (over continuous and discrete domains). Given a set of samples drawn from an unknown target distribution, we want to compute a log-concave hypothesis…
We revisit the problem of sampling from a target distribution that has a smooth strongly log-concave density everywhere in $\mathbb R^p$. In this context, if no additional density information is available, the randomized midpoint…
A sum of lognormal random variables (RVs) appears in many problems of science and engineering. For example, it is invloved in computing the distribution of recevied signal and interference powers for radio channels subject to lognormal…
In applied probability, the normal approximation is often used for the distribution of data with assumed additive structure. This tradition is based on the central limit theorem for sums of (independent) random variables. However, it is…
In this paper we provide explicit upper bounds on some distances between the (law of the) output of a random Gaussian NN and (the law of) a random Gaussian vector. Our results concern both shallow random Gaussian neural networks with…
For two convex discs $K$ and $L$, we say that $K$ is $L$-convex if it is equal to the intersection of all translates of $L$ that contain $K$. In $L$-convexity the set $L$ plays a similar role as closed half-spaces do in the classical notion…
Approximating the solution of the nonlinear filtering problem with Gaussian mixtures has been a very popular method since the 1970s. However, the vast majority of such approximations are introduced in an ad-hoc manner without theoretical…
In this paper, under the assumption that the dimension is much larger than the sample size, i.e., $p \asymp n^{\alpha}, \alpha>1,$ we consider the (unnormalized) sample covariance matrices $Q = \Sigma^{1/2} XX^*\Sigma^{1/2}$, where…
Let $X$ be a $d$-dimensional random vector and $X_\theta$ its projection onto the span of a set of orthonormal vectors $\{\theta_1,...,\theta_k\}$. Conditions on the distribution of $X$ are given such that if $\theta$ is chosen according to…
The unadjusted Langevin algorithm is commonly used to sample probability distributions in extremely high-dimensional settings. However, existing analyses of the algorithm for strongly log-concave distributions suggest that, as the dimension…
Gromov--Wasserstein (GW) distances compare graphs, shapes, and point clouds through internal distances, without requiring a common coordinate system. This invariance is powerful, but discrete GW is a nonconvex quadratic optimal transport…
In 2010, Shiffman and Zelditch proved a central limit theorem (CLT) for smooth statistics of Gaussian random zeros in codimension one over compact K\"ahler manifolds. They raised the question of whether this result admits a two-fold…