{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T02:54:10Z","timestamp":1784688850294,"version":"3.55.0"},"reference-count":432,"publisher":"Emerald","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,10,21]]},"abstract":"<jats:p>Spectral methods have emerged as a simple yet surprisingly effective approach for extracting information from massive, noisy and incomplete data. In a nutshell, spectral methods refer to a collection of algorithms built upon the eigenvalues (resp. singular values) and eigenvectors (resp. singular vectors) of some properly designed matrices constructed from data. A diverse array of applications have been found in machine learning, imaging science, financial and econometric modeling, and signal processing, including recommendation systems, community detection, ranking, structured matrix recovery, tensor data estimation, joint shape matching, blind deconvolution, financial investments, risk managements, treatment evaluations, causal inference, amongst others. Due to their simplicity and effectiveness, spectral methods are not only used as a stand-alone estimator, but also frequently employed to facilitate other more sophisticated algorithms to enhance performance.<\/jats:p>\n                  <jats:p>While the studies of spectral methods can be traced back to classical matrix perturbation theory and the method of moments, the past decade has witnessed tremendous theoretical advances in demystifying their efficacy through the lens of statistical modeling, with the aid of concentration inequalities and non-asymptotic random matrix theory. This monograph aims to present a systematic, comprehensive, yet accessible introduction to spectral methods from a modern statistical perspective, highlighting their algorithmic implications in diverse large-scale applications. In particular, our exposition gravitates around several central questions that span various applications: how to characterize the sample efficiency of spectral methods in reaching a target level of statistical accuracy, and how to assess their stability in the face of random noise, missing data, and adversarial corruptions? In addition to conventional \u21132 perturbation analysis, we present a systematic \u2113\u221e and \u21132,\u221e perturbation theory for eigenspace and singular subspaces, which has only recently become available owing to a powerful \u201cleave-one-out\u201d analysis framework.<\/jats:p>","DOI":"10.1561\/2200000079","type":"journal-article","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T03:30:46Z","timestamp":1634787046000},"page":"566-806","source":"Crossref","is-referenced-by-count":116,"title":["Spectral Methods for Data Science: A Statistical Perspective"],"prefix":"10.1108","volume":"14","author":[{"given":"Yuxin","family":"Chen","sequence":"first","affiliation":[{"name":"Princeton University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuejie","family":"Chi","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianqing","family":"Fan","sequence":"additional","affiliation":[{"name":"Princeton University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cong","family":"Ma","sequence":"additional","affiliation":[{"name":"University of Chicago"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"140","published-online":{"date-parts":[[2021,10,21]]},"reference":[{"issue":"1","key":"2026033012311740800_ref001","first-page":"6446","article-title":"Community detection and stochastic block models: recent developments","volume":"18","author":"Abbe","year":"2017","journal-title":"Journal of Machine Learning Research"},{"issue":"1","key":"2026033012311740800_ref002","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1109\/TIT.2015.2490670","article-title":"Exact recovery in the stochastic block model","volume":"62","author":"Abbe","year":"2016","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026033012311740800_ref003","volume-title":"An Lp theory of PCA and spectral clustering","author":"Abbe","year":"2020"},{"issue":"3","key":"2026033012311740800_ref004","doi-asserted-by":"crossref","first-page":"1452","DOI":"10.1214\/19-AOS1854","article-title":"Entrywise eigenvector analysis of random matrices with low expected rank","volume":"48","author":"Abbe","year":"2020","journal-title":"The Annals of Statistics"},{"issue":"2","key":"2026033012311740800_ref005","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/1219092.1219097","article-title":"Fast computation of low-rank matrix approximations","volume":"54","author":"Achlioptas","year":"2007","journal-title":"Journal of the ACM"},{"key":"2026033012311740800_ref006","first-page":"67","volume-title":"Model-based reinforcement learning with a generative model is minimax optimal","author":"Agarwal","year":"2020"},{"key":"2026033012311740800_ref007","first-page":"70","volume-title":"Accelerated spectral ranking","author":"Agarwal","year":"2018"},{"key":"2026033012311740800_ref008","volume-title":"Entrywise estimation of singular vectors of low-rank matrices with heteroskedasticity and dependence","author":"Agterberg","year":"2021"},{"issue":"3","key":"2026033012311740800_ref009","doi-asserted-by":"crossref","first-page":"1711","DOI":"10.1109\/TIT.2013.2294644","article-title":"Blind deconvolution using convex programming","volume":"60","author":"Ahmed","year":"2013","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"2026033012311740800_ref010","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1109\/JSTSP.2018.2837638","article-title":"Hypergraph spectral clustering in the weighted stochastic block model","volume":"12","author":"Ahn","year":"2018","journal-title":"IEEE Journal of Selected Topics in Signal Processing"},{"issue":"3","key":"2026033012311740800_ref011","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.3982\/ECTA8968","article-title":"Eigenvalue ratio test for the number of factors","volume":"81","author":"Ahn","year":"2013","journal-title":"Econometrica"},{"issue":"2","key":"2026033012311740800_ref012","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10994-009-5103-0","article-title":"NP-hardness of Euclidean sum-of-squares clustering","volume":"75","author":"Aloise","year":"2009","journal-title":"Machine learning"},{"issue":"3-4","key":"2026033012311740800_ref013","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<457::AID-RSA14>3.0.CO;2-W","article-title":"Finding a large hidden clique in a random graph","volume":"13","author":"Alon","year":"1998","journal-title":"Random Structures & Algorithms"},{"key":"2026033012311740800_ref014","first-page":"2454","volume-title":"High-dimensional analysis of semidefinite relaxations for sparse principal components","author":"Amini","year":"2008"},{"issue":"4","key":"2026033012311740800_ref015","doi-asserted-by":"crossref","first-page":"2097","DOI":"10.1214\/13-AOS1138","article-title":"Pseudo-likelihood methods for community detection in large sparse networks","volume":"41","author":"Amini","year":"2013","journal-title":"The Annals of Statistics"},{"issue":"1","key":"2026033012311740800_ref016","first-page":"802","article-title":"Robust synthetic control","volume":"19","author":"Amjad","year":"2018","journal-title":"The Journal of Machine Learning Research"},{"key":"2026033012311740800_ref017","first-page":"2773","article-title":"Tensor decompositions for learning latent variable models","volume":"15","author":"Anandkumar","year":"2014","journal-title":"Journal of Machine Learning Research"},{"key":"2026033012311740800_ref018","volume-title":"An introduction to multivariate statistical analysis","author":"Anderson","year":"1962"},{"key":"2026033012311740800_ref019","first-page":"191","volume-title":"Relax, no need to round: Integrality of clustering formulations","author":"Awasthi","year":"2015"},{"key":"2026033012311740800_ref020","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/978-3-642-32512-0_4","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Awasthi","year":"2012"},{"issue":"1","key":"2026033012311740800_ref021","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s13278-019-0566-x","article-title":"Community detection in large-scale social networks: state-of-the-art and future directions","volume":"9","author":"Azaouzi","year":"2019","journal-title":"Social Network Analysis and Mining"},{"key":"2026033012311740800_ref022","first-page":"252","article-title":"Phase retrieval meets statistical learning theory: A flexible convex relaxation","volume-title":"Artificial Intelligence and Statistics","author":"Bahmani","year":"2017"},{"issue":"1","key":"2026033012311740800_ref023","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1111\/1468-0262.00392","article-title":"Inferential theory for factor models of large dimensions","volume":"71","author":"Bai","year":"2003","journal-title":"Econometrica"},{"issue":"4","key":"2026033012311740800_ref024","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.3982\/ECTA6135","article-title":"Panel data models with interactive fixed effects","volume":"77","author":"Bai","year":"2009","journal-title":"Econo-metrica"},{"issue":"1","key":"2026033012311740800_ref025","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1111\/1468-0262.00273","article-title":"Determining the number of factors in approximate factor models","volume":"70","author":"Bai","year":"2002","journal-title":"Econometrica"},{"issue":"2","key":"2026033012311740800_ref026","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/j.jeconom.2008.08.010","article-title":"Forecasting economic time series using targeted predictors","volume":"146","author":"Bai","year":"2008","journal-title":"Journal of Econometrics"},{"key":"2026033012311740800_ref027","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1146\/annurev-economics-080315-015356","article-title":"Econometric analysis of large factor models","volume":"8","author":"Bai","year":"2016","journal-title":"Annual Review of Economics"},{"issue":"473","key":"2026033012311740800_ref028","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1198\/016214505000000628","article-title":"Prediction by supervised principal components","volume":"101","author":"Bair","year":"2006","journal-title":"Journal of the American Statistical Association"},{"key":"2026033012311740800_ref029","first-page":"324","volume-title":"SMAC: Simultaneous mapping and clustering using spectral decompositions","author":"Bajaj","year":"2018"},{"issue":"1","key":"2026033012311740800_ref030","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1214\/16-AOS1435","article-title":"Statistical guarantees for the EM algorithm: From population to sample-based analysis","volume":"45","author":"Balakrishnan","year":"2017","journal-title":"The Annals of Statistics"},{"key":"2026033012311740800_ref031","first-page":"954","article-title":"Noise thresholds for spectral clustering","volume-title":"Advances in Neural Information Processing Systems","author":"Balakrishnan","year":"2011"},{"key":"2026033012311740800_ref032","first-page":"1293","article-title":"Streaming PCA and subspace tracking: The missing data case","author":"Balzano","year":"2018"},{"issue":"1-2","key":"2026033012311740800_ref033","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10107-016-1059-6","article-title":"Tightness of the maximum likelihood semidefinite relaxation for angular synchronization","volume":"163","author":"Bandeira","year":"2017","journal-title":"Mathematical Programming"},{"issue":"4","key":"2026033012311740800_ref034","doi-asserted-by":"crossref","first-page":"2479","DOI":"10.1214\/15-AOP1025","article-title":"Sharp nonasymptotic bounds on the norm of random matrices with independent entries","volume":"44","author":"Bandeira","year":"2016","journal-title":"The Annals of Probability"},{"key":"2026033012311740800_ref035","volume-title":"Statistical inference for principal components of spiked covariance matrix","author":"Bao","year":"2020"},{"issue":"1","key":"2026033012311740800_ref036","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1214\/20-AOS1960","article-title":"Singular vector and singular subspace distribution for the matrix denoising model","volume":"49","author":"Bao","year":"2021","journal-title":"The Annals of Statistics"},{"key":"2026033012311740800_ref037","first-page":"417","volume-title":"Noisy tensor completion via the sum-of-squares hierarchy","author":"Barak","year":"2016"},{"issue":"6","key":"2026033012311740800_ref038","doi-asserted-by":"crossref","first-page":"1373","DOI":"10.1162\/089976603321780317","article-title":"Laplacian eigenmaps for dimensionality reduction and data representation","volume":"15","author":"Belkin","year":"2003","journal-title":"Neural Computation"},{"key":"2026033012311740800_ref039","volume-title":"Matrix analysis","author":"Bhatia","year":"2013"},{"issue":"2","key":"2026033012311740800_ref040","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1093\/biomet\/asx008","article-title":"Covariate-assisted spectral clustering","volume":"104","author":"Binkiewicz","year":"2017","journal-title":"Biometrika"},{"key":"2026033012311740800_ref041","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001","volume-title":"Concentration inequalities: A nonasymptotic theory of independence","author":"Boucheron","year":"2013"},{"key":"2026033012311740800_ref042","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.laa.2015.02.027","article-title":"Low-rank matrix completion via preconditioned optimization on the Grassmann manifold","volume":"475","author":"Boumal","year":"2015","journal-title":"Linear Algebra and its Applications"},{"issue":"3\/4","key":"2026033012311740800_ref043","doi-asserted-by":"crossref","first-page":"324","DOI":"10.2307\/2334029","article-title":"Rank analysis of incomplete block designs: I. The method of paired comparisons","volume":"39","author":"Bradley","year":"1952","journal-title":"Biometrika"},{"key":"2026033012311740800_ref044","volume-title":"Markov chains: Gibbs fields, Monte Carlo simulation, and queues","author":"Br\u00e9maud","year":"2013"},{"key":"2026033012311740800_ref045","first-page":"358","volume-title":"Community detection for hierarchical image segmentation","author":"Browet","year":"2011"},{"issue":"2","key":"2026033012311740800_ref046","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1214\/20-AOS1986","article-title":"Subspace estimation from unbalanced and incomplete data matrices: \u21132,\u221e statistical guarantees","volume":"49","author":"Cai","year":"2021","journal-title":"The Annals of Statistics"},{"key":"2026033012311740800_ref047","first-page":"1863","article-title":"Nonconvex low-rank symmetric tensor completion from noisy data","volume-title":"Advances in Neural Information Processing Systems","author":"Cai","year":"2019"},{"key":"2026033012311740800_ref048","article-title":"Nonconvex low-rank tensor completion from noisy data","volume-title":"Operations Research","author":"Cai","year":"2021"},{"key":"2026033012311740800_ref049","first-page":"1271","volume-title":"Uncertainty quantification for nonconvex tensor completion: Confidence intervals, heteroscedasticity and optimality","author":"Cai","year":"2020"},{"issue":"1","key":"2026033012311740800_ref050","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/s10915-018-0857-9","article-title":"Fast rank-one alternating minimization algorithm for phase retrieval","volume":"79","author":"Cai","year":"2019","journal-title":"Journal of Scientific Computing"},{"issue":"3","key":"2026033012311740800_ref051","doi-asserted-by":"crossref","first-page":"1027","DOI":"10.1214\/14-AOS1290","article-title":"Robust and computationally feasible community detection in the presence of arbitrary outlier nodes","volume":"43","author":"Cai","year":"2015","journal-title":"The Annals of Statistics"},{"issue":"5","key":"2026033012311740800_ref052","doi-asserted-by":"crossref","first-page":"2221","DOI":"10.1214\/16-AOS1443","article-title":"Optimal rates of convergence for noisy sparse phase retrieval via thresholded Wirtinger flow","volume":"44","author":"Cai","year":"2016","journal-title":"The Annals of Statistics"},{"issue":"6","key":"2026033012311740800_ref053","doi-asserted-by":"crossref","first-page":"3074","DOI":"10.1214\/13-AOS1178","article-title":"Sparse PCA: Optimal rates and adaptive estimation","volume":"41","author":"Cai","year":"2013","journal-title":"The Annals of Statistics"},{"issue":"1","key":"2026033012311740800_ref054","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1214\/14-AOS1267","article-title":"ROP: Matrix recovery via rank-one projections","volume":"43","author":"Cai","year":"2015","journal-title":"The Annals of Statistics"},{"issue":"1","key":"2026033012311740800_ref055","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1214\/17-AOS1541","article-title":"Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics","volume":"46","author":"Cai","year":"2018","journal-title":"The Annals of Statistics"},{"key":"2026033012311740800_ref056","first-page":"16","volume-title":"A non-convex blind calibration method for randomised sensing strategies","author":"Cambareri","year":"2016"},{"issue":"4","key":"2026033012311740800_ref057","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1109\/TIT.2015.2399924","article-title":"Phase retrieval via Wirtinger flow: Theory and algorithms","volume":"61","author":"Cand\u00e8s","year":"2015","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026033012311740800_ref058","volume-title":"Mathematics of sparsity (and a few other things)","author":"Cand\u00e8s","year":"2014"},{"issue":"3","key":"2026033012311740800_ref059","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1970392.1970395","article-title":"Robust principal component analysis?","volume":"58","author":"Cand\u00e8s","year":"2011","journal-title":"Journal of the ACM (JACM)"},{"issue":"2","key":"2026033012311740800_ref060","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.acha.2014.09.004","article-title":"Phase retrieval from coded diffraction patterns","volume":"39","author":"Cand\u00e8s","year":"2015","journal-title":"Applied and Computational Harmonic Analysis"},{"key":"2026033012311740800_ref061","first-page":"925","article-title":"Matrix completion with noise","author":"Cand\u00e8s","year":"2010"},{"issue":"8","key":"2026033012311740800_ref062","doi-asserted-by":"crossref","first-page":"1241","DOI":"10.1002\/cpa.21432","article-title":"Phaselift: Exact and stable signal recovery from magnitude measurements via convex programming","volume":"66","author":"Cand\u00e8s","year":"2013","journal-title":"Communications on Pure and Applied Mathematics"},{"issue":"6","key":"2026033012311740800_ref063","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","article-title":"Exact matrix completion via convex optimization","volume":"9","author":"Cand\u00e8s","year":"2009","journal-title":"Foundations of Computational Mathematics"},{"issue":"5","key":"2026033012311740800_ref064","doi-asserted-by":"crossref","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","article-title":"The power of convex relaxation: Near-optimal matrix completion","volume":"56","author":"Cand\u00e8s","year":"2010","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"2026033012311740800_ref065","doi-asserted-by":"crossref","first-page":"1609","DOI":"10.1109\/TSP.2015.2500192","article-title":"Poisson matrix recovery and completion","volume":"64","author":"Cao","year":"2015","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"5","key":"2026033012311740800_ref066","doi-asserted-by":"crossref","first-page":"2405","DOI":"10.1214\/18-AOS1752","article-title":"The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics","volume":"47","author":"Cape","year":"2019","journal-title":"The Annals of Statistics"},{"key":"2026033012311740800_ref067","first-page":"1","article-title":"Aggregation and social choice: A mean voter theorem","volume-title":"Econometrica: Journal of the Econometric Society:","author":"Caplin","year":"1991"},{"key":"2026033012311740800_ref068","first-page":"1","volume-title":"Phasepack: A phase retrieval library","author":"Chandra","year":"2019"},{"key":"2026033012311740800_ref069","first-page":"1610","volume-title":"Latent variable graphical model selection via convex optimization","author":"Chandrasekaran","year":"2010"},{"issue":"2","key":"2026033012311740800_ref070","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1137\/090761793","article-title":"Rank-sparsity incoherence for matrix decomposition","volume":"21","author":"Chandrasekaran","year":"2011","journal-title":"SIAM Journal on Optimization"},{"key":"2026033012311740800_ref071","first-page":"1","article-title":"Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence","volume-title":"Foundations of Computational Mathematics:","author":"Charisopoulos","year":"2021"},{"key":"2026033012311740800_ref072","volume-title":"Composite optimization for robust blind deconvolution","author":"Charisopoulos","year":"2019"},{"issue":"1","key":"2026033012311740800_ref073","first-page":"177","article-title":"Matrix estimation by universal singular value thresholding","volume":"43","author":"Chatterjee","year":"2014","journal-title":"The Annals of Statistics"},{"key":"2026033012311740800_ref074","volume-title":"Spectral clustering of graphs with general degrees in the extended planted partition model","author":"Chaudhuri","year":"2012"},{"key":"2026033012311740800_ref075","first-page":"460","article-title":"A reduced-dimension fMRI shared response model","volume-title":"Advances in Neural Information Processing Systems","author":"Chen","year":"2015"},{"issue":"9","key":"2026033012311740800_ref076","doi-asserted-by":"crossref","first-page":"5806","DOI":"10.1109\/TIT.2020.2992234","article-title":"Nonconvex rectangular matrix completion via gradient descent without \u21132,\u221e regularization","volume":"66","author":"Chen","year":"2020","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026033012311740800_ref077","volume-title":"Normal approximation by Stein\u2019s method","author":"Chen","year":"2010"},{"issue":"3","key":"2026033012311740800_ref078","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1137\/16M1107747","article-title":"Phase retrieval by linear algebra","volume":"38","author":"Chen","year":"2017","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"16","key":"2026033012311740800_ref079","doi-asserted-by":"crossref","first-page":"4339","DOI":"10.1109\/TSP.2015.2442958","article-title":"Phase transitions in spectral community detection","volume":"63","author":"Chen","year":"2015","journal-title":"IEEE Transactions on Signal Processing"},{"key":"2026033012311740800_ref080","volume-title":"Partial recovery for top-K ranking: Optimality of MLE and sub-optimality of spectral method","author":"Chen","year":"2020"},{"key":"2026033012311740800_ref081","volume-title":"Global and individualized community detection in inhomogeneous multilayer networks","author":"Chen","year":"2020"},{"key":"2026033012311740800_ref082","first-page":"193","volume-title":"Pairwise ranking aggregation in a crowdsourced setting","author":"Chen","year":"2013"},{"key":"2026033012311740800_ref083","volume-title":"Cutoff for exact recovery of Gaussian mixture models","author":"Chen","year":"2020"},{"issue":"7","key":"2026033012311740800_ref084","doi-asserted-by":"crossref","first-page":"4034","DOI":"10.1109\/TIT.2015.2429594","article-title":"Exact and stable covari-ance estimation from quadratic sampling via convex programming","volume":"61","author":"Chen","year":"2015","journal-title":"IEEE Transactions on Information Theory"},{"issue":"7","key":"2026033012311740800_ref085","doi-asserted-by":"crossref","first-page":"4613","DOI":"10.1109\/TIT.2021.3065700","article-title":"Learning mixtures of low-rank models","volume":"67","author":"Chen","year":"2021","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"2026033012311740800_ref086","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/MSP.2018.2821706","article-title":"Harnessing structures in big data via guaranteed low-rank matrix estimation: Recent theory and fast algorithms via convex and nonconvex optimization","volume":"35","author":"Chen","year":"2018","journal-title":"IEEE Signal Processing Magazine"},{"key":"2026033012311740800_ref087","volume-title":"Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees","author":"Chen","year":"2015"},{"issue":"5","key":"2026033012311740800_ref088","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1002\/cpa.21638","article-title":"Solving random quadratic systems of equations is nearly as easy as solving linear systems","volume":"70","author":"Chen","year":"2017","journal-title":"Communications on Pure and Applied Mathematics"},{"issue":"8","key":"2026033012311740800_ref089","doi-asserted-by":"crossref","first-page":"1648","DOI":"10.1002\/cpa.21760","article-title":"The projected power method: An efficient algorithm for joint alignment from pairwise differences","volume":"71","author":"Chen","year":"2018","journal-title":"Communications on Pure and Applied Mathematics"},{"issue":"1","key":"2026033012311740800_ref090","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1214\/20-AOS1963","article-title":"Asymmetry helps: Eigenvalue and eigenvector analyses of asymmetrically perturbed low-rank matrices","volume":"49","author":"Chen","year":"2021","journal-title":"The Annals of Statistics"},{"issue":"10","key":"2026033012311740800_ref091","doi-asserted-by":"crossref","first-page":"6576","DOI":"10.1109\/TIT.2014.2343623","article-title":"Robust spectral compressed sensing via structured matrix completion","volume":"60","author":"Chen","year":"2014","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1-2","key":"2026033012311740800_ref092","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10107-019-01363-6","article-title":"Gradient descent with random initialization: Fast global convergence for nonconvex phase retrieval","volume":"176","author":"Chen","year":"2019","journal-title":"Mathematical Programming"},{"issue":"4","key":"2026033012311740800_ref093","doi-asserted-by":"crossref","first-page":"3098","DOI":"10.1137\/19M1290000","article-title":"Noisy matrix completion: Understanding statistical guarantees for convex relaxation via nonconvex optimization","volume":"30","author":"Chen","year":"2020","journal-title":"SIAM Journal on Optimization"},{"issue":"4","key":"2026033012311740800_ref094","doi-asserted-by":"crossref","first-page":"2204","DOI":"10.1214\/18-AOS1745","article-title":"Spectral method and regularized MLE are both optimal for top-\u039a ranking","volume":"47","author":"Chen","year":"2019","journal-title":"The Annals of Statistics"},{"key":"2026033012311740800_ref095","first-page":"22931","article-title":"Inference and uncertainty quantification for noisy matrix completion","author":"Chen","year":"2019"},{"key":"2026033012311740800_ref096","doi-asserted-by":"crossref","DOI":"10.1214\/21-AOS2066","article-title":"Bridging convex and nonconvex optimization in robust PCA: Noise, outliers, and missing data","volume-title":"accepted to The Annals of Statistics","author":"Chen","year":"2021"},{"key":"2026033012311740800_ref097","article-title":"Convex and nonconvex optimization are both minimax-optimal for noisy blind deconvolu-tion","volume-title":"accepted to Journal of the American Statistical Association","author":"Chen","year":"2021"},{"key":"2026033012311740800_ref098","first-page":"100","volume-title":"Near-optimal joint object matching via convex relaxation","author":"Chen","year":"2014"},{"key":"2026033012311740800_ref099","first-page":"689","volume-title":"Community recovery in graphs with locality","author":"Chen","year":"2016"},{"key":"2026033012311740800_ref100","first-page":"371","volume-title":"Spectral MLE: Top-K rank aggregation from pairwise comparisons","author":"Chen","year":"2015"},{"issue":"10","key":"2026033012311740800_ref101","doi-asserted-by":"crossref","first-page":"5881","DOI":"10.1109\/TIT.2016.2600566","article-title":"Information recovery from pairwise measurements","volume":"62","author":"Chen","year":"2016","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026033012311740800_ref102","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.2021.3111828","article-title":"Tackling small eigen-gaps: Fine-grained eigenvector estimation and inference under heteroscedastic noise","volume-title":"accepted to IEEE Transactions on Information Theory","author":"Cheng","year":"2021"},{"key":"2026033012311740800_ref103","first-page":"797","volume-title":"Nearly optimal robust matrix completion","author":"Cherapanamjeri","year":"2017"},{"key":"2026033012311740800_ref104","volume-title":"Inference for low-rank models","author":"Chernozhukov","year":"2021"},{"issue":"17","key":"2026033012311740800_ref105","doi-asserted-by":"crossref","first-page":"4429","DOI":"10.1109\/TSP.2017.2712127","article-title":"Subspace learning from bits","volume":"65","author":"Chi","year":"2017","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"20","key":"2026033012311740800_ref106","doi-asserted-by":"crossref","first-page":"5239","DOI":"10.1109\/TSP.2019.2937282","article-title":"Nonconvex optimization meets low-rank matrix factorization: An overview","volume":"67","author":"Chi","year":"2019","journal-title":"IEEE Transactions on Signal Processing"},{"key":"2026033012311740800_ref107","first-page":"391","volume-title":"Stochastic block model and community detection in sparse graphs: A spectral algorithm with optimal rate of recovery","author":"Chin","year":"2015"},{"issue":"2","key":"2026033012311740800_ref108","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1017\/S0963548309990514","article-title":"Graph partitioning via adaptive spectral techniques","volume":"19","author":"Coja-Oghlan","year":"2010","journal-title":"Combinatorics, Probability & Computing"},{"key":"2026033012311740800_ref109","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.laa.2020.01.039","article-title":"Exact recovery in the hypergraph stochastic block model: A spectral algorithm","volume":"593","author":"Cole","year":"2020","journal-title":"Linear Algebra and its Applications"},{"issue":"1","key":"2026033012311740800_ref110","first-page":"1","article-title":"Fisher lecture: Dimension reduction in regression","volume":"22","author":"Cook","year":"2007","journal-title":"Statistical Science"},{"key":"2026033012311740800_ref111","volume-title":"Minimax Sample Complexity for Turn-based Stochastic Game","author":"Cui","year":"2021"},{"key":"2026033012311740800_ref112","first-page":"285","volume-title":"Aggregating crowdsourced binary ratings","author":"Dalvi","year":"2013"},{"key":"2026033012311740800_ref113","first-page":"2345","volume-title":"Sharp Statistical Guaratees for Adversarially Robust Gaussian Classification","author":"Dan","year":"2020"},{"key":"2026033012311740800_ref114","first-page":"634","volume-title":"Learning mixtures of Gaussians","author":"Dasgupta","year":"1999"},{"issue":"3","key":"2026033012311740800_ref115","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1093\/imaiai\/iau006","article-title":"1-bit matrix completion","volume":"3","author":"Davenport","year":"2014","journal-title":"Information and Inference: A Journal of the IMA"},{"issue":"4","key":"2026033012311740800_ref116","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1109\/JSTSP.2016.2539100","article-title":"An overview of low-rank matrix recovery from incomplete observations","volume":"10","author":"Davenport","year":"2016","journal-title":"IEEE Journal of Selected Topics in Signal Processing"},{"issue":"1","key":"2026033012311740800_ref117","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0707001","article-title":"The rotation of eigenvectors by a perturbation. III","volume":"7","author":"Davis","year":"1970","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"2026033012311740800_ref118","first-page":"1071","volume-title":"Phase retrieval via linear programming: Fundamental limits and algorithmic improvements","author":"Dhifallah","year":"2017"},{"key":"2026033012311740800_ref119","first-page":"696","article-title":"Comparison theorems for reversible Markov chains","volume-title":"The Annals of Applied Probability:","author":"Diaconis","year":"1993"},{"issue":"11","key":"2026033012311740800_ref120","doi-asserted-by":"crossref","first-page":"7274","DOI":"10.1109\/TIT.2020.2992769","article-title":"Leave-one-out approach for matrix completion: Primal and dual analysis","volume":"66","author":"Ding","year":"2020","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026033012311740800_ref121","doi-asserted-by":"crossref","first-page":"387","DOI":"10.3150\/19-BEJ1129","article-title":"High dimensional deformed rectangular matrices with applications in matrix denoising","volume":"26","author":"Ding","year":"2020","journal-title":"Bernoulli"},{"issue":"19","key":"2026033012311740800_ref122","doi-asserted-by":"crossref","first-page":"5152","DOI":"10.1109\/TSP.2018.2864660","article-title":"Nonconvex demixing from bilinear measurements","volume":"66","author":"Dong","year":"2018","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"2","key":"2026033012311740800_ref123","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1023\/A:1022303426500","article-title":"A note on sin \u0398 theorems for singular subspace variations","volume":"40","author":"Dopico","year":"2000","journal-title":"BIT Numerical Mathematics"},{"key":"2026033012311740800_ref124","volume-title":"Few-shot learning via learning the representation, provably","author":"Du","year":"2020"},{"key":"2026033012311740800_ref125","first-page":"505","article-title":"Slicing regression: a link-free regression method","volume-title":"The Annals of Statistics:","author":"Duan","year":"1991"},{"key":"2026033012311740800_ref126","first-page":"4486","article-title":"State aggregation learning from Markov transition data","volume-title":"Advances in Neural Information Processing Systems","author":"Duan","year":"2019"},{"issue":"3","key":"2026033012311740800_ref127","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1093\/imaiai\/iay015","article-title":"Solving (most) of a set of quadratic equalities: Composite optimization for robust phase retrieval","volume":"8","author":"Duchi","year":"2019","journal-title":"Information and Inference: A Journal of the IMA"},{"issue":"8","key":"2026033012311740800_ref128","doi-asserted-by":"crossref","first-page":"5182","DOI":"10.1109\/TIT.2020.2981910","article-title":"Analysis of spectral methods for phase retrieval with random orthogonal matrices","volume":"66","author":"Dudeja","year":"2020","journal-title":"IEEE Transactions on Information Theory"},{"issue":"7","key":"2026033012311740800_ref129","volume":"200","author":"Durrett","year":"2007","journal-title":"Random graph dynamics"},{"key":"2026033012311740800_ref130","first-page":"613","volume-title":"Rank aggregation methods for the web","author":"Dwork","year":"2001"},{"issue":"1-2","key":"2026033012311740800_ref131","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s00440-016-0754-9","article-title":"On the impact of predictor geometry on the performance on high-dimensional ridge-regularized generalized robust regression estimators","volume":"170","author":"El Karoui","year":"2018","journal-title":"Probability Theory and Related Fields"},{"key":"2026033012311740800_ref132","first-page":"14557","article-title":"On robust regression with high-dimensional predictors","author":"El Karoui","year":"2013"},{"issue":"3","key":"2026033012311740800_ref133","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1016\/j.acha.2013.08.003","article-title":"Phase retrieval: Stability and recovery guarantees","volume":"36","author":"Eldar","year":"2014","journal-title":"Applied and Computational Harmonic Analysis"},{"key":"2026033012311740800_ref134","first-page":"321","article-title":"Unperturbed: Spectral analysis beyond Davis-Kahan","volume-title":"Algorithmic Learning Theory","author":"Eldridge","year":"2018"},{"key":"2026033012311740800_ref135","first-page":"373","article-title":"High-rank matrix completion","volume-title":"Artificial Intelligence and Statistics","author":"Eriksson","year":"2012"},{"issue":"6","key":"2026033012311740800_ref136","doi-asserted-by":"crossref","first-page":"2605","DOI":"10.1214\/07-AOS504","article-title":"High dimensional classification using features annealed independence rules","volume":"36","author":"Fan","year":"2008","journal-title":"Annals of statistics"},{"key":"2026033012311740800_ref137","volume-title":"SIMPLE: Statistical inference on membership profiles in large networks","author":"Fan","year":"2019"},{"key":"2026033012311740800_ref138","first-page":"1","article-title":"Asymptotic theory of eigenvectors for random matrices with diverging spikes","volume-title":"Journal of the American Statistical Association:","author":"Fan","year":"2020"},{"issue":"2","key":"2026033012311740800_ref139","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1093\/nsr\/nwt032","article-title":"Challenges of big data analysis","volume":"1","author":"Fan","year":"2014","journal-title":"National science review"},{"key":"2026033012311740800_ref140","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1146\/annurev-financial-091420-011735","article-title":"Recent developments on factor models and applications in econometric learning","volume":"13","author":"Fan","year":"2021","journal-title":"Annual Review of Financial Economics"},{"key":"2026033012311740800_ref141","doi-asserted-by":"crossref","DOI":"10.1201\/9780429096280","volume-title":"Statistical foundations of data science","author":"Fan","year":"2020"},{"issue":"4","key":"2026033012311740800_ref142","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1111\/rssb.12016","article-title":"Large covariance estimation by thresholding principal orthogonal complements","volume":"75","author":"Fan","year":"2013","journal-title":"Journal of the Royal Statistical Society. Series B, Statistical methodology"},{"issue":"1","key":"2026033012311740800_ref143","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1214\/15-AOS1364","article-title":"Projected principal component analysis in factor models","volume":"44","author":"Fan","year":"2016","journal-title":"The Annals of Statistics"},{"issue":"4","key":"2026033012311740800_ref144","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.3982\/ECTA12749","article-title":"Power enhancement in high-dimensional cross-sectional tests","volume":"83","author":"Fan","year":"2015","journal-title":"Econometrica"},{"issue":"5","key":"2026033012311740800_ref145","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1111\/j.1467-9868.2008.00674.x","article-title":"Sure independence screening for ultrahigh dimensional feature space","volume":"70","author":"Fan","year":"2008","journal-title":"Journal of the Royal Statistical Society: Series B (Statistical Methodology)"},{"key":"2026033012311740800_ref146","first-page":"1","volume-title":"Wiley Stats Ref: Statistics Reference Online","author":"Fan","year":"2018"},{"issue":"6","key":"2026033012311740800_ref147","doi-asserted-by":"crossref","first-page":"3009","DOI":"10.1214\/18-AOS1713","article-title":"Distributed estimation of principal eigenspaces","volume":"47","author":"Fan","year":"2019","journal-title":"The Annals of Statistics"},{"issue":"2","key":"2026033012311740800_ref148","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1214\/20-STS785","article-title":"Robust high-dimensional factor models with applications to statistical machine learning","volume":"36","author":"Fan","year":"2021","journal-title":"Statistical Science"},{"key":"2026033012311740800_ref149","first-page":"1","article-title":"An \u2113\u221e eigenvector perturbation bound and its application to robust covariance estimation","volume":"18","author":"Fan","year":"2018","journal-title":"Journal of Machine Learning Research"},{"key":"2026033012311740800_ref150","volume-title":"Spiked covariances and principal components analysis in high-dimensional random effects models","author":"Fan","year":"2018"},{"key":"2026033012311740800_ref151","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1017\/S0962492920000069","article-title":"The numerics of phase retrieval","volume":"29","author":"Fannjiang","year":"2020","journal-title":"Acta Numerica"},{"issue":"1","key":"2026033012311740800_ref152","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1109\/TIT.2018.2839677","article-title":"Exponential error rates of SDP for block models: Beyond Grothendieck\u2019s inequality","volume":"65","author":"Fei","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026033012311740800_ref153","first-page":"1931","volume-title":"Hidden integrality of SDP relaxations for sub-Gaussian mixture models","author":"Fei","year":"2018"},{"key":"2026033012311740800_ref154","first-page":"1235","volume-title":"Achieving the Bayes error rate in stochastic block model by SDP, robustly","author":"Fei","year":"2019"},{"key":"2026033012311740800_ref155","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-4549-5","volume-title":"A course in large sample theory","author":"Ferguson","year":"1996"},{"issue":"15","key":"2026033012311740800_ref156","doi-asserted-by":"crossref","first-page":"2758","DOI":"10.1364\/AO.21.002758","article-title":"Phase retrieval algorithms: A comparison","volume":"21","author":"Fienup","year":"1982","journal-title":"Applied optics"},{"issue":"1","key":"2026033012311740800_ref157","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1137\/120875600","article-title":"Consistent adjacency-spectral partitioning for the stochastic block model when the model parameters are unknown","volume":"34","author":"Fishkind","year":"2013","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"2026033012311740800_ref158","first-page":"943","volume-title":"Spectral thresholds in the bipartite stochastic block model","author":"Florescu","year":"2016"},{"key":"2026033012311740800_ref159","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1080\/00029890.1957.11989117","article-title":"Solution of a ranking problem from binary comparisons","volume":"64","author":"Ford Jr","year":"1957","journal-title":"The American Mathematical Monthly"},{"issue":"4","key":"2026033012311740800_ref160","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1162\/003465300559037","article-title":"The generalized dynamic-factor model: Identification and estimation","volume":"82","author":"Forni","year":"2000","journal-title":"Review of Economics and statistics"},{"key":"2026033012311740800_ref161","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2016.09.002","article-title":"Community detection in networks: A user guide","volume":"659","author":"Fortunato","year":"2016","journal-title":"Physics Reports"},{"issue":"2","key":"2026033012311740800_ref162","doi-asserted-by":"crossref","first-page":"1264","DOI":"10.1109\/TIT.2020.3039308","article-title":"Weighted matrix completion from non-random, non-uniform sampling patterns","volume":"67","author":"Foucart","year":"2020","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026033012311740800_ref163","doi-asserted-by":"crossref","first-page":"3225","DOI":"10.1109\/TSP.2020.2993153","article-title":"Guaranteed recovery of one-hidden-layer neural networks via cross entropy","volume":"68","author":"Fu","year":"2020","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"1","key":"2026033012311740800_ref164","first-page":"1980","article-title":"Achieving optimal misclassification proportion in stochastic block models","volume":"18","author":"Gao","year":"2017","journal-title":"Journal of Machine Learning Research"},{"key":"2026033012311740800_ref165","first-page":"2741","volume-title":"Efficient algorithms for large-scale generalized eigenvector computation and canonical correlation analysis","author":"Ge","year":"2016"},{"issue":"6","key":"2026033012311740800_ref166","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/34.927464","article-title":"From few to many: Illumination cone models for face recognition under variable lighting and pose","volume":"23","author":"Georghiades","year":"2001","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"2026033012311740800_ref167","first-page":"167","volume-title":"Who moderates the moderators? crowdsourcing abuse detection in user-generated content","author":"Ghosh","year":"2011"},{"key":"2026033012311740800_ref168","first-page":"1093","volume-title":"Alternating minimization converges super-linearly for mixed linear regression","author":"Ghosh","year":"2020"},{"issue":"3","key":"2026033012311740800_ref169","doi-asserted-by":"crossref","first-page":"317","DOI":"10.4171\/msl\/8","article-title":"Partial recovery bounds for clustering with the relaxed K-means","volume":"1","author":"Giraud","year":"2019","journal-title":"Mathematical Statistics and Learning"},{"issue":"4","key":"2026033012311740800_ref170","doi-asserted-by":"crossref","first-page":"2675","DOI":"10.1109\/TIT.2018.2800768","article-title":"Phasemax: Convex phase retrieval via basis pursuit","volume":"64","author":"Goldstein","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2026033012311740800_ref171","doi-asserted-by":"crossref","first-page":"1548","DOI":"10.1109\/TIT.2011.2104999","article-title":"Recovering low-rank matrices from few coefficients in any basis","volume":"57","author":"Gross","year":"2011","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026033012311740800_ref172","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.acha.2015.05.004","article-title":"Improved recovery guarantees for phase retrieval from coded diffraction patterns","volume":"42","author":"Gross","year":"2017","journal-title":"Applied and Computational Harmonic Analysis"},{"key":"2026033012311740800_ref173","first-page":"1475","article-title":"Minimax-optimal inference from partial rankings","volume":"27","author":"Hajek","year":"2014","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"5","key":"2026033012311740800_ref174","doi-asserted-by":"crossref","first-page":"2788","DOI":"10.1109\/TIT.2016.2546280","article-title":"Achieving exact cluster recovery threshold via semidefinite programming","volume":"62","author":"Hajek","year":"2016","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026033012311740800_ref175","volume-title":"An optimal statistical and computational framework for generalized tensor estimation","author":"Han","year":"2020"},{"key":"2026033012311740800_ref176","first-page":"1","article-title":"Eigen selection in spectral clustering: a theory guided practice","volume-title":"Journal of the American Statistical Association","author":"Han","year":"2021"},{"key":"2026033012311740800_ref177","volume-title":"Universal rank inference via residual subsampling with application to large networks","author":"Han","year":"2019"},{"issue":"3","key":"2026033012311740800_ref178","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1016\/j.acha.2016.01.001","article-title":"Phaselift is robust to a constant fraction of arbitrary errors","volume":"42","author":"Hand","year":"2017","journal-title":"Applied and Computational Harmonic Analysis"},{"key":"2026033012311740800_ref179","volume-title":"Corruption robust phase retrieval via linear programming","author":"Hand","year":"2016"},{"key":"2026033012311740800_ref180","first-page":"1029","article-title":"Large sample properties of generalized method of moments estimators","volume-title":"Econometrica: Journal of the Econometric Society:","author":"Hansen","year":"1982"},{"key":"2026033012311740800_ref181","first-page":"651","volume-title":"Understanding alternating minimization for matrix completion","author":"Hardt","year":"2014"},{"issue":"6","key":"2026033012311740800_ref182","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2512329","article-title":"Most tensor problems are NP-hard","volume":"60","author":"Hillar","year":"2013","journal-title":"Journal of the ACM"},{"issue":"2","key":"2026033012311740800_ref183","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0378-8733(83)90021-7","article-title":"Stochastic blockmodels: First steps","volume":"5","author":"Holland","year":"1983","journal-title":"Social networks"},{"key":"2026033012311740800_ref184","first-page":"178","volume-title":"Fast spectral algorithms from sum-of-squares proofs: Tensor decomposition and planted sparse vectors","author":"Hopkins","year":"2016"},{"key":"2026033012311740800_ref185","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139020411","volume-title":"Matrix analysis","author":"Horn","year":"2012"},{"key":"2026033012311740800_ref186","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1214\/18-PS321","article-title":"Time-uniform Chernoff bounds via nonnegative supermartingales","volume":"17","author":"Howard","year":"2020","journal-title":"Probability Surveys"},{"key":"2026033012311740800_ref187","article-title":"COMS 4772: advanced machine learning","volume-title":"Lecture notes, Columbia University","author":"Hsu","year":"2016"},{"key":"2026033012311740800_ref188","first-page":"11","volume-title":"Learning mixtures of spherical Gaussians: Moment methods and spectral decompositions","author":"Hsu","year":"2013"},{"issue":"4","key":"2026033012311740800_ref189","first-page":"1","article-title":"Tensor maps for synchronizing heterogeneous shape collections","volume":"38","author":"Huang","year":"2019","journal-title":"ACM Transactions on Graphics (TOG)"},{"issue":"4","key":"2026033012311740800_ref190","doi-asserted-by":"crossref","first-page":"2757","DOI":"10.1137\/17M1151390","article-title":"Blind deconvolution by a steepest descent algorithm on a quotient manifold","volume":"11","author":"Huang","year":"2018","journal-title":"SIAM Journal on Imaging Sciences"},{"key":"2026033012311740800_ref191","first-page":"8082","volume-title":"Learning transformation synchronization","author":"Huang","year":"2019"},{"issue":"5","key":"2026033012311740800_ref192","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1111\/cgf.12184","article-title":"Consistent shape maps via semidefinite programming","volume":"32","author":"Huang","year":"2013","journal-title":"Computer Graphics Forum"},{"key":"2026033012311740800_ref193","volume-title":"Robust statistics","author":"Huber","year":"2004"},{"issue":"1","key":"2026033012311740800_ref194","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1214\/aos\/1079120141","article-title":"MM algorithms for generalized Bradley-Terry models","volume":"32","author":"Hunter","year":"2004","journal-title":"The annals of statistics"},{"issue":"2","key":"2026033012311740800_ref195","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1007\/s10107-016-1097-0","article-title":"Probably certifiably correct k-means clustering","volume":"165","author":"Iguchi","year":"2017","journal-title":"Mathematical Programming"},{"key":"2026033012311740800_ref196","first-page":"263","article-title":"Phase retrieval: An overview of recent developments","volume-title":"Optical Compressive Imaging:","author":"Jaganathan","year":"2016"},{"issue":"7","key":"2026033012311740800_ref197","doi-asserted-by":"crossref","first-page":"4434","DOI":"10.1109\/TIT.2019.2902924","article-title":"Sample-efficient algorithms for recovering structured signals from magnitude-only measurements","volume":"65","author":"Jagatap","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3-4","key":"2026033012311740800_ref198","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1561\/2200000058","article-title":"Non-convex optimization for machine learning","volume":"10","author":"Jain","year":"2017","journal-title":"Foundations and Trends\u00ae in Machine Learning"},{"key":"2026033012311740800_ref199","first-page":"665","volume-title":"Low-rank matrix completion using alternating minimization","author":"Jain","year":"2013"},{"key":"2026033012311740800_ref200","first-page":"1001","volume-title":"Clustering partially observed graphs via convex optimization","author":"Jalali","year":"2011"},{"key":"2026033012311740800_ref201","volume-title":"Top-K ranking from pairwise comparisons: When spectral ranking is optimal","author":"Jang","year":"2016"},{"issue":"5-6","key":"2026033012311740800_ref202","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1561\/2200000057","article-title":"Spectral learning on matrices and tensors","volume":"12","author":"Janzamin","year":"2019","journal-title":"Foundations and Trends in Machine Learning"},{"issue":"3","key":"2026033012311740800_ref203","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s10208-012-9129-5","article-title":"Localization from incomplete noisy distance measurements","volume":"13","author":"Javanmard","year":"2013","journal-title":"Foundations of Computational Mathematics"},{"issue":"6A","key":"2026033012311740800_ref204","doi-asserted-by":"crossref","first-page":"2593","DOI":"10.1214\/17-AOS1630","article-title":"Debiasing the Lasso: Optimal sample size for Gaussian designs","volume":"46","author":"Javanmard","year":"2018","journal-title":"The Annals of Statistics"},{"key":"2026033012311740800_ref205","volume-title":"Convergence of the randomized Kaczmarz method for phase retrieval","author":"Jeong","year":"2017"},{"key":"2026033012311740800_ref206","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/j.laa.2017.05.002","article-title":"A unified perturbation analysis framework for countable Markov chains","volume":"529","author":"Jiang","year":"2017","journal-title":"Linear Algebra and its Applications"},{"key":"2026033012311740800_ref207","first-page":"4520","article-title":"Provable efficient online matrix completion via non-convex stochastic gradient descent","volume-title":"Advances in Neural Information Processing Systems","author":"Jin","year":"2016"},{"key":"2026033012311740800_ref208","first-page":"4116","article-title":"Local maxima in the likelihood of Gaussian mixture models: Structural results and algorithmic consequences","volume-title":"Advances in Neural Information Processing Systems","author":"Jin","year":"2016"},{"issue":"1","key":"2026033012311740800_ref209","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1214\/14-AOS1265","article-title":"Fast community detection by SCORE","volume":"43","author":"Jin","year":"2015","journal-title":"The Annals of Statistics"},{"issue":"5","key":"2026033012311740800_ref210","doi-asserted-by":"crossref","first-page":"2151","DOI":"10.1214\/16-AOS1522","article-title":"Phase transitions for high dimensional clustering and related problems","volume":"45","author":"Jin","year":"2017","journal-title":"The Annals of Statistics"},{"issue":"2","key":"2026033012311740800_ref211","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1214\/aos\/1009210544","article-title":"On the distribution of the largest eigenvalue in principal components analysis","volume":"29","author":"Johnstone","year":"2001","journal-title":"The Annals of statistics"},{"issue":"486","key":"2026033012311740800_ref212","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1198\/jasa.2009.0121","article-title":"On consistency and sparsity for principal components analysis in high dimensions","volume":"104","author":"Johnstone","year":"2009","journal-title":"Journal of the American Statistical Association"},{"key":"2026033012311740800_ref213","first-page":"1277","article-title":"PCA in high dimensions: An orientation","author":"Johnstone","year":"2018"},{"key":"2026033012311740800_ref214","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-1-4757-1904-8_8","volume-title":"Principal component analysis","author":"Jolliffe","year":"1986"},{"key":"2026033012311740800_ref215","first-page":"553","volume-title":"Efficiently learning mixtures of two Gaussians","author":"Kalai","year":"2010"},{"issue":"3","key":"2026033012311740800_ref216","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1137\/S0097539704445925","article-title":"The spectral method for general mixture models","volume":"38","author":"Kannan","year":"2008","journal-title":"SIAM Journal on Computing"},{"key":"2026033012311740800_ref217","volume-title":"Spectral algorithms","author":"Kannan","year":"2009"},{"key":"2026033012311740800_ref218","first-page":"81","volume-title":"Efficient crowdsourcing for multi-class labeling","author":"Karger","year":"2013"},{"issue":"1","key":"2026033012311740800_ref219","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/opre.2013.1235","article-title":"Budget-optimal task allocation for reliable crowdsourcing systems","volume":"62","author":"Karger","year":"2014","journal-title":"Operations Research"},{"key":"2026033012311740800_ref220","volume-title":"Perturbation theory for linear operators","author":"Kato","year":"2013"},{"key":"2026033012311740800_ref221","volume-title":"A new SVD approach to optimal topic estimation","author":"Ke","year":"2017"},{"key":"2026033012311740800_ref222","first-page":"952","article-title":"Matrix completion from noisy entries","volume-title":"Advances in Neural Information Processing Systems","author":"Keshavan","year":"2009"},{"issue":"6","key":"2026033012311740800_ref223","doi-asserted-by":"crossref","first-page":"2980","DOI":"10.1109\/TIT.2010.2046205","article-title":"Matrix completion from a few entries","volume":"56","author":"Keshavan","year":"2010","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026033012311740800_ref224","doi-asserted-by":"crossref","first-page":"282","DOI":"10.3150\/12-BEJ486","article-title":"Noisy low-rank matrix completion with general sampling distribution","volume":"20","author":"Klopp","year":"2014","journal-title":"Bernoulli"},{"issue":"3","key":"2026033012311740800_ref225","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1137\/07070111X","article-title":"Tensor decompositions and applications","volume":"51","author":"Kolda","year":"2009","journal-title":"SIAM review"},{"issue":"1","key":"2026033012311740800_ref226","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1214\/19-AOS1816","article-title":"Efficient estimation of linear functionals of principal components","volume":"48","author":"Koltchinskii","year":"2020","journal-title":"The Annals of Statistics"},{"issue":"4","key":"2026033012311740800_ref227","doi-asserted-by":"crossref","first-page":"1976","DOI":"10.1214\/15-AIHP705","article-title":"Asymptotics and concentration bounds for bilinear forms of spectral projectors of sample covariance","volume":"52","author":"Koltchinskii","year":"2016","journal-title":"Annales de l\u2019Institut Henri Poincar\u00e9, Probabilit\u00e9s et Statistiques"},{"issue":"5","key":"2026033012311740800_ref228","doi-asserted-by":"crossref","first-page":"2302","DOI":"10.1214\/11-AOS894","article-title":"Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion","volume":"39","author":"Koltchinskii","year":"2011","journal-title":"The Annals of Statistics"},{"key":"2026033012311740800_ref229","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/978-3-319-40519-3_18","volume-title":"High Dimensional Probability VII","author":"Koltchinskii","year":"2016"},{"key":"2026033012311740800_ref230","first-page":"5394","volume-title":"Meta-learning for mixed linear regression","author":"Kong","year":"2020"},{"issue":"4","key":"2026033012311740800_ref231","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1002\/cpa.21957","article-title":"On the convex geometry of blind deconvolution and matrix completion","volume":"74","author":"Krahmer","year":"2021","journal-title":"Communications on Pure and Applied Mathematics"},{"issue":"6","key":"2026033012311740800_ref232","doi-asserted-by":"crossref","first-page":"V273","DOI":"10.1190\/geo2013-0022.1","article-title":"Tensor completion based on nuclear norm minimization for 5D seismic data reconstruction","volume":"78","author":"Kreimer","year":"2013","journal-title":"Geophysics"},{"key":"2026033012311740800_ref233","first-page":"299","volume-title":"Clustering with spectral norm and the k-means algorithm","author":"Kumar","year":"2010"},{"key":"2026033012311740800_ref234","first-page":"1405","volume-title":"On the minimax optimal-ity of the EM algorithm for learning two-component mixed linear regression","author":"Kwon","year":"2021"},{"issue":"3","key":"2026033012311740800_ref235","first-page":"209","article-title":"Factor analysis as a statistical method","volume":"12","author":"Lawley","year":"1962","journal-title":"Journal of the Royal Statistical Society. Series D (The Statistician)"},{"key":"2026033012311740800_ref236","volume-title":"Estimating the number of communities in networks by spectral methods","author":"Le","year":"2015"},{"issue":"3","key":"2026033012311740800_ref237","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1002\/rsa.20713","article-title":"Concentration and regularization of random graphs","volume":"51","author":"Le","year":"2017","journal-title":"Random Structures & Algorithms"},{"key":"2026033012311740800_ref238","first-page":"2925","volume-title":"Concentration of random graphs and application to community detection","author":"Le","year":"2018"},{"issue":"3","key":"2026033012311740800_ref239","doi-asserted-by":"crossref","first-page":"2110","DOI":"10.1137\/17M1143599","article-title":"Spectral methods for passive imaging: Nonasymptotic performance and robustness","volume":"11","author":"Lee","year":"2018","journal-title":"SIAM Journal on Imaging Sciences"},{"issue":"3","key":"2026033012311740800_ref240","doi-asserted-by":"crossref","first-page":"1666","DOI":"10.1109\/TIT.2017.2784479","article-title":"Near-optimal compressed sensing of a class of sparse low-rank matrices via sparse power factorization","volume":"64","author":"Lee","year":"2017","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026033012311740800_ref241","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1214\/14-AOS1274","article-title":"Consistency of spectral clustering in stochastic block models","volume":"43","author":"Lei","year":"2015","journal-title":"The Annals of Statistics"},{"key":"2026033012311740800_ref242","volume-title":"A generic sample splitting approach for refined community recovery in stochastic block models","author":"Lei","year":"2014"},{"key":"2026033012311740800_ref243","volume-title":"Unified \u21132\u2192\u221e eigenspace perturbation theory for symmetric random matrices","author":"Lei","year":"2019"},{"issue":"3-4","key":"2026033012311740800_ref244","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1007\/s00440-017-0824-7","article-title":"Asymptotics for high dimensional regression M-estimates: Fixed design results","volume":"172","author":"Lei","year":"2018","journal-title":"Probability Theory and Related Fields"},{"key":"2026033012311740800_ref245","doi-asserted-by":"crossref","DOI":"10.1201\/9781315119427","volume-title":"Sufficient dimension reduction: Methods and applications with R","author":"Li","year":"2018"},{"key":"2026033012311740800_ref246","volume-title":"Minimax estimation of linear functions of eigenvectors in the face of small eigen-gaps","author":"Li","year":"2021"},{"key":"2026033012311740800_ref247","first-page":"6337","volume-title":"Theory of spectral method for union of subspaces-based random geometry graph","author":"Li","year":"2021"},{"key":"2026033012311740800_ref248","first-page":"12861","article-title":"Breaking the sample size barrier in model-based reinforcement learning with a generative model","volume-title":"Advances in Neural Information Processing Systems (NeurIPS)","author":"Li","year":"2020"},{"issue":"1-2","key":"2026033012311740800_ref249","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1023\/B:JMIV.0000011324.14508.fb","article-title":"A fast spectral method for active 3D shape reconstruction","volume":"20","author":"Li","year":"2004","journal-title":"Journal of Mathematical Imaging and Vision"},{"issue":"420","key":"2026033012311740800_ref250","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1080\/01621459.1992.10476258","article-title":"On principal Hessian directions for data visualization and dimension reduction: Another application of Stein\u2019s lemma","volume":"87","author":"Li","year":"1992","journal-title":"Journal of the American Statistical Association"},{"issue":"2","key":"2026033012311740800_ref251","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/S0895479896298506","article-title":"Relative perturbation theory: II. Eigenspace and singular subspace variations","volume":"20","author":"Li","year":"1998","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"5","key":"2026033012311740800_ref252","doi-asserted-by":"crossref","first-page":"3019","DOI":"10.1137\/120893707","article-title":"Sparse signal recovery from quadratic measurements via convex programming","volume":"45","author":"Li","year":"2013","journal-title":"SIAM Journal on Mathematical Analysis"},{"issue":"1","key":"2026033012311740800_ref253","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1214\/19-STS715","article-title":"Convex relaxation methods for community detection","volume":"36","author":"Li","year":"2021","journal-title":"Statistical Science"},{"issue":"1-2","key":"2026033012311740800_ref254","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s10107-018-1333-x","article-title":"When do birds of a feather flock together? k-means, proximity, and conic programming","volume":"179","author":"Li","year":"2020","journal-title":"Mathematical Programming"},{"issue":"3","key":"2026033012311740800_ref255","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1016\/j.acha.2018.01.001","article-title":"Rapid, robust, and reliable blind deconvolution via nonconvex optimization","volume":"47","author":"Li","year":"2019","journal-title":"Applied and Computational Harmonic Analysis"},{"issue":"5","key":"2026033012311740800_ref256","doi-asserted-by":"crossref","first-page":"3097","DOI":"10.1109\/TIT.2018.2883623","article-title":"Blind gain and phase calibration via sparse spectral methods","volume":"65","author":"Li","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026033012311740800_ref257","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1093\/imaiai\/iaz009","article-title":"Non-convex low-rank matrix recovery with arbitrary outliers via median-truncated gradient descent","volume":"9","author":"Li","year":"2020","journal-title":"Information and Inference: A Journal of the IMA"},{"issue":"3","key":"2026033012311740800_ref258","doi-asserted-by":"crossref","first-page":"1928","DOI":"10.1109\/TIT.2021.3050427","article-title":"Nonconvex matrix factorization from rank-one measurements","volume":"67","author":"Li","year":"2021","journal-title":"IEEE Transactions on Information Theory"},{"issue":"7","key":"2026033012311740800_ref259","doi-asserted-by":"crossref","first-page":"2813","DOI":"10.1175\/MWR-D-16-0368.1","article-title":"A statistical investigation of the dependence of tropical cyclone intensity change on the surrounding environment","volume":"145","author":"Lin","year":"2017","journal-title":"Monthly Weather Review"},{"key":"2026033012311740800_ref260","volume-title":"Near-optimal performance bounds for orthogonal and permutation group synchronization via spectral methods","author":"Ling","year":"2020"},{"issue":"1","key":"2026033012311740800_ref261","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1093\/imaiai\/iax022","article-title":"Regularized gradient descent: A non-convex recipe for fast joint blind deconvolution and demixing","volume":"8","author":"Ling","year":"2019","journal-title":"Information and Inference: A Journal of the IMA"},{"key":"2026033012311740800_ref262","article-title":"Tensor Completion Made Practical","volume-title":"Neural Information Processing Systems","author":"Liu","year":"2020"},{"issue":"1","key":"2026033012311740800_ref263","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1109\/TPAMI.2012.39","article-title":"Tensor completion for estimating missing values in visual data","volume":"35","author":"Liu","year":"2012","journal-title":"IEEE transactions on Pattern Analysis and Machine Intelligence"},{"issue":"4","key":"2026033012311740800_ref264","doi-asserted-by":"crossref","first-page":"2121","DOI":"10.1214\/18-AOAS1146","article-title":"e PCA: High dimensional exponential family PCA","volume":"12","author":"Liu","year":"2018","journal-title":"The Annals of Applied Statistics"},{"issue":"4","key":"2026033012311740800_ref265","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.1137\/110838753","article-title":"Perturbation bounds for the stationary distributions of Markov chains","volume":"33","author":"Liu","year":"2012","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"2","key":"2026033012311740800_ref266","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","article-title":"Least squares quantization in PCM","volume":"28","author":"Lloyd","year":"1982","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026033012311740800_ref267","doi-asserted-by":"crossref","DOI":"10.1214\/20-AOS2044","article-title":"Optimality of spectral clustering for Gaussian mixture model","volume-title":"accepted to The Annals of Statistics","author":"L\u00f6ffler","year":"2021"},{"issue":"3","key":"2026033012311740800_ref268","doi-asserted-by":"crossref","first-page":"1637","DOI":"10.1214\/12-AOS1018","article-title":"High-dimensional regression with noisy and missing data: provable guarantees with nonconvexity","volume":"40","author":"Loh","year":"2012","journal-title":"The Annals of Statistics"},{"issue":"3","key":"2026033012311740800_ref269","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.3150\/12-BEJ487","article-title":"High-dimensional covariance matrix estimation with missing observations","volume":"20","author":"Lounici","year":"2014","journal-title":"Bernoulli"},{"key":"2026033012311740800_ref270","volume-title":"Statistical and computational guarantees of Lloyd\u2019s algorithm and its variants","author":"Lu","year":"2016"},{"issue":"3","key":"2026033012311740800_ref271","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1093\/imaiai\/iaz020","article-title":"Phase transitions of spectral initialization for high-dimensional non-convex estimation","volume":"9","author":"Lu","year":"2020","journal-title":"Information and Inference: A Journal of the IMA"},{"key":"2026033012311740800_ref272","volume-title":"Individual choice behavior: A theoretical analysis","author":"Luce","year":"2012"},{"issue":"9","key":"2026033012311740800_ref273","doi-asserted-by":"crossref","first-page":"2347","DOI":"10.1109\/TSP.2019.2904918","article-title":"Optimal spectral initialization for signal recovery with applications to phase retrieval","volume":"67","author":"Luo","year":"2019","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"4","key":"2026033012311740800_ref274","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","article-title":"The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations","volume":"54","author":"Lusseau","year":"2003","journal-title":"Behavioral Ecology and Sociobiology"},{"key":"2026033012311740800_ref275","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1109\/TSP.2021.3051425","article-title":"Beyond Procrustes: Balancing-free gradient descent for asymmetric low-rank matrix sensing","volume":"69","author":"Ma","year":"2021","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"3","key":"2026033012311740800_ref276","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s10208-019-09429-9","article-title":"Implicit regularization in nonconvex statistical estimation: Gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvo-lution","volume":"20","author":"Ma","year":"2020","journal-title":"Foundations of Computational Mathematics"},{"issue":"2","key":"2026033012311740800_ref277","doi-asserted-by":"crossref","first-page":"1332","DOI":"10.1109\/TIT.2021.3049172","article-title":"Spectral method for phase retrieval: an expectation propagation perspective","volume":"67","author":"Ma","year":"2021","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"2026033012311740800_ref278","doi-asserted-by":"crossref","first-page":"3600","DOI":"10.1109\/TIT.2019.2893254","article-title":"Optimization-based AMP for Phase Retrieval: The Impact of Initialization and \u21132-regularization","volume":"65","author":"Ma","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026033012311740800_ref279","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1214\/13-AOS1097","article-title":"Sparse principal component analysis and iterative thresholding","volume":"41","author":"Ma","year":"2013","journal-title":"The Annals of Statistics"},{"key":"2026033012311740800_ref280","first-page":"281","volume-title":"Some methods for classification and analysis of multivariate observations","author":"MacQueen","year":"1967"},{"key":"2026033012311740800_ref281","volume-title":"Lecture notes on randomized linear algebra","author":"Mahoney","year":"2016"},{"key":"2026033012311740800_ref282","first-page":"694","volume-title":"Community detection thresholds and the weak Ramanujan property","author":"Massouli\u00e9","year":"2014"},{"issue":"37","key":"2026033012311740800_ref283","first-page":"1","article-title":"A well-tempered landscape for non-convex robust subspace recovery","volume":"20","author":"Maunu","year":"2019","journal-title":"Journal of Machine Learning Research"},{"issue":"2","key":"2026033012311740800_ref284","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1111\/j.1467-6494.1992.tb00970.x","article-title":"An introduction to the five-factor model and its applications","volume":"60","author":"McCrae","year":"1992","journal-title":"Journal of personality"},{"issue":"2","key":"2026033012311740800_ref285","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1093\/imaiai\/iaaa020","article-title":"Low-rank matrix completion and denoising under Poisson noise","volume":"10","author":"McRae","year":"2021","journal-title":"Information and Inference: A Journal of the IMA"},{"key":"2026033012311740800_ref286","first-page":"529","volume-title":"Spectral partitioning of random graphs","author":"McSherry","year":"2001"},{"key":"2026033012311740800_ref287","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198570837.001.0001","volume-title":"Information, Physics, and Computation","author":"Mezard","year":"2009"},{"issue":"5","key":"2026033012311740800_ref288","doi-asserted-by":"crossref","first-page":"056111","DOI":"10.1103\/PhysRevE.86.056111","article-title":"Alignment and integration of complex networks by hypergraph-based spectral clustering","volume":"86","author":"Michoel","year":"2012","journal-title":"Physical Review E"},{"issue":"4","key":"2026033012311740800_ref289","doi-asserted-by":"crossref","first-page":"1003","DOI":"10.1239\/jap\/1134587812","article-title":"Sensitivity and convergence of uniformly ergodic Markov chains","volume":"42","author":"Mitrophanov","year":"2005","journal-title":"Journal of Applied Probability"},{"issue":"4","key":"2026033012311740800_ref290","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1093\/imaiai\/iax001","article-title":"Clustering subgaussian mixtures by semidefinite programming","volume":"6","author":"Mixon","year":"2017","journal-title":"Information and Inference: A Journal of the IMA"},{"key":"2026033012311740800_ref291","first-page":"926","volume-title":"Spectral methods from tensor networks","author":"Moitra","year":"2019"},{"key":"2026033012311740800_ref292","first-page":"5172","volume-title":"On the sensitivity of spectral initialization for noisy phase retrieval","author":"Monardo","year":"2019"},{"issue":"3","key":"2026033012311740800_ref293","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1007\/s10208-018-9395-y","article-title":"Fundamental limits of weak recovery with applications to phase retrieval","volume":"19","author":"Mondelli","year":"2019","journal-title":"Foundations of Computational Mathematics"},{"key":"2026033012311740800_ref294","article-title":"EE 378B: Statistical Signal Processing","volume-title":"Lecture notes, Stanford University","author":"Montanari","year":"2011"},{"issue":"11","key":"2026033012311740800_ref295","doi-asserted-by":"crossref","first-page":"2381","DOI":"10.1002\/cpa.21748","article-title":"Spectral algorithms for tensor completion","volume":"71","author":"Montanari","year":"2018","journal-title":"Communications on Pure and Applied Mathematics"},{"key":"2026033012311740800_ref296","first-page":"69","volume-title":"Consistency thresholds for the planted bisection model","author":"Mossel","year":"2015"},{"issue":"6","key":"2026033012311740800_ref297","doi-asserted-by":"crossref","first-page":"2791","DOI":"10.1214\/08-AOS618","article-title":"Finite sample approximation results for principal component analysis: A matrix perturbation approach","volume":"36","author":"Nadler","year":"2008","journal-title":"The Annals of Statistics"},{"key":"2026033012311740800_ref298","first-page":"4762","volume-title":"Phaseless PCA: Low-rank matrix recovery from column-wise phaseless measurements","author":"Nayer","year":"2019"},{"key":"2026033012311740800_ref299","volume-title":"Sharp optimal recovery in the two component Gaussian mixture model","author":"Ndaoud","year":"2018"},{"issue":"2","key":"2026033012311740800_ref300","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1214\/10-AOS850","article-title":"Estimation of (near) low-rank matrices with noise and high-dimensional scaling","volume":"39","author":"Negahban","year":"2011","journal-title":"The Annals of Statistics"},{"issue":"1","key":"2026033012311740800_ref301","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.2016.1534","article-title":"Rank centrality: Ranking from pairwise comparisons","volume":"65","author":"Negahban","year":"2016","journal-title":"Operations Research"},{"issue":"1","key":"2026033012311740800_ref302","first-page":"1665","article-title":"Restricted strong convexity and weighted matrix completion: Optimal bounds with noise","volume":"13","author":"Negahban","year":"2012","journal-title":"Journal of Machine Learning Research"},{"issue":"63","key":"2026033012311740800_ref303","doi-asserted-by":"crossref","first-page":"4814","DOI":"10.1109\/TSP.2015.2448516","article-title":"Phase retrieval using alternating minimization","volume":"18","author":"Netrapalli","year":"2015","journal-title":"IEEE Transactions on Signal Processing"},{"key":"2026033012311740800_ref304","first-page":"1107","article-title":"Non-convex robust PCA","volume-title":"Advances in Neural Information Processing Systems","author":"Netrapalli","year":"2014"},{"issue":"3","key":"2026033012311740800_ref305","doi-asserted-by":"crossref","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","article-title":"Finding community structure in networks using the eigenvectors of matrices","volume":"74","author":"Newman","year":"2006","journal-title":"Physical review E"},{"issue":"4","key":"2026033012311740800_ref306","doi-asserted-by":"crossref","first-page":"042822","DOI":"10.1103\/PhysRevE.88.042822","article-title":"Spectral methods for community detection and graph partitioning","volume":"88","author":"Newman","year":"2013","journal-title":"Physical Review E"},{"key":"2026033012311740800_ref307","first-page":"849","article-title":"On spectral clustering: Analysis and an algorithm","volume-title":"Advances in Neural Information Processing Systems","author":"Ng","year":"2002"},{"key":"2026033012311740800_ref308","first-page":"595","article-title":"Learning mixed multinomial logit model from ordinal data","volume-title":"Advances in Neural Information Processing Systems","author":"Oh","year":"2014"},{"key":"2026033012311740800_ref309","volume-title":"Concentration of the adjacency matrix and of the Laplacian in random graphs with independent edges","author":"Oliveira","year":"2009"},{"key":"2026033012311740800_ref310","volume-title":"Applied linear algebra","author":"Olver","year":"2006"},{"issue":"5","key":"2026033012311740800_ref311","doi-asserted-by":"crossref","first-page":"2886","DOI":"10.1109\/TIT.2015.2401574","article-title":"Simultaneously structured models with application to sparse and low-rank matrices","volume":"61","author":"Oymak","year":"2015","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026033012311740800_ref312","first-page":"1860","article-title":"Solving the multi-way matching problem by permutation synchronization","volume":"26","author":"Pachauri","year":"2013","journal-title":"Advances in Neural Information Processing Systems"},{"key":"2026033012311740800_ref313","volume-title":"Tech. rep","author":"Page","year":"1999"},{"issue":"1","key":"2026033012311740800_ref314","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/TIT.2020.3027316","article-title":"Instance-dependent \u2113\u221e-bounds for policy evaluation in tabular reinforcement learning","volume":"67","author":"Pananjady","year":"2020","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026033012311740800_ref315","first-page":"1617","article-title":"Asymptotics of sample eigenstructure for a large dimensional spiked covariance model","volume-title":"Statistica S\u00ednica:","author":"Paul","year":"2007"},{"key":"2026033012311740800_ref316","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1098\/rsta.1894.0003","article-title":"Contributions to the mathematical theory of evolution","volume":"185","author":"Pearson","year":"1894","journal-title":"Philosophical Transactions of the Royal Society of London. A"},{"issue":"1","key":"2026033012311740800_ref317","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/050641983","article-title":"Approximating k-means-type clustering via semidefinite programming","volume":"18","author":"Peng","year":"2007","journal-title":"SIAM Journal on Optimization"},{"issue":"5","key":"2026033012311740800_ref318","doi-asserted-by":"crossref","first-page":"2416","DOI":"10.1214\/17-AOS1625","article-title":"Optimality and sub-optimality of PCA I: Spiked random matrix models","volume":"46","author":"Perry","year":"2018","journal-title":"The Annals of Statistics"},{"issue":"3","key":"2026033012311740800_ref319","doi-asserted-by":"crossref","first-page":"1785","DOI":"10.1109\/TIT.2019.2950717","article-title":"Convolutional phase retrieval via gradient descent","volume":"66","author":"Qu","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1-2","key":"2026033012311740800_ref320","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/0100000064","article-title":"Concentration of measure inequalities in information theory, communications, and coding","volume":"10","author":"Raginsky","year":"2013","journal-title":"Foundations and Trends in Communications and Information Theory"},{"key":"2026033012311740800_ref321","first-page":"118","volume-title":"A statistical convergence perspective of algorithms for rank aggregation from pairwise data","author":"Rajkumar","year":"2014"},{"issue":"1","key":"2026033012311740800_ref322","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1109\/89.365379","article-title":"Robust text-independent speaker identification using Gaussian mixture speaker models","volume":"3","author":"Reynolds","year":"1995","journal-title":"IEEE Transactions on Speech and Audio Processing"},{"key":"2026033012311740800_ref323","first-page":"2897","article-title":"A statistical model for tensor PCA","volume-title":"Advances in Neural Information Processing Systems","author":"Richard","year":"2014"},{"issue":"4","key":"2026033012311740800_ref324","doi-asserted-by":"crossref","first-page":"1878","DOI":"10.1214\/11-AOS887","article-title":"Spectral clustering and the high-dimensional stochastic blockmodel","volume":"39","author":"Rohe","year":"2011","journal-title":"The Annals of Statistics"},{"issue":"4A","key":"2026033012311740800_ref325","doi-asserted-by":"crossref","first-page":"2610","DOI":"10.3150\/17-BEJ938","article-title":"Perturbation theory for Markov chains via Wasserstein distance","volume":"24","author":"Rudolf","year":"2018","journal-title":"Bernoulli"},{"key":"2026033012311740800_ref326","first-page":"976","volume-title":"A precise analysis of phasemax in phase retrieval","author":"Salehi","year":"2018"},{"key":"2026033012311740800_ref327","first-page":"8641","article-title":"Learning without the phase: Regularized phasemax achieves optimal sample complexity","volume-title":"Advances in Neural Information Processing Systems","author":"Salehi","year":"2018"},{"issue":"3-4","key":"2026033012311740800_ref328","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/s00025-016-0564-5","article-title":"The local convexity of solving systems of quadratic equations","volume":"71","author":"Sanghavi","year":"2017","journal-title":"Results in Mathematics"},{"issue":"3","key":"2026033012311740800_ref329","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1214\/14-AOS1285","article-title":"Role of normalization in spectral clustering for stochastic blockmodels","volume":"43","author":"Sarkar","year":"2015","journal-title":"The Annals of Statistics"},{"issue":"2","key":"2026033012311740800_ref330","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0165-1684(91)90058-Q","article-title":"The SVD and reduced rank signal processing","volume":"25","author":"Scharf","year":"1991","journal-title":"Signal Processing"},{"issue":"1","key":"2026033012311740800_ref331","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02289451","article-title":"A generalized solution of the orthogonal procrustes problem","volume":"31","author":"Sch\u00f6nemann","year":"1966","journal-title":"Psychometrika"},{"key":"2026033012311740800_ref332","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1037\/h0084096","article-title":"The net of reciprocal influence. a problem in treating sociometric data","volume":"3","author":"Seeley","year":"1949","journal-title":"Canadian Journal of Experimental Psychology"},{"key":"2026033012311740800_ref333","first-page":"11","volume-title":"Stochastically transitive models for pairwise comparisons: Statistical and computational issues","author":"Shah","year":"2016"},{"issue":"8","key":"2026033012311740800_ref334","doi-asserted-by":"crossref","first-page":"4854","DOI":"10.1109\/TIT.2019.2903249","article-title":"Feeling the Bern: Adaptive estimators for Bernoulli probabilities of pairwise comparisons","volume":"65","author":"Shah","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026033012311740800_ref335","first-page":"1","volume-title":"A case for ordinal peer-evaluation in MOOCs","author":"Shah","year":"2013"},{"issue":"4","key":"2026033012311740800_ref336","doi-asserted-by":"crossref","first-page":"1088","DOI":"10.1109\/TSP.2018.2885494","article-title":"Matrix completion with deterministic pattern: A geometric perspective","volume":"67","author":"Shapiro","year":"2018","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"4","key":"2026033012311740800_ref337","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1109\/TSP.2013.2297687","article-title":"GESPAR: Efficient phase retrieval of sparse signals","volume":"62","author":"Shechtman","year":"2014","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"3","key":"2026033012311740800_ref338","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1109\/MSP.2014.2352673","article-title":"Phase retrieval with application to optical imaging: a contemporary overview","volume":"32","author":"Shechtman","year":"2015","journal-title":"IEEE Signal Processing Magazine"},{"key":"2026033012311740800_ref339","first-page":"4925","article-title":"Normalized spectral map synchronization","volume-title":"Advances in Neural Information Processing Systems","author":"Shen","year":"2016"},{"issue":"8","key":"2026033012311740800_ref340","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","article-title":"Normalized cuts and image segmentation","volume":"22","author":"Shi","year":"2000","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"13","key":"2026033012311740800_ref341","doi-asserted-by":"crossref","first-page":"3551","DOI":"10.1109\/TSP.2017.2690524","article-title":"Tensor decomposition for signal processing and machine learning","volume":"65","author":"Sidiropoulos","year":"2017","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"1","key":"2026033012311740800_ref342","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.acha.2010.02.001","article-title":"Angular synchronization by eigenvectors and semidef-inite programming","volume":"30","author":"Singer","year":"2011","journal-title":"Applied and Computational Harmonic Analysis"},{"issue":"2","key":"2026033012311740800_ref343","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1137\/090767777","article-title":"Three-dimensional structure determination from common lines in cryo-EM by eigenvectors and semidefinite programming","volume":"4","author":"Singer","year":"2011","journal-title":"SIAM Journal on Imaging Sciences"},{"issue":"4","key":"2026033012311740800_ref344","doi-asserted-by":"crossref","first-page":"2374","DOI":"10.1109\/TIT.2019.2891653","article-title":"Structured signal recovery from quadratic measurements: Breaking sample complexity barriers via nonconvex optimization","volume":"65","author":"Soltanolkotabi","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026033012311740800_ref345","volume-title":"A robust spectral clustering algorithm for sub-Gaussian mixture models with outliers","author":"Srivastava","year":"2019"},{"key":"2026033012311740800_ref346","doi-asserted-by":"crossref","DOI":"10.1525\/9780520423671-036","volume-title":"A bound for the error in the normal approximation to the distribution of a sum of dependent random variables","author":"Stein","year":"1972"},{"key":"2026033012311740800_ref347","volume-title":"Matrix perturbation theory","author":"Stewart","year":"1990"},{"issue":"460","key":"2026033012311740800_ref348","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1198\/016214502388618960","article-title":"Forecasting using principal components from a large number of predictors","volume":"97","author":"Stock","year":"2002","journal-title":"Journal of the American statistical association"},{"key":"2026033012311740800_ref349","first-page":"415","volume-title":"Handbook of macroeconomics","author":"Stock","year":"2016"},{"key":"2026033012311740800_ref350","volume-title":"Matrix perturbation analysis (in Chinese)","author":"Sun","year":"1987"},{"issue":"11","key":"2026033012311740800_ref351","doi-asserted-by":"crossref","first-page":"6535","DOI":"10.1109\/TIT.2016.2598574","article-title":"Guaranteed matrix completion via non-convex factorization","volume":"62","author":"Sun","year":"2016","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026033012311740800_ref352","first-page":"251","volume-title":"Joint map and symmetry synchronization","author":"Sun","year":"2018"},{"key":"2026033012311740800_ref353","first-page":"10252","volume-title":"K-best transformation synchronization","author":"Sun","year":"2019"},{"key":"2026033012311740800_ref354","first-page":"14516","article-title":"A modern maximum-likelihood theory for high-dimensional logistic regression","author":"Sur","year":"2019"},{"issue":"1-2","key":"2026033012311740800_ref355","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s00440-018-00896-9","article-title":"The likelihood ratio test in high-dimensional logistic regression is asymptotically a rescaled chi-square","volume":"175","author":"Sur","year":"2019","journal-title":"Probability Theory and Related Fields"},{"issue":"1","key":"2026033012311740800_ref356","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1093\/imaiai\/iay005","article-title":"Phase retrieval via randomized Kaczmarz: Theoretical guarantees","volume":"8","author":"Tan","year":"2019","journal-title":"Information and Inference: A Journal of the IMA"},{"key":"2026033012311740800_ref357","volume-title":"Topics in Random Matrix Theory. Graduate Studies in Mathematics","author":"Tao","year":"2012"},{"key":"2026033012311740800_ref358","volume-title":"Statistical analysis of finite mixture distributions","author":"Titterington","year":"1985"},{"issue":"2","key":"2026033012311740800_ref359","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF00129684","article-title":"Shape and motion from image streams under orthography: a factorization method","volume":"9","author":"Tomasi","year":"1992","journal-title":"International Journal of Computer Vision"},{"issue":"150","key":"2026033012311740800_ref360","first-page":"1","article-title":"Accelerating ill-conditioned low-rank matrix estimation via scaled gradient descent","volume":"22","author":"Tong","year":"2021","journal-title":"Journal of Machine Learning Research"},{"key":"2026033012311740800_ref361","doi-asserted-by":"crossref","first-page":"2396","DOI":"10.1109\/TSP.2021.3071560","article-title":"Low-rank matrix recovery with scaled subgradient methods: Fast and robust convergence without the condition number","volume":"69","author":"Tong","year":"2021","journal-title":"IEEE Transactions on Signal Processing"},{"key":"2026033012311740800_ref362","volume-title":"Scaling and scalability: Provable nonconvex low-rank tensor estimation from incomplete measurements","author":"Tong","year":"2021"},{"key":"2026033012311740800_ref363","first-page":"10434","volume-title":"Provable meta-learning of linear representations","author":"Tripuraneni","year":"2021"},{"key":"2026033012311740800_ref364","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1214\/ECP.v16-1624","article-title":"Freedman\u2019s inequality for matrix martingales","volume":"16","author":"Tropp","year":"2011","journal-title":"Electronic Communications in Probability"},{"issue":"4","key":"2026033012311740800_ref365","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s10208-011-9099-z","article-title":"User-friendly tail bounds for sums of random matrices","volume":"12","author":"Tropp","year":"2012","journal-title":"Foundations of Computational Mathematics"},{"issue":"1-2","key":"2026033012311740800_ref366","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000048","article-title":"An introduction to matrix concentration inequalities","volume":"8","author":"Tropp","year":"2015","journal-title":"Foundations and Trends\u00ae in Machine Learning"},{"key":"2026033012311740800_ref367","volume-title":"Introduction to Nonparametric Estimation. Springer Series in Statistics","author":"Tsybakov","year":"2009"},{"key":"2026033012311740800_ref368","first-page":"964","volume-title":"Low-rank solutions of linear matrix equations via procrustes flow","author":"Tu","year":"2016"},{"key":"2026033012311740800_ref369","first-page":"586","article-title":"Face recognition using eigen-faces","author":"Turk","year":"1991"},{"key":"2026033012311740800_ref370","volume-title":"Asymptotic statistics","author":"Van der Vaart","year":"2000"},{"issue":"5","key":"2026033012311740800_ref371","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/MSP.2020.3003541","article-title":"Nonconvex structured phase retrieval: A focus on provably correct approaches","volume":"37","author":"Vaswani","year":"2020","journal-title":"IEEE Signal Processing Magazine"},{"key":"2026033012311740800_ref372","first-page":"1274","article-title":"Rethinking PCA for modern data sets: Theory, algorithms, and applications","author":"Vaswani","year":"2018"},{"issue":"15","key":"2026033012311740800_ref373","doi-asserted-by":"crossref","first-page":"4059","DOI":"10.1109\/TSP.2017.2684758","article-title":"Low-rank phase retrieval","volume":"65","author":"Vaswani","year":"2017","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"4","key":"2026033012311740800_ref374","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1016\/j.jcss.2003.11.008","article-title":"A spectral algorithm for learning mixture models","volume":"68","author":"Vempala","year":"2004","journal-title":"Journal of Computer and System Sciences"},{"key":"2026033012311740800_ref375","volume-title":"High-dimensional probability","author":"Vershynin","year":"2017"},{"key":"2026033012311740800_ref376","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-87811-9","volume-title":"Generalized principal component analysis","author":"Vidal","year":"2016"},{"issue":"4","key":"2026033012311740800_ref377","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1017\/nws.2016.21","article-title":"Spectral ranking","volume":"4","author":"Vigna","year":"2016","journal-title":"Network Science"},{"issue":"4","key":"2026033012311740800_ref378","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","article-title":"A tutorial on spectral clustering","volume":"17","author":"Von Luxburg","year":"2007","journal-title":"Statistics and Computing"},{"key":"2026033012311740800_ref379","first-page":"1278","article-title":"Minimax rates of estimation for sparse PCA in high dimensions","volume-title":"Artificial intelligence and statistics","author":"Vu","year":"2012"},{"issue":"6","key":"2026033012311740800_ref380","doi-asserted-by":"crossref","first-page":"2905","DOI":"10.1214\/13-AOS1151","article-title":"Minimax sparse principal subspace estimation in high dimensions","volume":"41","author":"Vu","year":"2013","journal-title":"The Annals of Statistics"},{"key":"2026033012311740800_ref381","doi-asserted-by":"crossref","DOI":"10.1017\/9781108627771","volume-title":"High-dimensional statistics: A non-asymptotic viewpoint","author":"Wainwright","year":"2019"},{"key":"2026033012311740800_ref382","volume-title":"Sample-efficient reinforcement learning for linearly-parameterized MDPs with a generative model","author":"Wang","year":"2021"},{"issue":"2","key":"2026033012311740800_ref383","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1109\/TIT.2017.2756858","article-title":"Solving systems of random quadratic equations via truncated amplitude flow","volume":"64","author":"Wang","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026033012311740800_ref384","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1109\/TSP.2017.2771733","article-title":"Sparse phase retrieval via truncated amplitude flow","volume":"66","author":"Wang","year":"2018","journal-title":"IEEE Transactions on Signal Processing"},{"key":"2026033012311740800_ref385","volume-title":"Entrywise convergence of Riemannian gradient method for low rank tensor completion via Tucker decomposition","author":"Wang","year":"2021"},{"issue":"3","key":"2026033012311740800_ref386","doi-asserted-by":"crossref","first-page":"1342","DOI":"10.1214\/16-AOS1487","article-title":"Asymptotics of empirical eigenstructure for high dimensional spiked covariance","volume":"45","author":"Wang","year":"2017","journal-title":"The Annals of Statistics"},{"issue":"153","key":"2026033012311740800_ref387","first-page":"1","article-title":"Spectral algorithms for community detection in directed networks","volume":"21","author":"Wang","year":"2020","journal-title":"Journal of Machine Learning Research"},{"issue":"1","key":"2026033012311740800_ref388","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01932678","article-title":"Perturbation bounds in connection with singular value decomposition","volume":"12","author":"Wedin","year":"1972","journal-title":"BIT Numerical Mathematics"},{"issue":"3","key":"2026033012311740800_ref389","doi-asserted-by":"crossref","first-page":"1198","DOI":"10.1137\/15M1050525","article-title":"Guarantees of Riemannian optimization for low rank matrix recovery","volume":"37","author":"Wei","year":"2016","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"2026033012311740800_ref390","volume-title":"High-Dimensional Data Analysis with Low-Dimensional Models: Principles, Computation, and Applications","author":"Wright","year":"2020"},{"issue":"4","key":"2026033012311740800_ref391","doi-asserted-by":"crossref","first-page":"1981","DOI":"10.1214\/19-AOS1873","article-title":"Optimal estimation of Gaussian mixtures via denoised method of moments","volume":"48","author":"Wu","year":"2020","journal-title":"The Annals of Statistics"},{"issue":"2","key":"2026033012311740800_ref392","doi-asserted-by":"crossref","first-page":"3798","DOI":"10.1214\/21-EJS1876","article-title":"Normal approximation and confidence region of singular subspaces","volume":"15","author":"Xia","year":"2021","journal-title":"Electronic Journal of Statistics"},{"issue":"6","key":"2026033012311740800_ref393","doi-asserted-by":"crossref","first-page":"1265","DOI":"10.1007\/s10208-018-09408-6","article-title":"On polynomial time methods for exact low-rank tensor completion","volume":"19","author":"Xia","year":"2019","journal-title":"Foundations of Computational Mathematics"},{"issue":"1","key":"2026033012311740800_ref394","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1111\/rssb.12400","article-title":"Statistical inferences of linear forms for noisy matrix completion","volume":"83","author":"Xia","year":"2021","journal-title":"Journal of the Royal Statistical Society: Series B (Statistical Methodology)"},{"issue":"1","key":"2026033012311740800_ref395","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1214\/20-AOS1942","article-title":"Statistically optimal and computationally efficient low rank tensor completion from noisy entries","volume":"49","author":"Xia","year":"2021","journal-title":"The Annals of Statistics"},{"key":"2026033012311740800_ref396","volume-title":"Inference for low-rank tensors-No need to debias","author":"Xia","year":"2020"},{"key":"2026033012311740800_ref397","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1111\/1467-9868.03411","article-title":"An adaptive estimation of dimension reduction space","volume":"64","author":"Xia","year":"2002","journal-title":"Journal of Royal Statistial Society Series B"},{"issue":"3","key":"2026033012311740800_ref398","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1080\/07474946.2020.1823191","article-title":"Sequential subspace change point detection","volume":"39","author":"Xie","year":"2020","journal-title":"Sequential Analysis"},{"key":"2026033012311740800_ref399","first-page":"2676","article-title":"Global analysis of expectation maximization for mixtures of two Gaussians","volume-title":"Advances in Neural Information Processing Systems","author":"Xu","year":"2016"},{"key":"2026033012311740800_ref400","volume-title":"Consistent risk estimation in high-dimensional linear regression","author":"Xu","year":"2019"},{"issue":"1","key":"2026033012311740800_ref401","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1162\/neco.1996.8.1.129","article-title":"On convergence properties of the EM algorithm for Gaussian mixtures","volume":"8","author":"Xu","year":"1996","journal-title":"Neural Computation"},{"key":"2026033012311740800_ref402","volume-title":"Inference for heteroskedastic PCA with missing data","author":"Yan","year":"2021"},{"key":"2026033012311740800_ref403","first-page":"2472","volume-title":"Sparse nonlinear regression: Parameter estimation under nonconvexity","author":"Yang","year":"2016"},{"issue":"1-2","key":"2026033012311740800_ref404","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s10107-019-01364-5","article-title":"Misspecified nonconvex statistical optimization for sparse phase retrieval","volume":"176","author":"Yang","year":"2019","journal-title":"Mathematical Programming"},{"key":"2026033012311740800_ref405","first-page":"613","volume-title":"Alternating minimization for mixed linear regression","author":"Yi","year":"2014"},{"key":"2026033012311740800_ref406","first-page":"4152","article-title":"Fast algorithms for robust PCA via gradient descent","volume-title":"Advances in Neural Information Processing Systems","author":"Yi","year":"2016"},{"issue":"2","key":"2026033012311740800_ref407","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1093\/biomet\/asv008","article-title":"A useful variant of the Davis-Kahan theorem for statisticians","volume":"102","author":"Yu","year":"2015","journal-title":"Biometrika"},{"key":"2026033012311740800_ref408","volume-title":"Community detection with dependent connectivity","author":"Yuan","year":"2018"},{"key":"2026033012311740800_ref409","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.cam.2019.01.009","article-title":"Phase retrieval via sparse Wirtinger flow","volume":"355","author":"Yuan","year":"2019","journal-title":"Journal of Computational and Applied Mathematics"},{"issue":"5","key":"2026033012311740800_ref410","doi-asserted-by":"crossref","first-page":"2575","DOI":"10.1214\/19-AOS1898","article-title":"Theoretical and computational guarantees of mean field variational inference for community detection","volume":"48","author":"Zhang","year":"2020","journal-title":"The Annals of Statistics"},{"key":"2026033012311740800_ref411","article-title":"Heteroskedastic PCA: Algorithm, optimality, and applications","volume-title":"Accepted to The Annals of Statistics","author":"Zhang","year":"2021"},{"issue":"5","key":"2026033012311740800_ref412","doi-asserted-by":"crossref","first-page":"3202","DOI":"10.1109\/TIT.2019.2956737","article-title":"Spectral state compression of Markov processes","volume":"66","author":"Zhang","year":"2020","journal-title":"IEEE Transactions on Information Theory"},{"issue":"11","key":"2026033012311740800_ref413","doi-asserted-by":"crossref","first-page":"7311","DOI":"10.1109\/TIT.2018.2841377","article-title":"Tensor SVD: Statistical and computational limits","volume":"64","author":"Zhang","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026033012311740800_ref414","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1137\/19M126476X","article-title":"ISLET: Fast and optimal low-rank tensor regression via importance sketching","volume":"2","author":"Zhang","year":"2020","journal-title":"SIAM Journal on Mathematics of Data Science"},{"key":"2026033012311740800_ref415","first-page":"1022","volume-title":"Provable non-convex phase retrieval with outliers: Median truncated Wirtinger flow","author":"Zhang","year":"2016"},{"issue":"11","key":"2026033012311740800_ref416","doi-asserted-by":"crossref","first-page":"7287","DOI":"10.1109\/TIT.2018.2847695","article-title":"Median-truncated nonconvex approach for phase retrieval with outliers","volume":"64","author":"Zhang","year":"2018","journal-title":"IEEE Transactions on information Theory"},{"issue":"1","key":"2026033012311740800_ref417","first-page":"5164","article-title":"A nonconvex approach for phase retrieval: Reshaped Wirtinger flow and incremental algorithms","volume":"18","author":"Zhang","year":"2017","journal-title":"The Journal of Machine Learning Research"},{"key":"2026033012311740800_ref418","first-page":"33","article-title":"Model-based multi-agent RL in zero-sum Markov games with near-optimal sample complexity","volume-title":"Advances in Neural Information Processing Systems","author":"Zhang","year":"2020"},{"issue":"19","key":"2026033012311740800_ref419","doi-asserted-by":"crossref","first-page":"5029","DOI":"10.1109\/TSP.2018.2862395","article-title":"Compres-sive phase retrieval via reweighted amplitude flow","volume":"66","author":"Zhang","year":"2018","journal-title":"IEEE Transactions on Signal Processing"},{"key":"2026033012311740800_ref420","first-page":"5756","volume-title":"Fast and sample efficient inductive matrix completion via multi-phase Procrustes flow","author":"Zhang","year":"2018"},{"key":"2026033012311740800_ref421","first-page":"5857","volume-title":"A primal-dual analysis of global optimality in nonconvex low-rank matrix recovery","author":"Zhang","year":"2018"},{"issue":"2","key":"2026033012311740800_ref422","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1137\/19M1272238","article-title":"Detecting overlapping communities in networks using spectral methods","volume":"2","author":"Zhang","year":"2020","journal-title":"SIAM Journal on Mathematics of Data Science"},{"key":"2026033012311740800_ref423","first-page":"1260","article-title":"Spectral methods meet EM: A provably optimal algorithm for crowdsourcing","volume-title":"Advances in Neural Information Processing Systems","author":"Zhang","year":"2014"},{"key":"2026033012311740800_ref424","volume-title":"From symmetry to geometry: Tractable nonconvex problems","author":"Zhang","year":"2020"},{"issue":"4","key":"2026033012311740800_ref425","doi-asserted-by":"crossref","first-page":"2266","DOI":"10.1214\/12-AOS1036","article-title":"Consistency of community detection in networks under degree-corrected stochastic block models","volume":"40","author":"Zhao","year":"2012","journal-title":"The Annals of Statistics"},{"key":"2026033012311740800_ref426","first-page":"109","article-title":"A convergent gradient descent algorithm for rank minimization and semidefinite programming from random linear measurements","volume-title":"Advances in Neural Information Processing Systems","author":"Zheng","year":"2015"},{"key":"2026033012311740800_ref427","volume-title":"Convergence analysis for rectangular matrix completion using Burer-Monteiro factorization and gradient descent","author":"Zheng","year":"2016"},{"key":"2026033012311740800_ref428","first-page":"4140","volume-title":"Recovery guarantees for one-hidden-layer neural networks","author":"Zhong","year":"2017"},{"issue":"2","key":"2026033012311740800_ref429","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1137\/17M1122025","article-title":"Near-optimal bounds for phase synchronization","volume":"28","author":"Zhong","year":"2018","journal-title":"SIAM Journal on Optimization"},{"key":"2026033012311740800_ref430","first-page":"2171","article-title":"Dual principal component pursuit: Improved analysis and efficient algorithms","volume-title":"Advances in Neural Information Processing Systems","author":"Zhu","year":"2018"},{"key":"2026033012311740800_ref431","volume-title":"High-dimensional principal component analysis with heterogeneous missingness","author":"Zhu","year":"2019"},{"issue":"2","key":"2026033012311740800_ref432","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1198\/106186006X113430","article-title":"Sparse principal component analysis","volume":"15","author":"Zou","year":"2006","journal-title":"Journal of Computational and Graphical Statistics"}],"container-title":["Foundations and Trends\u00ae in Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftmal\/article-pdf\/14\/5\/566\/11134917\/2200000079en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftmal\/article-pdf\/14\/5\/566\/11134917\/2200000079en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T18:10:50Z","timestamp":1777486250000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftmal\/article\/14\/5\/566\/1331292\/Spectral-Methods-for-Data-Science-A-Statistical"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,21]]},"references-count":432,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,10,21]]}},"URL":"https:\/\/doi.org\/10.1561\/2200000079","relation":{},"ISSN":["1935-8237","1935-8245"],"issn-type":[{"value":"1935-8237","type":"print"},{"value":"1935-8245","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,21]]}}}