Fourier-support-aware Weyl normalization
Implementation & benchmark of arXiv:2607.13697 — Quantitative Fourier Restriction Estimates for Weyl Operators: Fourier-Support Dependence and Lower Bounds
Source paper: Quantitative Fourier Restriction Estimates for Weyl Operators: Fourier-Support Dependence and Lower Bounds arXiv:2607.13697 ⓘ · analyzed Aug 30, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
For a learned phase-space layer, estimate its symplectic Fourier bandwidth R and divide its output gain by the theorem's support-dependent factor R raised to an exponent determined by the Schatten index p. This creates a resolution-aware normalization: layers with larger phase-space bandwidth are automatically damped when p is not equal to 2, while the Hilbert-Schmidt case p = 2 remains unscaled.
Formulas
Mathematical statement
Let u belong to E'(R^(2d)) and satisfy supp(u) contained in the closed ball of radius R centered at z_0, with R >= 1. Let a = F_sigma u, where F_sigma is the symplectic Fourier transform associated with sigma(w,z) = eta dot x - y dot xi for z = (x, xi) and w = (y, eta). The paper proves the upper comparison ||L_{F_sigma u}||_{S_p} less than or equal to a constant times R^alpha ||F_sigma u||_{L^p}, and proves a reverse comparison with the same support exponent, where alpha = (2d + 1 + epsilon)|1 - 2/p|. The exponent vanishes at p = 2, matching the exact Hilbert-Schmidt identity, and grows as p moves away from 2. Adapt this as a gain-control rule for a neural Weyl layer: L_tilde_a = R_eff^(-alpha) L_a, where R_eff is an estimated effective support radius of the learned symplectic Fourier transform.
Implementation notes
Use this in a phase-space convolution, neural operator, or learned Weyl layer whose parameters define a symbol a. The integration point is immediately before applying the layer to activations: compute a discrete symplectic Fourier transform of the symbol parameters, estimate their frequency radius, multiply the layer output by the normalization factor, and then apply any residual connection. On a discrete two-dimensional phase-space grid, let u_j denote sampled symbol coefficients and z_j their phase-space frequency coordinates. Compute weights w_j = |F_sigma u_j|^q, then calculate R_eff = max(1, sqrt(sum_j ||z_j||^2 w_j / (sum_j w_j + delta))). Set alpha = (2d + 1 + epsilon_exp) abs(1 - 2/p) and scale = R_eff^(-alpha). The forward computation is: a = weyl_apply(symbol, x); y = scale times a. Initially stop gradients through R_eff to prevent the normalization estimator from creating unstable feedback. The paper supplies the support-dependent exponent and the special role of p = 2; the effective-radius estimator is an empirical replacement for exact compact support. Compare hard support radius, percentile radius, and the displayed second-moment estimator. First test on CIFAR-10 or a 64 by 64 image-regression task with a learned Fourier or Weyl layer. Compare no normalization and standard weight normalization at several resolutions. Track gradient-norm variance, estimated largest singular value, validation error, and convergence at equal FLOPs. Success means resolution-invariant activation gain and fewer unstable runs without accuracy loss.
Verification
This idea has not been verified yet.
Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.
Artifacts
Artifacts unavailable.