Approximate matrix completion based on cavity method
From MaRDI portal
Publication:5872687
DOI10.1088/1751-8121/AB40DEOpenAlexW3102018812MaRDI QIDQ5872687FDOQ5872687
Authors: Chihiro Noguchi, Yoshiyuki Kabashima 
Publication date: 4 January 2023
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.00138
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
- Exact matrix completion via convex optimization
- Parallel stochastic gradient algorithms for large-scale matrix completion
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Learning the parts of objects by non-negative matrix factorization
- Matrix Completion From a Few Entries
- A simpler approach to matrix completion
- Low-rank matrix completion using alternating minimization
- A CDMA multiuser detection algorithm on the basis of belief propagation
- Information, Physics, and Computation
- Bilinear Generalized Approximate Message Passing—Part I: Derivation
- Bilinear Generalized Approximate Message Passing—Part II: Applications
- Phase Transitions and Sample Complexity in Bayes-Optimal Matrix Factorization
Cited In (1)
Uses Software
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)
