English

Stochastic Vector Approximate Message Passing with applications to phase retrieval

Computation 2024-10-10 v3

Abstract

Phase retrieval refers to the problem of recovering a high-dimensional vector xCN\boldsymbol{x} \in \mathbb{C}^N from the magnitude of its linear transform z=Ax\boldsymbol{z} = A \boldsymbol{x}, observed through a noisy channel. To improve the ill-posed nature of the inverse problem, it is a common practice to observe the magnitude of linear measurements z(1)=A(1)x,...,z(L)=A(L)x\boldsymbol{z}^{(1)} = A^{(1)} \boldsymbol{x},..., \boldsymbol{z}^{(L)} = A^{(L)}\boldsymbol{x} using multiple sensing matrices A(1),...,A(L)A^{(1)},..., A^{(L)}, with ptychographic imaging being a remarkable example of such strategies. Inspired by existing algorithms for ptychographic reconstruction, we introduce stochasticity to Vector Approximate Message Passing (VAMP), a computationally efficient algorithm applicable to a wide range of Bayesian inverse problems. By testing our approach in the setup of phase retrieval, we show the superior convergence speed of the proposed algorithm.

Keywords

Cite

@article{arxiv.2408.17102,
  title  = {Stochastic Vector Approximate Message Passing with applications to phase retrieval},
  author = {Hajime Ueda and Shun Katakami and Masato Okada},
  journal= {arXiv preprint arXiv:2408.17102},
  year   = {2024}
}

Comments

We found that damping scheme proposed in S. Sarker et al. (2021) substantially enhances the VAMP algorithm, which changed the result shown in Fig. 4. We also added the link to our code for numerical experiment. Some typos are also corrected

R2 v1 2026-06-28T18:28:32.640Z