Research map / Learning theory and algorithms / Matrix and tensor methods
Optimal Estimation and Completion of Matrices with Biclustering Structures
Chao Gao, Yu Lu, Zongming Ma, Harrison H. Zhou
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 |
|---|---|---|---|
| use 2-fold cross validation to choose k and rho instead of knowing them | Constrained least-squares biclustering on sparse SBM · Sparse SBM, k=4, rescaled sample size 6 | sqrt MSE: 0.085 -> 0.084 | No clear effect |
| use 2-fold cross validation to choose k and rho instead of knowing them | Constrained least-squares biclustering on sparse SBM · Sparse SBM, k=4, rescaled sample size 24 | sqrt MSE: 0.053 -> 0.058 | Hurt |
| use 2-fold cross validation to choose k and rho instead of knowing them | Constrained least-squares biclustering on sparse SBM · Sparse SBM, k=6, rescaled sample size 24 | sqrt MSE: 0.048 -> 0.050 | Hurt |
| add the range constraint Q in [l,u] to the least-squares estimator (ablation) | Biclustering algorithm on sparse SBM k=8 and Gaussian (4,8) · Simulated sparse SBM and Gaussian biclustering | MSE | Improved |
| add the range constraint Q in [l,u] to the least-squares estimator (ablation) | Biclustering algorithm on sparse SBM k=8 and Gaussian (4,8) · Simulated data, large rescaled sample size | MSE | No clear effect |
| rescale sample size by sqrt(pn/log k) in Bernoulli SBM simulation | Constrained least-squares estimator · Simulated SBM, k in {2,4,8,16}, p=0.5 | error | Improved |
Closest papers by meaning
- Rate-Optimal Subspace Estimation on Random Graphs (NeurIPS 2021 · similarity 0.89)
- Variational Estimators of the Degree-corrected Latent Block Model for Bipartite Networks (JMLR 2024 · similarity 0.88)
- On the Robustness of Spectral Algorithms for Semirandom Stochastic Block Models (NeurIPS 2024 · similarity 0.86)
- Exact Community Recovery under Side Information: Optimality of Spectral Algorithms (ICLR 2025 · similarity 0.86)
- A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering (ICML 2024 · similarity 0.85)
- 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.
