Related papers: Kronecker-product random matrices and a matrix lea…
In this paper, we study the asymptotic properties of regularized least squares with indefinite kernels in reproducing kernel Krein spaces (RKKS). By introducing a bounded hyper-sphere constraint to such non-convex regularized risk…
This paper presents a new method for estimating high dimensional covariance matrices. The method, permuted rank-penalized least-squares (PRLS), is based on a Kronecker product series expansion of the true covariance matrix. Assuming an…
Let $x_i$, $i\in\mathbb{Z}$ be a sequence of i.i.d. standard normal random variables. Consider rectangular Toeplitz $\mathbf{X}=\left(x_{j-i}\right)_{1\leq i\leq p,1\leq j\leq n}$ and circulant $\mathbf{X}=\left(x_{(j-i)\mod…
An equation is obtained for the Stieltjes transform of the normalized distribution of singular values of non-symmetric band random matrices in the limit when the band width and rank of the matrix simultaneously tend to infinity. Conditions…
Since the seminal work of Keating and Snaith, the characteristic polynomial of a random Haar-distributed unitary matrix has seen several of its functional studied or turned into a conjecture; for instance: $ \bullet $ its value in $1$…
Assume a finite set of complex random variables form a determinantal point process, we obtain a theorem on the limit of the empirical distribution of these random variables. The result is applied to %We study the limits of the empirical…
We present a polynomial time algorithm to approximately scale tensors of any format to arbitrary prescribed marginals (whenever possible). This unifies and generalizes a sequence of past works on matrix, operator and tensor scaling. Our…
We analyze statistical features of the ``optimization landscape'' in a random version of one of the simplest constrained optimization problems of the least-square type: finding the best approximation for the solution of an overcomplete…
We consider sample covariance matrices of the form $X^*X$, where $X$ is an $M \times N$ matrix with independent random entries. We prove the isotropic local Marchenko-Pastur law, i.e. we prove that the resolvent $(X^* X - z)^{-1}$ converges…
We study the problem of efficiently correcting an erroneous product of two $n\times n$ matrices over a ring. Among other things, we provide a randomized algorithm for correcting a matrix product with at most $k$ erroneous entries running in…
Kronecker product covariance structure provides an efficient way to modeling the inter-correlations of matrix-variate data. In this paper, we propose testing statistics for Kronecker product covariance matrix based on linear spectral…
We investigate the relation between the spectrum of a non-normal matrix and the norm of its resolvent. We provide spectral estimates for the resolvent of matrices whose largest singular value is bounded by $1$ (so-called Hilbert space…
Covariance estimation for matrix-valued data has received an increasing interest in applications. Unlike previous works that rely heavily on matrix normal distribution assumption and the requirement of fixed matrix size, we propose a class…
We consider the random matrix model with external source, in case where the potential V(x) is an even polynomial and the external source has two eigenvalues a, -a of equal multiplicity. We show that the limiting mean eigenvalue distribution…
We consider the problem of minimizing the lowest eigenvalue of the Schr\"odinger operator $-\Delta+V$ in $L^2(\mathbb R^d)$ when the integral $\int e^{-tV}\,dx$ is given for some $t>0$. We show that the eigenvalue is minimal for the…
We study the Gaussian and robust covariance estimation, assuming the true covariance matrix to be a Kronecker product of two lower dimensional square matrices. In both settings we define the estimators as solutions to the constrained…
We determine the border ranks of tensors that could potentially advance the known upper bound for the exponent $\omega$ of matrix multiplication. The Kronecker square of the small $q=2$ Coppersmith-Winograd tensor equals the $3\times 3$…
We consider a random symmetric matrix ${\bf X} = [X_{jk}]_{j,k=1}^n$ with upper triangular entries being independent identically distributed random variables with mean zero and unit variance. We additionally suppose that $\mathbb E…
For an $n\times n$ diagonally dominant matrix $T=(t_{i,j})_{n\times n}$ with positive elements satisfying certain bounding conditions, we propose to use a diagonal matrix $S=(s_{i,j})_{n\times n}$ to approximate the inverse of $T$, where…
Consider the linear equation $\mathbf{A}\mathbf{x}=\mathbf{y}$, where $\mathbf{A}$ is a $k\times N$-matrix, $\mathbf{x}\in\mathcal{K}\subset \mathbb{R}^N$ and $\mathbf{y}\in\mathbb{R}^M$ a given vector. When $\mathcal{K}$ is a convex set…