SOURCE-LINKED INTELLIGENCE

Nuclear Norm-Regularized Bayesian Matrix Completion

arXiv · AI, language, vision and robotics · article · Sep 24, 2026 · UTC

Matrix completion, the problem of estimating missing entries in a matrix from noisily observed ones, underlies a diverse array of problems such as recommender systems and counterfactual outcome estimation in panel data. Many algorithms address the problem using regularized least squares, often with the nuclear norm as a regularizer, but this method yields a point estimate with no built-in uncertainty quantification. A Bayesian formulation is a natural alternative, and if the noise variance is known, the nuclear norm-based prior yields a log-concave posterior. Unfortunately, in practice, the no

Read original source ↗ Open in workspace

recordType

paper

region

Global