相关论文: Improved bounds for the RIP of Subsampled Circulan…

In this paper we introduce deterministic $m\times n$ RIP fulfilling $\pm 1$ matrices of order $k$ such that $\frac{\log m}{\log k}\approx \frac{\log(\log_2 n)}{\log(\log_2 k)}$. The columns of these matrices are binary BCH code vectors that…

We give a simple, greedy $O(n^{\omega+0.5})=O(n^{2.872})$-time algorithm to list-decode planted cliques in a semirandom model introduced in [CSV17] (following [FK01]) that succeeds whenever the size of the planted clique is $k\geq…

Random reshuffling with momentum (RRM) corresponds to the SGD optimizer with momentum option enabled, as found in many machine learning libraries like PyTorch and TensorFlow. Despite its widespread use, the convergence properties of RRM do…

We study $\textit{sparse singular value certificates}$ for random rectangular matrices. If $M$ is an $n \times d$ matrix with independent Gaussian entries, we give a new family of polynomial-time algorithms which can certify upper bounds on…

Dimensionality reduction is in demand to reduce the complexity of solving large-scale problems with data lying in latent low-dimensional structures in machine learning and computer version. Motivated by such need, in this work we study the…

This paper addresses the behavior of the Lov\'asz number for dense random circulant graphs. The Lov\'asz number is a well-known semidefinite programming upper bound on the independence number. Circulant graphs, an example of a Cayley graph,…

1. A standard Gaussian random matrix has full rank with probability 1 and is well-conditioned with a probability quite close to 1 and converging to 1 fast as the matrix deviates from square shape and becomes more rectangular. 2. If we…

We consider the matrix completion problem under a form of row/column weighted entrywise sampling, including the case of uniform entrywise sampling as a special case. We analyze the associated random observation operator, and prove that with…

Motivated by problems in controlled experiments, we study the discrepancy of random matrices with continuous entries where the number of columns $n$ is much larger than the number of rows $m$. Our first result shows that if $\omega(1) = m =…

In this paper, we study the rate distortion function of the i.i.d sequence of multiplications of a Bernoulli $p$ random variable and a gaussian random variable $\sim N(0,1)$. We use a new technique in the derivation of the lower bound in…

We shall show that if the restricted isometry constant (RIC) $\delta_{s+1}(A)$ of the measurement matrix $A$ satisfies $$ \delta_{s+1}(A) < \frac{1}{\sqrt{s + 1}}, $$ then the greedy algorithm Orthogonal Matching Pursuit(OMP) will succeed.…

We study the asymptotic distribution of level crossings for random matrix pencils A_n+\lambda B_n in several ensembles, including complex and real i.i.d. matrices and Gaussian/Hermitian settings. We derive a representation of the normalized…

We study limit distributions of independent random matrices as well as limit joint distributions of their blocks under normalized partial traces composed with classical expectation. In particular, we are concerned with the ensemble of…

Finding a suitable measurement matrix is an important topic in compressed sensing. Though the known random matrix, whose entries are drawn independently from a certain probability distribution, can be used as a measurement matrix and…

We consider self-loops and multiple edges in the configuration model as the size of the graph tends to infinity. The interest in these random variables is due to the fact that the configuration model, conditioned on being simple, is a…

The theory of random matrices contains many central limit theorems. We have central limit theorems for eigenvalues statistics, for the log-determinant and log-permanent, for limiting distribution of individual eigenvalues in the bulk, and…

Polynomial based methods have recently been used in several works for mitigating the effect of stragglers (slow or failed nodes) in distributed matrix computations. For a system with $n$ worker nodes where $s$ can be stragglers, these…

Motivated by the philosophy and phenomenal success of compressed sensing, the problem of reconstructing a matrix from a sampling of its entries has attracted much attention recently. Such a problem can be viewed as an information-theoretic…

We investigate the extremal values of partial traces of matrix tensors under operator norm constraints. To evaluate these multi-linear quantities, we develop a comprehensive graphical formalism that encodes multi-leg partial traces, partial…

The matrix $A:\mathbb{R}^n \to \mathbb{R}^m$ is $(\delta,k)$-regular if for any $k$-sparse vector $x$, $$ \left| \|Ax\|_2^2-\|x\|_2^2\right| \leq \delta \sqrt{k} \|x\|_2^2. $$ We show that if $A$ is $(\delta,k)$-regular for $1 \leq k \leq…