advanced41 min studyLesson 720 in Mathematics

Nonparametric confidence bands and honesty

Control smoothing bias and a whole-function coverage event, then distinguish pointwise validity, uniform honesty and adaptation.

On this page

What you’ll understand

  • Define simultaneous coverage and uniform honesty over a function class.
  • Construct a finite-grid band with an explicit between-grid bias bound.
  • Explain why adaptive estimation and cumulative bands do not automatically yield honest density bands.

A narrow curve with uncertainty shading can make several incompatible promises. It might cover the target at one fixed point, cover a smoothed target, cover every point simultaneously, or maintain that simultaneous coverage uniformly across a function class. Honest nonparametric inference requires stating which promise is intended and accounting for smoothing bias as well as sampling fluctuations. A finite-grid construction makes the two components explicit. It also explains why a theorem for a cumulative distribution cannot simply be differentiated into a density guarantee.

Put the quantifiers in the confidence statement

For a specified interval I and function class F\mathcal F, a finite-sample honest band requires the infimum over f in that class of the probability of Ln(x)≤f(x)≤Un(x)L_n(x)\le f(x)\le U_n(x) for every x in I to be at least one minus alpha. Asymptotic honesty places a lower limit over n outside that infimum. In contrast, pointwise asymptotic validity for each fixed f permits the worst function to change with n and does not supply the uniform statement.

Simultaneity over x is another separate quantifier. Intervals that each have 95% coverage at a fixed location need not cover an entire curve with probability 95%. If errors at five locations were independent and each interval covered exactly with probability 0.95, the joint probability would be 0.95 to the fifth power, about 0.774. Dependence changes this calculation but does not turn marginal coverage into an automatic simultaneous guarantee. A continuum of points also needs control between any plotted grid nodes.

lim inf⁡n→∞inf⁡f∈FPr⁡f{Ln(x)≤f(x)≤Un(x) for all x∈I}≥1−α\liminf_{n\to\infty}\inf_{f\in\mathcal F}\Pr_f\{L_n(x)\le f(x)\le U_n(x)\text{ for all }x\in I\}\ge1-\alpha
This is asymptotic uniform honesty with simultaneous coverage in x. Finite-sample honesty replaces the lower limit by the corresponding inequality at each n.↔ Scroll wide equations horizontally.

A stochastic bound does not pay for smoothing bias

Decompose estimation error into the centered random fluctuation f^−Eff^\widehat f-\mathbb E_f\widehat f and the bias Eff^−f\mathbb E_f\widehat f-f. A calibrated simultaneous fluctuation bound alone covers the expected estimator, not necessarily the true function. If a deterministic bias bound B(x) holds uniformly on the announced class, adding it to the stochastic radius gives a valid triangle-inequality band. Estimating bias introduces its own error, and a bootstrap that reproduces centered fluctuations does not automatically remove that error.

Undersmoothing can make bias negligible relative to stochastic width under suitable uniform regularity conditions, at the cost of larger noise. Bias correction can instead change both the center and its variance. Neither method is a universal repair without assumptions. Choosing bandwidth from the same data adds selection dependence, so a fixed-bandwidth calibration needs a theorem before being reused unchanged. Exact finite-grid Gaussian calculations are useful teaching examples because both the stochastic event and the approximation remainder can be written down separately.

∣f^(x)−f(x)∣≤∣f^(x)−Eff^(x)∣+∣Eff^(x)−f(x)∣≤c s(x)+B(x)|\widehat f(x)-f(x)|\le|\widehat f(x)-\mathbb E_f\widehat f(x)|+|\mathbb E_f\widehat f(x)-f(x)|\le c\,s(x)+B(x)
The last inequality holds on a simultaneous fluctuation event and under a bias bound valid for the entire stated parameter class.↔ Scroll wide equations horizontally.

Adaptation requires a specified restriction or compromise

In standard nonparametric density and regression settings, full nested smoothness classes can prevent a band from being both uniformly honest over their union and as narrow as the smoother class would permit when it were known. This is an inference obstruction, not a claim that adaptive point estimation is impossible. Quantitative self-similarity or separation conditions can exclude signals whose unresolved fine-scale behavior is too hard to detect. Other choices accept a wider band or weaken uniformity, each changing the stated statistical promise.

Distribution estimation illustrates the importance of the target. The empirical cumulative distribution admits a distribution-free uniform band because it averages a structured family of bounded indicators. Recovering a density differentiates that function, an unstable operation without derivative control. Smooth perturbations can have small cumulative differences and large density differences at high frequency. Extra smoothness restrictions are therefore substantive information about the target, not cosmetic regularity assumptions that may be omitted when transferring a confidence statement.

An honest band from five noisy grid values

Observe Yj=f(xj)+epsilon_j at grid points 0,0.25,0.5,0.75,1, with independent Gaussian errors of known standard deviation 0.1. Assume f is Lipschitz with constant at most 0.4. Use the nearest observed grid value as the center at each x and construct a 95% band over [0,1].

  1. There are five grid noises. A two-sided Bonferroni calibration uses c=Phi inverse(1−0.05/(2×5))=Phi inverse(0.995), about 2.575829. Each noise exceeds c×0.1 in magnitude with probability 0.01, so all five are bounded with probability at least 0.95.

  2. Every location is within 0.125 of a nearest grid point. The Lipschitz condition bounds the difference between the true function there and at that grid point by 0.4×0.125=0.05.

  3. Use the nearest Yj as center and half-width 0.257583+0.05=0.307583 everywhere. On the common grid-noise event, the triangle inequality covers every x. The result is finite-sample honest over this Lipschitz class; arbitrary grid ties can be resolved either way.

The result

The band explicitly pays for simultaneous noise and between-grid approximation. Independence is available here, but Bonferroni would only need the stated marginal Gaussian noise laws.

Explore the model

Interactive lab

Interactive lab · sampling

A standard deviation is only one input to a band

Pause and Reset, then set both controls to p=0.5 and n=25; predict sample-mean standard deviation 0.1. Reset and set p=0.5 and n=100; predict 0.05. The bars are exact pointwise Bernoulli-mean distributions, not a simultaneous curve experiment. The normal comparison is an approximation; neither it nor playback supplies a bias allowance or a whole-function confidence level.

A standard deviation is only one input to a bandExact binomial masses for the mean of n independent Bernoulli trials, compared with normal mass between adjacent half-count boundaries; normal tails outside the finite support remain outside the bars. Playback highlights outcomes, not random samples. The Berry–Esseen bound applies to standardized CDFs, not individual bars or continuity-corrected errors. At p = 0 or 1, normal comparison and that bound are disabled. Normal-CDF evaluation uses a numerical approximation with absolute error below 7.5×10⁻⁸ (at most 1.5×10⁻⁷ per interval, before rounding). Current readings: Mean sample proportion: 0.5; Sample-mean variance: 0.0125; Uniform CDF error bound: ≤ 0.1062. All parameters are adjustable with the labeled controls below.Exact distribution of the mean of 20 independent Bernoulli variables with success probability 0.5; playback highlights outcome 0.00.250.50.75100.0580.1150.1730.23Sample mean · k / nProbability massNormal bin masses are an approximationk = 0 · exact probability = 9.54e-7
Exact binomial massNormal interval massHighlighted outcome / mean
Mean sample proportion
0.5
Sample-mean variance
0.0125
Uniform CDF error bound
≤ 0.1062
t = 0 s

Exact binomial masses for the mean of n independent Bernoulli trials, compared with normal mass between adjacent half-count boundaries; normal tails outside the finite support remain outside the bars. Playback highlights outcomes, not random samples. The Berry–Esseen bound applies to standardized CDFs, not individual bars or continuity-corrected errors. At p = 0 or 1, normal comparison and that bound are disabled. Normal-CDF evaluation uses a numerical approximation with absolute error below 7.5×10⁻⁸ (at most 1.5×10⁻⁷ per interval, before rounding). Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.

Look forShrinking pointwise variance is useful, but honesty also requires simultaneous calibration and control of approximation bias.

Check your understanding

What can fail if a band calibrates only the centered smoother's fluctuations?

Try it yourself

On [0,1], compare densities f_plus(x)=1+0.5sin(2pi kx) and f_minus(x)=1−0.5sin(2pi kx) for positive integer k. Find their supremum density difference and the supremum difference of their cumulative distributions. Explain why this obstructs differentiating an arbitrary cumulative band.

Take a moment to make a prediction or work it out on paper. Open a hint when you need one.

Give me a hint

The sine perturbation has integral zero. Integrate the density difference from zero to x, then maximize 1−cos(2pi kx).

Compare with the solution

Both densities integrate to one and lie between 0.5 and 1.5. Their density difference is sin(2pi kx), with supremum absolute value one. Their cumulative difference is [1−cos(2pi kx)]/(2pi k), with supremum 1/(pi k), tending to zero. Thus arbitrarily close cumulative functions can correspond to density curves a fixed distance apart. A density band needs additional regularity control; in this example derivative bounds grow with k, so the pair does not contradict a theorem over a fixed suitably smooth class.

Take it with you

  • Honesty is uniform over the announced class as well as simultaneous over locations.
  • Bias, selection and between-grid behavior require separate control from variance.
  • Adaptive inference and differentiation of cumulative bands need additional assumptions.

Read further

Original sources and deeper explanations to follow at your own pace.

Optional progress, saved in this browser when available. Revisit any lesson at any time.

Lesson not marked complete.