V-Fold Jackknife Neural Uncertainty
Implementation & benchmark of arXiv:2607.22493 — The V-fold jackknife for semiparametric inference: variance estimation, confidence intervals, and simultaneous confidence bands
Source paper: The V-fold jackknife for semiparametric inference: variance estimation, confidence intervals, and simultaneous confidence bands arXiv:2607.22493 ⓘ · analyzed Aug 30, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Wrap a neural estimator with V leave-fold-out refits and use the dispersion of fold pseudo-values to produce uncertainty intervals without deriving an influence function or relying on unstable parameter-space Hessians. The same construction can be applied to scalar metrics, predictions at fixed inputs, dose-response curves, or vectors of logits and probabilities.
Formulas
Mathematical statement
The paper assumes an asymptotically linear estimator $\hat{\Psi}(P_n)$ satisfying $\hat{\Psi}(P_n)-\Psi(P_0)=P_n\varphi+R(P_n,P_0)$, where $P_n$ is the empirical distribution of $n$ observations, $\Psi(P_0)$ is the target, $\varphi$ is a mean-zero influence function, and $R=o_p(n^{-1/2})$. Partition the data into V equal folds $I_1,\ldots,I_V$, let $\hat\Psi$ be the full-data neural estimate and $\hat\Psi_{-v}$ the estimate trained without fold $I_v$. Define the delete-fold pseudo-value $J_v=V\hat\Psi-(V-1)\hat\Psi_{-v}$. For equal-sized folds, the jackknife variance estimator is $\hat{\sigma}^2_J=[V(V-1)]^{-1}\sum_{v=1}^V(J_v-\bar J)^2$, where $\bar J=V^{-1}\sum_vJ_v$. The paper's fixed-V result gives the Studentized limit $T=(\hat\Psi-\Psi(P_0))/\hat\sigma_J\Rightarrow t_{V-1}$, so use a t critical value rather than a normal critical value. For a vector prediction $\Psi=(\Psi_1,\ldots,\Psi_K)$, standardize each component and calibrate a simultaneous band using the distribution of $\max_k|T_k|$.
Implementation notes
Integrate this at the estimator-output level, not inside the optimizer. Choose a prediction functional: for regression use $\Psi(x)=f_\theta(x)$; for classification use one probability or logit; for a scalar evaluation metric use the validation metric computed on a fixed evaluation set. Split the training data into V disjoint folds, with V=5 as the first experiment. Train one full model to obtain $\hat\Psi$ and V models on data excluding fold v to obtain $\hat\Psi_{-v}$. For every evaluation point x, execute: J[v] = V*full_pred[x] - (V-1)*loo_pred[v,x]; Jbar = mean(J, axis=0); var[x] = sum((J[:,x]-Jbar[x])**2)/(V*(V-1)); se[x] = sqrt(var[x]+1e-8); interval[x] = full_pred[x] +/- t_quantile(V-1, 1-alpha/2)*se[x]. For vector outputs, estimate the correlation matrix from centered pseudo-values and either sample a multivariate t distribution with degrees of freedom V-1 or use a bootstrap over the V pseudo-value vectors to estimate the critical value for max_k abs(T[k]). The mathematical quantities are the pseudo-value transformation, variance factor, and t calibration; neural predictions and fold-to-fold covariance are estimated empirically. First test on a small MLP regressor on a UCI dataset, comparing ordinary dropout intervals and a deep ensemble at equal total refit count. Measure empirical 90% coverage, interval width, calibration error, and coverage under distribution shift. Success means coverage closer to nominal without requiring a large ensemble, particularly where dropout or Hessian-based standard errors are anti-conservative.
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.