Optimal sample complexity of subgradient descent for amplitude flow via non-Lipschitz matrix concentration

DOI10.4310/CMS.2021.V19.N7.A11zbMath1475.94033arXiv2011.00288OpenAlexW3196403860MaRDI QIDQ2057056

Vladislav Voroninski, Oscar Leong, Paul E. Hand

Publication date: 8 December 2021

Published in: Communications in Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.00288

zbMATH Keywords

non-convex optimizationconcentration inequalityphase retrievalsubgradient descent

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Information theory (general) (94A15)

This page was built for publication: Optimal sample complexity of subgradient descent for amplitude flow via non-Lipschitz matrix concentration