The problem of estimating a matrix based on a set of its observed entries is commonly referred to as the matrix completion problem. In this work, we specifically address the scenario of binary observations, often termed as 1-bit matrix completion. While numerous studies have explored Bayesian and frequentist methods for real-value matrix completion, there has been a lack of theoretical exploration regarding Bayesian approaches in 1-bit matrix completion. We tackle this gap by considering a general, non-uniform sampling scheme and providing theoretical assurances on the efficacy of the fractional posterior. Our contributions include obtaining concentration results for the fractional posterior and demonstrating its effectiveness in recovering the underlying parameter matrix. We accomplish this using two distinct types of prior distributions: low-rank factorization priors and a spectral scaled Student prior, with the latter requiring fewer assumptions. Importantly, our results exhibit an adaptive nature by not mandating prior knowledge of the rank of the parameter matrix. Our findings are comparable to those found in the frequentist literature, yet demand fewer restrictive assumptions.

通过考虑非均匀采样方案，我们为二值观测的矩阵完成问题提供了理论保证，证明了分数后验的有效性。我们使用两种不同类型的先验分布来实现这一目标：低秩分解先验和谱缩放的学生先验，后者需要较少的假设。重要的是，我们的结果具有自适应性，不需要对参数矩阵的秩有先验知识，与最频繁的文献中的结果相当，但需要较少的限制性假设。

1比特矩阵完备性问题中分数后验的集中性质