Projects
Reading
People
Chat
SU\G
(đ¸)
/K¡U
Projects
Reading
People
Chat
Sign Up
Sign In
Light
Dark
System
Low Permutation-rank Matrices: Structural Properties and Noisy Completion
Nihar B. Shah
,
Sivaraman Balakrishnan
,
Martin J. Wainwright
Type:
Preprint
Publication Date:
2017-09-01
Citations:
1
View Publication
Share
Locations
arXiv (Cornell University) -
View
Similar Works
Action
Title
Year
Authors
+
Low Permutation-rank Matrices: Structural Properties and Noisy Completion
2019
Nihar B. Shah
Sivaraman Balakrishnan
Martin J. Wainwright
+
Low Permutation-rank Matrices: Structural Properties and Noisy Completion
2017
Nihar B. Shah
Sivaraman Balakrishnan
Martin J. Wainwright
+
PDF
Chat
Low Permutation-Rank Matrices: Structural Properties and Noisy Completion
2018
Nihar B. Shah
Sivaraman Balakrishnan
Martin J. Wainwright
+
Nearly-optimal Robust Matrix Completion
2016
Yeshwanth Cherapanamjeri
Kartik Gupta
Prateek Jain
+
Nearly-optimal Robust Matrix Completion
2016
Yeshwanth Cherapanamjeri
Kartik Gupta
Prateek Jain
+
Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization
2020
Yuxin Chen
Yuejie Chi
Jianqing Fan
Cong Ma
Yuling Yan
+
Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization
2019
Yuxin Chen
Yuejie Chi
Jianqing Fan
Cong Ma
Yuling Yan
+
Low-rank matrix completion and denoising under Poisson noise
2019
Andrew D. McRae
Mark A. Davenport
+
Low-rank matrix completion and denoising under Poisson noise
2019
Andrew D. McRae
Mark A. Davenport
+
PDF
Chat
Matrix Completion With Noise
2010
Emmanuel J. Candès
Yaniv Plan
+
Robust matrix completion
2016
Olga Klopp
Karim Lounici
Alexandre B. Tsybakov
+
Statistically Optimal and Computationally Efficient Low Rank Tensor Completion from Noisy Entries
2017
Dong Xia
Ming Yuan
CunâHui Zhang
+
PDF
Chat
Statistically optimal and computationally efficient low rank tensor completion from noisy entries
2021
Dong Xia
Ming Yuan
CunâHui Zhang
+
PDF
Chat
Low-rank matrix completion and denoising under Poisson noise
2020
Andrew D. McRae
Mark A. Davenport
+
PDF
Chat
Sparse Bayesian Methods for Low-Rank Matrix Estimation
2012
S. Derin Babacan
Martin Luessi
Rafael Molina
Aggelos K. Katsaggelos
+
Robust Matrix Completion
2016
Olga Klopp
Karim Lounici
Alexandre B. Tsybakov
+
PDF
Chat
Exact matrix completion via convex optimization
2012
Emmanuel J. Candès
Benjamin Recht
+
Sparse Bayesian Methods for Low-Rank Matrix Estimation
2011
S. Derin Babacan
Martin Luessi
Rafael Molina
Aggelos K. Katsaggelos
+
Matrix Completion With Noise
2009
Emmanuel J. Candès
Yaniv Plan
+
On the Power of Truncated SVD for General High-rank Matrix Estimation Problems
2017
Simon S. Du
Yining Wang
Aarti Singh
Works That Cite This (1)
Action
Title
Year
Authors
+
Minimax Rates and Efficient Algorithms for Noisy Sorting
2017
Cheng Mao
Jonathan Weed
Philippe Rigollet
Works Cited by This (32)
Action
Title
Year
Authors
+
Matrix Completion Problems
2001
Monique Laurent
+
On two-sided orthogonal procrustes problems
1968
Peter H. SchĂśnemann
+
Matrix estimation by Universal Singular Value Thresholding
2014
Sourav Chatterjee
+
PDF
Chat
Fast singular value thresholding without singular value decomposition
2013
JianâFeng Cai
Stanley Osher
+
Tensor Decompositions and Applications
2009
Tamara G. Kolda
Brett W. Bader
+
Minimax risk of matrix denoising by singular value thresholding
2014
David L. Donoho
Matan Gavish
+
Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
1977
Joseph B. Kruskal
+
PDF
Chat
A Singular Value Thresholding Algorithm for Matrix Completion
2010
JianâFeng Cai
Emmanuel J. Candès
Zuowei Shen
+
Tensor rank is NP-complete
1990
Johan HĂĽstad
+
PDF
Chat
Concentration around the mean for maxima of empirical processes
2005
Thierry Klein
Emmanuel Rio