Iteratively consistent one-bit phase retrieval

Abstract

We introduce the ICQPhase algorithm for iteratively consistent quantized phase retrieval. ICQPhase addresses the problem of recovering a signal [Formula: see text] or [Formula: see text] from one-bit quantized phaseless measurements [Formula: see text], [Formula: see text], where [Formula: see text] are orthogonal projections and where [Formula: see text] is a one-bit scalar quantizer. We numerically validate the performance of ICQPhase and demonstrate that it experimentally achieves mean squared error of order [Formula: see text] in a variety of settings. We provide a theoretical analysis of the algorithm for the case of rank-one projections of signals in two-dimensional real space and prove that the mean squared error is of order [Formula: see text].

Multivalued hybrid contraction that involves Jaggi and Pata-type inequalities

“…[29] proposed a zeroth-order stochastic federated learning method and a new type of approximating sequence for strictly decreasing step sizes and Mohiuddine et. al [21] study the existence of solutions of systems of nonlinear integral equations in the settings of tempered sequence space, for more details on the applications see [14,12].…”

Heavy-ball-based relaxed optimal s-thresholding algorithms for solving compressed sensing problem

“…As an extreme quantized CS, one-bit CS has attracted widely attention for its simple framework and perfect reconstruction performance. For further discussion of one-bit CS, we refer to [11] and the references therein.…”

Distributionally robust sparse portfolio selection

“…Based on Nesterov's gradient-free technique, Wei et al [27] proposed a zero-order stochastic federation learning method. Domel-White and Powell [9] introduced the ICQPhase algorithm for iteratively consistent quantized phase retrieval.…”