A multiscale cavity method for sublinear-rank symmetric matrix factorization
Jean Barbier, Justin Ko, Anas A. Rahman
TL;DR
This work proves that in the spiked Wigner model with rank growing sublinearly as $M={\rm o}(\sqrt{\ln N})$, the limiting mutual information coincides with the rank-one RS variational formula, effectively reducing a growing-rank problem to a scalar optimization. The authors introduce a multiscale cavity method to handle two growing dimensions and establish a rank-one reduction for all SNR via information-theoretic and convexity arguments, enabled by an overlap-concentration perturbation and Nishimori identities. They provide a Guerra interpolation-based lower bound and a multiscale cavity-based upper bound that match, yielding the limit $\lim_{N\to\infty}F_N(\lambda)=\sup_{q\in[0,\rho]}F_1^{RS}(q,\lambda)$, and derive the associated MMSE relationship. The approach highlights a pathway to extend replica-symmetric analyses to broad, large-array inference problems with dimension-dependent coordinates, with potential reach beyond symmetric matrix factorization to tensors and asymmetric variants.
Abstract
We consider a statistical model for symmetric matrix factorization with additive Gaussian noise in the high-dimensional regime where the rank $M$ of the signal matrix to infer scales with its size $N$ as $M={\rm o}(\sqrt{\ln N})$. Allowing for an $N$-dependent rank offers new challenges and requires new methods. Working in the Bayes-optimal setting, we show that whenever the signal has i.i.d.~entries, the limiting mutual information between signal and data is given by a variational formula involving a rank-one replica symmetric potential. In other words, from the information-theoretic perspective, the case of a (slowly) growing rank is the same as when $M=1$ (namely, the standard spiked Wigner model). The proof is primarily based on a novel multiscale cavity method allowing for growing rank along with some information-theoretic identities on worst noise for the vector Gaussian channel. We believe that the cavity method developed here will play a role in the analysis of a broader class of inference and spin models where the degrees of freedom are large arrays instead of vectors.
