Approximate matrix completion based on cavity method
From MaRDI portal
(Redirected from Publication:5872687)
Recommendations
- Matrix completion and low-rank SVD via fast alternating least squares
- Low-rank matrix completion using alternating minimization
- Spectral regularization algorithms for learning large incomplete matrices
- Empirical Bayes matrix completion
- Matrix completion via a low rank factorization model and an augmented Lagrangean succesive overrelaxation algorithm
Cites work
- A CDMA multiuser detection algorithm on the basis of belief propagation
- A simpler approach to matrix completion
- Bilinear Generalized Approximate Message Passing—Part I: Derivation
- Bilinear Generalized Approximate Message Passing—Part II: Applications
- Exact matrix completion via convex optimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Information, Physics, and Computation
- Learning the parts of objects by non-negative matrix factorization
- Low-rank matrix completion using alternating minimization
- Matrix Completion From a Few Entries
- Parallel stochastic gradient algorithms for large-scale matrix completion
- Phase Transitions and Sample Complexity in Bayes-Optimal Matrix Factorization
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
This page was built for publication: Approximate matrix completion based on cavity method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5872687)
