PDMM: A novel Primal-Dual Majorization-Minimization algorithm for Poisson Phase-Retrieval problem
Ghania Fatima, Zongyu Li, Aakash Arora, and Prabhu Babu

TL;DR
This paper introduces PDMM, a novel primal-dual majorization-minimization algorithm for Poisson phase-retrieval, offering faster convergence and competitive accuracy compared to existing methods, with extensions for sparse signals.
Contribution
The paper presents a new double-loop MM algorithm based on saddle point reformulation and Fenchel duality, improving efficiency in Poisson phase-retrieval problems.
Findings
PDMM outperforms existing algorithms in speed.
PDMM achieves comparable signal recovery accuracy.
Algorithm extends to sparse Poisson phase-retrieval.
Abstract
In this paper, we introduce a novel iterative algorithm for the problem of phase-retrieval where the measurements consist of only the magnitude of linear function of the unknown signal, and the noise in the measurements follow Poisson distribution. The proposed algorithm is based on the principle of majorization-minimization (MM); however, the application of MM here is very novel and distinct from the way MM has been usually used to solve optimization problems in the literature. More precisely, we reformulate the original minimization problem into a saddle point problem by invoking Fenchel dual representation of the log (.) term in the Poisson likelihood function. We then propose tighter surrogate functions over both primal and dual variables resulting in a double-loop MM algorithm, which we have named as Primal-Dual Majorization-Minimization (PDMM) algorithm. The iterative steps of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
