Finding a low-rank basis in a matrix subspace
arXiv:1503.08601
Abstract
For a given matrix subspace, how can we find a basis that consists of low-rank matrices? This is a generalization of the sparse vector problem. It turns out that when the subspace is spanned by rank-1 matrices, the matrices can be obtained by the tensor CP decomposition. For the higher rank case, the situation is not as straightforward. In this work we present an algorithm based on a greedy process applicable to higher rank problems. Our algorithm first estimates the minimum rank by applying soft singular value thresholding to a nuclear norm relaxation, and then computes a matrix with that rank using the method of alternating projections. We provide local convergence results, and compare our algorithm with several alternative approaches. Applications include data compression beyond the classical truncated SVD, computing accurate eigenvectors of a near-multiple eigenvalue, image separation and graph Laplacian eigenproblems.
References in corpus (9)
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Tensor Decompositions for Signal Processing Applications From Two-way to Multiway Component Analysis
- A Simpler Approach to Matrix Completion
- Complete Dictionary Recovery over the Sphere I: Overview and the Geometric Picture
- Complete Dictionary Recovery over the Sphere II: Recovery by Riemannian Trust-region Method
- Canonical polyadic decomposition of third-order tensors: reduction to generalized eigenvalue decomposition
- Exact Recovery of Sparsely-Used Dictionaries
- Transversality and alternating projections for nonconvex sets
- A new convergence proof for the higher-order power method and generalizations