Related papers: Sharp Matrix Empirical Bernstein Inequalities

We derive in this short article the non-asymptotical non-uniform sharp error estimation for the Bernstein's type approximation of continuous function based on the modern probabilistic apparatus.

We give a distribution-dependent concentration inequality for functions of independent variables. The result extends Bernstein's inequality from sums to more general functions, whose variation in any argument does not depend too much on the…

Random sampling of large Markov matrices with a tunable spectral gap, a nonuniform stationary distribution, and a nondegenerate limiting empirical spectral distribution (ESD) is useful. Fix $c>0$ and $p>0$. Let $A_n$ be the adjacency matrix…

We derive the mean eigenvalue density for symmetric Gaussian random N x N matrices in the limit of large N, with a constraint implying that the row sum of matrix elements should vanish. The result is shown to be equivalent to a result found…

In this paper we first introduce the unified definition of the sharp constant that includes constants in three major problems of approximation theory, such as, inequalities for approximating elements, approximation of individual elements,…

Spectral functions of symmetric matrices -- those depending on matrices only through their eigenvalues -- appear often in optimization. A cornerstone variational analytic tool for studying such functions is a formula relating their…

In several applications, one must estimate a real-valued (symmetric) Toeplitz covariance matrix, typically shifted by the conjugated diagonal matrices of phase progression and phase "calibration" errors. Unlike the Hermitian Toeplitz…

We modify the classical Bernstein's inequality for the sums of independent centered random variables (r.v.) in the terms of relative tails or moments. We built also some examples in order to show the exactness of offered results.

We consider $n\times n$ non-Hermitian random matrices with independent entries and a variance profile, as well as an additive deterministic diagonal deformation. We show that their empirical eigenvalue distribution converges to a limiting…

We propose a second-order accurate method to estimate the eigenvectors of extremely large matrices thereby addressing a problem of relevance to statisticians working in the analysis of very large datasets. More specifically, we show that…

We investigate concentration properties of functions of random vectors with values in the discrete cube, satisfying the stochastic covering property (SCP) or the strong Rayleigh property (SRP). Our result for SCP measures include…

For a sufficiently nice 2 dimensional shape, we define its approximating matrix (or patterned matrix) as a random matrix with iid entries arranged according to a given pattern. For large approximating matrices, we observe that the…

For self-normalized martingales with conditionally symmetric differences, de la Pe\~{n}a [A general class of exponential inequalities for martingales and ratios. Ann. Probab. 27, No.1, 537-564] established the Gaussian type exponential…

For an asymptotically Poincare-Einstein manifold with a lower Ricci curvature bound, we establish a sharp inequality relating the type II Yamabe invariant of the interior and the Yamabe invariant of its conformal infinity

We collect in this note some observations on the role of symmetries in Bayesian inference problems, that can be useful or detrimental depending on the way they act on the signal and on the observations. We emphasize in particular the need…

We consider the problem of writing an arbitrary symmetric matrix as the difference of two positive semidefinite matrices. We start with simple ideas such as eigenvalue decomposition. Then, we develop a simple adaptation of the Cholesky that…

We consider non-Hermitian random matrices $X \in \mathbb{C}^{n \times n}$ with general decaying correlations between their entries. For large $n$, the empirical spectral distribution is well approximated by a deterministic density,…

Let $p \in (0,1/2)$ be fixed, and let $B_n(p)$ be an $n\times n$ random matrix with i.i.d. Bernoulli random variables with mean $p$. We show that for all $t \ge 0$, \[\mathbb{P}[s_n(B_n(p)) \le tn^{-1/2}] \le C_p t + 2n(1-p)^{n} + C_p…

We offer a method to estimate a covariance matrix in the special case that \textit{both} the covariance matrix and the precision matrix are sparse --- a constraint we call double sparsity. The estimation method is maximum likelihood,…

We study discrete-time mirror descent applied to the unregularized empirical risk in matrix sensing. In both the general case of rectangular matrices and the particular case of positive semidefinite matrices, a simple potential-based…