Related papers: Sparse Hanson-Wright Inequalities with Application…
We derive explicit Bernstein-type and Bennett-type concentration inequalities for matrix-valued martingale processes with unbounded observations from the Hermitian space $\mathbb{H}(d)$. Specifically, we assume that the…
Random feature methods have been successful in various machine learning tasks, are easy to compute, and come with theoretical accuracy bounds. They serve as an alternative approach to standard neural networks since they can represent…
The unadjusted Langevin algorithm is widely used for sampling from complex high-dimensional distributions. It is well known to be biased, with the bias typically scaling linearly with the dimension when measured in squared Wasserstein…
We consider $N\times N$ self-adjoint Gaussian random matrices defined by an arbitrary deterministic sparsity pattern with $d$ nonzero entries per row. We show that such random matrices exhibit a canonical localization-delocalization…
We present two sharp, closed-form empirical Bernstein inequalities for symmetric random matrices with bounded eigenvalues. By sharp, we mean that both inequalities adapt to the unknown variance in a tight manner: the deviation captured by…
In this paper, we prove the restricted isometry property of block diagonal random matrices with elements from $\varphi$-sub-Gaussian variables, which extends the previously known results for the sub-Gaussian case. A crucial ingredient of…
We introduce a randomly extrapolated primal-dual coordinate descent method that adapts to sparsity of the data matrix and the favorable structures of the objective function. Our method updates only a subset of primal and dual variables with…
We consider a sparse linear regression model with unknown symmetric error under the high-dimensional setting. The true error distribution is assumed to belong to the locally $\beta$-H\"{o}lder class with an exponentially decreasing tail,…
Consider a $n\times n$ sparse non-Hermitian random matrix $X_n$ defined as the Hadamard product between a random matrix with centered independent and identically distributed entries and a sparse Bernoulli matrix with success probability…
Sparse graphs with bounded average degree form a rich class of discrete structures where local geometry strongly influences global behavior. The Benjamini-Schramm (BS) convergence offers a natural framework to describe their asymptotic…
In this paper, we propose a novel nonconvex approach to robust principal component analysis for HSI denoising, which focuses on simultaneously developing more accurate approximations to both rank and column-wise sparsity for the low-rank…
Sparse non-Hermitian random matrices arise in the study of disordered physical systems with asymmetric local interactions, and have applications ranging from neural networks to ecosystem dynamics. The spectral characteristics of these…
Complex networks with directed, local interactions are ubiquitous in nature, and often occur with probabilistic connections due to both intrinsic stochasticity and disordered environments. Sparse non-Hermitian random matrices arise…
We prove that the reverse characteristic polynomial $\det(I_n - zA_n)$ of a random $n \times n$ matrix $A_n$ with iid $\mathrm{Bernoulli}(d/n)$ entries converges in distribution towards the random infinite product $\prod_{\ell =…
In this paper, we describe a new algorithm that approximates the extreme eigenvalue/eigenvector pairs of a symmetric matrix. The proposed algorithm can be viewed as an extension of the Jacobi eigenvalue method for symmetric matrices…
We review the application of the notion of local convergence on locally finite randomly rooted graphs, known as Benjamini-Schramm convergence, to the calculation of the global eigenvalue density of random matrices from the beta-Gaussian and…
We develop novel empirical Bernstein inequalities for the variance of bounded random variables. Our inequalities hold under constant conditional variance and mean, without further assumptions like independence or identical distribution of…
Consider an $ N \times N$ Hermitian one-dimensional random band matrix with band width $W > N^{1 / 2 + \frak c} $ for any $ {\frak c} > 0$. In the bulk of the spectrum and in the large $ N $ limit, we obtain the following results: (i) The…
We present a concentration result concerning random weighted projections in high dimensional spaces. As applications, we prove (1) New concentration inequalities for random quadratic forms; (2) The infinity norm of most unit eigenvectors of…
We propose a novel parallel numerical algorithm for calculating the smallest eigenvalues of highly ill-conditioned matrices. It is based on the {\it LDLT} decomposition and involves finding a $k \times k$ sub-matrix of the inverse of the…