Section 5.4

Simultaneous Estimation

[14/0%]
Show
LaTeX
Problem 5.4.1

In Example 4.2, show that an estimator δ\delta is equivariant if and only if it satisfies (4.11) and (4.12).

?
Problem 5.4.2

Show that a function μ\mu satisfies (4.12) if and only if it depends only on ΣXi2\Sigma X_{i}^{2}.

?
Problem 5.4.3

Verify the Bayes estimator (4.15).

?
Problem 5.4.4

Let XiX_{i} be independent with binomial distribution b(pi,ni),i=1,…,rb\left(p_{i}, n_{i}\right), i=1, \ldots , r. For estimating p=(p1,…,pr)p=\left(p_{1}, \ldots , p_{r}\right) with average squared error loss (4.17), find the minimax estimator of pp, and determine whether it is admissible.

?
Problem 5.4.5

Establishing the admissibility of the normal mean in two dimensions is quite difficult, made so by the fact that the conjugate priors fail in the limiting Bayes method. Let

X∼N2(θ,I) and L(θ,δ)=∣θ−δ∣2. X \sim N_{2}(\boldsymbol {\theta }, I) \quad \text{ and } \quad L(\boldsymbol {\theta }, \delta )=|\boldsymbol {\theta }-\delta |^{2}.

The conjugate priors are θ∼N2(0,τ2I),τ2>0\boldsymbol {\theta } \sim N_{2}\left(0, \tau^{2} I\right), \tau^{2}>0.

?
(a)

For this sequence of priors, verify that the limiting Bayes argument, as in Example 2.8, results in inequality (4.18), which does not establish admissibility.

(b)

Stein (in James and Stein 1961), proposed the sequence of priors that works to prove XX is admissible by the limiting Bayes method. A version of these priors, given by Brown and Hwang (1982), is

gn(θ)={1 if ∣θ∣≤11−log⁡∣θ∣log⁡n if 1≤∣θ∣≤n0 if ∣θ∣≥n g_{n}(\boldsymbol {\theta })= \begin{cases} 1 & \text{ if }|\boldsymbol {\theta }| \leq 1 \\ 1-\frac{\log |\boldsymbol {\theta }|}{\log n} & \text{ if } 1 \leq |\boldsymbol {\theta }| \leq n \\ 0 & \text{ if }|\boldsymbol {\theta }| \geq n\end{cases}

for n=2,3,…n=2,3, \ldots. Show that δgn(x)→x\delta^{g_{n}}(x) \rightarrow x a.e. as n→∞n \rightarrow \infty.

(c)

A special case of the very general results of Brown and Hwang (1982) state that for the prior πn(θ)2g(θ)\pi_{n}(\boldsymbol {\theta })^{2} g(\boldsymbol {\theta }), the limiting Bayes method (Blyth's method) will establish the admissibility of the estimator δg(x)\delta^{g}(x) [the generalized Bayes estimator against g(θ)g(\boldsymbol {\theta }) ] if

∫{θ:∣θ∣>1}g(θ)dθ∣θ∣2[max⁡{log⁡∣θ∣,log⁡2}]2<∞. \int _{\left\{ \boldsymbol {\theta }:\left|\boldsymbol {\theta }\right|>1\right\} } \frac{g(\boldsymbol {\theta }) d \boldsymbol {\theta }}{|\boldsymbol {\theta }|^{2}[\max \left\{ \log \left|\boldsymbol {\theta }\right|, \log 2\right\} ]^{2}}<\infty .

Show that this holds for g(θ)=1g(\theta )=1 and that δg(x)=x\delta^{g}(x)=x, so xx is admissible.

Remark.
?

Stein (1956b) originally established the admissibility of XX in two dimensions using an argument based on the information inequality. His proof was complicated by the fact that he needed some additional invariance arguments to establish the result. See Theorem 7.19 and Problem 7.19 for more general statements of the Brown/Hwang result.

Problem 5.4.6

Let X1,X2,…,XrX_{1}, X_{2}, \ldots , X_{r} be independent with Xi∼N(θi,1)X_{i} \sim N\left(\theta_{i}, 1\right). The following heuristic argument, due to Stein (1956b), suggests that it should be possible, at least for large rr and hence large ∣θ∣\left|\theta \right|, to improve on the estimator X=(X1,X2,…,Xr)\mathbf{X}=\left(X_{1}, X_{2}, \ldots , X_{r}\right).

?
(a)

Use a Taylor series argument to show

∣x∣2=r+∣θ∣2+Op[(r+∣θ∣2)1/2], |\mathbf{x}|^{2}=r+|\boldsymbol {\theta }|^{2}+O_{p}\left[\left(r+|\boldsymbol {\theta }|^{2}\right)^{1 / 2}\right],

so, with high probability, the true θ\boldsymbol {\theta } is in the sphere {θ:∣θ∣2≤∣x∣2−r}\left\{ \boldsymbol {\theta }:|\boldsymbol {\theta }|^{2} \leq |\mathbf{x}|^{2}-r\right\}. The usual estimator X\mathbf{X} is approximately the same size as θ\boldsymbol {\theta } and will almost certainly be outside of this sphere.

(b)

Part (a) suggested to Stein an estimator of the form δ(x)=[1−h(∣x∣2)]x\delta (\mathbf{x})=\left[1-h\left(|\mathbf{x}|^{2}\right)\right] \mathbf{x}. Show that

∣θ−δ(x)∣2=(1−h)2∣x−θ∣2−2h(1−h)θ′(x−θ)+h2∣θ∣2. |\boldsymbol {\theta }-\delta (\mathbf{x})|^{2}=(1-h)^{2}|\mathbf{x}-\boldsymbol {\theta }|^{2}-2 h(1-h) \boldsymbol {\theta }^{\prime }(\mathbf{x}-\boldsymbol {\theta })+h^{2}|\boldsymbol {\theta }|^{2}.
(c)

Establish that θ′(x−θ)/∣θ∣=Z∼N(0,1)\boldsymbol {\theta }^{\prime }(\mathbf{x}-\boldsymbol {\theta }) /\left|\boldsymbol {\theta }\right|=Z \sim N(0,1), and ∣x−θ∣2≈r|\mathbf{x}-\boldsymbol {\theta }|^{2} \approx r, and, hence,

∣θ−δ(x)∣2≈(1−h)2r+h2∣θ∣2+Op[(r+∣θ∣2)1/2]. |\boldsymbol {\theta }-\delta (\mathbf{x})|^{2} \approx (1-h)^{2} r+h^{2}|\boldsymbol {\theta }|^{2}+O_{p}\left[\left(r+|\boldsymbol {\theta }|^{2}\right)^{1 / 2}\right].
(d)

Show that the leading term in part (c) is minimized at h=r/(r+∣θ∣2)h=r /\left(r+|\boldsymbol {\theta }|^{2}\right), and since ∣x∣2≈r+∣θ∣2|\mathbf{x}|^{2} \approx r+|\boldsymbol {\theta }|^{2}, this leads to the estimator δ(x)=(1−r∣x∣2)x\delta (\mathbf{x})=\left(1-\frac{r}{|\mathbf{x}|^{2}}\right) \mathbf{x} of (4.20).

Problem 5.4.7

If S2S^{2} is distributed as χr2\chi_{r}^{2}, use (2.2.5) to show that E[S−2]=1/(r−2)\mathbb {E}\left[S^{-2}\right]=1 /(r-2).

?
Problem 5.4.8

In Example 4.7, show that R\mathcal{R} is nonsingular for ρ1\rho_{1} and ρ2\rho_{2} and singular for ρ3\rho_{3} and ρ4\rho_{4}.

?
Problem 5.4.9

Show that the function ρ2\rho_{2} of Example 4.7 is convex.

?
Problem 5.4.10

In Example 4.7, show that XX is admissible for

?
(a)

ρ3\rho_{3} and

(b)

ρ4\rho_{4}.

Problem 5.4.11

In Example 4.8, show that X\mathbf{X} is admissible under the assumptions (ii)(a).

?
Problem 5.4.12

Let L\mathcal{L} be a family of loss functions and suppose there exists L0∈LL_{0} \in \mathcal{L} and a minimax estimator δ0\delta_{0} with respect to L0L_{0} such that in the notation of (4.29),

sup⁡L,θRL(θ,δ0)=sup⁡θRL0(θ,δ0). \sup _{L, \theta } R_{L}\left(\theta , \delta _{0}\right)=\sup _{\theta } R_{L_{0}}\left(\theta , \delta _{0}\right).

Then, δ0\delta_{0} is minimax with respect to L\mathcal{L}; that is, it minimizes sup⁡L,θRL(θ,δ)\sup_{L, \theta } R_{L}(\theta , \delta ).

?
Problem 5.4.13

Assuming (4.25), show that E=1−[(r−2)2/r∣X−μ∣2]E=1-\left[(r-2)^{2} / r|\mathbf{X}-\mu |^{2}\right] is the unique unbiased estimator of the risk (5..4.25), and that EE is inadmissible.

?
Remark.
?

The estimator EE is also unbiased for estimation of the loss L(θ,δ)L(\boldsymbol {\theta }, \delta ). See Note 9.5.

Problem 5.4.14

A natural extension of risk domination under a particular loss is to risk domination under a class of losses. Hwang (1985) defines universal domination of δ\delta by δ′\delta^{\prime } if the inequality

Eθ[L(∣θ−δ′(X)∣)]≤Eθ[L(∣θ−δ(X)∣)] for all θ \mathbb {E}_{\theta }\left[L\left(\left|\boldsymbol {\theta }-\delta ^{\prime }(\mathbf{X})\right|\right)\right] \leq \mathbb {E}_{\theta }\left[L(\left|\boldsymbol {\theta }-\delta (\mathbf{X})\right|)\right] \text{ for all } \boldsymbol {\theta }

holds for all loss functions L(⋅)L(\cdot ) that are nondecreasing, with at least one loss function producing nonidentical risks.

?
(a)

Show that δ′\delta^{\prime } universally dominates δ\delta if and only if it stochastically dominates δ\delta, that is, if and only if

Pθ(∣θ−δ′(X)∣>k)≤Pθ(∣θ−δ(X)∣>k) \mathbb {P}_{\theta }\left(\left|\boldsymbol {\theta }-\delta ^{\prime }(\mathbf{X})\right|>k\right) \leq \mathbb {P}_{\theta }\left(\left|\boldsymbol {\theta }-\delta (\mathbf{X})\right|>k\right)

for all kk and θ\boldsymbol {\theta } with strict inequality for some θ\boldsymbol {\theta }.

(b)

For X∼Nr(θ,I)X \sim N_{r}(\boldsymbol {\theta }, I), show that the James-Stein estimator δc(x)=(1−c/∣x∣2)x\delta^{c}(\mathbf{x})=\left(1-c /|\mathbf{x}|^{2}\right) \mathbf{x} does not universally dominate x.

Hwang (1985) and Brown and Hwang (1989) explore many facets of universal domination. Hwang (1985) shows that even δ+\delta^{+}does not universally dominate XX unless the class of loss functions is restricted. We also note that although the inequality in part (a) may seem reminiscent of the "Pitman closeness" criterion, there is really no relation. The criterion of Pitman closeness suffers from a number of defects not shared by stochastic domination (see Robert et al. 1993).