Second order accurate distributed eigenvector computation for extremely large matrices

DOI10.1214/10-EJS577zbMath1329.65074arXiv0908.0137MaRDI QIDQ1952103

Alexandre d'Aspremont, Noureddine El Karoui

Publication date: 27 May 2013

Published in: Electronic Journal of Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0908.0137

Mathematics Subject Classification ID

Related Items (5)

An extension of the angular synchronization problem to the heterogeneous setting ⋮ Robust covariance estimation for distributed principal component analysis ⋮ Communication-Efficient Distributed Eigenspace Estimation ⋮ Distributed estimation of principal eigenspaces ⋮ Relative perturbation bounds with applications to empirical covariance operators

Uses Software

• ElemStatLearn
• WebGraph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An approximation method for eigenvectors of very large matrices
• Latent semantic indexing: A probabilistic analysis
• Perturbation theory for linear operators.
• Concentration of measure and isoperimetric inequalities in product spaces
• Exact matrix completion via convex optimization
• Using PageRank to Characterize Web Structure
• Fast computation of low-rank matrix approximations
• Sampling from large matrices
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Spectral Algorithms
• The Expected Norm of Random Matrices
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• A Survey of Eigenvector Methods for Web Information Retrieval
• Fast monte-carlo algorithms for finding low-rank approximations
• Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
• Spectral norm of random matrices
• The elements of statistical learning. Data mining, inference, and prediction

This page was built for publication: Second order accurate distributed eigenvector computation for extremely large matrices