Empirical Bayes 1-bit matrix completion
Not on the map. Why?
Abstract (arXiv)
The problem of predicting unobserved entries in a binary matrix, known as 1-bit matrix completion, has found diverse applications in fields such as recommendation systems. In this study, we develop an empirical Bayes method for 1-bit matrix completion motivated by the Efron--Morris estimator, a matrix generalization of the James--Stein estimator that shrinks singular values toward zero. The proposed method exploits the underlying low-rank structure of binary matrices, drawing parallels with multidimensional item response theory. Simulation studies and real-data applications demonstrate that the proposed method achieves competitive predictive accuracy and favorable predictive calibration.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 35 references that are in the map. First posted on arXiv 10 May 2026.
Builds on
7 of 35 references.
References · 7
- 2017On Calibration of Modern Neural Networkscited by 4,960
- 2013A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completioncited by 25
- 20161-bit Matrix Completion: PAC-Bayesian Analysis of a Variational Approximationcited by 11
- 20151-Bit Matrix Completion under Exact Low-Rank Constraintcited by 7
- 2023A Majorization-Minimization Gauss-Newton Method for 1-Bit Matrix Completioncited by 2
- 2017Empirical Bayes Matrix Completioncited by 1
- 2026Empirical Bayes data integreation for multi-response regressioncited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2024Concentration properties of fractional posterior in 1-bit matrix completion
- 2023Misclassification excess risk bounds for 1-bit matrix completion
- 2023Matrix Completion from One-Bit Dither Samples
- 2024Optimal score estimation via empirical Bayes smoothing
- 2022High Dimensional Statistical Estimation under Uniformly Dithered One-bit Quantization
- 2019Soft-Bayes: Prod for Mixtures of Experts with Log-Loss
- 2025Graphical model for factorization and completion of relatively high rank tensors by sparse sampling
- 2026Smoothed Score Queries and the Complexity of Sampling