Weighted low rank approximations with provable guarantees
From MaRDI portal
(Redirected from Weighted low rank approximations with provable guarantees)
Recommendations
- On a Problem of Weighted Low-Rank Approximation of Matrices
- Low-rank matrix approximation with weights or missing data is NP-hard
- Fast monte-carlo algorithms for finding low-rank approximations
- Computational Science and Its Applications – ICCSA 2004
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
Cited in
(14)- An adaptation for iterative structured matrix completion
- Parameterized low-rank binary matrix approximation
- Algorithms and Literate Programs for Weighted Low-Rank Approximation with Missing Data
- Low-rank matrix approximation with weights or missing data is NP-hard
- Structured weighted low rank approximation
- Matrix completion and related problems via strong duality
- Parameterized low-rank binary matrix approximation
- Non-convex matrix completion and related problems via strong duality
- On a Problem of Weighted Low-Rank Approximation of Matrices
- Simple heuristics yield provable algorithms for masked low-rank approximation
- Training (overparametrized) neural networks in near-linear time
- A very sketchy talk (invited talk)
- Guessing efficiently for constrained subspace approximation
- Left vs, right representations for solving weighted low-rank approximation problems
This page was built for publication: Weighted low rank approximations with provable guarantees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361834)
