Inference and uncertainty quantification for noisy matrix completion
Published 2019 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Inference and uncertainty quantification for noisy matrix completion
Authors
Keywords
-
Journal
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA
Volume 116, Issue 46, Pages 22931-22937
Publisher
Proceedings of the National Academy of Sciences
Online
2019-10-31
DOI
10.1073/pnas.1910053116
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval, Matrix Completion, and Blind Deconvolution
- (2019) Cong Ma et al. FOUNDATIONS OF COMPUTATIONAL MATHEMATICS
- Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
- (2019) Yuejie Chi et al. IEEE TRANSACTIONS ON SIGNAL PROCESSING
- Adaptive confidence sets for matrix completion
- (2018) Alexandra Carpentier et al. BERNOULLI
- Guaranteed Matrix Completion via Non-Convex Factorization
- (2016) Ruoyu Sun et al. IEEE TRANSACTIONS ON INFORMATION THEORY
- Asymptotic normality and optimalities in estimation of large Gaussian graphical models
- (2015) Zhao Ren et al. ANNALS OF STATISTICS
- Confidence intervals for high-dimensional inverse covariance estimation
- (2015) Jana Janková et al. Electronic Journal of Statistics
- On asymptotically optimal confidence regions and tests for high-dimensional models
- (2014) Sara van de Geer et al. ANNALS OF STATISTICS
- A significance test for the lasso
- (2014) Richard Lockhart et al. ANNALS OF STATISTICS
- Confidence intervals for low dimensional parameters in high dimensional linear models
- (2013) Cun-Hui Zhang et al. JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-STATISTICAL METHODOLOGY
- Large covariance estimation by thresholding principal orthogonal complements
- (2013) Jianqing Fan et al. JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-STATISTICAL METHODOLOGY
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- (2011) Vladimir Koltchinskii et al. ANNALS OF STATISTICS
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- (2011) David Gross IEEE TRANSACTIONS ON INFORMATION THEORY
- Angular synchronization by eigenvectors and semidefinite programming
- (2010) A. Singer APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS
- Matrix Completion From a Few Entries
- (2010) Raghunandan H. Keshavan et al. IEEE TRANSACTIONS ON INFORMATION THEORY
- Matrix Completion With Noise
- (2010) Emmanuel J Candes et al. PROCEEDINGS OF THE IEEE
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- (2010) Benjamin Recht et al. SIAM REVIEW
- Exact Matrix Completion via Convex Optimization
- (2009) Emmanuel J. Candès et al. FOUNDATIONS OF COMPUTATIONAL MATHEMATICS
Add your recorded webinar
Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.
Upload NowAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started