Fetching the paper…
Reading the bibliography…
We study the robust recovery of a low-rank matrix from sparsely and grossly corrupted Gaussian measurements, with no prior knowledge on the intrinsic rank.
Minimization of unsmooth functionals
Boris Teodorovich Polyak · 1969
Earlier work this paper cites.
Weak sharp minima in mathematical programming
James V Burke and Michael C Ferris · 1993
Earlier work this paper cites.
Nonsmooth analysis and control theory
Francis H Clarke, Yuri S Ledyaev, Ronald J Stern, and Peter R Wolenski · 2008
Earlier work this paper cites.
Introduction to the non-asymptotic analysis of random matrices
Roman Vershynin · 2010
Earlier work this paper cites.
Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
Benjamin Recht, Maryam Fazel, and Pablo A Parrilo · 2010
Earlier work this paper cites.
Robust principal component analysis?
Emmanuel J Candès, Xiaodong Li, Yi Ma, and John Wright · 2011
Earlier work this paper cites.
Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements
Emmanuel J Candes and Yaniv Plan · 2011
Earlier work this paper cites.
User-friendly tail bounds for sums of random matrices
Joel A Tropp · 2012
Earlier work this paper cites.
Low-rank matrix recovery from errors and erasures
Yudong Chen, Ali Jalali, Sujay Sanghavi, and Constantine Caramanis · 2013
Earlier work this paper cites.
Adam: A method for stochastic optimization
Diederik P Kingma and Jimmy Ba · 2014
Earlier work this paper cites.
U-net: Convolutional networks for biomedical image segmentation
Olaf Ronneberger, Philipp Fischer, and Thomas Brox · 2015
Earlier work this paper cites.
Low-rank positive semidefinite matrix recovery from corrupted rank-one measurements
Yuanxin Li, Yue Sun, and Yuejie Chi · 2016
Earlier work this paper cites.
Guaranteed matrix completion via non-convex factorization
Ruoyu Sun and Zhi-Quan Luo · 2016
Earlier work this paper cites.
Global optimality of local search for low rank matrix recovery
Srinadh Bhojanapalli, Behnam Neyshabur, and Nathan Srebro · 2016
Cited alongside, same era.
No spurious local minima in nonconvex low rank problems: A unified geometric analysis
Rong Ge, Chi Jin, and Yi Zheng · 2017
Cited alongside, same era.
High-dimensional probability: An introduction with applications in data science
Roman Vershynin · 2018
Cited alongside, same era.
Deep image prior
Dmitry Ulyanov, Andrea Vedaldi, and Victor Lempitsky · 2018
Cited alongside, same era.
Global optimality in low-rank matrix optimization
Zhihui Zhu, Qiuwei Li, Gongguo Tang, and Michael B Wakin · 2018
Cited alongside, same era.
Implicit regularization in matrix factorization
Suriya Gunasekar, Blake Woodworth, Srinadh Bhojanapalli, Behnam Neyshabur, and Nathan Srebro · 2018
Cited alongside, same era.
Google colaboratory
Ekaba Bisong · 2019
Later among the works it cites.
Non-convex low-rank matrix recovery with arbitrary outliers via median-truncated gradient descent
Yuanxin Li, Yuejie Chi, Huishuai Zhang, and Yingbin Liang · 2020
Later among the works it cites.
Nonconvex robust low-rank matrix recovery
Xiao Li, Zhihui Zhu, Anthony Man-Cho So, and Rene Vidal · 2020
Later among the works it cites.
Robust recovery via implicit bias of discrepant learning rates for double over-parameterization
Chong You, Zhihui Zhu, Qing Qu, and Yi Ma · 2020
Later among the works it cites.
From symmetry to geometry: Tractable nonconvex problems
Yuqian Zhang, Qing Qu, and John Wright · 2020
Later among the works it cites.
Bridging convex and nonconvex optimization in robust pca: Noise, outliers, and missing data
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Algorithmic regularization in over-parameterized matrix sensing and neural networks with quadratic activations
Yuanzhi Li, Tengyu Ma, and Hongyang Zhang · 2018
Cited alongside, same era.
High-dimensional statistics: A non-asymptotic viewpoint
Martin J Wainwright · 2019
Cited alongside, same era.
Solving (most) of a set of quadratic equalities: Composite optimization for robust phase retrieval
John C Duchi and Feng Ruan · 2019
Cited alongside, same era.
Recovery of future data via convolution nuclear norm minimization
Guangcan Liu and Wayne Zhang · 2019
Cited alongside, same era.
Nonconvex optimization meets low-rank matrix factorization: An overview
Yuejie Chi, Yue M Lu, and Yuxin Chen · 2019
Cited alongside, same era.
Denoising and regularization via exploiting the structural bias of convolutional generators
Reinhard Heckel and Mahdi Soltanolkotabi · 2019
Cited alongside, same era.
Yuxin Chen, Jianqing Fan, Cong Ma, and Yuling Yan · 2020
Later among the works it cites.
Robust and efficient high-dimensional quantum state tomography
Markus Rambach, Mahdi Qaryan, Michael Kewming, Christopher Ferrie, Andrew G White, and Jacquiline Romero · 2021
Closest in time.
Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
Vasileios Charisopoulos, Yudong Chen, Damek Davis, Mateo Díaz, Lijun Ding, and Dmitriy Drusvyatskiy · 2021
Closest in time.
Low-rank matrix recovery with scaled subgradient methods: Fast and robust convergence without the condition number
Tian Tong, Cong Ma, and Yuejie Chi · 2021
Closest in time.
Jianhao Ma and Salar Fattahi · 2021
Closest in time.
On the computational and statistical complexity of over-parameterized matrix sensing
Jiacheng Zhuo, Jeongyeol Kwon, Nhat Ho, and Constantine Caramanis · 2021
Closest in time.
Sign-rip: A robust restricted isometry property for low-rank matrix recovery
Jianhao Ma and Salar Fattahi · 2021
Closest in time.