Finite empirical-variance exponential moments #
This module proves a finite, source-normalized lower-tail MGF inequality for the Bessel-corrected empirical variance of a bounded loss. The proof uses a sharp single-pair chord bound, exact factorization over disjoint random-matching blocks, and finite Jensen over all coordinate permutations.
For every sample size n ≥ 2, the final theorem matches the coefficient in
Tolstikhin and Seldin (2013), equation (9):
E exp(eta * n * (V - Vhat)) ≤ exp(eta^2 * n^2 * V / (2 * (n - 1))).
The intermediate matching theorem is sharper when n is even. These are
fixed-hypothesis finite-product moment bounds; no PAC-Bayes change of measure or
posterior-uniform confidence statement is claimed here.
Sharp single-pair lower-tail MGF. The kernel range is [0,1/2], which
improves the quadratic coefficient from 1/2 to 1/4.
Sharp lower-tail MGF for the mean of m independent pair kernels.
Natural centered-MGF form of the independent-pair result.
Unused iid coordinates integrate out exactly. This is the odd-sample
bridge: instantiate r = 1.
The sharp pair-block MGF transported back to an ordinary Fin-indexed
iid sample, allowing r unused coordinates.
Finite Jensen bounds the exponential centered at the sample variance by the uniform average over permuted canonical matchings.
Every permuted canonical matching has the same product-law MGF bound as the canonical matching.
Full sample-variance lower-tail MGF obtained by random matching and finite Jensen.
n-scaled form. With m = floor(n/2) this is the
Tolstikhin--Seldin coefficient n²/(4m).
Source-normalized finite version of Tolstikhin--Seldin (2013), Eq. (9). The Bessel empirical variance is averaged under the explicit finite iid product law.
Normalized form of the source-facing empirical-variance MGF.
The deterministic variance penalty is moved inside the exponential, so the finite-product expectation is at most one. This is the form consumed by the finite PAC-Bayes change-of-measure layer.