Fetching the paper…
Reading the bibliography…
This paper studies the problem of recovering a low-rank matrix from several noisy random linear measurements.
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
Samuel Burer and Renato DC Monteiro · 2003
Earlier work this paper cites.
Local minima and convergence in low-rank semidefinite programming
Samuel Burer and Renato DC Monteiro · 2005
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.
Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements
E. J. Cand e ` \grave{\rm e} s and Y. Plan · 2011
Earlier work this paper cites.
Universal low-rank matrix recovery from pauli measurements
Yi-Kai Liu · 2011
Earlier work this paper cites.
Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements
Emmanuel J Candès and Yaniv Plan · 2011
Earlier work this paper cites.
Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
Steven T Flammia, David Gross, Yi-Kai Liu, and Jens Eisert · 2012
Earlier work this paper cites.
Low-rank matrix completion using alternating minimization
Prateek Jain, Praneeth Netrapalli, and Sujay Sanghavi · 2013
Earlier work this paper cites.
Guaranteed matrix completion via nonconvex factorization
Ruoyu Sun and Zhi-Quan Luo · 2015
Earlier work this paper cites.
Yudong Chen and Martin J Wainwright · 2015
Earlier work this paper cites.
Global optimality of local search for low rank matrix recovery
Srinadh Bhojanapalli, Behnam Neyshabur, and Nathan Srebro · 2016
Earlier work this paper cites.
Low-rank solutions of linear matrix equations via procrustes flow
Stephen Tu, Ross Boczar, Max Simchowitz, Mahdi Soltanolkotabi, and Ben Recht · 2016
Earlier work this paper cites.
Matrix completion has no spurious local minimum
Rong Ge, Jason D Lee, and Tengyu Ma · 2016
Earlier work this paper cites.
No spurious local minima in nonconvex low rank problems: A unified geometric analysis
Rong Ge, Chi Jin, and Yi Zheng · 2017
Earlier work this paper cites.
Implicit regularization in matrix factorization
Suriya Gunasekar, Blake E Woodworth, Srinadh Bhojanapalli, Behnam Neyshabur, and Nati Srebro · 2017
Earlier work this paper cites.
Global optimality in low-rank matrix optimization
Zhihui Zhu, Qiuwei Li, Gongguo Tang, and Michael B Wakin · 2018
Earlier work this paper cites.
Harnessing structures in big data via guaranteed low-rank matrix estimation: Recent theory and fast algorithms via convex and nonconvex optimization
Yudong Chen and Yuejie Chi · 2018
Earlier work this paper cites.
Algorithmic regularization in learning deep homogeneous models: Layers are automatically balanced
Simon S Du, Wei Hu, and Jason D Lee · 2018
Earlier work this paper cites.
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.
The implicit bias of gradient descent on separable data
Daniel Soudry, Elad Hoffer, Mor Shpigel Nacson, Suriya Gunasekar, and Nathan Srebro · 2018
Cited alongside, same era.
Implicit bias of gradient descent on linear convolutional networks
Suriya Gunasekar, Jason D Lee, Daniel Soudry, and Nati Srebro · 2018
Cited alongside, same era.
Deep image prior
Dmitry Ulyanov, Andrea Vedaldi, and Victor Lempitsky · 2018
Cited alongside, same era.
High-dimensional probability: An introduction with applications in data science
Roman Vershynin · 2018
Cited alongside, same era.
Nonconvex optimization meets low-rank matrix factorization: An overview
Preconditioned gradient descent for over-parameterized nonconvex matrix factorization
Jialun Zhang, Salar Fattahi, and Richard Zhang · 2021
Later among the works it cites.
Small random initialization is akin to spectral learning: Optimization and generalization guarantees for overparameterized low-rank matrix reconstruction
Dominik Stöger and Mahdi Soltanolkotabi · 2021
Later among the works it cites.
Early stopping for deep image prior
Hengkang Wang, Taihui Li, Zhong Zhuang, Tiancong Chen, Hengyue Liang, and Ju Sun · 2021
Later among the works it cites.
Self-validation: Early stopping for single-instance deep generative priors
Taihui Li, Zhong Zhuang, Hengyue Liang, Le Peng, Hengkang Wang, and Ju Sun · 2021
Later among the works it cites.
Rank overspecified robust matrix recovery: Subgradient method and exact recovery
Lijun Ding, Liwei Jiang, Yudong Chen, Qing Qu, and Zhihui Zhu · 2021
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Yuejie Chi, Yue M Lu, and Yuxin Chen · 2019
Cited alongside, same era.
The non-convex geometry of low-rank matrix optimization
Qiuwei Li, Zhihui Zhu, and Gongguo Tang · 2019
Cited alongside, same era.
Gpipe: Efficient training of giant neural networks using pipeline parallelism
Yanping Huang, Youlong Cheng, Ankur Bapna, Orhan Firat, Dehao Chen, Mia Chen, HyoukJoong Lee, Jiquan Ngiam, Quoc V Le, Yonghui Wu, et al · 2019
Cited alongside, same era.
Implicit regularization for optimal sparse recovery
Tomas Vaskevicius, Varun Kanade, and Patrick Rebeschini · 2019
Cited alongside, same era.
Peng Zhao, Yun Yang, and Qiao-Chu He · 2019
Cited alongside, same era.
Overparameterized nonlinear learning: Gradient descent takes the shortest path?
Samet Oymak and Mahdi Soltanolkotabi · 2019
Cited alongside, same era.
Implicit regularization in deep matrix factorization
Sanjeev Arora, Nadav Cohen, Wei Hu, and Yuping Luo · 2019
Cited alongside, same era.
Later among the works it cites.
Sign-rip: A robust restricted isometry property for low-rank matrix recovery
Jianhao Ma and Salar Fattahi · 2021
Later among the works it cites.
Robust training under label noise by over-parameterization
Sheng Liu, Zhihui Zhu, Qing Qu, and Chong You · 2022
Closest in time.
Jianhao Ma and Salar Fattahi · 2022
Closest in time.
Dominik Stöger and Mahdi Soltanolkotabi · 2022
Closest in time.
Cong Ma, Xingyu Xu, Tian Tong, and Yuejie Chi · 2023
Closest in time.
Algorithmic regularization in model-free overparametrized asymmetric matrix factorization
Liwei Jiang, Yudong Chen, and Lijun Ding · 2023
Closest in time.
Implicit balancing and regularization: Generalization and convergence guarantees for overparameterized asymmetric matrix sensing
Mahdi Soltanolkotabi, Dominik Stöger, and Changzhi Xie · 2023
Closest in time.
Nuoya Xiong, Lijun Ding, and Simon S Du · 2023
Closest in time.
Fast and accurate estimation of low-rank matrices from noisy measurements via preconditioned non-convex gradient descent
Jialun Zhang, Richard Y Zhang, and Hong-Ming Chiu · 2024
Closest in time.
A local nearly linearly convergent first-order method for nonsmooth functions with quadratic growth
Damek Davis and Liwei Jiang · 2024
Closest in time.
Non-convex matrix sensing: Breaking the quadratic rank barrier in the sample complexity
Dominik Stöger and Yizhe Zhu · 2024
Closest in time.
Convergence of gradient descent with small initialization for unregularized matrix completion
Jianhao Ma and Salar Fattahi · 2024
Closest in time.