# Matrix Completion With Deterministic Pattern: A Geometric Perspective

@article{Shapiro2019MatrixCW,
title={Matrix Completion With Deterministic Pattern: A Geometric Perspective},
author={Alexander Shapiro and Yao Xie and Rui Zhang},
journal={IEEE Transactions on Signal Processing},
year={2019},
volume={67},
pages={1088-1103}
}
• Published 31 January 2018
• Mathematics, Computer Science
• IEEE Transactions on Signal Processing
We consider the matrix completion problem with a deterministic pattern of observed entries. In this setting, we aim to answer the question: Under what conditions will there be (at least locally) unique solution to the matrix completion problem, i.e., the underlying true matrix is identifiable? We answer the question from a certain point of view and outline a geometric perspective. We give an algebraically verifiable sufficient condition, which we call the well-posedness condition, for the local… Expand
17 Citations
Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization
• Mathematics, Computer Science
• SIAM J. Optim.
• 2020
It is demonstrated that when the rank and the condition number of the unknown matrix are bounded by a constant, the convex programming approach achieves near-optimal estimation errors - in terms of the Euclidean loss, the entrywise loss, and the spectral norm loss - for a wide range of noise levels. Expand
Noisy Matrix Completion : Understanding the Stability of Convex Relaxation via Nonconvex Optimization
This paper studies noisy low-rank matrix completion: given partial and corrupted entries of a large low-rank matrix, the goal is to estimate the underlying matrix faithfully and efficiently. ArguablyExpand
Matrix completion with nonconvex regularization: spectral operators and scalable algorithms
• Computer Science, Mathematics
• Stat. Comput.
• 2020
This paper proposes NC-Impute —an EM-flavored algorithmic framework for computing a family of nonconvex penalized matrix completion problems with warm starts, and presents a systematic study of the associated spectral thresholding operators, which play an important role in the overall algorithm. Expand
Weighted Matrix Completion From Non-Random, Non-Uniform Sampling Patterns
• Computer Science, Mathematics
• IEEE Transactions on Information Theory
• 2021
This work proposes a simple and efficient debiased projection scheme for recovery from noisy observations and derives theoretical guarantees that upper bound the recovery error and nearly matching lower bounds that showcase optimality in several regimes. Expand
Statistical Rank Selection for Incomplete Low-rank Matrices
• Computer Science
• ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
• 2019
We consider the problem of determining the rank in the low-rank matrix completion. We propose a statistical model for noisy observation. It is important for many existing algorithms and sometimes hasExpand
Goodness-offit tests on manifolds
• 2019
We develop a general theory for the goodness-offit test to non-linear models. In particular, we assume that the observations are noisy samples of a sub-manifold defined by a non-linear map of someExpand
Rank one tensor completion problem
• Computer Science, Mathematics
• ArXiv
• 2020
This paper shows that the global uniqueness over the field of real numbers can be verified in a polynomial time, and gives examples showing that there is an essential difference over the fields of real and complex numbers. Expand
Inference and uncertainty quantification for noisy matrix completion
• Computer Science, Mathematics
• Proceedings of the National Academy of Sciences
• 2019
A simple procedure to compensate for the bias of the widely used convex and nonconvex estimators and derive distributional characterizations for the resulting debiased estimators, which enable optimal construction of confidence intervals/regions for the missing entries and the low-rank factors. Expand
Finiteness of fibers in matrix completion via Plücker coordinates
Let $\Omega \subseteq \{1,\dots,m\} \times \{1,\dots,n\}$. We consider fibers of coordinate projections $\pi_\Omega : \mathscr{M}_k(r,m \times n) \rightarrow k^{\# \Omega}$ from the algebraic varietyExpand
A Robust Channel Estimation Scheme for 5G Massive MIMO Systems
• I. Khan, +5 authors B. Choi
• Computer Science
• Wirel. Commun. Mob. Comput.
• 2019
Simulation results show that the proposed channel estimation scheme effectively estimates the channel with reduced pilot overhead and improved performance as compared with the state-of-the-art schemes. Expand

#### References

SHOWING 1-10 OF 45 REFERENCES
A characterization of deterministic sampling patterns for low-rank matrix completion
• Mathematics, Computer Science
• 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)
• 2015
A characterization of finitely completable observation sets is used to derive sufficient deterministic sampling conditions for unique completability and it is shown that under uniform random sampling schemes, these conditions are satisfied with high probability if O(max{r,logd}) entries per column are observed. Expand
The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Mathematics, Computer Science
• IEEE Transactions on Information Theory
• 2010
This paper shows that, under certain incoherence assumptions on the singular vectors of the matrix, recovery is possible by solving a convenient convex program as soon as the number of entries is on the order of the information theoretic limit (up to logarithmic factors). Expand
A converse to low-rank matrix completion
• Mathematics, Computer Science
• 2016 IEEE International Symposium on Information Theory (ISIT)
• 2016
Conditions on X (genericity) and a deterministic condition on Ω to guarantee that if there is a rank-r matrix that agrees with the observed entries, then X is indeedRank-r, and this condition is satisfied with high probability under uniform random sampling schemes with only O(max{r, log d}) samples per column. Expand
Fundamental Conditions for Low-CP-Rank Tensor Completion
• Mathematics, Computer Science
• J. Mach. Learn. Res.
• 2017
This work considers the problem of low canonical polyadic rank tensor completion and proposes a combinatorial method to derive a lower bound on the sampling probability of the tensor, or equivalently, the number of sampled entries that guarantees finite completability with high probability. Expand
Incoherence-Optimal Matrix Completion
• Yudong Chen
• Mathematics, Computer Science
• IEEE Transactions on Information Theory
• 2015
The results show that the standard and joint incoherence conditions are associated, respectively, with the information (statistical) and computational aspects of the matrix decomposition problem. Expand
On Deterministic Sampling Patterns for Robust Low-Rank Matrix Completion
• Mathematics, Computer Science
• IEEE Signal Processing Letters
• 2018
The recent results on the deterministic sampling patterns in the absence of noise based on the geometric analysis on the Grassmannian manifold are extended and a special case where each column has a certain number of noisy entries is considered is considered, where the probabilistic analysis performs very efficiently. Expand
Rank Determination for Low-Rank Data Completion
• Mathematics, Computer Science
• J. Mach. Learn. Res.
• 2017
This paper considers the scenario where the rank is not given and aims to approximate the unknown rank based on the location of sampled entries and some given completion, and shows that the obtained upper bound is exactly equal to theunknown rank if the lowest-rank completion is given. Expand
Guaranteed Matrix Completion via Nonconvex Factorization
• Computer Science
• 2015 IEEE 56th Annual Symposium on Foundations of Computer Science
• 2015
This paper establishes a theoretical guarantee for the factorization based formulation to correctly recover the underlying low-rank matrix, and is the first one that provides exact recovery guarantee for many standard algorithms such as gradient descent, SGD and block coordinate gradient descent. Expand
Matrix Completion From a Few Entries
• Computer Science, Mathematics
• IEEE Transactions on Information Theory
• 2010
An efficient algorithm is described, which is called OptSpace, that reconstructs M from |E| = O(rn) observed entries with relative root mean square error 1/2 RMSE ¿ C(¿) (nr/|E|)1/2 with probability larger than 1 - 1/n3. Expand
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Mathematics, Computer Science
• SIAM Rev.
• 2010
It is shown that if a certain restricted isometry property holds for the linear transformation defining the constraints, the minimum-rank solution can be recovered by solving a convex optimization problem, namely, the minimization of the nuclear norm over the given affine space. Expand