Related papers: An error bound in the Sudakov-Fernique inequality

We study the problem of estimating the barycenter of a distribution given i.i.d. data in a geodesic space. Assuming an upper curvature bound in Alexandrov's sense and a support condition ensuring the strong geodesic convexity of the…

The Dvoretzky--Kiefer--Wolfowitz--Massart inequality gives a sub-Gaussian tail bound on the supremum norm distance between the empirical distribution function of a random sample and its population counterpart. We provide a short proof of a…

We consider the problem of finding, for a given quadratic measure of non-uniformity of a set of $N$ points (such as $L_2$ star-discrepancy or diaphony), the asymptotic distribution of this discrepancy for truly random points in the limit…

Estimating divergences in a consistent way is of great importance in many machine learning tasks. Although this is a fundamental problem in nonparametric statistics, to the best of our knowledge there has been no finite sample exponential…

Let $Z_1,\ldots,Z_n$ be i.i.d. isotropic random vectors in $\mathbb{R}^p$, and $T \subset \mathbb{R}^p$ be a compact set. A classical line of empirical process theory characterizes the size of the suprema of the quadratic process…

In this paper, we present some asymptotic properties of the normalized inverse-Gaussian process. In particular, when the concentration parameter is large, we establish an analogue of the empirical functional central limit theorem, the…

We systematically investigate quantum algorithms and lower bounds for mean estimation given query access to non-identically distributed samples. On the one hand, we give quantum mean estimators with quadratic quantum speed-up given samples…

We propose and prove an existential theorem for entanglement-assisted asymmetric quantum error correction. Then we demonstrate its superiority over the conventional one.

We propose a consistent estimator of sharp bounds on the variance of the difference-in-means estimator in completely randomized experiments. Generalizing Robins [Stat. Med. 7 (1988) 773-785], our results resolve a well-known identification…

We study boundary non-crossing probabilities $$ P_{f,u} := \mathrm P\big(\forall t\in \mathbb T\ X_t + f(t)\le u(t)\big) $$ for continuous centered Gaussian process $X$ indexed by some arbitrary compact separable metric space $\mathbb T$.…

In the simple quantum hypothesis testing problem, upper bound with asymmetric setting is shown by using a quite useful inequality by Audenaert et al, quant-ph/0610027, which was originally invented for symmetric setting. Using this upper…

The article starts with generalizations of some classical results and new truncation error upper bounds in the sampling theorem for bandlimited stochastic processes. Then, it investigates $L_p([0,T])$ and uniform approximations of…

The method to derive uniform bounds with Gaussian and Rademacher complexities is extended to the case where the sample average is replaced by a nonlinear statistic. Tight bounds are obtained for U-statistics, smoothened L-statistics and…

The problem of binary hypothesis testing between two probability measures is considered. New sharp bounds are derived for the best achievable error probability of such tests based on independent and identically distributed observations.…

This paper presents a saddlepoint approximation of the random-coding union bound of Polyanskiy et al. for i.i.d. random coding over discrete memoryless channels. The approximation is single-letter, and can thus be computed efficiently.…

We present a new method for proving the norm concentration inequality of sub-Gaussian variables. Our proof is based on an averaged version of the moment generating function, termed the averaged moment generating function. Our method applies…

For a wide class of monotonic functions $f$, we develop a Chernoff-style concentration inequality for quadratic forms $Q_f \sim \sum\limits_{i=1}^n f(\eta_i) (Z_i + \delta_i)^2$, where $Z_i \sim N(0,1)$. The inequality is expressed in terms…

This paper derives non-asymptotic error bounds for nonlinear stochastic approximation algorithms in the Wasserstein-$p$ distance. To obtain explicit finite-sample guarantees for the last iterate, we develop a coupling argument that compares…

This paper is devoted to the estimators of the mean that provide strong non-asymptotic guarantees under minimal assumptions on the underlying distribution. The main ideas behind proposed techniques are based on bridging the notions of…

We show how to compute lower bounds for the supremum Bayes error if the class-conditional distributions must satisfy moment constraints, where the supremum is with respect to the unknown class-conditional distributions. Our approach makes…