# Observability-Gated Spectral Phase Initialization

- ID: 494
- Canonical URL: https://synthcore.org/idea/494/observability-gated-spectral-phase-initialization
- API JSON: https://synthcore.org/api/idea/494.json
- API Markdown: https://synthcore.org/api/idea/494.md
- Verification status: beats_baseline
- Source: [arXiv:2607.06762](https://arxiv.org/abs/2607.06762)
- Category: architecture
- Solves: stability, accuracy, sample-efficiency
- ML areas: graph-nn, initialization, embedding
- Math tags: spectral-theory, linear-algebra, optimization, geometry
- Ratings: usefulness 6/10; difficulty 5/10; novelty 7/10

## Idea description

Add a preprocessing or differentiable synchronization layer that estimates one unit-modulus complex phase per graph node or data view from noisy pairwise relative-phase observations. Initialize the phases with a leading-eigenvector method, fix the global phase gauge, and allow nonlinear refinement only when the estimated perturbation is small relative to the observable Jacobian margin. This replaces random initialization for rotation-alignment modules and should reduce bad local minima caused by inconsistent gauges.

## Mathematical statement

The paper normalizes perturbation by the observability margin using eta = (K_s times the observed infinity-norm measurement error plus K_u times the voltage-magnitude infinity-norm error) divided by rho, where epsilon_s and epsilon_u are measurement and magnitude errors, K_s and K_u are model-dependent constants, and rho is the smallest nonzero Jacobian singular value after removing the global-phase nullspace. Its weighted Jacobian is H = [Re(J_theta), Re(J_u); Im(J_theta), Im(J_u); 0, sqrt(beta) I], and the gauge direction satisfies H times [1_n; 0] = 0. The constrained margin is the minimum Jacobian norm over unit perturbations whose phase component sums to zero. The paper proves spectral and WLS recovery error of order eta below a fixed threshold. In the neural adaptation, theta_i is the phase attached to node or view i, rho is estimated from a centered Jacobian, and the leading eigenvector of a pairwise connection matrix supplies the spectral initializer.

## Key formulas

- $$\eta\coloneqq\frac{K_s\|\epsilon_s\|_{\infty,\mathrm{obs}}+K_u\|\epsilon_u\|_{\infty}}{\rho}.$$
- $$H=\begin{bmatrix}\operatorname{Re}\{J_{\theta}\}&\operatorname{Re}\{J_u\}\\\operatorname{Im}\{J_{\theta}\}&\operatorname{Im}\{J_u\}\\0&\sqrt{\beta}\,I\end{bmatrix},\qquad H\begin{bmatrix}\mathbf{1}_n\\0\end{bmatrix}=0.$$
- $$\sigma_{2n-1}(H)=\min_{\substack{(\dot{\theta},\dot{u})\in\mathbb{R}^{2n}\\\mathbf{1}^{T}\dot{\theta}=0,\ \|(\dot{\theta},\dot{u})\|=1}}\sqrt{\|J_{\theta}\dot{\theta}+J_u\dot{u}\|^2+\beta\|\dot{u}\|^2}.$$
- $$C_{ij}=w_{ij}e^{\mathrm{i}\phi_{ij}},\quad v=\operatorname{eigmax}(C),\quad \widehat{z}_i=\frac{v_i}{|v_i|+10^{-8}},\quad \widehat{\theta}_i=\arg(\widehat{z}_i)-\arg(\widehat{z}_r).$$

## Implementation notes

Integrate this as a graph-embedding alignment layer before a GNN or contrastive loss. Each node or view i has a scalar phase z_i = exp(i theta_i); an edge provides a noisy relative phase phi_ij approximately equal to theta_i minus theta_j and a confidence weight w_ij. Construct the Hermitian connection matrix C by setting C_ij = w_ij exp(i phi_ij), C_ji = conjugate(C_ij), and C_ii = 0. Compute its largest eigenvector with 5 to 20 power iterations or Lanczos, normalize each entry as z_hat_i = v_i divided by abs(v_i) plus 10^-8, and fix the gauge by subtracting the phase of a reference node r. Rotate each node embedding with the two-dimensional representation R(theta) = [[cos(theta), -sin(theta)], [sin(theta), cos(theta)]]. For confidence gating, estimate the centered Jacobian of the downstream observation map by automatic differentiation. Form P = I - 11^T/n, estimate the smallest singular value of J_theta P with randomized SVD, and use it as rho_hat. Estimate noise from the robust median absolute deviation of edge residuals r_ij = wrap(theta_hat_i - theta_hat_j - phi_ij), then set eta_hat = K times median(abs(r_ij)) divided by rho_hat. Below a threshold, use the spectral phases directly; above it, initialize a refinement network from them with a reduced learning rate. The paper contributes the gauge removal, singular-value margin, normalized-noise criterion, and first-order error prediction; K, the threshold, and embedding dimension are empirical. Start with a 20-node stochastic block model, random ground-truth rotations, Gaussian edge noise, and a two-layer GCN. Compare random initialization, direct gradient optimization, and spectral initialization at equal optimization steps. Measure gauge-aligned phase RMSE, node-classification accuracy, successful-basin frequency, and loss versus wall-clock time. Success means lower variance and faster loss descent, particularly for sparse or noisy graphs, with no accuracy loss in the low-noise regime.

## Verification

- Status: beats_baseline
- Mechanism evidence: yes
- Mechanism confirmed: yes
- Practical verdict: helps
- Verdict: Built a NumPy MVP for Hermitian connection-matrix spectral phase initialization, reference-node gauge fixing, centered-Jacobian observability margin, MAD-based eta estimation, and gated refinement. The math check reproduced an exact gauge nullspace (||J1||=0) and matched the constrained margin to the smallest nonzero singular value (rho=1.608038). Across 40 fixed-seed trials per noise level, spectral initialization had lower phase RMSE than random in 100%, 100%, 100%, and 87.5% of trials for noise 0.15, 0.35, 0.70, and 1.10 respectively; the effect weakened at high noise but remained positive. The promised initialization benefit is observed, while the full GNN adaptation claim was not tested.

### Mechanism check

- Verdict: Built a NumPy MVP for Hermitian connection-matrix spectral phase initialization, reference-node gauge fixing, centered-Jacobian observability margin, MAD-based eta estimation, and gated refinement. The math check reproduced an exact gauge nullspace (||J1||=0) and matched the constrained margin to the smallest nonzero singular value (rho=1.608038). Across 40 fixed-seed trials per noise level, spectral initialization had lower phase RMSE than random in 100%, 100%, 100%, and 87.5% of trials for noise 0.15, 0.35, 0.70, and 1.10 respectively; the effect weakened at high noise but remained positive. The promised initialization benefit is observed, while the full GNN adaptation claim was not tested.
- Confidence: 8/10
- Limitations: This is a small NumPy graph synchronization experiment rather than the planned two-layer GCN or differentiable PyTorch layer. The Jacobian is the exact pairwise-difference Jacobian, weights are uniform, eta uses K=1, and no wall-clock/FLOP, classification-accuracy, CUDA, or learned downstream observation-map evaluation was performed.

### Practical benchmark

- Paired seeds: 8
- Baseline mean: 0
- Idea mean: 0
- p-value: 0.0081
- Paired wins: 8/8
- Benchmark verdict: idea better (significant)

## Artifacts

- [bench_phase.py](https://synthcore.org/code/1358/bench_phase.py)
- [bench_report.json](https://synthcore.org/code/1358/bench_report.json)
- [phase_track.py](https://synthcore.org/code/1358/phase_track.py)
- [report.md](https://synthcore.org/code/1358/report.md)
- [report_bench_2026-09-04T170838.md](https://synthcore.org/code/1358/report_bench_2026-09-04T170838.md)
- [results.json](https://synthcore.org/code/1358/results.json)
- [spectral_phase_experiment.py](https://synthcore.org/code/1358/spectral_phase_experiment.py)
- [Download all files as ZIP](https://synthcore.org/download/1358)

## Disclaimer

AI-generated research hypothesis, automatically tested. Not peer-reviewed.