Fetching the paper…
Reading the bibliography…
Recovering low-rank structures via eigenvector perturbation analysis is a common problem in statistical machine learning, such as in factor analysis, community detection, ranking, matrix completion, among others.
Spectral clustering and the high-dimensional stochastic blockmodel
Rohe, K · 1915
Earlier work this paper cites.
Quantisierung als eigenwertproblem
Schrödinger, E · 1926
Earlier work this paper cites.
The rotation of eigenvectors by a perturbation. III
Davis, C · 1970
Earlier work this paper cites.
Perturbation bounds in connection with singular value decomposition
Wedin, P.-Å · 1972
Earlier work this paper cites.
One-step Huber estimates in the linear model
Bickel, P. J · 1975
Earlier work this paper cites.
Stochastic blockmodels: First steps
Holland, P. W · 1983
Earlier work this paper cites.
Matrix perturbation theory
Stewart, G · 1990
Earlier work this paper cites.
Normalized cuts and image segmentation
Shi, J · 2000
Earlier work this paper cites.
Spectral partitioning of random graphs
McSherry, F · 2001
Earlier work this paper cites.
On spectral clustering: Analysis and an algorithm
Ng, A. Y · 2002
Earlier work this paper cites.
Completely bounded maps and operator algebras
Paulsen, V · 2002
Earlier work this paper cites.
Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices
Baik, J · 2005
Earlier work this paper cites.
Spectral techniques applied to sparse random graphs
Feige, U · 2005
Earlier work this paper cites.
A spectral heuristic for bisecting random graphs
Coja-Oghlan, A · 2006
Earlier work this paper cites.
Distributed clock synchronization over wireless networks: Algorithms and analysis
Giridhar, A · 2006
Earlier work this paper cites.
Phase retrieval via Wirtinger flow: Theory and algorithms
Candès, E. J · 2007
Earlier work this paper cites.
The largest eigenvalue of rank one deformation of large wigner matrices
Féral, D · 2007
Earlier work this paper cites.
Exact matrix completion via convex optimization
Candès, E. J · 2009
Earlier work this paper cites.
A gradient descent algorithm on the Grassman manifold for matrix completion
Keshavan, R. H · 2009
Earlier work this paper cites.
Distributed image-based 3-D localization of camera sensor networks
Tron, R · 2009
Earlier work this paper cites.
Matrix completion with noise
Candès, E. J · 2010
Earlier work this paper cites.
The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices
Benaych-Georges, F · 2011
Earlier work this paper cites.
Robust principal component analysis?
Candès, E. J · 2011
Earlier work this paper cites.
Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
Decelle, A · 2011
Earlier work this paper cites.
Recovering low-rank matrices from few coefficients in any basis
Gross, D · 2011
Earlier work this paper cites.
Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
Koltchinskii, V · 2011
Earlier work this paper cites.
Angular synchronization by eigenvectors and semidefinite programming
Singer, A · 2011
Earlier work this paper cites.
Sensor network localization by eigenvector synchronization over the Euclidean group
Cucuringu, M · 2012
Earlier work this paper cites.
Viewing direction estimation in cryo-EM using synchronization
Shkolnisky, Y · 2012
Cited alongside, same era.
A consistent adjacency spectral embedding for stochastic blockmodel graphs
Sussman, D. L · 2012
Cited alongside, same era.
Optimal M-estimation in high-dimensional regression
Bean, D · 2013
Cited alongside, same era.
Concentration inequalities: A nonasymptotic theory of independence
Boucheron, S · 2013
Cited alongside, same era.
Low-rank matrix completion using alternating minimization
Jain, P · 2013
Cited alongside, same era.
Spectral redemption in clustering sparse networks
Krzakala, F · 2013
Cited alongside, same era.
Fan, J · 2016
Later among the works it cites.
Matrix completion has no spurious local minimum
Ge, R · 2016
Later among the works it cites.
Community detection in sparse networks via Grothendieck’s inequality
Guédon, O · 2016
Later among the works it cites.
Achieving exact cluster recovery threshold via semidefinite programming: Extensions
Hajek, B · 2016
Later among the works it cites.
Phase transitions in semidefinite relaxations
Javanmard, A · 2016
Later among the works it cites.
Asymptotics and concentration bounds for bilinear forms of spectral projectors of sample covariance
Koltchinskii, V · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Mossel, E · 2013
Cited alongside, same era.
On semidefinite relaxations for the block model
Amini, A. A · 2014
Cited alongside, same era.
Community detection thresholds and the weak ramanujan property
Massoulié, L · 2014
Cited alongside, same era.
Consistency thresholds for binary symmetric block models
Mossel, E · 2014
Cited alongside, same era.
A simple SVD algorithm for finding hidden partitions
Vu, V · 2014
Cited alongside, same era.
Accurate community detection in the stochastic block model via spectral algorithms
Yun, S.-Y · 2014
Cited alongside, same era.
Later among the works it cites.
Perturbation of linear forms of singular vectors under gaussian noise
Koltchinskii, V · 2016
Later among the works it cites.
Fundamental limits of symmetric low-rank matrix estimation
Lelarge, M · 2016
Later among the works it cites.
Semidefinite programs on sparse random graphs and their application to community detection
Montanari, A · 2016
Later among the works it cites.
Optimality and sub-optimality of PCA for spiked random matrices and synchronization
Perry, A · 2016
Later among the works it cites.
A certifiably correct algorithm for synchronization over the special Euclidean group
Rosen, D. M · 2016
Later among the works it cites.
Guaranteed matrix completion via non-convex factorization
Sun, R · 2016
Later among the works it cites.
Optimal cluster recovery in the labeled stochastic block model
Yun, S.-Y · 2016
Later among the works it cites.
Minimax rates of community detection in stochastic block models
Zhang, A. Y · 2016
Later among the works it cites.
Community detection and stochastic block models: recent developments
Abbe, E · 2017
Closest in time.
Proof of the achievability conjectures in the general stochastic block model
Abbe, E · 2017
Closest in time.
Cape, J · 2017
Closest in time.
Spectral method and regularized MLE are both optimal for top- K K ranking
Chen, Y · 2017
Closest in time.
Unperturbed: spectral analysis beyond Davis-Kahan
Eldridge, J · 2017
Closest in time.
Distributed estimation of principal eigenspaces
Fan, J · 2017
Closest in time.
Ma, C · 2017
Closest in time.
The ℓ ∞ \ell_{\infty} perturbation of hosvd and low rank tensor denoising
Xia, D · 2017
Closest in time.
Eigenvector under random perturbation: A nonasymptotic Rayleigh-Schrödinger theory
Zhong, Y · 2017
Closest in time.
Supplement to “entrywise eigenvector analysis of random matrices with low expected rank”
Abbe, E · 2018
Closest in time.
Random perturbation of low rank matrices: Improving classical bounds
O’Rourke, S · 2018
Closest in time.
Near-optimal bounds for phase synchronization
Zhong, Y · 2018
Closest in time.
Matrix completion from noisy entries
Keshavan, R. H · 2078
Closest in time.
The power of convex relaxation: Near-optimal matrix completion
Candès, E. J · 2080
Closest in time.