The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
Abstract
This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entries. We show that properly constrained nuclear-norm minimization stably recovers a low-rank matrix from a constant number of noisy measurements per degree of freedom; this seems to be the first result of this nature. Further, with high probability, the recovery error from noisy data is within a constant of three targets: (1) the minimax risk, (2) an “oracle” error that would be available if the column space of the matrix were known, and (3) a more adaptive “oracle” error which would be available with the knowledge of the column space corresponding to the part of the matrix that stands above the noise. Lastly, the error bounds regarding low-rank matrices are extended to provide an error bound when the matrix has full rank with decaying singular values. The analysis in this paper is based on the restricted isometry property (RIP).
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Decoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
Stable signal recovery from incomplete and inaccurate measurements
Candès, E. J., Romberg, J. K., & Tao, T. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20124 · Cited by 7,036
Self-citationRobust principal component analysis?
Candès, E. J., Li, X., Ma, Y., & Wright, J. (2011) · Journal of the ACM · doi:10.1145/1970392.1970395 · Cited by 6,921
Self-citationA Singular Value Thresholding Algorithm for Matrix Completion
Cai, J.-F., Candès, E. J., & Shen, Z. (2010) · SIAM Journal on Optimization · doi:10.1137/080738970 · Cited by 5,809
Self-citationExact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
Self-citationZiegel, E. R., Lehmann, E. L., & Casella, G. (1999) · Technometrics · doi:10.2307/1270597 · Cited by 4,203
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Recht, B., Fazel, M., & Parrilo, P. A. (2010) · SIAM Review · doi:10.1137/070697835 · Cited by 3,471
Simultaneous analysis of Lasso and Dantzig selector
Bickel, P. J., Ritov, Y., & Tsybakov, A. B. (2009) · The Annals of Statistics · doi:10.1214/08-aos620 · Cited by 2,396
The Power of Convex Relaxation: Near-Optimal Matrix Completion
Candes, E. J., & Tao, T. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2044061 · Cited by 2,060
The Dantzig selector: Statistical estimation when p is much larger than n
Candes, E., & Tao, T. (2007) · The Annals of Statistics · doi:10.1214/009053606000001523 · Cited by 1,747
Cited by
The Convex Geometry of Linear Inverse Problems
Chandrasekaran, V., Recht, B., Parrilo, P. A., & Willsky, A. S. (2012) · Foundations of Computational Mathematics · doi:10.1007/s10208-012-9135-7 · Cited by 886
Stochastic Gradient Descent on Riemannian Manifolds
Bonnabel, S. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2254619 · Cited by 540
Hankel Matrix Rank Minimization with Applications to System Identification and Realization
Fazel, M., Pong, T. K., Sun, D., & Tseng, P. (2013) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/110853996 · Cited by 487
An Overview of Low-Rank Matrix Recovery From Incomplete Observations
Davenport, M. A., & Romberg, J. (2016) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2016.2539100 · Cited by 439
Blind Deconvolution Using Convex Programming
Ahmed, A., Recht, B., & Romberg, J. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2294644 · Cited by 387
Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
Chi, Y., Lu, Y. M., & Chen, Y. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2937282 · Cited by 360
Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
Flammia, S. T., Gross, D., Liu, Y.-K., & Eisert, J. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/9/095022 · Cited by 358
Tulyakov, S., Alameda-Pineda, X., Ricci, E., Yin, L., Cohn, J. F., & Sebe, N. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.263 · Cited by 340
Geometric median and robust estimation in Banach spaces
Minsker, S. (2015) · Bernoulli · doi:10.3150/14-bej645 · Cited by 261
Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
Oymak, S., Jalali, A., Fazel, M., Eldar, Y. C., & Hassibi, B. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2401574 · Cited by 252
An Exact and Robust Conformal Inference Method for Counterfactual and Synthetic Controls
Chernozhukov, V., Wüthrich, K., & Zhu, Y. (2021) · Journal of the American Statistical Association · doi:10.1080/01621459.2021.1920957 · Cited by 176
Metadata
- Authors
- Candès, E. J., & Plan, Y.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2011-04
- Volume
- 57
- Issue
- 4
- Pages
- 2342-2359
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2162451874
- Cited by
- 569
- References
- 27
- FWCI
- 29.68
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.