Past the first term of the normal approximation

A correction that goes below zero

One Edgeworth term takes the normal approximation's error at two standard deviations from 38% to 8% on ten exponential draws, and stretches the range within 10% of the truth from 1.66 to 3.09 standard deviations at a hundred. It also turns negative in the short tail at every sample size — past 3.13 standard deviations at a hundred draws and 9.83 at a hundred thousand — because the region recedes only as the sixth root of n.

Worth reading first: The tail converges last.

A bound written for a coin found that the Berry–Esseen guarantee is the wrong instrument for a smooth skewed source, and found the right one by accident: the worst distance between an exponential sum and the normal was predicted to four digits by the first term of an expansion. The tail converges last names the same expansion as the systematic repair and warns, in a sentence, that it can go negative in the far tail. Neither measured what the repair does in the place a probability is read.

This essay does, on the same source — a sum of exponential draws, whose exact tail is an incomplete gamma function and can be evaluated at any threshold to full precision.

The upper tail of 10 exponential draws: normal, one Edgeworth term, two Edgeworth terms, each against the exact tailEach curve is an approximation divided by the exact gamma tail, so 1 is exact. Six standard deviations out at n = 10: the normal gives ×0.0000670, one Edgeworth term ×0.00159, two ×0.0167 and the saddlepoint ×1.0007.1010.110⁻²10⁻³10⁻⁴246standard deviations above the meanapproximation ÷ exactnormalone Edgeworth termtwo Edgeworth termsexact incomplete gamma, n = 101 is exact, 0.1 is ten times too small
Fig. 1 The upper tail of a standardised sum of ten exponential draws, approximated three ways and each divided by the exact tail, on a logarithmic scale. The flat line at 1 is exact. The slider is the number of draws.

What the expansion adds

The normal approximation reads a standardised sum’s distribution off its first two moments and nothing else. The Edgeworth expansion writes the true distribution function as the normal plus corrections carrying the higher moments, in powers of 1/n1/\sqrt{n}:

Fn(z)  =  Φ(z)    φ(z)γ(z21)6n    φ(z)[κ(z33z)24n+γ2(z510z3+15z)72n]    F_n(z) \;=\; \Phi(z) \;-\; \varphi(z)\,\frac{\gamma\,(z^2 - 1)}{6\sqrt{n}} \;-\; \varphi(z)\left[\frac{\kappa\,(z^3 - 3z)}{24\,n} + \frac{\gamma^2\,(z^5 - 10z^3 + 15z)}{72\,n}\right] \;-\; \cdots

with γ\gamma the source’s skewness and κ\kappa its excess kurtosis. For exponential draws γ=2\gamma = 2 and κ=6\kappa = 6. The first bracket is the one-term correction and carries the skew; the second carries the kurtosis and the square of the skew, and is smaller by another factor of n\sqrt{n}.

Each correction is a polynomial in zz multiplied by the normal density. That shape is the whole story of this essay. Where zz is moderate the polynomial is modest and the density is not small, so the correction is a sensible adjustment. Where zz is large the density still decays like the normal’s, but the polynomial grows, and the correction ends up larger than the thing it corrects.

Two standard deviations: the repair works

At the threshold a two-sided 5% test reads, the correction does what it is advertised to do.

draws normal ÷ exact one term ÷ exact two terms ÷ exact
5 0.555 1.14 1.01
10 0.617 1.08 1.01
100 0.816 1.01 1.00
1,000 0.931 1.00 1.00

These are ratios at two standard deviations above the mean, where the exponential sum’s long tail is. At ten draws the normal gives 0.617 of the true tail — a p-value that should be 3.69% reported as 2.27%. One term moves that to 1.08; two terms to 1.01.

The first correction removes at least two thirds of the normal’s error at two standard deviations, and more as the sample grows — 68% at five draws, 95% at a hundred — and the second removes most of what is left. At a thousand draws the one-term correction is exact to the digits drawn while the normal is still 7% short. The skewness term is doing exactly the work the theory assigns it: the normal approximation’s leading error is the skew, and adding the skew back removes it.

One reading, at thirty observations

The ratios are easier to feel as a single decision. Thirty measurements of a right-skewed quantity — waiting times, say, which is what an exponential is — and a one-sided test whose statistic lands 2.58 standard errors above the null mean. The normal table says the p-value is 0.50%.

The exact tail of the thirty-draw sum at that threshold is 1.03%. The p-value is twice what it was reported as, and a result that looked comfortably past a 1% threshold is not past it. One Edgeworth term with the true skewness gives 1.00%; with two terms, 1.06%. The first correction has taken a factor of two out of a reading at a threshold people actually use, at a sample size people actually have.

With the skewness estimated from those thirty observations, the corrected reading lands at a median of about 0.84% — most of the way from the normal’s answer to the true one, not all of it, for the reason the section on estimated skewness below measures. Every version of the correction does better than the table, and none of the numbers on this page change the direction of that comparison at a threshold this close in.

That is what makes the rest of the essay worth reading carefully. The correction is not a curiosity; at two to three standard deviations it is the difference between a reported p-value and a true one on the most ordinary kind of skewed data. The question is how far out that stays true.

Further out: the repair runs out

The hero figure shows what happens past two standard deviations, and the table puts numbers on it at a hundred draws.

threshold normal ÷ exact one term ÷ exact two terms ÷ exact
2 sd 0.816 1.01 1.00
3 sd 0.491 0.920 1.01
4 sd 0.197 0.612 0.925
6 sd 0.00684 0.0560 0.210

Every correction improves on the normal at every threshold here, and every one of them eventually falls away from 1. At four standard deviations a single term gives 61% of the tail. At six, two terms give 21% of it: better than the normal’s 0.7%, and still wrong by a factor of five.

How far into the upper tail four approximations stay within 10% of the exact tail. The largest threshold before each approximation's ratio to the exact tail first leaves 1 ± 0.1. At a hundred draws: the normal 1.66, one Edgeworth term 3.09, two 4.11, and the saddlepoint past 12, the edge of the range searched. At a hundred thousand draws the normal has reached only 4.66.
Fig. 2 How far into the upper tail each approximation stays within 10% of the exact tail, against the number of draws on a logarithmic axis. The saddlepoint line sits at the edge of the range searched at every size.

The cleaner way to see it is to ask how far out each one can be trusted to within 10%:

draws normal one term two terms
10 1.37 sd 2.71 sd 2.66 sd
100 1.66 sd 3.09 sd 4.11 sd
1,000 2.25 sd 4.04 sd 5.26 sd
10,000 3.21 sd 5.64 sd 7.26 sd
100,000 4.66 sd 8.10 sd 10.38 sd

A single correction roughly doubles the reach of the normal approximation, which is a large practical gain: at a hundred draws it moves the trustworthy range from a threshold nobody reads to one past a two-sided 0.5% test. But every column still grows slowly. A hundredfold increase in the sample takes the one-term range from 3.09 to 5.64 standard deviations, and the ten-draw row shows two terms reaching less far than one — the second correction overshoots at 2.7 standard deviations before it undershoots further out.

Why the range grows so slowly

The rate at which that range grows is set by the shape of the corrections, and it is worth making explicit.

The normal tail beyond zz is about φ(z)/z\varphi(z)/z. The kk-th correction is a polynomial of degree 3k13k - 1 times φ(z)\varphi(z), divided by nk/2n^{k/2}. Divided by the tail it is correcting, it behaves like

z3knk/2  =  (z3n)k\frac{z^{3k}}{n^{k/2}} \;=\; \left(\frac{z^3}{\sqrt{n}}\right)^{k}

so the whole series is organised in powers of z3/nz^3/\sqrt{n}, not of 1/n1/\sqrt{n}. The expansion is useful only while z3z^3 is small compared with n\sqrt{n}, which is to say while z|z| is small compared with n1/6n^{1/6}.

The sixth root is a brutal rate. To move the useful range of any fixed number of terms out by a factor of two takes sixty-four times the data. Six standard deviations corresponds to z3=216z^3 = 216, which is small compared with n\sqrt{n} only once nn is well past fifty thousand. The table agrees: at a hundred thousand draws two terms are good to 10.38 standard deviations, and at a hundred they are not good to five.

This is also the precise sense in which the expansion is asymptotic rather than convergent. At a fixed sample size, adding terms improves the approximation near the centre and does not rescue the far tail, because every term is a larger power of the same ratio, and past the point where that ratio exceeds one the terms grow instead of shrinking. The series is a statement about what happens as nn grows at a fixed threshold. A tail probability is read at a threshold that has to move out as the probability gets smaller.

The short tail

Everything above is the long tail, where the exponential sum has more probability than the normal and the corrections add some back. The other side is where the expansion stops being a probability at all.

The lower tail of 5 exponential draws, and two Edgeworth corrections of it. The sum cannot fall below -2.24 standard deviations, and the exact tail runs down to zero there. The one-term correction crosses zero at about -1.97 and reports -6.20e-3 at -2.19 — a negative probability.
Fig. 3 The lower tail of a sum of five exponential draws, which cannot fall more than 2.24 standard deviations below its mean. The exact tail reaches zero at that floor. The one-term correction crosses zero before it and keeps going.

A sum of positive draws cannot be negative, so its standardised version has a floor at n-\sqrt{n} — at 2.24-2.24 for five draws — and the true lower tail is very short: two standard deviations below the mean it holds 0.022% of the distribution. The normal approximation, which has no floor, puts 2.28% there, which is 103 times too much.

The one-term correction subtracts the skew from the normal, which is the right direction. It subtracts too much. At two standard deviations below the mean it gives −6.33 times the true tail — a negative probability — and two terms give −30.8 times. The correction has overshot zero, and the second term, which helped so much on the long side, makes it five times worse on this one.

Nothing is wrong with the arithmetic. The correction is a polynomial times a density and has no reason to respect the fact that a probability cannot be negative; it was built to be accurate to a stated order near the centre and says nothing at all about the edges. What goes wrong is only the reading: a number between −1 and 0 printed where a p-value was expected.

The negative region never goes away

It would be natural to assume the negative region is a small-sample curiosity that disappears once there are enough draws. It recedes. It does not disappear.

Where a one-term Edgeworth correction first gives a negative probability, from 5 to 100,000 exponential draws. The lower tail turns negative 1.97 standard deviations below the mean at 5 draws, 3.13 at a hundred and 9.83 at 100,000. The threshold recedes like the sixth root of the sample size, following the dashed prediction, so there is no sample size at which the region is gone.
Fig. 4 The threshold below which the one-term lower tail is negative, against the number of draws, beside the cube-root prediction. The exact tail probability at each threshold is printed beside its point.

The one-term lower tail is Φ(z)\Phi(z) minus the skew correction, and Φ(z)\Phi(z) falls like φ(z)/z\varphi(z)/|z| while the correction is φ(z)\varphi(z) times a quadratic. They cross where z(z21)3n|z|(z^2 - 1) \approx 3\sqrt{n}, so roughly at z=(3n)1/3|z| = (3\sqrt{n})^{1/3} — the same sixth root of nn again.

draws negative beyond predicted exact tail there
5 1.97 sd 1.89 sd 4.1×1044.1 \times 10^{-4}
30 2.58 sd 2.54 sd 9.8×1049.8 \times 10^{-4}
100 3.13 sd 3.11 sd 2.3×1042.3 \times 10^{-4}
1,000 4.57 sd 4.56 sd 7.9×1077.9 \times 10^{-7}
100,000 9.83 sd 9.83 sd 1.5×10231.5 \times 10^{-23}

At a hundred draws the region begins where the true tail is a little over two in ten thousand. That is not exotic. It is the size of a p-value in a study with a dozen comparisons corrected for the number of analyses that were run. At a thousand draws the region has moved to probabilities below one in a million, where it troubles only the most extreme applications. At every size it is there.

Two terms behave better on this side at moderate sizes — from thirty draws on they stay positive across the whole short tail — which makes the point about asymptotic series in the other direction. Adding a term can repair a defect, create one, or both, depending on where it is read, and nothing in the formula says which.

The skewness it would really be given

Every number so far hands the correction the true skewness of the source, which is 2. Nobody using the correction has that. They have a sample, and the correction’s coefficient is whatever that sample’s skewness happens to be — so the measurement that matters in practice is the correction with the skewness estimated from the same observations it is applied to.

A skewness correction with the skewness estimated from the sample, 2 standard deviations out. On exponential samples the sample skewness has a median of 0.93 at ten observations and 1.85 at three hundred, against a true value of 2. The correction built on it gives a median of ×0.834 of the exact tail at ten, where the true-skewness correction gives ×1.081 and the normal ×0.617.
Fig. 5 The upper tail two standard deviations out, read three ways across sample sizes: the normal, the one-term correction with the true skewness, and the one-term correction with each sample’s own skewness, drawn as its median and the band from the tenth to the ninetieth percentile over four thousand samples.

The sample skewness of a long-tailed source is biased low, for the reason an interval’s tails disagree on the same source: the skew is made by rare large values, and a small sample usually does not contain one. At ten exponential observations the median sample skewness is 0.93 — less than half the truth — and one sample in ten reads below 0.20. At thirty the median is 1.38; at three hundred, 1.85, still short.

The correction inherits that bias directly, because its size is proportional to the skewness put into it:

observations median sample skewness normal ÷ exact corrected, true skewness corrected, sample skewness
10 0.93 0.617 1.081 0.834
30 1.38 0.719 1.031 0.934
100 1.71 0.816 1.010 0.982
300 1.85 0.883 1.004 0.995

At ten observations the estimated correction recovers a little over half of the normal’s shortfall rather than all of it and more. It is still an improvement — the normal gives 62% of the tail, the corrected reading gives 83% at the median — and on only 4.9% of samples is it further from the truth than the normal was. The repair is real and it is systematically partial, pulled back towards the approximation it was correcting by exactly the amount the sample understates the skew.

Two consequences follow for how the expansion is read. The first is that the tables above, computed with the true skewness, are the correction’s best case at small samples, and the gap between the fourth and fifth columns is the price of not knowing the source. The second is more useful: the bias is in a known direction. A skew-corrected tail computed from a small sample of a right-skewed quantity is too small, not merely uncertain, and a reader who has nothing better can at least read it as a lower bound on how much the normal understated.

The same bias explains a pattern the resampling essays keep meeting. A method that estimates the skewness from the sample and corrects for it — the accelerated bootstrap’s constant is one such estimate — gets most of the repair at moderate samples and a fraction of it at small ones, and the bootstrap’s reach into a tail is limited by the same missing large values that bias the skewness here.

Where a skew correction does its useful work

The measurements make the correction’s proper use easy to state. It is a repair for moderate thresholds on skewed sources, and at moderate thresholds it is very good.

Its most important application is not a tail probability at all but a critical value. The Cornish–Fisher expansion is the same series inverted: it adjusts the quantile rather than the probability, and a skew-corrected critical value for a one-sided test at 2.5% sits inside the range where the one-term correction is at its best. The imbalance between an interval’s two tails on an exponential source — 4.08% missed on one side against 1.11% on the other at a hundred and twenty observations — is a first-order skew effect of precisely this kind, and it is what a skew-corrected interval is built to remove.

The same series is also the reason some resampling methods are more accurate than others. A bootstrap that resamples a studentised statistic gets the skewness term right automatically, where the plain normal interval and the percentile interval do not, and that is the content of the claim that the studentised bootstrap is “second-order accurate” — a claim whose price is measured elsewhere. Second-order accuracy means exactly the first correction and nothing more, which the tables here show is very good at two standard deviations and not good at six.

What the correction should not be used for is a far-tail probability read off its own formula. Past zn1/6|z| \approx n^{1/6} the corrections dominate the quantity they correct, the ratio to the truth can take any value including negative ones, and there is no internal signal that the region has been entered.

The upper tail of 100 exponential draws: normal, one Edgeworth term, two Edgeworth terms, each against the exact tail. Each curve is an approximation divided by the exact gamma tail, so 1 is exact. Six standard deviations out at n = 100: the normal gives ×0.00684, one Edgeworth term ×0.0560, two ×0.210 and the saddlepoint ×1.0000.
Fig. 6 The same three approximations at a hundred draws. Every curve is closer to 1 than at ten draws, and every curve still leaves it before six standard deviations.

What the counts establish, and what they do not

One correction removes most of the normal’s error at two standard deviations. At a thousand draws it takes the ratio from 0.931 to within a hundredth of 1, and at every size in the tables the one-term error at two standard deviations is under a third of the normal’s.

The one-term lower tail turns negative at every sample size measured — five, thirty, a thousand and a hundred thousand draws — at a threshold that moves further out as the sample grows and sits within a tenth of a standard deviation of the cube-root prediction at each.

One term reaches further into the upper tail than the normal does, at every size. Stated as a comparison at each size because the ranges themselves are properties of the exponential source, and a different skew would move all of them.

What is not claimed is anything general about the series beyond these corrections. The divergence of the full Edgeworth series for a fixed sample size is a known result about the expansion and is not measured here; what is measured is that two terms do not reach six standard deviations at a hundred draws. Nor is it claimed that the negative-probability region is a practical hazard at large samples: at a thousand draws it begins at a probability of 7.9×1077.9 \times 10^{-7}, and whether any reading happens that far out depends on the application.

Every number is exact rather than simulated. The exponential sum’s tail is an incomplete gamma function, the corrections are closed forms, and the table of ranges is a search over those closed forms — so, like the figures in the collection’s methods essay, each can be recomputed independently and none carries Monte Carlo error.

Still open: an approximation built at the threshold

Every correction here is built at the centre of the distribution and extrapolated outward, which is why its error is organised in powers of z3/nz^3/\sqrt{n} and grows with the threshold. The remedy is to build the approximation somewhere else.

A saddlepoint approximation tilts the distribution so that the threshold being read becomes its centre, applies the normal approximation there — where the normal is good — and tilts back. The error is then an expansion about the threshold rather than about the mean, and it does not have to grow as the threshold moves out. In the range figure above it reaches the edge of the search at every size. Whether that holds on a source where it is not favoured, and what it costs to use on a statistic whose moment generating function is not written down, are the questions an approximation built at the threshold takes up.

The inverse question is also untouched. A Cornish–Fisher critical value is the one-term correction applied to a quantile, and it inherits the sixth-root range; the one-sided test it produces has an actual size that could be counted against its nominal one at each threshold, exactly as the ratios here were, and the point past which it starts to mislead has not been located.

What links here

Computed from the collection, not written here: the essays that point at this one.

Shares its objects with

Essays that name at least two of the same things, and that neither author linked.

Named objects

A flat tag is an object no other essay names yet.

Approximation errorAsymptotic seriesCentral limit theoremConvergence rateEdgeworth expansionNormal approximationSkewnessTail probability