mlsanityData to 7 Oct 2026

Bayesian Uncertainty Quantification for Low-Rank Matrix Completion

arXiv 2101.01299 ↗First posted 5 Jan 2021stat.MEcited by 7

Not on the map. Why?

Abstract (arXiv)

We consider the problem of uncertainty quantification for an unknown low-rank matrix X, given a partial and noisy observation of its entries. This quantification of uncertainty is essential for many real-world problems, including image processing, satellite imaging, and seismology, providing a principled framework for validating scientific conclusions and guiding decision-making. However, existing literature has mainly focused on the completion (i.e., point estimation) of the matrix X, with little work on investigating its uncertainty. To this end, we propose in this work a new Bayesian modeling framework, called BayeSMG, which parametrizes the unknown X via its underlying row and column subspaces. This Bayesian subspace parametrization enables efficient posterior inference on matrix subspaces, which represents interpretable phenomena in many applications. This can then be leveraged for improved matrix recovery. We demonstrate the effectiveness of BayeSMG over existing Bayesian matrix recovery methods in numerical experiments, image inpainting, and a seismic sensor network application.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 5 Jan 2021.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 0; 2025: 1; 2026: 4.

7 papers.