Related papers: Estimates of norms of log-concave random matrices …

This article presents maximum likelihood estimators (MLEs) and log-likelihood ratio (LLR) tests for the eigenvalues and eigenvectors of Gaussian random symmetric matrices of arbitrary dimension, where the observations are independent…

We confirm the conjecture posed by Gu\'edon, Hinrichs, Litvak, and Prochno in 2017 that $\mathbb{E}\|(a_{ij}g_{ij})_{i\le m, j\le n}\colon \ell_p^n \to \ell_q^m\|$ is comparable, up to constants depending only on $p$ and $q$, to \[ \max_i…

Let $K$ be an isotropic convex body in $\R^n$. Given $\eps>0$, how many independent points $X_i$ uniformly distributed on $K$ are needed for the empirical covariance matrix to approximate the identity up to $\eps$ with overwhelming…

We prove an upper bound on the expected $\ell_p$ injective norm of sums of subgaussian random tensors. Our proof is simple and does not rely on any explicit geometric or chaining arguments. Instead, it follows from a simple application of…

In this paper, we study the restricted isometry property of partial random circulant matrices. For a bounded subgaussian generator with independent entries, we prove that the partial random circulant matrices satisfy $s$-order RIP with high…

We consider orthogonally invariant probability measures on $\mathrm{GL}_n(\mathbb{R})$ and compare the mean of the logs of the moduli of eigenvalues of the matrices to the Lyapunov exponents of random matrix products independently drawn…

We study the Restricted Isometry Property of a random matrix $\Gamma$ with independent isotropic log-concave rows. To this end, we introduce a parameter $\Gamma_{k,m}$ that controls uniformly the operator norm of sub-matrices with $k$ rows…

Under reasonable algebraic assumptions and under an infinite second order moment assumption, we show that the logarithm of the norm (log-norm) of a product of random i.i.d. matrices with entries in $\mathbb{R}$ or in any other local field…

This article is concerned with Monte-Carlo methods for the estimation of the trace of an implicitly given matrix $A$ whose information is only available through matrix-vector products. Such a method approximates the trace by an average of…

Let $X_N$ be a symmetric $N\times N$ random matrix whose $\sqrt{N}$-scaled centered entries are uniformly square integrable. We prove that if the entries of $X_N$ can be partitioned into independent subsets each of size $o(\log N)$, then…

We study random matrices with independent subgaussian columns. Assuming each column has a fixed Euclidean norm, we establish conditions under which such matrices act as near-isometries when restricted to a given subset of their domain. We…

We prove two-sided Chevet-type inequalities for independent symmetric Weibull random variables with shape parameter $r\in[1,2]$. We apply them to provide two-sided estimates for operator norms from $\ell_p^n$ to $\ell_q^m$ of random…

We establish upper bounds for tails of order statistics of isotropic log-concave vectors and apply them to derive a concentration of l_r norms of such vectors.

Low-rank matrix completion concerns the problem of estimating unobserved entries in a matrix using a sparse set of observed entries. We consider the non-uniform setting where the observed entries are sampled with highly varying…

We investigate two-sided bounds for operator norms of random matrices with unhomogenous independent entries. We formulate a lower bound for Rademacher matrices and conjecture that it may be reversed up to a universal constant. We show that…

The scalable calculation of matrix determinants has been a bottleneck to the widespread application of many machine learning methods such as determinantal point processes, Gaussian processes, generalised Markov random fields, graph models…

We describe an elementary method to get non-asymptotic estimates for the moments of Hermitian random matrices whose elements are Gaussian independent random variables. As the basic example, we consider the GUE matrices. Immediate…

We present randomized algorithms for estimating the trace and deter- minant of Hermitian positive semi-definite matrices. The algorithms are based on subspace iteration, and access the matrix only through matrix vector products. We analyse…

Given a real matrix A with n columns, the problem is to approximate the Gram product AA^T by c << n weighted outer products of columns of A. Necessary and sufficient conditions for the exact computation of AA^T (in exact arithmetic) from c…

We obtain lower tail estimates for the smallest singular value of random matrices with independent but non-identically distributed entries. Specifically, we consider $n\times n$ matrices with complex entries of the form \[ M = A\circ X + B…