The stability of generalized phase retrieval problem over compact groups

Tal Amir, Tamir Bendory, Nadav Dym, Dan EdidinarXiv 2025 · DOI · arXiv

Introduction

In many scientific imaging domains, such as X-ray crystallography and astronomy, physical sensors are unable to record the phase of a signal, capturing only its magnitude or power spectrum. The challenge of reconstructing the original signal from these incomplete measurements is known as the phase retrieval problem. While classical phase retrieval focuses on Fourier magnitudes, modern applications like Cryo-Electron Microscopy (cryo-EM) require a more complex framework. In cryo-EM, researchers must reconstruct a 3D molecular structure from thousands of 2D projections taken at unknown orientations. This necessitates a "generalized" phase retrieval approach, where signals are recovered from second-order moments (Gram matrices) under the action of a compact group, such as the group of 3D rotations.

While previous research has established conditions under which a solution to this problem is unique, uniqueness alone does not guarantee practical utility. In high-noise environments, a problem can be unique yet mathematically unstable; a negligible amount of measurement noise could result in a catastrophic error in the reconstruction. This paper provides a rigorous mathematical foundation for the stability of generalized phase retrieval, proving that for a wide variety of structured signals, the recovery process is bi-Lipschitz—meaning it is fundamentally robust to noise and model errors.

Theoretical Framework and Methodology

The authors model the problem using the Multi-Reference Alignment (MRA) framework, where observations are treated as signals acted upon by a group element plus additive noise ($y = g \cdot x + \epsilon$). The recovery focuses on the $L$-tuple of Gram matrices, which serves as a generalization of the power spectrum.

The core contribution of the paper is the proof of bi-Lipschitz continuity for the mapping from the signal to its measurements. A mapping is bi-Lipschitz if the distance between two signals is bounded proportionally by the distance between their respective measurements. To achieve this, the authors utilize a combination of representation theory, algebraic geometry, and transversality theory.

The Role of Transversality

A key insight of the paper is that "transversality"—a geometric condition where a signal set intersects the orbits of the group action cleanly—is a prerequisite for stability. However, the authors demonstrate through counterexamples (notably Example 3.4) that transversality alone is insufficient. If a signal prior is tangent to a group orbit, the recovery remains unstable despite being unique. This highlights why proving bi-Lipschitzness is a significantly higher bar than proving uniqueness.

Stability Results for Structured Priors

The paper establishes that stability is a "generic" property. If a low-dimensional signal model (such as a subspace or a manifold) is randomly oriented within the larger space, it becomes stable for phase retrieval. The authors provide specific "stability corollaries" for several signal classes, governed by an "effective dimension" constant $K$ (defined as the dimension of the representation minus the maximum orbit dimension):

  • Linear Subspaces: Recovery is stable if the subspace is generic and its dimension $M$ satisfies $M < K/2$.
  • Sparse Signals: For signals that are $M$-sparse in a generic basis, stability is guaranteed if $4M < K$.
  • ReLU Neural Networks: In a modern application of the theory, the authors prove that signals generated by a generic ReLU network with latent dimension $M$ can be stably recovered if $4M < K$.

For the specific case of cryo-EM, the results suggest that molecular structures can be stably reconstructed if their complexity (dimension) is roughly less than two-thirds of the total available degrees of freedom in the representation.

Discussion and Future Directions

This work bridges the gap between theoretical uniqueness and practical robustness in signal processing. By proving that generic, low-dimensional priors are naturally stable, it provides a mathematical justification for the success of various heuristic reconstruction methods used in imaging.

However, several open challenges remain. First, while the results hold for "generic" bases, they do not yet fully extend to the "standard" basis often used in X-ray crystallography. Second, while the paper proves that Lipschitz constants exist, it does not provide a method to calculate their exact values, which is necessary to determine the precise noise sensitivity in practice. Finally, the current framework assumes a uniform distribution of group elements (e.g., random rotations). Future work is needed to address the non-uniform distributions often encountered in real-world cryo-EM data, where molecules may have preferred orientations.

Summary updated

Abstract

The generalized phase retrieval problem over compact groups aims to recover a set of matrices -- representing an unknown signal -- from their associated Gram matrices. This framework generalizes the classical phase retrieval problem, which reconstructs a signal from the magnitudes of its Fourier transform, to a richer setting involving non-abelian compact groups. In this broader context, the unknown phases in Fourier space are replaced by unknown orthogonal matrices that arise from the action of a compact group on a finite-dimensional vector space. This problem is primarily motivated by advances in electron microscopy to determining the 3D structure of biological macromolecules from highly noisy observations. To capture realistic assumptions from machine learning and signal processing, we model the signal as belonging to one of several broad structural families: a generic linear subspace, a sparse representation in a generic basis, the output of a generic ReLU neural network, or a generic low-dimensional manifold. Our main result shows that, for a prior of sufficiently low dimension, the generalized phase retrieval problem not only admits a unique solution (up to inherent group symmetries), but also satisfies a bi-Lipschitz property. This implies robustness to both noise and model mismatch -- an essential requirement for practical use, especially when measurements are severely corrupted by noise. These findings provide theoretical support for a wide class of scientific problems under modern structural assumptions, and they offer strong foundations for developing robust algorithms in high-noise regimes.
BibTeX
@misc{amir2025stability,
  author = {Tal Amir and Tamir Bendory and Nadav Dym and Dan Edidin},
  title = {{The stability of generalized phase retrieval problem over compact groups}},
  year = {2025},
  eprint = {2505.04190},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2505.04190},
}
Figure