相关论文: New scaling of Itzykson-Zuber integrals

We estimate the asymptotics of spherical integrals when the rank of one matrix is finite. We show that it is given in terms of the R-transform of the spectral measure of the full rank matrix and give a new proof of the fact that the…

We consider integrals on unitary groups $U_d$ of the form $$\int_{U_d}U_{i_1j_1}... U_{i_qj_q}U^*_{j'_{1}i'_{1}} ... U^*_{j'_{q'}i'_{q'}}dU$$ We give an explicit formula in terms of characters of symmetric groups and Schur functions, which…

Matrix completion algorithms recover a low rank matrix from a small fraction of the entries, each entry contaminated with additive errors. In practice, the singular vectors and singular values of the low rank matrix play a pivotal role for…

In this paper, we prove that in small parameter regions, arbitrary unitary matrix integrals converge in the large $N$ limit and match their formal expansion. Secondly we give a combinatorial model for our matrix integral asymptotics and…

The notion of `stable rank' of a matrix is central to the analysis of randomized matrix algorithms, covariance estimation, deep neural networks, and recommender systems. We compare the properties of the stable rank and intrinsic dimension…

This paper studies inference in linear models with a high-dimensional parameter matrix that can be well-approximated by a ``spiked low-rank matrix.'' A spiked low-rank matrix has rank that grows slowly compared to its dimensions and nonzero…

We consider the problem of exact low-rank matrix completion from a geometric viewpoint: given a partially filled matrix M, we keep the positions of specified and unspecified entries fixed, and study how the minimal completion rank depends…

We compute an analogue of the Itzykson-Zuber integral for the case of arbitrary complex matrices. The calculation is done for both ordinary and supermatrices by transferring the Itzykson-Zuber diffusion equation method to the space of…

Low-rank approximation of a matrix by means of random sampling has been consistently efficient in its empirical studies by many scientists who applied it with various sparse and structured multipliers, but adequate formal support for this…

We prove an asymptotic formula for the number of fixed rank matrices with integer coefficients over a number field K/Q and bounded norm. As an application, we derive an approximate Rogers integral formula for discrete sets of module…

This paper is divided into two parts. In the first part, we develop a general method for expressing ranks of matrix expressions that involve Moore-Penrose inverses, group inverses, Drazin inverses, as well as weighted Moore-Penrose inverses…

We consider the problem of finding the smallest rank of a complex matrix whose absolute values of the entries are given. We call this minimum the phaseless rank of the matrix of the entrywise absolute values. In this paper we study this…

We consider generalized one-matrix models in which external fields allow control over the coordination numbers on both the original and dual lattices. We rederive in a simple fashion a character expansion formula for these models originally…

In this paper, we introduce PSI-LinUCB, a scalable variant of LinUCB that enables efficient training, inference, and memory usage by representing the inverse regularized design matrix as a sum of a diagonal matrix and low-rank correction.…

Pseudospectra and structured pseudospectra are important tools for the analysis of matrices. Their computation, however, can be very demanding for all but small matrices. A new approach to compute approximations of pseudospectra and…

Most recent results in matrix completion assume that the matrix under consideration is low-rank or that the columns are in a union of low-rank subspaces. In real-world settings, however, the linear structure underlying these models is…

Let X be quasi-isometric to either the mapping class group equipped with the word metric, or to Teichmuller space equipped with either the Teichmuller metric or the Weil-Petersson metric. We introduce a unified approach to study the coarse…

We consider semiparametric location-scatter models for which the $p$-variate observation is obtained as $X=\Lambda Z+\mu$, where $\mu$ is a $p$-vector, $\Lambda$ is a full-rank $p\times p$ matrix and the (unobserved) random $p$-vector $Z$…

In this paper the asymptotic distribution of estimators is derived in a general regression setting where rank restrictions on a submatrix of the coefficient matrix are imposed and the regressors can include stationary or I(1) processes.…

In this work, we characterize matrices of linear forms and constant rank, demonstrating that, under some natural assumptions, they are always associated with a syzygy bundle that fits into a (partially linear) resolution. Furthermore, this…