Deterministic algorithms for matrix completion
From MaRDI portal
Recommendations
Cites work
- A simpler approach to matrix completion
- Exact matrix completion via convex optimization
- Expander graphs and their applications
- scientific article; zbMATH DE number 4032351 (Why is no real title available?)
- Matrix completion from noisy entries
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- Ramanujan graphs
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Twice-Ramanujan sparsifiers
Cited in
(6)- Sparse random tensors: concentration, regularization and applications
- Long time dynamics for interacting oscillators on graphs
- A divide-and-conquer algorithm for binary matrix completion
- Deterministic tensor completion with hypergraph expanders
- Spectral gap in random bipartite biregular graphs and applications
- Nonconvex deterministic matrix completion by projected gradient descent methods
This page was built for publication: Deterministic algorithms for matrix completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2925527)