Sequential Statistics

Gleser (1965) has extended Chow and Robbins' (1965) results to the linear regression problem Let y 1, y 2,... be a sequence of independent observations with
| (4.8.1) | |
where ? ? is an unknown 1 p vector, x (i) a known p 1 column vector, and ? i a random error having an unknown distribution function F with mean 0 and finite, but unknown variance ? 2. We wish to find a region W in p-dimensional Euclidean space such that P( ? ? W)=1 ? ? and such that the length of the interval cut off on the i-axis by W has width=2 d, i=1, 2,..., p. As has already been noted for p=1, no fixed-sample size procedure meeting the requirements exists. Hence, we are led to consider sequential procedures.
Since the least-squares (Gauss-Markov) estimate of ? has, component-wise, uniformly minimum variance among all linear unbiased estimates of ?, has good asymptotic properties (such as consistency) and performs reasonably well against non-linear unbiased estimates, the least squares estimate of ? would be a natural candidate to use in the construction of our confidence region. It is well-known that the least squares estimate of ? is given by
| (4.8.2) | |
where
, X n=( x (1), x (2),..., x ( n )