The Overlap Gap Property in Principal Submatrix Recovery
From MaRDI portal
Random matrices (probabilistic aspects) (60B20) Factor analysis and principal components; correspondence analysis (62H25) Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44) Statistical mechanics of random media, disordered materials (including liquid crystals and spin glasses) (82D30)
Abstract: We study support recovery for a principal submatrix with elevated mean , hidden in an symmetric mean zero Gaussian matrix. Here is a universal constant, and we assume for some constant . We establish that {there exists a constant such that} the MLE recovers a constant proportion of the hidden submatrix if , {while such recovery is information theoretically impossible if }. The MLE is computationally intractable in general, and in fact, for sufficiently small, this problem is conjectured to exhibit a emph{statistical-computational gap}. To provide rigorous evidence for this, we study the likelihood landscape for this problem, and establish that for some and , the problem exhibits a variant of the emph{Overlap-Gap-Property (OGP)}. As a direct consequence, we establish that a family of local MCMC based algorithms do not achieve optimal recovery. Finally, we establish that for , a simple spectral method recovers a constant proportion of the hidden submatrix.
This page was built for publication: The Overlap Gap Property in Principal Submatrix Recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6324231)