A neural network is trained on simulated datasets drawn from a prior over a distribution family, using single independent draws of the root T_n - T(F) scored by the pinball loss, a proper scoring rule whose population minimizer is the posterior-predictive law of the root.
Abstract
Efron's bootstrap is the default tool for estimating the sampling distribution of a statistic, yet it is provably inconsistent for maxima of bounded-support distributions, means under infinite variance, extreme quantiles, and tail-index estimators. The classical remedies, the m-out-of-n bootstrap and subsampling, require rate corrections that depend on unknown parameters and behave erratically at realistic sample sizes. We propose an amortized alternative: a neural network is trained on simulated datasets drawn from a prior over a distribution family, using single independent draws of the root T_n - T(F) scored by the pinball loss, a proper scoring rule whose population minimizer is the posterior-predictive law of the root. At test time, a single forward pass maps one dataset of n = 200 observations to its full sampling-distribution estimate, from which confidence intervals follow directly. On four canonical bootstrap-failure problems (bounded-support maximum, alpha-stable mean, Pareto tail index, and 99% value-at-risk under tempered stable returns), the method attains nominal 95% coverage, beats every feasible classical method in Wasserstein distance to the true sampling distribution, and captures over 97% of the achievable improvement where the exact Bayes-optimal answer is computable. For the value-at-risk problem no distribution-free method can reach nominal coverage at all; the learned method attains 94.7%. A single universal network with a statistic token matches all four specialists, and on real daily market returns the unchanged model averages 0.87 coverage against 0.73 for the bootstrap, as predicted by our out-of-family analysis.
A simple decomposition of a neural-network-based normalizing flow that naturally uncovers a pivotal statistic in the presence of nuisance parameters, based only on a sample generator from the distribution of interest is presented.
Sign-Corrected Bessel Debiasing (SCBD), a signed pseudo-marginal method based on independent block estimates of the loss, is introduced and its ordinary-MC and independently randomised quasi-Monte Carlo (RQMC) implementations are studied.
Yingkai Lu, J. Lee, Geoff K. Nicholls· 0 citations
It is demonstrated that Student's t yields better predictive performance than a Gaussian likelihood distribution, independent of the data distribution and MLP architecture (depth and width), and can also lead to shorter training times, while still being easy to implement.
Pei-Hsuan Hsia, L. Heyen, Arvid Weyrauch et al.· arXiv.org· 0 citations
This work develops the V-fold jackknife as a computationally efficient and theoretically justified alternative for semiparametric inference and extends the theory to generalized asymptotically linear estimators with diverging influence-function variance and slower-than-\sqrt n convergence.
Yi Li, Ashkan Ertefaie, M. V. van der Laan· 0 citations
A local asymptotic theory is developed for the estimated return CDF over $T^{-1/2}$-neighborhoods of finitely many thresholds, together with its bootstrap analogue that justifies bootstrap inference for smooth statistical functionals, including variance, CVaR, expected shortfall, and expectiles.
An amortized framework is proposed that consistently and substantially outperforms Silverman's rule, the Sheather--Jones selector, and least-squares cross-validation, with especially large gains in small and heterogeneous samples.
Junying Liang, Hailiang Du· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.