Exact Computation of Non-Gaussian Mismatch Penalties in Wiener-Hermite Cross-Correlation Identification
Abstract
Wiener-Hermite cross-correlation identification represents a polynomial response in the Hermite basis. Under Gaussian excitation the basis is orthogonal and a diagonal rule recovers it exactly; under non-Gaussian excitation the same basis is kept, but its Gram matrix gains off-diagonal terms and the diagonal rule is no longer the population projection. We give the exact finite-order excess risk of this mismatch: a moment quadratic form from two Hankel-Cholesky factorizations and one diagonal solve, at cost from moments to order . Closed cumulant forms at orders three and four expose which non-Gaussian features drive it; symmetry protects the Gaussian basis only through order two. A bootstrap decides, from data, whether a matched basis is worth building; on a Wiener-Hammerstein benchmark it separates a near-Gaussian channel (penalty ) from a skewed output (penalty ). The computation is a weighted- projection whose core normal-system correspondence is machine-checked in Lean 4.
Keywords
Cite
@article{arxiv.2607.14699,
title = {Exact Computation of Non-Gaussian Mismatch Penalties in Wiener-Hermite Cross-Correlation Identification},
author = {Serhii Zabolotnii},
journal= {arXiv preprint arXiv:2607.14699},
year = {2026}
}
Comments
23 pages, 2 figures. Includes a Lean 4/Mathlib machine-checked core. Reproducibility code (MIT): https://github.com/SZabolotnii/Ku-Projection-Framework-code-supplement