Matrix completion based on Gaussian parameterized belief propagation
From MaRDI portal
Publication:5158906
DOI10.1088/1742-5468/AC21C9OpenAlexW3202065623MaRDI QIDQ5158906FDOQ5158906
Authors: Koki Okajima, Yoshiyuki Kabashima 
Publication date: 26 October 2021
Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.00233
Recommendations
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- An alternating direction algorithm for matrix completion with nonnegative factors
- Orthogonal rank-one matrix pursuit for low rank matrix completion
- Noisy low-rank matrix completion with general sampling distribution
- Approximate matrix completion based on cavity method
Cites Work
- Matrix completion from noisy entries
- Title not available (Why is that?)
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Low-rank matrix completion using alternating minimization
- A CDMA multiuser detection algorithm on the basis of belief propagation
- Information, Physics, and Computation
- Statistical Physics of Spin Glasses and Information Processing
- First eigenvalue/eigenvector in sparse random symmetric matrices: influences of degree fluctuation
- Approximate matrix completion based on cavity method
This page was built for publication: Matrix completion based on Gaussian parameterized belief propagation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5158906)
