{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T05:37:40Z","timestamp":1791437860232,"version":"4.3.3"},"reference-count":79,"publisher":"Institute of Mathematical Statistics","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann. Statist."],"published-print":{"date-parts":[[2024,8,1]]},"abstract":"<jats:p>We consider the problem of estimating the factors of a low-rank n\u00d7d matrix, when this is corrupted by additive Gaussian noise. A special example of our setting corresponds to clustering mixtures of Gaussians with equal (known) covariances. Simple spectral methods do not take into account the distribution of the entries of these factors and are therefore often suboptimal. Here, we characterize the asymptotics of the minimum estimation error under the assumption that the distribution of the entries is known to the statistician. Our results apply to the high-dimensional regime n,d\u2192\u221e and d\/n\u2192\u221e (or d\/n\u21920) and generalize earlier work that focused on the proportional asymptotics n,d\u2192\u221e, d\/n\u2192\u03b4\u2208(0,\u221e). We outline an interesting signal strength regime in which d\/n\u2192\u221e and partial recovery is possible for the left singular vectors while impossible for the right singular vectors. We illustrate the general theory by deriving consequences for Gaussian mixture clustering and carrying out a numerical study on genomics data.<\/jats:p>","DOI":"10.1214\/24-aos2400","type":"journal-article","created":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T01:49:23Z","timestamp":1728006563000},"page":"1460-1484","source":"Crossref","is-referenced-by-count":3,"title":["Fundamental limits of low-rank matrix estimation with diverging aspect ratios"],"prefix":"10.1214","volume":"52","author":[{"given":"Andrea","family":"Montanari","sequence":"first","affiliation":[{"name":"Department of Statistics and Department of Mathematics, Stanford University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuchen","family":"Wu","sequence":"additional","affiliation":[{"name":"Department of Statistics and Data Science, the Wharton School, University of Pennsylvania"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"108","reference":[{"key":"10","doi-asserted-by":"publisher","unstructured":"<small>Barbier, J.<\/small> and <small>Macris, N.<\/small> (2019). The adaptive interpolation method: A simple scheme to prove replica formulas in Bayesian inference. <i>Probab. Theory Related Fields<\/i> <b>174<\/b> 1133\u20131185.","DOI":"10.1007\/s00440-018-0879-0"},{"key":"11","doi-asserted-by":"publisher","unstructured":"<small>Bayati, M.<\/small> and <small>Montanari, A.<\/small> (2011). The dynamics of message passing on dense graphs, with applications to compressed sensing. <i>IEEE Trans. Inf. Theory<\/i> <b>57<\/b> 764\u2013785.","DOI":"10.1109\/TIT.2010.2094817"},{"key":"23","doi-asserted-by":"publisher","unstructured":"<small>Deshpande, Y.<\/small>, <small>Abbe, E.<\/small> and <small>Montanari, A.<\/small> (2017). Asymptotic mutual information for the balanced binary stochastic block model. <i>Inf. Inference<\/i> <b>6<\/b> 125\u2013170.","DOI":"10.1093\/imaiai\/iaw017"},{"key":"59","unstructured":"<small>M\u00e9zard, M.<\/small>, <small>Parisi, G.<\/small> and <small>Virasoro, M. A.<\/small> (1987). <i>Spin Glass Theory and Beyond<\/i>. <i>World Scientific Lecture Notes in Physics<\/i> <b>9<\/b>. World Scientific Co., Inc., Teaneck, NJ."},{"key":"72","doi-asserted-by":"publisher","unstructured":"<small>Perry, A.<\/small>, <small>Wein, A. S.<\/small> and <small>Bandeira, A. S.<\/small> (2020). Statistical limits of spiked tensor models. <i>Ann. Inst. Henri Poincar\u00e9 Probab. Stat.<\/i> <b>56<\/b> 230\u2013264.","DOI":"10.1214\/19-AIHP960"},{"key":"69","doi-asserted-by":"crossref","unstructured":"<small>Novembre, J.<\/small> and <small>Stephens, M.<\/small> (2008). Interpreting principal component analyses of spatial population genetic variation. <i>Nat. Genet.<\/i> <b>40<\/b> 646\u2013649.","DOI":"10.1038\/ng.139"},{"key":"18","doi-asserted-by":"publisher","unstructured":"<small>Bubeck, S.<\/small>, <small>Ding, J.<\/small>, <small>Eldan, R.<\/small> and <small>R\u00e1cz, M. Z.<\/small> (2016). Testing for high-dimensional geometry in random graphs. <i>Random Structures Algorithms<\/i> <b>49<\/b> 503\u2013532.","DOI":"10.1002\/rsa.20633"},{"key":"3","doi-asserted-by":"crossref","unstructured":"<small>AMINI, A. A.<\/small> and <small>WAINWRIGHT, M. J.<\/small> (2009). High-dimensional analysis of semidefinite relaxations for sparse principal components. <i>Ann. Statist.<\/i> <b>37<\/b> 2877\u20132921.","DOI":"10.1214\/08-AOS664"},{"key":"34","doi-asserted-by":"crossref","unstructured":"<small>Giraud, C.<\/small> and <small>Verzelen, N.<\/small> (2018). Partial recovery bounds for clustering with the relaxed <i>K<\/i>-means. <i>Math. Stat. Learn.<\/i> <b>1<\/b> 317\u2013374.","DOI":"10.4171\/msl\/8"},{"key":"71","doi-asserted-by":"publisher","unstructured":"<small>Peng, J.<\/small> and <small>Wei, Y.<\/small> (2007). Approximating <i>k<\/i>-means-type clustering via semidefinite programming. <i>SIAM J. Optim.<\/i> <b>18<\/b> 186\u2013205.","DOI":"10.1137\/050641983"},{"key":"78","doi-asserted-by":"publisher","unstructured":"<small>Vempala, S.<\/small> and <small>Wang, G.<\/small> (2004). A spectral algorithm for learning mixture models. <i>J. Comput. System Sci.<\/i> <b>68<\/b> 841\u2013860.","DOI":"10.1016\/j.jcss.2003.11.008"},{"key":"24","doi-asserted-by":"crossref","unstructured":"<small>DESHPANDE, Y.<\/small> and <small>MONTANARI, A.<\/small> (2014). Information-theoretically optimal sparse PCA. In 2014 <i>IEEE International Symposium on Information Theory<\/i> 2197\u20132201. IEEE, New York.","DOI":"10.1109\/ISIT.2014.6875223"},{"key":"65","doi-asserted-by":"publisher","unstructured":"<small>MONTANARI, A.<\/small> and <small>VENKATARAMANAN, R.<\/small> (2021). Estimation of low-rank matrices via approximate message passing. <i>Ann. Statist.<\/i> <b>49<\/b> 321\u2013345.","DOI":"10.1214\/20-AOS1958"},{"key":"19","doi-asserted-by":"publisher","unstructured":"<small>CAI, T. T.<\/small>, <small>LIANG, T.<\/small> and <small>RAKHLIN, A.<\/small> (2017). Computational and statistical boundaries for submatrix localization in a large noisy matrix. <i>Ann. Statist.<\/i> <b>45<\/b> 1403\u20131430.","DOI":"10.1214\/16-AOS1488"},{"key":"9","doi-asserted-by":"publisher","unstructured":"<small>BANKS, J.<\/small>, <small>MOORE, C.<\/small>, <small>VERSHYNIN, R.<\/small>, <small>VERZELEN, N.<\/small> and <small>XU, J.<\/small> (2018). Information-theoretic bounds and phase transitions in clustering, sparse PCA, and submatrix localization. <i>IEEE Trans. Inf. Theory<\/i> <b>64<\/b> 4872\u20134994.","DOI":"10.1109\/tit.2018.2810020"},{"key":"5","doi-asserted-by":"publisher","unstructured":"<small>AWASTHI, P.<\/small> and <small>SHEFFET, O.<\/small> (2012). Improved spectral-norm bounds for clustering. In <i>Approximation, Randomization, and Combinatorial Optimization<\/i>. <i>Lecture Notes in Computer Science<\/i> <b>7408<\/b> 37\u201349. Springer, Heidelberg.","DOI":"10.1007\/978-3-642-32512-0_4"},{"key":"68","unstructured":"<small>NOVEMBRE, J.<\/small>, <small>JOHNSON, T.<\/small>, <small>BRYC, K.<\/small>, <small>KUTALIK, Z.<\/small>, <small>BOYKO, A. R.<\/small>, <small>AUTON, A.<\/small>, <small>INDAP, A.<\/small>, <small>KING, K. S.<\/small>, <small>BERGMANN, S.<\/small> et al. (2008). Genes mirror geography within Europe. <i>Nature<\/i> <b>456<\/b> 98\u2013101."},{"key":"37","unstructured":"<small>HAJEK, B.<\/small>, <small>WU, Y.<\/small> and <small>XU, J.<\/small> (2017). Submatrix localization via message passing. <i>J. Mach. Learn. Res.<\/i> <b>18<\/b> Paper No. 186."},{"key":"54","doi-asserted-by":"crossref","unstructured":"<small>LESIEUR, T.<\/small>, <small>KRZAKALA, F.<\/small> and <small>ZDEBOROV\u00c1, L.<\/small> (2015). MMSE of probabilistic low-rank matrix estimation: Universality with respect to the output channel. In 2015 53<i>rd Annual Allerton Conference on Communication, Control, and Computing<\/i> (<i>Allerton<\/i>) 680\u2013687. IEEE.","DOI":"10.1109\/ALLERTON.2015.7447070"},{"key":"61","doi-asserted-by":"publisher","unstructured":"<small>MIXON, D. G.<\/small>, <small>VILLAR, S.<\/small> and <small>WARD, R.<\/small> (2017). Clustering subgaussian mixtures by semidefinite programming. <i>Inf. Inference<\/i> <b>6<\/b> 389\u2013415.","DOI":"10.1093\/imaiai\/iax001"},{"key":"25","unstructured":"<small>DESHPANDE, Y.<\/small> and <small>MONTANARI, A.<\/small> (2016). Sparse PCA via covariance thresholding. <i>J. Mach. Learn. Res.<\/i> <b>17<\/b> Paper No. 141."},{"key":"62","doi-asserted-by":"crossref","unstructured":"<small>MOITRA, A.<\/small> and <small>VALIANT, G.<\/small> (2010). Settling the polynomial learnability of mixtures of Gaussians. In 2010 <i>IEEE<\/i> 51<i>st Annual Symposium on Foundations of Computer Science\u2014FOCS<\/i> 2010 93\u2013102. IEEE Computer Soc., Los Alamitos, CA.","DOI":"10.1109\/FOCS.2010.15"},{"key":"70","doi-asserted-by":"crossref","unstructured":"<small>PEARSON, K.<\/small> (1894). Contributions to the mathematical theory of evolution. <i>Philos. Trans. R. Soc. Lond. A<\/i> <b>185<\/b> 71\u2013110.","DOI":"10.1098\/rsta.1894.0003"},{"key":"4","doi-asserted-by":"crossref","unstructured":"<small>AWASTHI, P.<\/small>, <small>BANDEIRA, A. S.<\/small>, <small>CHARIKAR, M.<\/small>, <small>KRISHNASWAMY, R.<\/small>, <small>VILLAR, S.<\/small> and <small>WARD, R.<\/small> (2015). Relax, no need to round: Integrality of clustering formulations. In <i>ITCS\u2019<\/i>15<i>\u2014Proceedings of the<\/i> 6<i>th Innovations in Theoretical Computer Science<\/i> 191\u2013200. ACM, New York.","DOI":"10.1145\/2688073.2688116"},{"key":"42","unstructured":"<small>JIN, C.<\/small>, <small>ZHANG, Y.<\/small>, <small>BALAKRISHNAN, S.<\/small>, <small>WAINWRIGHT, M. J.<\/small> and <small>JORDAN, M. I.<\/small> (2016). Local maxima in the likelihood of Gaussian mixture models: Structural results and algorithmic consequences. <i>Adv. Neural Inf. Process. Syst.<\/i> <b>29<\/b>."},{"key":"74","doi-asserted-by":"publisher","unstructured":"<small>REGEV, O.<\/small> and <small>VIJAYARAGHAVAN, A.<\/small> (2017). On learning mixtures of well-separated Gaussians. In 58<i>th Annual IEEE Symposium on Foundations of Computer Science\u2014FOCS<\/i> 2017 85\u201396. IEEE Computer Soc., Los Alamitos, CA.","DOI":"10.1109\/FOCS.2017.17"},{"key":"29","unstructured":"<small>Dua, D.<\/small> and <small>Graff, C.<\/small> (2017). UCI Machine Learning Repository."},{"key":"6","doi-asserted-by":"publisher","unstructured":"<small>Baik, J.<\/small>, <small>Ben Arous, G.<\/small> and <small>P\u00e9ch\u00e9, S.<\/small> (2005). Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices. <i>Ann. Probab.<\/i> <b>33<\/b> 1643\u20131697.","DOI":"10.1214\/009117905000000233"},{"key":"13","doi-asserted-by":"publisher","unstructured":"<small>Benaych-Georges, F.<\/small> and <small>Nadakuditi, R. R.<\/small> (2011). The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices. <i>Adv. Math.<\/i> <b>227<\/b> 494\u2013521.","DOI":"10.1016\/j.aim.2011.02.007"},{"key":"40","doi-asserted-by":"crossref","unstructured":"<small>Hsu, D.<\/small> and <small>Kakade, S. M.<\/small> (2013). Learning mixtures of spherical Gaussians: Moment methods and spectral decompositions. In <i>ITCS\u2019<\/i>13<i>\u2014Proceedings of the<\/i> 2013 <i>ACM Conference on Innovations in Theoretical Computer Science<\/i> 11\u201319. ACM, New York.","DOI":"10.1145\/2422436.2422439"},{"key":"45","doi-asserted-by":"publisher","unstructured":"<small>Johnstone, I. M.<\/small> and <small>Lu, A. Y.<\/small> (2009). On consistency and sparsity for principal components analysis in high dimensions. <i>J. Amer. Statist. Assoc.<\/i> <b>104<\/b> 682\u2013693.","DOI":"10.1198\/jasa.2009.0121"},{"key":"52","doi-asserted-by":"publisher","unstructured":"<small>Lelarge, M.<\/small> and <small>Miolane, L.<\/small> (2019). Fundamental limits of symmetric low-rank matrix estimation. <i>Probab. Theory Related Fields<\/i> <b>173<\/b> 859\u2013929.","DOI":"10.1007\/s00440-018-0845-x"},{"key":"57","doi-asserted-by":"publisher","unstructured":"<small>Ma, Z.<\/small> (2013). Sparse principal component analysis and iterative thresholding. <i>Ann. Statist.<\/i> <b>41<\/b> 772\u2013801.","DOI":"10.1214\/13-AOS1097"},{"key":"15","doi-asserted-by":"publisher","unstructured":"<small>Berthet, Q.<\/small> and <small>Rigollet, P.<\/small> (2013). Optimal detection of sparse principal components in high dimension. <i>Ann. Statist.<\/i> <b>41<\/b> 1780\u20131815.","DOI":"10.1214\/13-AOS1127"},{"key":"14","doi-asserted-by":"publisher","unstructured":"<small>Benaych-Georges, F.<\/small> and <small>Nadakuditi, R. R.<\/small> (2012). The singular values and vectors of low rank perturbations of large rectangular random matrices. <i>J. Multivariate Anal.<\/i> <b>111<\/b> 120\u2013135.","DOI":"10.1016\/j.jmva.2012.04.019"},{"key":"7","doi-asserted-by":"publisher","unstructured":"<small>Baik, J.<\/small> and <small>Silverstein, J. W.<\/small> (2006). Eigenvalues of large sample covariance matrices of spiked population models. <i>J. Multivariate Anal.<\/i> <b>97<\/b> 1382\u20131408.","DOI":"10.1016\/j.jmva.2005.08.003"},{"key":"44","doi-asserted-by":"publisher","unstructured":"<small>Johnstone, I. M.<\/small> (2007). High dimensional statistical inference and random matrices. In <i>International Congress of Mathematicians. Vol. I<\/i> 307\u2013333. Eur. Math. Soc., Z\u00fcrich.","DOI":"10.4171\/022-1\/13"},{"key":"46","doi-asserted-by":"publisher","unstructured":"<small>Johnstone, I. M.<\/small> and <small>Onatski, A.<\/small> (2020). Testing in high-dimensional spiked models. <i>Ann. Statist.<\/i> <b>48<\/b> 1231\u20131254.","DOI":"10.1214\/18-AOS1697"},{"key":"73","doi-asserted-by":"publisher","unstructured":"<small>Perry, A.<\/small>, <small>Wein, A. S.<\/small>, <small>Bandeira, A. S.<\/small> and <small>Moitra, A.<\/small> (2018). Optimality and sub-optimality of PCA I: Spiked random matrix models. <i>Ann. Statist.<\/i> <b>46<\/b> 2416\u20132451.","DOI":"10.1214\/17-AOS1625"},{"key":"20","doi-asserted-by":"publisher","unstructured":"<small>Cai, T. T.<\/small>, <small>Ma, J.<\/small> and <small>Zhang, L.<\/small> (2019). CHIME: Clustering of high-dimensional Gaussian mixtures with EM algorithm and its optimality. <i>Ann. Statist.<\/i> <b>47<\/b> 1234\u20131267.","DOI":"10.1214\/18-AOS1711"},{"key":"51","doi-asserted-by":"crossref","unstructured":"<small>Kumar, A.<\/small> and <small>Kannan, R.<\/small> (2010). Clustering with spectral norm and the <i>k<\/i>-means algorithm. In 2010 <i>IEEE<\/i> 51<i>st Annual Symposium on Foundations of Computer Science\u2014FOCS<\/i> 2010 299\u2013308. IEEE Computer Soc., Los Alamitos, CA.","DOI":"10.1109\/FOCS.2010.35"},{"key":"8","doi-asserted-by":"publisher","unstructured":"<small>Balakrishnan, S.<\/small>, <small>Wainwright, M. J.<\/small> and <small>Yu, B.<\/small> (2017). Statistical guarantees for the EM algorithm: From population to sample-based analysis. <i>Ann. Statist.<\/i> <b>45<\/b> 77\u2013120.","DOI":"10.1214\/16-AOS1435"},{"key":"43","doi-asserted-by":"publisher","unstructured":"<small>Johnstone, I. M.<\/small> (2001). On the distribution of the largest eigenvalue in principal components analysis. <i>Ann. Statist.<\/i> <b>29<\/b> 295\u2013327.","DOI":"10.1214\/aos\/1009210544"},{"key":"1","doi-asserted-by":"crossref","unstructured":"<small>ABBE, E.<\/small> (2017). Community detection and stochastic block models: Recent developments. <i>J. Mach. Learn. Res.<\/i> <b>18<\/b> Paper No. 177.","DOI":"10.1561\/9781680834772"},{"key":"63","unstructured":"<small>MONDELLI, M.<\/small> and <small>VENKATARAMANAN, R.<\/small> (2021). PCA initialization for approximate message passing in rotationally invariant models. <i>Adv. Neural Inf. Process. Syst.<\/i> <b>34<\/b> 29616\u201329629."},{"key":"2","doi-asserted-by":"publisher","unstructured":"<small>ACHLIOPTAS, D.<\/small> and <small>MCSHERRY, F.<\/small> (2005). On spectral learning of mixtures of distributions. In <i>Learning Theory<\/i>. <i>Lecture Notes in Computer Science<\/i> <b>3559<\/b> 458\u2013469. Springer, Berlin.","DOI":"10.1007\/11503415_31"},{"key":"12","doi-asserted-by":"publisher","unstructured":"<small>BELKIN, M.<\/small> and <small>SINHA, K.<\/small> (2015). Polynomial learning of distribution families. <i>SIAM J. Comput.<\/i> <b>44<\/b> 889\u2013911.","DOI":"10.1137\/13090818X"},{"key":"16","unstructured":"<small>BERTHET, Q.<\/small> and <small>RIGOLLET, P.<\/small> (2013). Computational lower bounds for sparse PCA. ArXiv preprint. Available at arXiv:<a href=\"https:\/\/arxiv.org\/abs\/1304.0828\">1304.0828<\/a>."},{"key":"17","doi-asserted-by":"publisher","unstructured":"<small>BRUBAKER, S. C.<\/small> and <small>VEMPALA, S. S.<\/small> (2008). Isotropic PCA and affine-invariant clustering. In <i>Building Bridges<\/i>. <i>Bolyai Soc. Math. Stud.<\/i> <b>19<\/b> 241\u2013281. Springer, Berlin.","DOI":"10.1007\/978-3-540-85221-6_8"},{"key":"21","doi-asserted-by":"publisher","unstructured":"<small>DASGUPTA, S.<\/small> (1999). Learning mixtures of Gaussians. In 40<i>th Annual Symposium on Foundations of Computer Science<\/i> (<i>New York<\/i>, 1999) 634\u2013644. IEEE Computer Soc., Los Alamitos, CA.","DOI":"10.1109\/SFFCS.1999.814639"},{"key":"22","unstructured":"<small>DASGUPTA, S.<\/small> and <small>SCHULMAN, L.<\/small> (2007). A probabilistic analysis of EM for mixtures of separated, spherical Gaussians. <i>J. Mach. Learn. Res.<\/i> <b>8<\/b> 203\u2013226."},{"key":"26","unstructured":"<small>DIA, M.<\/small>, <small>MACRIS, N.<\/small>, <small>KRZAKALA, F.<\/small>, <small>LESIEUR, T.<\/small>, <small>ZDEBOROV\u00c1, L.<\/small> et al. (2016). Mutual information for symmetric rank-one matrix estimation: A proof of the replica formula. <i>Adv. Neural Inf. Process. Syst.<\/i> <b>29<\/b>."},{"key":"27","doi-asserted-by":"publisher","unstructured":"<small>DOMINGUEZ, T.<\/small> and <small>MOURRAT, J.-C.<\/small> (2024). Mutual information for the sparse stochastic block model. <i>Ann. Probab.<\/i> <b>52<\/b> 434\u2013501.","DOI":"10.1214\/23-aop1665"},{"key":"28","unstructured":"<small>DONOHO, D. L.<\/small> and <small>FELDMAN, M. J.<\/small> (2022). Optimal Eigenvalue Shrinkage in the Semicircle Limit. Available at arXiv:<a href=\"https:\/\/arxiv.org\/abs\/2210.04488\">2210.04488<\/a>."},{"key":"30","doi-asserted-by":"crossref","unstructured":"<small>EL ALAOUI, A.<\/small> and <small>KRZAKALA, F.<\/small> (2018). Estimation in the spiked Wigner model: A short proof of the replica formula. In 2018 <i>IEEE International Symposium on Information Theory<\/i> (<i>ISIT<\/i>) 1874\u20131878. IEEE, New York.","DOI":"10.1109\/ISIT.2018.8437810"},{"key":"31","unstructured":"<small>FEI, Y.<\/small> and <small>CHEN, Y.<\/small> (2018). Hidden integrality of SDP relaxations for sub-Gaussian mixture models. In <i>Conference on Learning Theory<\/i> 1931\u20131965. PMLR."},{"key":"32","doi-asserted-by":"publisher","unstructured":"<small>FELDMAN, J.<\/small>, <small>SERVEDIO, R. A.<\/small> and <small>O\u2019DONNELL, R.<\/small> (2006). PAC learning axis-aligned mixtures of Gaussians with no separation assumption. In <i>Learning Theory<\/i>. <i>Lecture Notes in Computer Science<\/i> <b>4005<\/b> 20\u201334. Springer, Berlin.","DOI":"10.1007\/11776420_5"},{"key":"33","doi-asserted-by":"publisher","unstructured":"<small>FELDMAN, M. J.<\/small> (2023). Spiked singular values and vectors under extreme aspect ratios. <i>J. Multivariate Anal.<\/i> <b>196<\/b> Paper No. 105187.","DOI":"10.1016\/j.jmva.2023.105187"},{"key":"35","unstructured":"<small>GUIONNET, A.<\/small>, <small>KO, J.<\/small>, <small>KRZAKALA, F.<\/small> and <small>ZDEBOROV\u00c1, L.<\/small> (2023). Estimating rank-one matrices with mismatched prior and noise: Universality and large deviations. Available at arXiv:<a href=\"https:\/\/arxiv.org\/abs\/2306.09283\">2306.09283<\/a>."},{"key":"36","doi-asserted-by":"publisher","unstructured":"<small>GUO, D.<\/small>, <small>SHAMAI, S.<\/small> and <small>VERD\u00da, S.<\/small> (2005). Mutual information and minimum mean-square error in Gaussian channels. <i>IEEE Trans. Inf. Theory<\/i> <b>51<\/b> 1261\u20131282.","DOI":"10.1109\/TIT.2005.844072"},{"key":"38","doi-asserted-by":"crossref","unstructured":"<small>HARDT, M.<\/small> and <small>PRICE, E.<\/small> (2015). Tight bounds for learning a mixture of two Gaussians [extended abstract]. In <i>STOC\u2019<\/i>15<i>\u2014Proceedings of the<\/i> 2015 <i>ACM Symposium on Theory of Computing<\/i> 753\u2013760. ACM, New York.","DOI":"10.1145\/2746539.2746579"},{"key":"39","doi-asserted-by":"crossref","unstructured":"<small>HOYLE, D. C.<\/small> and <small>RATTRAY, M.<\/small> (2004). Principal-component-analysis eigenvalue spectra from data with symmetry-breaking structure. <i>Phys. Rev. E<\/i> <b>69<\/b> 026124.","DOI":"10.1103\/PhysRevE.69.026124"},{"key":"41","unstructured":"<small>IGUCHI, T.<\/small>, <small>MIXON, D. G.<\/small>, <small>PETERSON, J.<\/small> and <small>VILLAR, S.<\/small> (2015). On the tightness of an SDP relaxation of k-means. ArXiv preprint. Available at arXiv:<a href=\"https:\/\/arxiv.org\/abs\/1505.04778\">1505.04778<\/a>."},{"key":"47","unstructured":"<small>JOURN\u00c9E, M.<\/small>, <small>NESTEROV, Y.<\/small>, <small>RICHT\u00c1RIK, P.<\/small> and <small>SEPULCHRE, R.<\/small> (2010). Generalized power method for sparse principal component analysis. <i>J. Mach. Learn. Res.<\/i> <b>11<\/b> 517\u2013553."},{"key":"48","doi-asserted-by":"crossref","unstructured":"<small>KALAI, A. T.<\/small>, <small>MOITRA, A.<\/small> and <small>VALIANT, G.<\/small> (2010). Efficiently learning mixtures of two Gaussians. In <i>STOC\u2019<\/i>10<i>\u2014Proceedings of the<\/i> 2010 <i>ACM International Symposium on Theory of Computing<\/i> 553\u2013562. ACM, New York.","DOI":"10.1145\/1806689.1806765"},{"key":"49","unstructured":"<small>KLUSOWSKI, J. M.<\/small> and <small>BRINDA, W.<\/small> (2016). Statistical guarantees for estimating the centers of a two-component Gaussian mixture by EM. ArXiv preprint. Available at arXiv:<a href=\"https:\/\/arxiv.org\/abs\/1608.02280\">1608.02280<\/a>."},{"key":"50","unstructured":"<small>KOLAR, M.<\/small>, <small>BALAKRISHNAN, S.<\/small>, <small>RINALDO, A.<\/small> and <small>SINGH, A.<\/small> (2011). Minimax localization of structural information in large noisy matrices. <i>Adv. Neural Inf. Process. Syst.<\/i> <b>24<\/b>."},{"key":"53","doi-asserted-by":"crossref","unstructured":"<small>LESIEUR, T.<\/small>, <small>DE BACCO, C.<\/small>, <small>BANKS, J.<\/small>, <small>KRZAKALA, F.<\/small>, <small>MOORE, C.<\/small> and <small>ZDEBOROV\u00c1, L.<\/small> (2016). Phase transitions and optimal algorithms in high-dimensional Gaussian mixture clustering. In 2016 54<i>th Annual Allerton Conference on Communication, Control, and Computing<\/i> (<i>Allerton<\/i>) 601\u2013608. IEEE, New York.","DOI":"10.1109\/ALLERTON.2016.7852287"},{"key":"55","doi-asserted-by":"publisher","unstructured":"<small>LI, X.<\/small>, <small>LI, Y.<\/small>, <small>LING, S.<\/small>, <small>STROHMER, T.<\/small> and <small>WEI, K.<\/small> (2020). When do birds of a feather flock together? <i>k<\/i>-means, proximity, and conic programming. <i>Math. Program.<\/i> <b>179<\/b> 295\u2013341.","DOI":"10.1007\/s10107-018-1333-x"},{"key":"56","unstructured":"<small>LU, Y.<\/small> and <small>ZHOU, H. H.<\/small> (2016). Statistical and computational guarantees of Lloyd\u2019s algorithm and its variants. ArXiv preprint. Available at arXiv:<a href=\"https:\/\/arxiv.org\/abs\/1612.02099\">1612.02099<\/a>."},{"key":"58","unstructured":"<small>MACRIS, N.<\/small>, <small>RUSH, C.<\/small> et al. (2020). All-or-nothing statistical and computational phase transitions in sparse spiked matrix estimation. <i>Adv. Neural Inf. Process. Syst.<\/i> <b>33<\/b> 14915\u201314926."},{"key":"60","unstructured":"<small>MIOLANE, L.<\/small> (2017). Fundamental limits of low-rank matrix estimation: the non-symmetric case. ArXiv preprint. Available at arXiv:<a href=\"https:\/\/arxiv.org\/abs\/1702.00473\">1702.00473<\/a>."},{"key":"64","unstructured":"<small>MONTANARI, A.<\/small> and <small>SEN, S.<\/small> (2022). A Short Tutorial on Mean-Field Spin Glass Techniques for Non-Physicists. Available at arXiv:<a href=\"https:\/\/arxiv.org\/abs\/2204.02909\">2204.02909<\/a>."},{"key":"66","doi-asserted-by":"crossref","unstructured":"<small>MONTANARI, A.<\/small> and <small>WU, Y.<\/small> (2024). Supplement to \u201cFundamental limits of low-rank matrix estimation with diverging aspect ratios.\u201d <a href=\"https:\/\/doi.org\/10.1214\/24-AOS2400SUPP\">https:\/\/doi.org\/10.1214\/24-AOS2400SUPP<\/a>","DOI":"10.1214\/24-AOS2400SUPP"},{"key":"67","doi-asserted-by":"publisher","unstructured":"<small>NDAOUD, M.<\/small> (2022). Sharp optimal recovery in the two component Gaussian mixture model. <i>Ann. Statist.<\/i> <b>50<\/b> 2096\u20132126.","DOI":"10.1214\/22-aos2178"},{"key":"75","unstructured":"<small>ROYER, M.<\/small> (2017). Adaptive clustering through semidefinite programming. <i>Adv. Neural Inf. Process. Syst.<\/i> <b>30<\/b>."},{"key":"76","doi-asserted-by":"crossref","unstructured":"<small>STAM, A. J.<\/small> (1959). Some inequalities satisfied by the quantities of information of Fisher and Shannon. <i>Inf. Control<\/i> <b>2<\/b> 101\u2013112.","DOI":"10.1016\/S0019-9958(59)90348-1"},{"key":"77","unstructured":"<small>THE 1000 GENOMES PROJECT CONSORTIUM<\/small> (2015). A global reference for human genetic variation. <i>Nature<\/i> <b>526<\/b> 68."},{"key":"79","doi-asserted-by":"crossref","unstructured":"<small>ZHONG, X.<\/small>, <small>SU, C.<\/small> and <small>FAN, Z.<\/small> (2022). Empirical Bayes PCA in high dimensions. <i>J. R. Stat. Soc. Ser. B. Stat. Methodol.<\/i> <b>84<\/b> 853\u2013878.","DOI":"10.1111\/rssb.12490"}],"container-title":["The Annals of Statistics"],"original-title":[],"deposited":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T17:35:03Z","timestamp":1791394503000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/annals-of-statistics\/volume-52\/issue-4\/Fundamental-limits-of-low-rank-matrix-estimation-with-diverging-aspect\/10.1214\/24-AOS2400.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,1]]},"references-count":79,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2024,8,1]]}},"URL":"https:\/\/doi.org\/10.1214\/24-aos2400","relation":{},"ISSN":["0090-5364","2168-8966"],"issn-type":[{"value":"0090-5364","type":"print"},{"value":"2168-8966","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,1]]}}}