Curvature-Calibrated Reparameterization Consistency
Implementation & benchmark of arXiv:2609.03042 — Equivariance, Curvature and Symmetry in Functional Covariance Estimation
Source paper: Equivariance, Curvature and Symmetry in Functional Covariance Estimation arXiv:2609.03042 ⓘ · analyzed Sep 4, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Add a consistency loss for a neural model processing irregularly sampled functions or sequences, comparing its latent covariance representation before and after a time-coordinate warp. The target discrepancy should be near zero for affine transformations but should grow with the normalized curvature, bandwidth, and local sparsity of a nonlinear warp.
Formulas
Mathematical statement
The paper defines an increasing \(C^{2,1}\) diffeomorphism \(\psi:[0,1]\to[0,1]\), normalized curvature \(\kappa_\psi=\|\psi''/\psi'\|_\infty\), and a unitary push-forward \(U_\psi\) on \(L^2\), \((U_\psi f)(s)=f(\psi^{-1}(s))\sqrt{(\psi^{-1})'(s)}\). For a population covariance operator \(\mathcal C\), coordinate change is exactly \(\mathcal C^{(\psi)}=U_\psi\mathcal C U_\psi^*\). For a local-linear covariance estimator with covariance bandwidth \(h\), mean bandwidth \(h_0\), and effective local sample sizes \(n_{\mathrm{loc}}\) and \(n_{\mathrm{loc},1}\), the Hilbert-Schmidt equivariance defect is \(O_P(\kappa_\psi S)\), where \(S=h^2+h n_{\mathrm{loc}}^{-1/2}+h_0^2+h_0 n_{\mathrm{loc},1}^{-1/2}\). Exact commutation for every finite design holds if and only if \(\psi\) is affine, so \(\kappa_\psi=0\) is the exact-equivariance boundary. In the neural loss, use \(\delta_\psi=\delta_0+C\kappa_\psi S\), where \(C\) is calibrated empirically and \(\delta_0\) accounts for discretization and numerical error.
Implementation notes
Integrate the method into an irregular-time transformer, GRU, or continuous-time encoder with a latent covariance head. For observations \((t_{ij},y_{ij})\), compute latent vectors \(z_{ij}=f_\theta(t_{ij},y_{ij})\), estimate their local mean with bandwidth \(h_0\), and form a grid-based local covariance \(\widehat{\mathcal C}_\theta\) using kernel-weighted off-diagonal products. Create a warped copy with \(s_{ij}=\psi(t_{ij})\), run the same network and covariance head, and call the result \(\widehat{\mathcal C}^{(\psi)}_\theta\). Numerically apply \(U_\psi\) to the unwarped covariance by resampling at \(\psi^{-1}(s)\) and multiplying by \(\sqrt{(\psi^{-1})'(s)}\). Estimate curvature on a discrete time grid using \(\kappa_\psi\approx\max_k |\Delta^2\psi_k/\Delta t^2|/(|\Delta\psi_k/\Delta t|+\epsilon)\). Estimate \(n_{\mathrm{loc}}\) and \(n_{\mathrm{loc},1}\) from counts of observations receiving non-negligible kernel weight, then compute \(S=h^2+h/\sqrt{n_{\mathrm{loc}}}+h_0^2+h_0/\sqrt{n_{\mathrm{loc},1}}\). Add \(\lambda\mathcal L_{\mathrm{curv}}\) to the task loss, with \(C\) and \(\delta_0\) calibrated on held-out affine and nonlinear warp pairs. Pseudocode: sample \(\psi\); compute \(C=\mathrm{CovHead}(f_\theta(t,y))\) and \(C_\psi=\mathrm{CovHead}(f_\theta(\psi(t),y))\); compute \(C_{\mathrm{target}}=U_\psi C U_\psi^*\); compute \(\kappa_\psi,S,\delta_\psi\); backpropagate task loss plus \(\lambda[\max(0,\|C_\psi-C_{\mathrm{target}}\|_{\mathrm{HS}}-\delta_\psi)]^2\). The theorem supplies the dependence on curvature and smoothing; the constant is estimated empirically. First test on a small 2-layer irregular-time transformer using synthetic Gaussian processes and PhysioNet, comparing no consistency loss, ordinary zero-target consistency, and this calibrated loss under affine, quadratic, and sinusoidal warps. Success means lower warped-test error and covariance/eigenspace discrepancy at equal clean-data accuracy, without the degradation caused by demanding exact invariance for high-curvature warps.
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.