Unverified 2026

Post-Commitment Leakage Probe

Implementation & benchmark of arXiv:2608.12072 — Testing the limits of past-adapted explanations by post-endpoint randomisation: anticipatory EEG as a worked case

Usefulness6/10
Difficulty4/10
Novelty7/10

Source paper: Testing the limits of past-adapted explanations by post-endpoint randomisation: anticipatory EEG as a worked case arXiv:2608.12072 ⓘ · analyzed Sep 1, 2026

AI-generated research hypothesis, automatically tested. Not peer-reviewed.

Idea description

Evaluate a temporal neural predictor by freezing its prediction before a later exogenous randomisation, then test whether the endpoint residual is systematically ordered by that randomised variable. Under a valid past-only information set, the randomised variable must be conditionally irrelevant to the already committed prediction error; significant ordering indicates leakage, selection bias, or an invalid sufficiency claim.

Formulas

$$m_{0}(\mathbf{X}_{j})=\mathbb{E}\!\left[A_{\mathrm{pre}}^{(j)}\mid\mathbf{X}_{j}\right].$$
$$\mathrm{(R3^{\star})}\qquad S^{(j)}\ \perp\!\!\!\perp\ \tau_{L}^{(j)}\ \big|\ \bigl(\mathcal{Z}_{j},\mathcal{R}_{j},\mathcal{G}_{\mathrm{frz}}\bigr).$$
$$e_j=A_j-f_{\theta^{(-k(j))}}(\mathbf{X}_j),\qquad T=\sum_{j:S_j=1}(\tau_{L,j}-\bar{\tau}_L)(e_j-\bar e).$$
$$p_{\mathrm{perm}}=\frac{1+\sum_{b=1}^{B}\mathbf{1}\!\left\{|T^{(b)}|\ge |T^{\mathrm{obs}}|\right\}}{B+1},\qquad T^{(b)}=\sum_{j:S_j=1}(\tau^{(b)}_{L,j}-\bar\tau_L)(e_j-\bar e).$$

Mathematical statement

The paper defines the past-only squared-error target as $m_{0}(\mathbf{X}_{j})=\mathbb{E}[A_{\mathrm{pre}}^{(j)}\mid\mathbf{X}_{j}]$, where $\mathbf{X}_{j}$ is the locked covariate vector available before commitment and $A_{\mathrm{pre}}^{(j)}$ is the endpoint. Its retained-sample exclusion condition is $(\mathrm{R3^{\star}})\ S^{(j)}\perp\!\!\!\perp\tau_{L}^{(j)}\mid(\mathcal{Z}_{j},\mathcal{R}_{j},\mathcal{G}_{\mathrm{frz}})$, where $S^{(j)}$ is retention, $\tau_{L}^{(j)}$ is the post-commitment assigned delay, $\mathcal{Z}_{j}$ contains endpoint and covariate information, $\mathcal{R}_{j}$ is the randomisation stratum, and $\mathcal{G}_{\mathrm{frz}}$ is the frozen preprocessing, nuisance-fitting, fold, and tuning object. The transferred null is conditional mean independence of the committed residual $e_j=A_j-f_{\theta}(\mathbf{X}_j)$ and the later randomisation: $\mathbb{E}[e_j\mid\tau_{L,j},\mathcal{Z}_j,\mathcal{R}_j,\mathcal{G}_{\mathrm{frz}},S_j=1]=\mathbb{E}[e_j\mid\mathcal{Z}_j,\mathcal{R}_j,\mathcal{G}_{\mathrm{frz}},S_j=1]$. Estimate ordering with the centered randomisation score $T=\sum_{j:S_j=1}(\tau_{L,j}-\bar\tau_L)(e_j-\bar e)$ and calibrate it by permuting $\tau_L$ within randomisation strata.

Implementation notes

(1) Integration point: use this as an evaluation wrapper around a temporal model, not as a gradient update. For each example or interaction, define a hard commitment time. Record the model input tensor and prediction immediately before commitment, then request a later exogenous delay, scheduling offset, sensor latency, or randomized presentation interval. The endpoint target must be fixed by the commitment event; no post-commitment tensor, timestamp, mask, batch statistic, or label-derived preprocessing may enter the prediction. Freeze the model, tokenizer, normalization statistics, fold assignments, and retention rule before reading the randomized delays. (2) Pseudocode: split data into randomization strata; fit the model on training folds only; for each held-out item j compute pred[j] = model_frozen(X_pre[j]), residual e[j] = A[j] - pred[j], and retain item j using a predeclared rule. Compute T_obs = sum((tau[j]-mean_tau)*(e[j]-mean_e)). For b in 1..B, permute tau independently within each stratum and recompute T; return the two-sided permutation p-value from the displayed formula. A signed one-sided test can target the direction predicted by the alternative. (3) Mathematics versus estimation: the conditional-independence null and retained-sample requirement come from the paper; residuals, stratum means, and permutation quantiles are empirical. Check positivity by requiring every retained stratum to contain at least two delay values and report strata with poor support. (4) First experiment: construct a synthetic sequence benchmark in which the target is generated from tokens before time t, while a random delay is assigned after t. Compare a leakage-free Transformer with versions receiving a future token, absolute final-sequence length, or batch-normalization statistics contaminated by future examples. Use 10k sequences, a small 2-layer Transformer, and 1,000 within-stratum permutations. The expected signal is a calibrated null p-value for the clean model and a reproducibly small p-value plus nonzero signed T for each leakage variant, while ordinary validation loss may remain almost unchanged.

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.