A continuous-time mirror descent approach to sparse phase retrieval
We analyze continuous-time mirror descent applied to sparse phase retrieval, which is the problem of recovering sparse signals from a set of magnitude-only measurements. We apply mirror descent to the unconstrained empirical risk minimization problem (batch setting), using the square loss and square...
Main Authors: | Wu, F, Rebeschini, P |
---|---|
Format: | Conference item |
Language: | English |
Published: |
Neural Information Processing Systems Foundation, Inc.
2020
|
Similar Items
-
Nearly minimax-optimal rates for noisy sparse phase retrieval via early-stopped mirror descent
by: Wu, F, et al.
Published: (2022) -
Implicit regularization in matrix sensing via mirror descent
by: Wu, F, et al.
Published: (2021) -
Hadamard wirtinger flow for sparse phase retrieval
by: Wu, F, et al.
Published: (2021) -
The statistical complexity of early-stopped mirror descent
by: Vaškevičius, T, et al.
Published: (2020) -
The statistical complexity of early-stopped mirror descent
by: Kanade, V, et al.
Published: (2023)