An $\ell_{\infty}$ Eigenvector Perturbation Bound and Its Application to Robust Covariance Estimation
From MaRDI portal
Publication:4558538
zbMath1473.15015arXiv1603.03516MaRDI QIDQ4558538
Yiqiao Zhong, Jianqing Fan, Wei-Chen Wang
Publication date: 22 November 2018
Full work available at URL: https://arxiv.org/abs/1603.03516
Computational methods for sparse matrices (65F50) Learning and adaptive systems in artificial intelligence (68T05) Eigenvalues, singular values, and eigenvectors (15A18) Perturbation theory of linear operators (47A55) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Related Items (33)
Asymptotic Theory of Eigenvectors for Random Matrices With Diverging Spikes ⋮ Non-asymptotic properties of spectral decomposition of large Gram-type matrices and applications ⋮ Robust covariance estimation with noisy high-frequency financial data ⋮ Near-optimal performance bounds for orthogonal and permutation group synchronization via spectral methods ⋮ Unnamed Item ⋮ Singular vector and singular subspace distribution for the matrix denoising model ⋮ Asymmetry helps: eigenvalue and eigenvector analyses of asymmetrically perturbed low-rank matrices ⋮ Improved Performance Guarantees for Orthogonal Group Synchronization via Generalized Power Method ⋮ Learning Gaussian graphical models with latent confounders ⋮ Perturbation upper bounds for singular subspaces with a kind of heteroskedastic noise and its application in clustering ⋮ Adaptive robust large volatility matrix estimation based on high-frequency financial data ⋮ Large volatility matrix analysis using global and national factor models ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Compressed spectral screening for large-scale differential correlation analysis with application in selecting glioblastoma gene modules ⋮ Entrywise eigenvector analysis of random matrices with low expected rank ⋮ A Spectral Method for Joint Community Detection and Orthogonal Group Synchronization ⋮ Euclidean Representation of Low-Rank Matrices and Its Geometric Properties ⋮ Entrywise limit theorems for eigenvectors of signal-plus-noise matrix models with weak signals ⋮ Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points ⋮ Learning low-dimensional nonlinear structures from high-dimensional noisy data: an integral operator approach ⋮ Solving Jigsaw Puzzles by the Graph Connection Laplacian ⋮ Uniform Bounds for Invariant Subspace Perturbations ⋮ The Sup-norm Perturbation of HOSVD and Low Rank Tensor Denoising ⋮ Singular vector distribution of sample covariance matrices ⋮ Robust high-dimensional factor models with applications to statistical machine learning ⋮ Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees ⋮ On the \(\ell^\infty\)-norms of the singular vectors of arbitrary powers of a difference matrix with applications to sigma-delta quantization ⋮ Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data ⋮ Spectral method and regularized MLE are both optimal for top-\(K\) ranking ⋮ The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics ⋮ A Performance Guarantee for Spectral Clustering ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- High dimensional covariance matrix estimation using a factor model
- Sparse principal component analysis and iterative thresholding
- Optimal detection of sparse principal components in high dimension
- Spectral clustering and the high-dimensional stochastic blockmodel
- User-friendly tail bounds for sums of random matrices
- Covariance regularization by thresholding
- A framework for robust subspace learning
- Random perturbation of low rank matrices: improving classical bounds
- Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics
- Principal component analysis.
- Challenging the empirical mean and empirical variance: a deviation study
- Asymptotics of empirical eigenstructure for high dimensional spiked covariance
- Minimax sparse principal subspace estimation in high dimensions
- Modern multidimensional scaling. Theory and applications.
- Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices
- Elliptically Contoured Models in Statistics and Portfolio Theory
- Incoherence-Optimal Matrix Completion
- Latent Variable Models and Factor Analysis
- Robust principal component analysis?
- Rank-Sparsity Incoherence for Matrix Decomposition
- SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
- Arbitrage, Factor Structure, and Mean-Variance Analysis on Large Asset Markets
- A multivariate version of kendall's τ
- Regularization of Wavelet Approximations
- Forecasting Using Principal Components From a Large Number of Predictors
- Scale-Invariant Sparse PCA on High-Dimensional Meta-Elliptical Data
- Dimension Reduction and Coefficient Estimation in Multivariate Linear Regression
- On Consistency and Sparsity for Principal Components Analysis in High Dimensions
- Generalized Thresholding of Large Covariance Matrices
- A useful variant of the Davis–Kahan theorem for statisticians
- Estimation of High Dimensional Mean Regression in the Absence of Symmetry and Light Tail Assumptions
- Singular vectors under random perturbation
- Common risk factors in the returns on stocks and bonds
- Inferential Theory for Factor Models of Large Dimensions
- Robust Estimation of a Location Parameter
- The Rotation of Eigenvectors by a Perturbation. III
- Perturbation bounds in connection with singular value decomposition
This page was built for publication: An $\ell_{\infty}$ Eigenvector Perturbation Bound and Its Application to Robust Covariance Estimation