Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 171

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Incoherence-Optimal Matrix Completion

Open access
Chen, Yudong · 2015 · IEEE Transactions on Information Theory

Abstract

This paper considers the matrix completion problem. We show that it is not necessary to assume joint incoherence, which is a standard but unintuitive and restrictive condition that is imposed by previous studies. This leads to a sample complexity bound that is orderwise optimal with respect to the incoherence parameter (as well as to the rank r and the matrix dimension n up to a log factor). As a consequence, we improve the sample complexity of recovering a semidefinite matrix from O(nr2log2n) to O(nr log2n), and the highest allowable rank from Θ(√n/ log n) to Θ(n/ log2n). The key step in proof is to obtain new bounds in terms of the ℓ∞,2-norm, defined as the maximum of the row and column norms of a matrix. To illustrate the applicability of our techniques, we discuss extensions to singular value decomposition projection, structured matrix completion and semisupervised clustering, for which we provide orderwise improvements over existing results. Finally, we turn to the closely related problem of low-rank-plus-sparse matrix decomposition. We show that the joint incoherence condition is unavoidable here for polynomialtime algorithms conditioned on the planted clique conjecture. This means it is intractable in general to separate a rank-ω(√n) positive semidefinite matrix and a sparse matrix. Interestingly, our results show that the standard and joint incoherence conditions are associated, respectively, with the information (statistical) and computational aspects of the matrix decomposition problem.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tit.2015.2415195

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Cited by

See all 171

Metadata

Authors
Chen, Y.
Venue
IEEE Transactions on Information Theory
Published
2015-05
Volume
61
Issue
5
Pages
2909-2923
ISSN
  • 0018-9448 (ISSN-L)
  • 1557-9654
OpenAlex
W2171046470
Cited by
171
References
1
FWCI
15.54
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Incoherence-Optimal Matrix Completion. https://app.cochat.ai/papers/10.1109/tit.2015.2415195
The paper
Chen, Y. (2015). Incoherence-Optimal Matrix Completion. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2015.2415195

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.