arXiv · 2411.13199
Sharp Bounds for Multiple Models in Matrix Completion
Abstract
In this paper, we demonstrate how a class of advanced matrix concentration inequalities, introduced in \cite{brailovskaya2024universality}, can be used to eliminate the dimensional factor in the convergence rate of matrix completion. This dimensional factor represents a significant gap between the upper bound and the minimax lower bound, especially in high dimension. Through a more precise spectral norm analysis, we remove the dimensional factors for three popular matrix completion estimators, thereby establishing their minimax rate optimality.
Explore related subjects
Keep this discovery
Dali Liu, Haolei Weng. 2024-11-20. Sharp Bounds for Multiple Models in Matrix Completion. https://arxiv.org/abs/2411.13199
Cite the original work for its findings. Save a collection to share your selection of sources.