Researchers have developed a new algorithm called CP generalized approximate message passing (CP-GAMP) for Bayesian CANDECOMP/PARAFAC (CP) decomposition. This method significantly reduces computation time compared to traditional variational Bayesian methods by employing Gaussian message approximations to bypass high-dimensional matrix inversions. The algorithm also incorporates a Bernoulli-Gaussian prior with expectation-maximization updates for estimating CP rank and noise variance, and its performance is validated through synthetic and image-inpainting experiments. AI
IMPACT This new algorithm could improve the efficiency of tensor reconstruction tasks in machine learning.
RANK_REASON The cluster contains a research paper detailing a new algorithm for tensor reconstruction. [lever_c_demoted from research: ic=1 ai=1.0]
- Bayesian CANDECOMP/PARAFAC (CP) decomposition
- Bernoulli-Gaussian prior
- Bingyang Cheng
- CP generalized approximate message passing (CP-GAMP)
- expectation–maximization algorithm
- Gaussian message approximations
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →