Research map / Learning theory and algorithms / Matrix and tensor methods
Statistical Inference for Noisy Incomplete Binary Matrix
Yunxiao Chen, Chengcheng Li, Jing Ouyang, Gongjun Xu
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| double sample size to N=10000, J=400 (ablation) | Rasch-model MLE · Simulation, block-wise missing | MSE of M: 0.067 -> 0.033 | Improved |
| double sample size to N=10000, J=400 (ablation) | Rasch-model MLE · Simulation, block-wise missing | MSE of theta: 0.064 -> 0.031 | Improved |
| double sample size to N=10000, J=400 (ablation) | Rasch-model MLE · Simulation, block-wise missing | MSE of beta: 0.0028 -> 0.0013 | Improved |
| random Bernoulli(0.5) missingness instead of block-wise design (ablation) | Rasch-model MLE · Simulation (N=5000, J=200) | MSE of M: 0.067 -> 0.068 | No clear effect |
| random missingness instead of block-wise design (ablation) | Rasch-model MLE · Simulation (N=5000, J=200) | MSE of beta: 0.0028 -> 0.0027 | No clear effect |
| double sample size to N=10000, J=400 (ablation) | Rasch-model MLE · Simulation, block-wise missing | average CPU time per iteration (s): 9.24 -> 47.18 | Hurt |
| random missingness instead of block-wise design (ablation) | Rasch-model MLE · Simulation (N=5000, J=200) | average CPU time per iteration (s): 9.24 -> 13.93 | Hurt |
Closest papers by meaning
- Missing Not at Random in Matrix Completion: The Effectiveness of Estimating Missingness Probabilities Under a Low Nuclear Norm Assumption (NeurIPS 2019 · similarity 0.89)
- A Note on Entrywise Consistency for Mixed-data Matrix Completion (JMLR 2024 · similarity 0.88)
- A Pairwise Pseudo-likelihood Approach for Matrix Completion with Informative Missingness (NeurIPS 2024 · similarity 0.87)
- Fast exact recovery of noisy matrix from few entries: the infinity norm approach (NeurIPS 2025 · similarity 0.87)
- RGNMR: A Gauss-Newton method for robust matrix completion with theoretical guarantees (NeurIPS 2025 · similarity 0.86)
- Semi-Random Matrix Completion via Flow-Based Adaptive Reweighting (NeurIPS 2024 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
