Skip to content

Subsampling and m-out-of-n bootstrap

Compare smaller subsets without replacement with m-out-of-n bootstrap samples, and see why centering, convergence rates and dependence determine valid uncertainty estimates.

Subsampling estimates a statistic's sampling uncertainty from smaller subsets drawn without replacement. The m-out-of-n bootstrap instead draws mm observations with replacement from the original nn observations. Both recompute the statistic on smaller samples and use an appropriate scale adjustment. They can support inference for some nonregular estimators where the ordinary bootstrap fails—an issue for a quant whose error bars depend on an extreme or a constrained estimate. Smaller samples alone do not establish validity.

The sampling rule changes the experiment

For independent, identically distributed observations, the basic distinction is:

MethodSize of each replicateReplacement within a replicate
Ordinary nonparametric bootstrapnnYes
Subsamplingm<nm<nNo
m-out-of-n bootstrapm<nm<nYes
Subsampling can enumerate all subsets of size mm, or approximate that collection with uniformly selected subsets. Different subsets may overlap: “without replacement” applies within a subset. The m-out-of-n bootstrap draws independently from the empirical distribution, so repeated original rows are possible. The replicate count controls numerical approximation; mm controls the statistical procedure. Bickel, Götze and van Zwet, §3.

Match the root before comparing errors

Suppose θ^n\hat\theta_n estimates θ\theta, and a known positive rate rnr_n gives a nondegenerate limiting sampling distribution:
rn(θ^n−θ)→dL.r_n(\hat\theta_n-\theta)\xrightarrow{d}L.

A common construction recomputes the estimator as θ^m∗(b)\hat\theta_m^{*(b)} on replicate bb and collects

Rm∗(b)=rm(θ^m∗(b)−θ^n).R_m^{*(b)}=r_m(\hat\theta_m^{*(b)}-\hat\theta_n).
This centres at the full-sample estimate, which replaces the unknown parameter. Its justification requires that this substitution be negligible on the smaller-sample scale; a typical condition is rm/rn→0r_m/r_n\to0, together with an appropriate limit theorem. Studentized roots require their own denominator and justification. rm=mr_m=\sqrt m applies to the root-nn example below; it is not a universal resampling rate. Romano and Shaikh, §2.1.
Consider a hypothetical scaling example: n=100n=100, full-sample estimate θ^n=2\hat\theta_n=2, and one replicate of size m=10m=10 giving θ^m∗=2.3\hat\theta_m^*=2.3. Assume the relevant rate is rk=kr_k=\sqrt k. Then
Rm∗=10(2.3−2)≈0.948683.R_m^*=\sqrt{10}(2.3-2)\approx0.948683.

The corresponding offset on the full-sample estimator's scale is

Rm∗100=10100(0.3)≈0.094868.\frac{R_m^*}{\sqrt{100}} =\sqrt{\frac{10}{100}}(0.3) \approx0.094868.
The raw difference 0.30.3 describes the smaller sample. Treating it directly as a full-sample error misses the scale conversion. These numbers describe one hypothetical replicate, not an estimated quantile, standard error or confidence interval. The chosen m=10m=10 is an arithmetic illustration, not a recommended sample size.
One hypothetical replicate has n equal to 100, m equal to 10, full estimate 2 and replicate estimate 2.3. Its raw difference is 0.3. Multiplying by square root of 10 gives root 0.948683; dividing that root by square root of 100 gives full-sample-scale offset 0.094868.
One hypothetical replicate has n equal to 100, m equal to 10, full estimate 2 and replicate estimate 2.3. Its raw difference is 0.3. Multiplying by square root of 10 gives root 0.948683; dividing that root by square root of 100 gives full-sample-scale offset 0.094868.
Normalise at the replicate size, then translate to the full-sample scale. No distribution or interval is estimated from this single replicate.
If a valid collection of roots supplies quantiles qα/2q_{\alpha/2} and q1−α/2q_{1-\alpha/2}, inversion gives the approximate root-based confidence interval
[θ^n−q1−α/2rn,  θ^n−qα/2rn].\left[ \hat\theta_n-\frac{q_{1-\alpha/2}}{r_n},\; \hat\theta_n-\frac{q_{\alpha/2}}{r_n} \right].
The upper root quantile enters the lower endpoint. This follows by solving qα/2≤rn(θ^n−θ)≤q1−α/2q_{\alpha/2}\le r_n(\hat\theta_n-\theta)\le q_{1-\alpha/2} for θ\theta. Appropriate quantile continuity and distributional approximation conditions are needed; raw percentiles of the smaller-sample estimates do not perform this inversion.

Where the justification can break

A common asymptotic regime is m→∞m\to\infty with m/n→0m/n\to0. It lets smaller-sample statistics approach their limiting law while reducing the effect of estimating the original distribution. It is not a universal guarantee for either method: the statistic, centering, rate, limiting law and data assumptions still matter. With-replacement resampling can introduce ties that require additional conditions. When the ordinary bootstrap already works, smaller resamples may sacrifice accuracy. Bickel, Götze and van Zwet, §§1–3.
Nor does “nonsmooth” automatically mean bootstrap failure. The same paper contrasts a median under positive-density conditions with nonregular failures. Even pointwise asymptotic validity need not give reliable coverage uniformly over nearby data-generating laws; Romano and Shaikh make that distinction explicit.
For serially dependent returns, arbitrary row subsets destroy temporal structure. A time-series subsampling method may instead compute the statistic on contiguous blocks of length mm, with scaling and dependence conditions justified for that statistic. This differs from a block bootstrap that assembles a longer replicate from multiple resampled blocks. Lahiri, §2.8.
Simulation and Resampling develops the ordinary bootstrap workflow and separates simulation error from sampling uncertainty. Its public page is a preview; the full lesson requires membership.

Sources

Last updated
  • subsampling
  • bootstrap
  • statistical inference
  • asymptotics
  • resampling
← Back to the glossaryBack to top ↑