Context. Observe X∼Nd(θ,Id) and estimate θ under total squared error. The MLE X is unbiased, minimax with constant risk d, and admissible for d=1, and with independent coordinates everyone expected the same for all d. Stein (1956) proved that for d≥3 some estimator has smaller risk at every θ; James and Stein (1961) gave the explicit rule and its exact risk; Efron and Morris (1973) read it as a Bayes rule whose prior variance is estimated from the data. The reason is that in many dimensions the noise adds to the observation's length on average, E∥X∥2=∥θ∥2+d, so X systematically overshoots θ in length. Pulling it toward any fixed point by an amount estimated from ∥X∥2 lowers the risk by up to d−2, and the error from estimating that one number stays bounded (the risk at the target is 2).
Setting.X∼Nd(θ,σ2Id), σ=1 unless stated, risk R(θ,δ)=Eθ∥δ(X)−θ∥2, S=∥X∥2, and K∼Poisson(∥θ∥2/2), so that S∣K∼χd+2K2. A rule is inadmissible if another has risk no larger at every θ and smaller at some.
Theorem 1 (Stein 1956). Let d≥3 and δa,b(X)=(1−a+∥X∥2b)X with a,b>0. Uniformly in θ as a→∞, R(θ,δa,b)≤d−a+∥θ∥22b(d−2)−b2+o(a+∥θ∥21), so for 0<b<2(d−2) and a large enough R(θ,δa,b)<d for every θ, and X is inadmissible. With b=d−2 the saving is asymptotic to (d−2)2/∥θ∥2 as ∥θ∥→∞, and this is best possible: no estimator has R(θ,δ)≤d−c/∥θ∥2 for all large ∥θ∥ with c>(d−2)2. For d=2, X is admissible.
Theorem 2 (James and Stein 1961). For d≥3 and any real b, R(θ,(1−Sb)X)=d−[2b(d−2)−b2]Ed−2+2K1. The bracket is maximized by b=d−2 at every θ: θ^JS=(1−Sd−2)X with risk d−(d−2)2Ed−2+2K1<d, equal to 2 at θ=0 and increasing in ∥θ∥ to d. With unknown variance and an independent Se∼σ2χn2, the rule (1−n+2d−2∥X∥2Se)X is optimal in its class and keeps the fraction n/(n+2) of the saving.
Theorem 3 (SURE and the positive part). If δ(X)=X+g(X) with g weakly differentiable and Eθ∑i∣∂igi∣<∞, then R(θ,δ)=Eθ[d+∥g∥2+2∇⋅g], an unbiased risk estimate that does not involve θ; for θ^JS it is d−(d−2)2/S (Stein 1981; Efron's short proof that θ^JS dominates X). The positive part θ^JS+=(1−Sd−2)+X strictly dominates θ^JS, and generally (1−c(S))+X strictly dominates (1−c(S))X whenever Pθ(c(S)>1)>0. It is itself inadmissible (it is not smooth, while admissible rules here are generalized Bayes and hence analytic), but the possible further gains are small.
Theorem 4 (empirical Bayes; Efron and Morris 1973). Under θi∼iidN(0,A) the Bayes rule is (1−B)X with B=1/(1+A), and θ^JS is that rule with B replaced by an unbiased estimate. The Bayes risks are RABayes=A+1dA,RAJS=A+1dA+A+12,RAMLE=d, so James-Stein gives up the share 2/d of the attainable saving (the relative savings loss) at every A. With the prior mean unknown, Lindley's rule θ^i=Xˉ+(1−∑j(Xj−Xˉ)2d−3)(Xi−Xˉ) dominates X for d≥4; toward a fitted r-parameter regression the constant is d−r−2.
Step 1
∥X∥2 overestimates ∥θ∥2 by about d, and the best shrinkage factor is 1−d/∥X∥2 (Stein's heuristic). Since ∥X∥2=d+∥θ∥2+Op(d+∥θ∥2), the data reveal ∥θ∥2 up to an error small next to d+∥θ∥2. Try δ=[1−h]X with h a function of ∥X∥2/d≈1+ρ2, ρ2=∥θ∥2/d: ∥δ−θ∥2=d[(1−h)2+ρ2h2]+Op(d), minimized at h=1/(1+ρ2), that is δ=(1−d/∥X∥2)X, with loss about dρ2/(1+ρ2), the Bayes risk of Theorem 4 at A=ρ2. This shrinks more than rescaling onto the sphere of radius ∥θ∥ because the noise also points X in a wrong direction, and shrinking past the sphere removes more of that error than it adds in bias.
Step 2
A small bounded shrinkage already beats X (Stein 1956). With Y=X−θ, expanding the square gives R(θ,δa,b)≤d−2bEa+∥Y+θ∥2Y⊤(Y+θ)−b/2. Expand the denominator to second order in θ⊤Y and use rotational invariance (given ∥Y∥2, θ⊤Y has mean 0 and second moment ∥θ∥2∥Y∥2/d); the leading terms give (d−2−b/2)/(a+∥θ∥2), the bound of Theorem 1. The remainder is negligible uniformly only because a→∞ (Stein's bounds, from a Chebyshev bound on {θ⊤Y<−∥θ∥2/4} when ∥θ∥2>a, are of order 1/((a+∥θ∥2)a) and (a+∥θ∥2)−3/2), so a serves only to keep the expansion uniform, and Step 3 does without it.
Step 3
Stein's lemma gives the exact risk of (1−b/S)X in terms of Eθ[1/S] (SURE). Gaussian integration by parts, E[(Xi−θi)gi(X)]=E[∂igi(X)], converts the cross term of ∥X+g−θ∥2 into an expected divergence, which is SURE. For g=−bX/S, ∇⋅g=−b(d−2)/S, so R(θ,(1−Sb)X)=d−[2b(d−2)−b2]EθS1, and E[1/S] is finite exactly when d≥3. Since θ enters only through one positive factor, the rule beats X iff 0<b<2(d−2), and b=d−2 is best at every θ at once, with no expansion in a.
Step 4
The exact risk is a Poisson mixture (James and Stein 1961). Both terms reduce to E[1/(d−2+2K)] through S∣K∼χd+2K2 and E[1/χm2]=1/(m−2); without Stein's lemma, James and Stein got the cross term E[(X−θ)⊤X/S] from a power series integrated termwise against Beta integrals. The risk is 2 at θ=0, increases in ∥θ∥ because K is stochastically increasing, and by Jensen is at most 2+d−2+∥θ∥2(d−2)∥θ∥2, close to the oracle of Step 1. The whole saving is made along X: every rule c(X)X has the same error orthogonal to X, while the mean square error along X is 1+(d−2)Ed−2+2K1≤2 for James-Stein. Conditioning on Se and using its first two moments gives the unknown-variance risk σ2{d−[2an(d−2)−a2n(n+2)]Ed−2+2K1}, now with K∼Poisson(∥θ∥2/2σ2), for the factor 1−aSe/∥X∥2, optimized at a=(d−2)/(n+2).
Step 5
(d−2)2/∥θ∥2 is the best rate, and X is admissible for d=2 (Stein 1956). Averaging a rule over O(d) with Haar measure gives a spherically symmetric rule whose risk at θ, by convexity of the loss, is at most the original risk averaged over the sphere of radius ∥θ∥, so it keeps any bound R≤d−c/∥θ∥2; and for those the information inequality yields a differential inequality with no solution. For bias −φ(t)θ, t=∥θ∥2, Cramér-Rao with the gradient-squared term dropped gives R(θ)≥d+tφ2−2dφ−4tφ′. For d=2, R≤2 forces ψ′≥ψ2/4t for ψ=tφ, so 1/ψ would have to change by 41∣log(t/t0)∣ toward 0 or ∞ while ψ is monotone and keeps its sign; hence ψ≡0, so δ is unbiased and R≥2. For d≥3, assume a saving c/t with α2=c−(d−2)2>0 and center at the James-Stein bias, φ=(d−2)/t+f; the 1/t terms collapse to −(d−2)2/t, and with ψ=tf4ψ′≥tα2+ψ2⟹α4[arctanαψ(t)−arctanαψ(t0)]≥logt0t, impossible for large t because the left side is at most 4π/α.
Step 6
Truncating the shrinkage factor at zero lowers the risk (positive part). When c=(d−2)/S>1, James-Stein flips the sign of X, and replacing it by 0 lowers the loss by (c−1)2S+2(c−1)θ⊤X. The first term is positive. For the second, Eθ⊤X=∥θ∥2 is not enough because c−1 is correlated with θ⊤X, so condition on S, which fixes c: on the sphere ∥x∥2=S the density of X is proportional to eθ⊤x, and reflecting across θ⊥ pairs ±θ⊤x with weights e±θ⊤x, so E[θ⊤X∣S]≥0. Nothing used the form of c, which gives the general statement.
Step 7
James-Stein is the Bayes rule with its one unknown estimated (Efron and Morris 1973). Marginally X∼Nd(0,(1+A)I), so S∼(1+A)χd2 and ESd−2=1+Ad−2Eχd21=B. Averaging SURE over the marginal shows that the Bayes risk of James-Stein exceeds that of the Bayes rule by 2B, against dB for the MLE, whence 2/d. Estimating the prior mean by Xˉ leaves ∑i(Xi−Xˉ)2∼(1+A)χd−12, so each estimated location parameter removes one degree of freedom. The MLE of B, min(1,d/S), gives (1−d/S)+X; its untruncated form dominates X for d≥5 but by Step 3 has uniformly larger risk than θ^JS. The prior only suggests the rule; domination holds at every fixed θ.
Consequences.Partial pooling. The posterior mean M+(1−B)(Xi−M) under θi∼N(M,A) is the partial-pooling estimate of multilevel models; Lindley-James-Stein estimates M and B from the spread of the Xi and beats no pooling at every configuration of the θi once d≥4, exchangeable or not; in Efron's batting-average example it reduces total prediction error to 0.28 of the MLE's. Implicit regularization. With orthonormal design, ridge with penalty λ is the Bayes rule with A=σ2/λ, so James-Stein is ridge with λ tuned on the data. Early stopping, weight decay and minimum-norm solutions also bias toward a fixed point, and Stein's result is the cleanest proof that such a bias, with the amount tuned on the data, can lower total error at every parameter value once d≥3. Limits. The gain is in total squared error only, and single coordinates can lose badly (in Efron's simulation an outlying mean's error rises from 1.08 to 2.04). It is concentrated near the target, vanishing relative to d as ∥θ∥2/d→∞. It needs d≥3 and Gaussian noise with known or independently estimated variance (James and Stein state without proof a bounded-shrinkage version under finite fourth moments, with b<2(d−2)miniσi2 and a not made explicit). Naive plug-in intervals undercover.
Terms
θ^JS
(1−∥X∥2d−2)X; risk d−(d−2)2Ed−2+2K1, equal to 2 at θ=0.
E[(Xi−θi)gi(X)]=E[∂igi(X)] for X∼N(θ,I): Gaussian integration by parts.
SURE
d+∥g∥2+2∇⋅g, unbiased for the risk of X+g(X); for JS it is d−(d−2)2/S.
(1−b/S)X
Risk d−[2b(d−2)−b2]E[1/S]; dominates X iff 0<b<2(d−2), best b=d−2.
Shrinkage factor B
1/(1+A) under θi∼N(0,A); Bayes rule (1−B)X; (d−2)/S is unbiased for B.
Relative savings loss
(RAJS−RABayes)/(RAMLE−RABayes)=2/d for every A.
Lindley rule
Shrink toward Xˉ with d−3 in place of d−2; dominates for d≥4; d−r−2 for an r-parameter target.
Unknown σ2
(1−n+2d−2∥X∥2Se)X, Se∼σ2χn2; keeps the fraction n/(n+2) of the saving.
Stein's optimal rate
No rule saves at least c/∥θ∥2 with c>(d−2)2 for all large ∥θ∥ (information inequality).
Quiz
Why does the James-Stein argument fail for d≤2?
The risk of (1−b/S)X contains b2E[1/S], and E[1/S] diverges at the origin for d≤2 (∫0rd−3dr is finite only for d>2), so every such shrinkage has infinite risk. For d≥3 the term is finite and the cross term −2b(d−2)E[1/S] can outweigh it.
What did Stein's lemma replace in James and Stein's 1961 computation of the exact risk?
James and Stein computed E[θ⊤X/S] by splitting off the component of X along θ and integrating a power series. Stein's lemma gives E[(X−θ)⊤X/S]=(d−2)E[1/S] in one line, but E[1/S] itself still needs the Poisson mixture.
In Stein's information-inequality argument for d≥3, what does writing the bias coefficient as φ=(d−2)/t+f accomplish?
Centering at the James-Stein bias leaves 4ψ′≥(α2+ψ2)/t when the saving constant exceeds (d−2)2. Integrating makes a bounded arctan grow like logt, a contradiction.
Geometrically, where does James-Stein gain over X?
Every rule along X leaves the same component of θ orthogonal to X, so the whole gain is in the radial error, whose mean square James-Stein reduces to 1+(d−2)Ed−2+2K1≤2. It accepts a little bias for a large reduction in that error.
W. James and Charles Stein. Estimation with Quadratic Loss. Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, 1961.