Related papers: New scaling of Itzykson-Zuber integrals
This paper is concerned with the calmness of a partial perturbation to the composite rank constraint system, an intersection of the rank constraint set and a general closed set, which is shown to be equivalent to a local Lipschitz-type…
Partitions of unity in ${\mathbf R}^d$ formed by (matrix) scales of a fixed function appear in many parts of harmonic analysis, e.g., wavelet analysis and the analysis of Triebel-Lizorkin spaces. We give a simple characterization of the…
The low-rank matrix completion problem can be solved by Riemannian optimization on a fixed-rank manifold. However, a drawback of the known approaches is that the rank parameter has to be fixed a priori. In this paper, we consider the…
The article is devoted to different aspects of the question "What can be done with a matrix by low rank perturbation?" It is proved that one can change a geometrically simple spectrum drastically by a rank 1 permutation, but the situation…
It is well known that any positive matrix can be scaled to have prescribed row and column sums by multiplying its rows and columns by certain positive scaling factors (which are unique up to a positive scalar). This procedure is known as…
Recently, fundamental conditions on the sampling patterns have been obtained for finite completability of low-rank matrices or tensors given the corresponding ranks. In this paper, we consider the scenario where the rank is not given and we…
We consider the problem of detecting the presence of a submatrix with larger-than-usual values in a large data matrix. This problem was considered in (Butucea and Ingster, 2013) under a one-parameter exponential family, and one of the test…
We describe several algorithms for matrix completion and matrix approximation when only some of its entries are known. The approximation constraint can be any whose approximated solution is known for the full matrix. For low rank…
Determining the precise rank is an important problem in many large-scale applications with matrix data exploiting low-rank plus noise models. In this paper, we suggest a universal approach to rank inference via residual subsampling (RIRS)…
We consider the problem of recovering an unknown low-rank matrix X with (possibly) non-orthogonal, effectively sparse rank-1 decomposition from measurements y gathered in a linear measurement process A. We propose a variational formulation…
We present a new proof of the well known formula for the rank of the inclusion matrix by constructing a $k\mathcal{S}_n$-module spanned by the columns of this matrix and calculating its dimension.
The task of reconstructing a matrix given a sample of observedentries is known as the matrix completion problem. It arises ina wide range of problems, including recommender systems, collaborativefiltering, dimensionality reduction, image…
We review some relations occurring between the combinatorial intersection theory on the moduli spaces of stable curves and the asymptotic behavior of the 't Hooft-Kontsevich matrix integrals. In particular, we give an alternative proof of…
Cointegration analysis was developed for non-stationary linear processes that exhibit stationary relationships between coordinates. Estimation of the cointegration relationships in a multi-dimensional cointegrated process typically proceeds…
In this paper, we show that the low rank matrix completion problem can be reduced to the problem of finding the rank of a certain tensor.
We study the asymptotic behaviour of uniform random maps with a prescribed face-degree sequence, in the bipartite case, as the number of faces tends to infinity. Under mild assumptions, we show that, properly rescaled, such maps converge in…
Gradient descent for matrix factorization exhibits an implicit bias toward approximately low-rank solutions. While existing theories often assume the boundedness of iterates, empirically the bias persists even with unbounded sequences. This…
We investigate uniform random block lower bidiagonal matrices over the finite field $\mathbb{F}_q$, and prove that their rank undergoes a phase transition. First, we consider block lower bidiagonal matrices with $(k_n+1)\times k_n$ blocks…
This article is dedicated to the following class of problems. Start with an $N\times N$ Hermitian matrix randomly picked from a matrix ensemble - the reference matrix. Applying a rank-$t$ perturbation to it, with $t$ taking the values $1\le…
Matrix sensing has many real-world applications in science and engineering, such as system control, distance embedding, and computer vision. The goal of matrix sensing is to recover a matrix $A_\star \in \mathbb{R}^{n \times n}$, based on a…