AIMech AI

Wirtinger Flow Phase Retrieval and Spectral Initialization

Algorithms AIMech:WirtingerFlowPhaseRetrievalAndSpectralInitialization DRAFT
Aliases: Wirtinger Flow (WF) Algorithm for Phase Retrieval, Candes-Li-Soltanolkotabi Spectral Initialization and Wirtinger Gradient Descent, Nonconvex Quartic Loss Wirtinger Calculus Phase Retrieval
A two-stage nonconvex optimization algorithm (introduced by Emmanuel J. Candès, Xiaodong Li, and Mahdi Soltanolkotabi in 2015) for recovering a complex or real signal $\boldsymbol{x} \in \mathbb{C}^n$ (up to a global unimodular phase factor $e^{i\phi}$) from $m$ phaseless quadratic intensity measurements $y_r = |\langle \boldsymbol{a}_r, \boldsymbol{x}\rangle|^2$, $r = 1,\dots,m$. Stage 1 (*Spectral Initialization*, Algorithm 1) computes the leading eigenvector of the weighted data covariance matrix $\boldsymbol{Y} = \frac{1}{m}\sum_{r=1}^m y_r\boldsymbol{a}_r\boldsymbol{a}_r^*$ (whose population expectation under Gaussian design is $\mathbb{E}[\boldsymbol{Y}] = \|\boldsymbol{x}\|^2\boldsymbol{I}_n + \boldsymbol{x}\boldsymbol{x}^*$) scaled to norm $\lambda_0 = \sqrt{n\sum_r y_r / \sum_r \|\boldsymbol{a}_r\|^2}$ to produce an initial iterate $\boldsymbol{z}_0$ satisfying $\mathrm{dist}(\boldsymbol{z}_0, \boldsymbol{x}) \le \frac{1}{8}\|\boldsymbol{x}\|$ (Section 7.1, Lemma 7.8). Stage 2 (*Wirtinger Flow*, Algorithm 1, Equation 2.2) minimizes the nonconvex quartic intensity loss $f(\boldsymbol{z}) = \frac{1}{2m}\sum_{r=1}^m (|\langle\boldsymbol{a}_r, \boldsymbol{z}\rangle|^2 - y_r)^2$ via complex Wirtinger-calculus gradient updates $\boldsymbol{z}_{\tau+1} = \boldsymbol{z}_\tau - \frac{\mu_{\tau+1}}{\|\boldsymbol{z}_0\|^2}\frac{1}{m}\sum_{r=1}^m (|\langle\boldsymbol{a}_r,\boldsymbol{z}_\tau\rangle|^2 - y_r)(\boldsymbol{a}_r\boldsymbol{a}_r^*)\boldsymbol{z}_\tau$. By establishing a local *Regularity Condition* $\mathrm{Re}(\langle\nabla f(\boldsymbol{z}), \boldsymbol{z} - \boldsymbol{x}e^{i\phi(\boldsymbol{z})}\rangle) \ge \frac{1}{\alpha}\mathrm{dist}^2(\boldsymbol{z},\boldsymbol{x}) + \frac{1}{\beta}\|\nabla f(\boldsymbol{z})\|^2$ in the basin $E(\boldsymbol{x}) = \{\boldsymbol{z} : \mathrm{dist}(\boldsymbol{z},\boldsymbol{x}) \le \frac{1}{8}\|\boldsymbol{x}\|\}$ via shared local smoothness and curvature bounds (Condition 7.9, Lemmas 7.2–7.7), Theorem 3.3 proves exact geometric convergence $\mathrm{dist}(\boldsymbol{z}_\tau, \boldsymbol{x}) \le \frac{1}{8}(1 - \frac{2\mu}{\alpha})^{\tau/2}\|\boldsymbol{x}\|$ from $m \ge c_0 n\log n$ Gaussian measurements or $L \ge c_1\log^4 n$ coded diffraction patterns (CDPs) with admissible fourth-moment modulation $\mathbb{E}[|d|^4] = 2(\mathbb{E}[|d|^2])^2$ (Equation 2.3).
Identity Notes & Concept Scope Resolved against all 442 pinned AIO concepts and 684 maintained AIMech concepts. Distinct from `AIMech:ImplicitRegularizationInNonconvexStatisticalEstimationByLeaveOneOutTrajectoryAnalysis` (Ma, Wang, Chi, & Chen 2020, which introduces leave-one-out trajectory perturbation analysis to sharpen the sample complexity of Wirtinger Flow from $O(n\log n)$ to $O(n\log n)$ with step size $\eta \asymp 1/\log n$, whereas Candès, Li, & Soltanolkotabi 2015 formulate the Wirtinger Flow algorithm itself, the spectral initializer $\boldsymbol{Y} = \frac{1}{m}\sum_r y_r\boldsymbol{a}_r\boldsymbol{a}_r^*$, the admissible octanary Coded Diffraction Pattern design, and the local Regularity Condition framework).

Claims & Grounded Evidence

3 Claims
Mechanism #claim-spectral-initialization-weighted-empirical-covariance
For Gaussian designs $\boldsymbol{a}_r \sim \mathcal{N}(\boldsymbol{0},\boldsymbol{I})$ or admissible Coded Diffraction Patterns satisfying $\mathbb{E}[d]=0$ and $\mathbb{E}[|d|^4] = 2(\mathbb{E}[|d|^2])^2$ (Equation 2.3), the population weighted covariance matrix satisfies $\mathbb{E}[\frac{1}{m}\sum_{r=1}^m y_r\boldsymbol{a}_r\boldsymbol{a}_r^*] = \|\boldsymbol{x}\|^2\boldsymbol{I}_n + \boldsymbol{x}\boldsymbol{x}^*$, and Lemma 7.8 proves that the scaled top eigenvector $\boldsymbol{z}_0$ of $\boldsymbol{Y}$ satisfies $\mathrm{dist}(\boldsymbol{z}_0, \boldsymbol{x}) \le \delta_0\|\boldsymbol{x}\|$ with $\delta_0 \le 1/8$ with high probability once $m \ge c_0 n\log n$ (Gaussian) or $L \ge c_1\log^4 n$ (CDP) (Sections 2.1, 4, and 7.1, Algorithm 1, Equation 2.3, Lemma 7.8).
Mechanism #claim-local-regularity-condition-via-cubic-smoothness-and-curvature
Inside the local neighborhood $E(\boldsymbol{x}) = \{\boldsymbol{z} : \mathrm{dist}(\boldsymbol{z},\boldsymbol{x}) \le \frac{1}{8}\|\boldsymbol{x}\|\}$, Lemmas 7.3–7.7 prove that uniform concentration of the fourth-moment operator $\|\frac{1}{m}\sum_{r=1}^m |\boldsymbol{a}_r^*\boldsymbol{u}|^2\boldsymbol{a}_r\boldsymbol{a}_r^* - (\boldsymbol{I}+2\boldsymbol{u}\boldsymbol{u}^*)\| \le \delta$ (Condition 7.9) implies both local smoothness $\|\nabla f(\boldsymbol{z})\| \le (1+\delta)C_{\max}\|\boldsymbol{z}-\boldsymbol{x}\|$ and local curvature $\mathrm{Re}(\langle\nabla f(\boldsymbol{z}), \boldsymbol{z}-\boldsymbol{x}\rangle) \ge ((1-\delta)C_{\min} - \delta C_{\max})\|\boldsymbol{z}-\boldsymbol{x}\|^2$, establishing the Regularity Condition $RC(\alpha,\beta,\frac{1}{8})$ with $\frac{1}{\alpha} + \frac{1}{\beta}(1+\delta)^2 C_{\max}^2 \le (1-\delta)C_{\min} - \delta C_{\max}$ (Sections 7.2–7.7, Condition 7.9, Lemmas 7.2–7.7).
Application #claim-geometric-contraction-of-wirtinger-flow
Whenever $f$ satisfies $RC(\alpha,\beta,\frac{1}{8})$ on $E(\boldsymbol{x})$ and $\boldsymbol{z}_0 \in E(\boldsymbol{x})$, Lemma 7.1 and Theorem 3.3 prove that Wirtinger Flow iterates $\boldsymbol{z}_{\tau+1} = \boldsymbol{z}_\tau - \frac{\mu}{\|\boldsymbol{x}\|^2}\nabla f(\boldsymbol{z}_\tau)$ with step size $0 < \mu \le \frac{2}{\beta}$ contract geometrically at every step: $\mathrm{dist}^2(\boldsymbol{z}_{\tau+1}, \boldsymbol{x}) \le (1 - \frac{2\mu}{\alpha})\mathrm{dist}^2(\boldsymbol{z}_\tau, \boldsymbol{x})$ (Section 3, Theorem 3.3, Section 7.2, Lemma 7.1).

⚠️ Curated Limitations & Negative Results

Artificial Intelligence Ontology (AIO) Grounding

Mapped AIO Classes
AIO Target Class Mapping Relation Mapping Rationale
AIO:PrincipalComponentAnalysis
Principal Component Analysis
related_match Stage 1 initializes by computing the principal eigenvector of the intensity-weighted sample covariance matrix.
AIO:DimensionalityReduction
Dimensionality Reduction
related_match Recovers the rank-1 latent signal vector from high-dimensional quadratic intensity projections via Wirtinger gradient descent.

Evidence Sources & Primary Literature

3 Sources
Source ID Publication / Document Type / Access Reference & Checksum
cls2015-wf-pdf
Emmanuel J. Candes, Xiaodong Li, Mahdi Soltanolkotabi
primary paper
full_text
ID: https://doi.org/10.1109/TIT.2015.2399924
sha256:868bf209f6a6…
cls2015-wf-abs
Emmanuel J. Candes, Xiaodong Li, Mahdi Soltanolkotabi
primary paper
abstract_only
ID: https://arxiv.org/abs/1407.1065
sha256:f1211abc8997…
cls2015-wf-cr
Emmanuel J. Candes, Xiaodong Li, Mahdi Soltanolkotabi
primary paper
abstract_only
ID: https://doi.org/10.1109/TIT.2015.2399924
sha256:3d1e8487ad55…

Ontology & Grounding Topology

Open in interactive network graph →
CONCEPT KIND Algorithms AIMech:WirtingerFlowPhaseRetrievalAndSpectralInitialization Wirtinger Flow Phase... 3 claims · 3 sources AIO GROUNDING AIO:PrincipalComponentAnalysis (2)

Curation Provenance

Curator: Antigravity
Method: ai_assisted
Model: Gemini
Created: 2026-10-19T05:32:00Z
Updated: 2026-10-19T05:32:00Z
Source File: data/curated/WirtingerFlowPhaseRetrievalAndSpectralInitialization.yaml · Schema: curated_concept.yaml

Explore across X-Mech

Related computational & biological Mechs: Embedding Map Network Graph ProteinTraitsMech (ESM-2 pLM) DUFMech (Domain pLM) TraitMech CultureMech All 14 X-Mech Repositories