Simple heuristics yield provable algorithms for masked low-rank approximation
From MaRDI portal
Cites work
- A numerical approach to the approximate and the exact minimum rank of a covariance matrix
- A PTAS for ℓp-Low Rank Approximation
- Approximate nonnegative rank is equivalent to the smooth rectangle bound
- Bi-criteria linear-time approximations for generalized k-mean/median/center
- Certifying equality with limited interaction
- Communication Complexity
- Diagonal and low-rank matrix decompositions, correlation matrices, and ellipsoid fitting
- EM algorithms for ML factor analysis
- Exact matrix completion via convex optimization
- Flexible imputation of missing data
- Handbook of robust low-rank and sparse matrix decomposition. Applications in image and video processing
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 524134 (Why is no real title available?)
- scientific article; zbMATH DE number 7204504 (Why is no real title available?)
- Input sparsity and hardness for robust subspace approximation
- Low rank approximation with entrywise \(\ell_1\)-norm error
- Low-rank matrix completion using alternating minimization
- Matrix Completion From a Few Entries
- On the complexity of robust PCA and \(\ell_1\)-norm low-rank matrix approximation
- On the exact space complexity of sketching and streaming small norms
- Parameterized low-rank binary matrix approximation
- Perturbed Identity Matrices Have High Rank: Proof and Applications
- Randomized Algorithms for Matrices and Data
- Rank-Sparsity Incoherence for Matrix Decomposition
- Rapid solution of integral equations of classical potential theory
- Relative error tensor low rank approximation
- Residual based sampling for online low rank approximation
- Robust Matrix Decomposition With Sparse Corruptions
- Robust principal component analysis?
- Sampling-based dimension reduction for subspace approximation
- Sketching as a tool for numerical linear algebra
- Spectral analysis of data
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- The Fast Gauss Transform
- The Frisch scheme in dynamic system identification
- The log-approximate-rank conjecture is false
- Weighted low rank approximations with provable guarantees
This page was built for publication: Simple heuristics yield provable algorithms for masked low-rank approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229289)
