2021
DOI: 10.4310/cms.2021.v19.n7.a11
|View full text |Cite
|
Sign up to set email alerts
|

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1
1

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…In contrast, for sparse priors, there is no known practical algorithm that achieves a recovery guarantee with a linear dependence on the sparsity s, even though doing so is known to be information-theoretically possible. See also [54] for simplified arguments in the case of phase retrieval without prior information (i.e., general signals in R n ).…”
Section: E Further Developmentsmentioning
confidence: 99%
“…In contrast, for sparse priors, there is no known practical algorithm that achieves a recovery guarantee with a linear dependence on the sparsity s, even though doing so is known to be information-theoretically possible. See also [54] for simplified arguments in the case of phase retrieval without prior information (i.e., general signals in R n ).…”
Section: E Further Developmentsmentioning
confidence: 99%
“…In contrast, for sparse priors, there is no known practical algorithm that achieves a recovery guarantee with a linear dependence on the sparsity s, even though doing so is known to be information-theoretically possible. See also [50] for simplified arguments in the case of phase retrieval without prior information (i.e., general signals in R n ).…”
Section: E Further Developmentsmentioning
confidence: 99%