Papers › Subspace Phase Retrieval
Subspace Phase Retrieval
Mengchu Xu, Dekuan Dong, Jian Wang
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In recent years, phase retrieval has received much attention in statistics, applied mathematics and optical engineering. In this paper, we propose an efficient algorithm, termed Subspace Phase Retrieval (SPR), which can accurately recover an n-dimensional k-sparse complex-valued signal $\x$ given its Ω(k²logn) magnitude-only Gaussian samples if the minimum nonzero entry of $\x$ satisfies |xₘᵢₙ| = Ω(/√(k)). Furthermore, if the energy sum of the most significant √(k) elements in $\x$ is comparable to ², the SPR algorithm can exactly recover $\x$ with Ω(k logn) magnitude-only samples, which attains the information-theoretic sampling complexity for sparse phase retrieval. Numerical Experiments demonstrate that the proposed algorithm achieves the state-of-the-art reconstruction performance compared to existing ones.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections