Skip to content
aiqbench takeAI + Quantum

aiqbench analysis

This paper establishes a mathematical equivalence between the classical Gerchberg-Saxton algorithm and gradient-based optimization, proving that alternating projections are identical to unit gradient descent steps on an amplitude least-squares loss. By framing these steps as Bayesian updates, the work bridges traditional optics with modern differentiable physics pipelines, offering a theoretical foundation for integrating classical phase retrieval into automatic differentiation workflows. This insight enables seamless hybridization of legacy iterative methods with contemporary probabilistic models for computational imaging.
Sources coveringarXiv, Fortune, Quantum Zeitgeist, LessWrong
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

On the conditional equivalence of phase retrieval algorithms

arXiv2 min read

arXiv:2606.07257v1 Announce Type: cross Abstract: Phase retrieval - recovering a complex-valued field from intensity measurements - is typically solved using variants of the Gerchberg-Saxton (GS) algorithm, understood as alternating projections between measurement planes. Meanwhile, modern computational imaging increasingly relies on gradient-based optimization and automatic differentiation. Here we show that these two approaches are mathematically identical: the GS magnitude replacement step is exactly a unit gradient descent step on an amplitude least-squares loss. This equivalence enables seamless integration of classical phase retrieval with differentiable physics pipelines. We further identify two complementary probabilistic interpretations of this equivalence: globally, the amplitude loss is the negative log-likelihood under Gaussian amplitude noise; locally, each projection step arises as a Bayesian update with the propagated field as prior. The local view provides qualitative guidance for relaxation in iterative phase retrieval.

Abstract:Phase retrieval - recovering a complex-valued field from intensity measurements - is typically solved using variants of the Gerchberg-Saxton (GS) algorithm, understood as alternating projections between measurement planes. Meanwhile, modern computational imaging increasingly relies on gradient-based optimization and automatic differentiation. Here we show that these two approaches are mathematically identical: the GS magnitude replacement step is exactly a unit gradient descent step on an amplitude least-squares loss. This equivalence enables seamless integration of classical phase retrieval with differentiable physics pipelines. We further identify two complementary probabilistic interpretations of this equivalence: globally, the amplitude loss is the negative log-likelihood under Gaussian amplitude noise; locally, each projection step arises as a Bayesian update with the propagated field as prior. The local view provides qualitative guidance for relaxation in iterative phase retrieval.

Optics (physics.optics); Machine Learning (cs.LG)

arXiv:2606.07257 [physics.optics]

(or arXiv:2606.07257v1 [physics.optics] for this version)

https://doi.org/10.48550/arXiv.2606.07257 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 225 words

Related coverage