Study of Compressed Randomized UTV Decompositions for Low-Rank Matrix Approximations in Data Science

Abstract

In this work, a novel rank-revealing matrix decomposition algorithm termed Compressed Randomized UTV (CoR-UTV) decomposition along with a CoR-UTV variant aided by the power method technique is proposed. CoR-UTV computes an approximation to a low-rank input matrix by making use of random sampling schemes. Given a large and dense matrix of size $m\times n$ with numerical rank $k$, where $k\ll \text{min}\{m,n\}$, CoR-UTV requires a few passes over the data, and runs in $O(mnk)$ floating-point operations. Furthermore, CoR-UTV can exploit modern computational platforms and can be optimized for maximum efficiency. CoR-UTV is also applied for solving robust principal component analysis problems. Simulations show that CoR-UTV outperform existing approaches.

7 pages, 2 figures. arXiv admin note: substantial text overlap with arXiv:1810.07323

References in corpus (13)

• Linearized Alternating Direction Method with Adaptive Penalty for Low-Rank Representation
• Latent variable graphical model selection via convex optimization
• Low-Complexity Design of Generalized Block Diagonalization Precoding Algorithms for Multiuser MIMO Systems
• Coherence Pursuit: Fast, Simple, and Robust Principal Component Analysis
• Branch-and-Bound Precoding for Multiuser MIMO Systems with 1-Bit Quantization
• Design of Robust Adaptive Beamforming Algorithms Based on Low-Rank and Cross-Correlation Techniques
• Randomized QR with Column Pivoting
• Multi-Branch Tomlinson-Harashima Precoding for MU-MIMO Systems: Theory and Algorithms
• Distributed Space-Time Coding Based on Adjustable Code Matrices for Cooperative MIMO Relaying Systems
• Sparsity-Aware Adaptive Algorithms Based on Alternating Optimization with Shrinkage
• Adaptive Reduced-Rank Minimum Symbol-Error-Rate Receive Processing for Large-Scale Multiple-Antenna Systems
• Direction Finding Algorithms with Joint Iterative Subspace Optimization
• Subspace-Orbit Randomized Decomposition for Low-rank Matrix Approximation