Related papers: Noise sensitivity for the top eigenvector of a spa…

Let $\bY =\bR+\bX$ be an $M\times N$ matrix, where $\bR$ is a rectangular diagonal matrix and $\bX$ consists of $i.i.d.$ entries. This is a signal-plus-noise type model. Its signal matrix could be full rank, which is rarely studied in…

In this paper, we study the sparse nonnegative tensor factorization and completion problem from partial and noisy observations for third-order tensors. Because of sparsity and nonnegativity, the underlying tensor is decomposed into the…

According to recent findings [1,2], empirical covariance matrices deduced from financial return series contain such a high amount of noise that, apart from a few large eigenvalues and the corresponding eigenvectors, their structure can…

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…

We consider three different models of sparse random graphs:~undirected and directed Erd\H{o}s-R\'{e}nyi graphs, and random bipartite graph with an equal number of left and right vertices. For such graphs we show that if the edge…

This paper considers the problem of testing for latent structure in large symmetric data matrices. The goal here is to develop statistically principled methodology that is flexible in its applicability, computationally efficient, and…

In this paper, we obtain improved running times for regression and top eigenvector computation for numerically sparse matrices. Given a data matrix $A \in \mathbb{R}^{n \times d}$ where every row $a \in \mathbb{R}^d$ has $\|a\|_2^2 \leq L$…

We consider a $p$-dimensional time series where the dimension $p$ increases with the sample size $n$. The resulting data matrix $X$ follows a stochastic volatility model: each entry consists of a positive random volatility term multiplied…

We obtain general, exact formulas for the overlaps between the eigenvectors of large correlated random matrices, with additive or multiplicative noise. These results have potential applications in many different contexts, from quantum…

Consider a random symmetric matrix with i.i.d.~entries on and above its diagonal that are products of Bernoulli random variables and random variables with sub-Gaussian tails. Such a matrix will be called a sparse Wigner matrix and can be…

This paper deals with symmetric random matrices whose upper diagonal entries are obtained from a linear random field with heavy tailed noise. It is shown that the maximum eigenvalue and the spectral radius of such a random matrix with…

We study the problem of sparse tensor principal component analysis: given a tensor $\pmb Y = \pmb W + \lambda x^{\otimes p}$ with $\pmb W \in \otimes^p\mathbb{R}^n$ having i.i.d. Gaussian entries, the goal is to recover the $k$-sparse unit…

We study the matrix denoising problem of estimating the singular vectors of a rank-$1$ signal corrupted by noise with both column and row correlations. Existing works are either unable to pinpoint the exact asymptotic estimation error or,…

Exact matrix completion and low rank matrix estimation problems has been studied in different underlying conditions. In this work we study exact low-rank completion under non-degenerate noise model. Non-degenerate random noise model has…

In this paper, we propose a cone projected power iteration algorithm to recover the first principal eigenvector from a noisy positive semidefinite matrix. When the true principal eigenvector is assumed to belong to a convex cone, the…

Tensor models play an increasingly prominent role in many fields, notably in machine learning. In several applications, such as community detection, topic modeling and Gaussian mixture learning, one must estimate a low-rank signal from a…

This paper investigates the fundamental limits for detecting a high-dimensional sparse matrix contaminated by white Gaussian noise from both the statistical and computational perspectives. We consider $p\times p$ matrices whose rows and…

For the sparse vector model, we consider estimation of the target vector, of its L2-norm and of the noise variance. We construct adaptive estimators and establish the optimal rates of adaptive estimation when adaptation is considered with…

Using a Bayesian approach, we consider the problem of recovering sparse signals under additive sparse and dense noise. Typically, sparse noise models outliers, impulse bursts or data loss. To handle sparse noise, existing methods…

We consider extremal eigenvalues of sparse random matrices, a class of random matrices including the adjacency matrices of Erd\H{o}s-R\'{e}nyi graphs $\mathcal{G}(N,p)$. Recently, it was shown that the leading order fluctuations of extremal…