Approximate matrix completion based on cavity method

DOI10.1088/1751-8121/ab40deOpenAlexW3102018812MaRDI QIDQ5872687

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

zbMATH Keywords

matrix completionmatrix factorizationcavity method

Mathematics Subject Classification ID

Quantum theory (81-XX) Statistical mechanics, structure of matter (82-XX)

Related Items (1)

Matrix completion based on Gaussian parameterized belief propagation

Uses Software

• Jellyfish
• MovieLens

Cites Work

• Parallel stochastic gradient algorithms for large-scale matrix completion
• Exact matrix completion via convex optimization
• Phase Transitions and Sample Complexity in Bayes-Optimal Matrix Factorization
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Information, Physics, and Computation
• Bilinear Generalized Approximate Message Passing—Part I: Derivation
• Bilinear Generalized Approximate Message Passing—Part II: Applications
• Matrix Completion From a Few Entries
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Learning the parts of objects by non-negative matrix factorization
• A Simpler Approach to Matrix Completion
• Low-rank matrix completion using alternating minimization
• A CDMA multiuser detection algorithm on the basis of belief propagation

This page was built for publication: Approximate matrix completion based on cavity method