Projected Non-Gaussian Confidence Loss
Implementation & benchmark of arXiv:2607.10095 — Analytical Confidence Boundaries for Non-Gaussian Uncertainty in Perturbed Spacecraft Dynamics
Source paper: Analytical Confidence Boundaries for Non-Gaussian Uncertainty in Perturbed Spacecraft Dynamics arXiv:2607.10095 ⓘ · analyzed Aug 30, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Represent input or parameter uncertainty locally by a low-order polynomial expansion of the network output, and compute only task-relevant directional third- and fourth-order moments. Add a penalty that calibrates or controls projected skewness and kurtosis, allowing the model to represent bent or elongated confidence regions without constructing a full dense moment tensor.
Formulas
Mathematical statement
Let z be a zero-mean perturbation in R^d with covariance Sigma, and let the network output perturbation be approximated by y minus y_bar approximately equal to J z plus one half H[z,z], where J is the Jacobian and H is the Hessian tensor. For orthonormal output-space directions u, v, and w, define the projected third moments E_uuu = E[(u^T y)^3], E_uuv = E[(u^T y)^2(v^T y)], and E_uuw = E[(u^T y)^2(w^T y)], together with the projected fourth moment E_uuuu = E[(u^T y)^4]. These are contractions of third- and fourth-order central moment tensors, but can be estimated directly by directional perturbations or automatic-differentiation Hessian-vector products. Standardize them as gamma_u = E_uuu divided by sigma_u cubed and kappa_u = E_uuuu divided by sigma_u to the fourth power minus 3, where sigma_u squared equals u^T Cov(y) u. Penalize disagreement between predicted and empirical projected moments, or penalize excessive tail deformation using a robust moment loss. The directional projections do the computational work: only a small number of contractions are retained instead of all O(m^4) output moment entries.
Implementation notes
Use a probabilistic MLP or deterministic predictor with input perturbations z sampled from a zero-mean Gaussian distribution with covariance Sigma_x. At each training batch, choose R equal to 4 through 16 unit directions in output space, including the residual direction and random orthogonal directions. Draw K perturbed inputs x plus z_k, evaluate y_k = f_theta(x + z_k), and center the outputs using their batch mean. For each direction u_r, compute q_kr = u_r transposed times (y_k minus y_bar), then calculate m2_r = K^{-1} sum q_kr squared, m3_r = K^{-1} sum q_kr cubed, and m4_r = K^{-1} sum q_kr to the fourth power. Set gamma_r = m3_r divided by (m2_r plus epsilon) to the three-halves power, and kappa_r = m4_r divided by (m2_r plus epsilon) squared minus 3. Add alpha times the projected moment loss to the supervised loss. A cheaper analytic variant computes directional Jacobian-vector products and Hessian-vector products, then uses Gaussian moment identities instead of K forward passes. The paper supplies the directional contraction strategy; empirical training supplies target moments, direction selection, alpha, and epsilon. First test on a two-layer MLP for UCI California Housing, comparing MSE, Gaussian mean-variance NLL, and this loss at equal forward-pass budgets. Evaluate with 4096 Monte Carlo samples. The prediction is that sampling error in gamma and kappa decreases as K^{-1/2}; the Taylor estimator should be accurate while the perturbation scale s satisfies s times the Hessian norm divided by the Jacobian norm less than approximately 0.2, followed by a sharp degradation beyond that regime. Non-Gaussian calibration should improve most on inputs where E_uuv is measurably nonzero.
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.