Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2011.00288
Cited By
v1
v2 (latest)
Optimal Sample Complexity of Subgradient Descent for Amplitude Flow via Non-Lipschitz Matrix Concentration
Communications in Mathematical Sciences (CMS), 2020
31 October 2020
Paul Hand
Oscar Leong
V. Voroninski
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Optimal Sample Complexity of Subgradient Descent for Amplitude Flow via Non-Lipschitz Matrix Concentration"
1 / 1 papers shown
Theoretical Perspectives on Deep Learning Methods in Inverse Problems
IEEE Journal on Selected Areas in Information Theory (JSAIT), 2022
Jonathan Scarlett
Reinhard Heckel
M. Rodrigues
Paul Hand
Yonina C. Eldar
AI4CE
416
48
0
29 Jun 2022
1
Page 1 of 1
