ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2011.00288
  4. Cited By
Optimal Sample Complexity of Subgradient Descent for Amplitude Flow via
  Non-Lipschitz Matrix Concentration
v1v2 (latest)

Optimal Sample Complexity of Subgradient Descent for Amplitude Flow via Non-Lipschitz Matrix Concentration

31 October 2020
Paul Hand
Oscar Leong
V. Voroninski
ArXiv (abs)PDFHTML

Papers citing "Optimal Sample Complexity of Subgradient Descent for Amplitude Flow via Non-Lipschitz Matrix Concentration"

1 / 1 papers shown
Title
Theoretical Perspectives on Deep Learning Methods in Inverse Problems
Theoretical Perspectives on Deep Learning Methods in Inverse Problems
Jonathan Scarlett
Reinhard Heckel
M. Rodrigues
Paul Hand
Yonina C. Eldar
AI4CE
110
32
0
29 Jun 2022
1