Low-Rank Matrices
Compressive PCA for Low-Rank Matrices on Graphs
... of low-rank matrices on graphs from their sampled ...and low-cost decoders for low-rank recovery and clustering, the presented framework gains a several orders of magnitude ...
23
Compressed sensing and robust recovery of low rank matrices
... matrix rank, which covers vector cardinality as a special case, and arises in a variety of ...for low-rank matrices, asking under what conditions a low-rank matrix can be sensed ...
5
Online Learning in the Embedded Manifold of Low-rank Matrices
... a low-rank constraint can dramatically improve the memory and run time complexity, while providing a natural regularization of the ...of low-rank matrices are either prohibitively time ...
30
Quantum singular-value decomposition of nonsparse low-rank matrices
... 3 Dahlem Center for Complex Quantum Systems, Freie Universität Berlin, 14195 Berlin, Germany 4 Department of Mechanical Engineering, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA (Received 13 ...
6
Rate Optimal Denoising of Simultaneously Sparse and Low Rank Matrices
... large matrices. Leading examples include denoising low rank matrices (Donoho and Gavish, 2014), recovering low rank matrices from a small number of entries, ...reduced ...
27
An implicit multishift QR-algorithm for Hermitian plus low rank matrices
... non-Hermitian low rank matrices can be effi- ciently reduced into Hessenberg ...plus low rank ...Hessenberg matrices, which are the sum of a Hermitian plus a possibly ...
24
Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
... and Low-Rank Matrices Abstract This paper considers compressed sensing and affine rank minimization in both noiseless and noisy cases and establishes sharp restricted isometry conditions for ...
28
A Distributed Frank-Wolfe Framework for Learning Low-Rank Matrices with the Trace Norm
... First, we propose DFW-Trace, a Frank-Wolfe algorithm relying on a distributed power method to approximately compute the leading eigenvector with communication cost of O(d + m) per pass over the dataset (epoch). This ...
19
Using Side Information to Reliably Learn Low-Rank Matrices from Missing and Corrupted Observations
... a low-rank matrix from missing and corrupted observations is a fundamental problem in many machine learning ...in low-rank matrix learning has received little attention, and most current ...
35
Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Matrices via Convex Optimization
... the low rank structure, ...computing low-rank matrix solutions to under- detennined linear equations [6,21], One of the most striking results concerns the exact completion of ...
45
Low Rank Positive Approximants of Symmetric Matrices
... k = B B ∈ × B ≤ k denote the related set of low-rank matrices. Then here we seek a matrix B ∈ that is nearest to A in a certain matrix norm. The difficulty stems from the fact that k is not a ...
15
Rank Determination for Low-Rank Data Completion
... of low-rank matrices or tensors given the corresponding ...the rank is not given and we aim to approximate the unknown rank based on the location of sampled entries and some given ...
29
Optimal Estimation of Low Rank Density Matrices
... In this subsection, we establish oracle inequalities for the von Neumann entropy penalized least squares estimator ˜ ρ ε in the case of trace regression model with Gaussian noise (As- sumption 4). Unlike in the case of ...
36
Low-rank completion and recovery of correlation matrices
... of rank-reduction ...the rank-reduction, as non-negligible amounts of information was being lost from the ...of rank-reduction should be explored ...
66
Deterministic algorithms for the low rank approximation of matrices
... Low rank approximations using the symmetric eigenvalue decomposition Objectives and key idea Formulation of the matrix eigenvalue problem Standard algorithm for the Hermitian eigendecomp[r] ...
115
Unique low rank completability of partially filled matrices
... rectangular matrices is a special case of the unique completability testing of positive semidefinite ...unique rank d completability of a partially filled n × n matrix in terms of either the minimum number of ...
31
Weighted Low-Rank Approximation of Matrices and Background Modeling
... Weighted Low-Rank Approximation of Matrices and Background Modeling Aritra Dutta, Xin Li, and Peter Richt´arik Abstract—We primarily study a special a weighted low-rank approximation of ...
14
Robust Low-Rank Approximation of Matrices in lp-Space
... common low-rank structure of multiple matrices, which is an extension of the single matrix ...convert matrices into vectors and thus can avoid processing the matrix with much larger size than ...
170
Structured low rank decomposition of multivariate Hankel matrices
... Hankel matrices of small rank in correlation with the decomposition of its symbol σ as a sum of polynomial-exponential ...the low rank decomposition of H σ and the decomposition of its symbol ...
18
Low Permutation-rank Matrices: Structural Properties and Noisy Completion
... a low non-negative rank framework inspired by its interpretation discussed in Appendix ...regular low-rank matrix completion problem setting. The permutation-rank version of this ...
43