Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2102.02756
Cited By
On the computational and statistical complexity of over-parameterized matrix sensing
27 January 2021
Jiacheng Zhuo
Jeongyeol Kwon
Nhat Ho
C. Caramanis
Re-assign community
ArXiv
PDF
HTML
Papers citing
"On the computational and statistical complexity of over-parameterized matrix sensing"
8 / 8 papers shown
Title
Toward Global Convergence of Gradient EM for Over-Parameterized Gaussian Mixture Models
Weihang Xu
Maryam Fazel
Simon S. Du
30
0
0
29 Jun 2024
Low-Tubal-Rank Tensor Recovery via Factorized Gradient Descent
Zhiyu Liu
Zhi-Long Han
Yandong Tang
Xi-Le Zhao
Yao Wang
32
1
0
22 Jan 2024
A Validation Approach to Over-parameterized Matrix and Image Recovery
Lijun Ding
Zhen Qin
Liwei Jiang
Jinxin Zhou
Zhihui Zhu
30
13
0
21 Sep 2022
Tensor-on-Tensor Regression: Riemannian Optimization, Over-parameterization, Statistical-computational Gap, and Their Interplay
Yuetian Luo
Anru R. Zhang
21
19
0
17 Jun 2022
Preconditioned Gradient Descent for Overparameterized Nonconvex Burer--Monteiro Factorization with Global Optimality Certification
G. Zhang
S. Fattahi
Richard Y. Zhang
40
23
0
07 Jun 2022
Algorithmic Regularization in Model-free Overparametrized Asymmetric Matrix Factorization
Liwei Jiang
Yudong Chen
Lijun Ding
31
26
0
06 Mar 2022
A Farewell to the Bias-Variance Tradeoff? An Overview of the Theory of Overparameterized Machine Learning
Yehuda Dar
Vidya Muthukumar
Richard G. Baraniuk
24
71
0
06 Sep 2021
Sharp Global Guarantees for Nonconvex Low-rank Recovery in the Noisy Overparameterized Regime
Richard Y. Zhang
37
25
0
21 Apr 2021
1