A note on the asymptotic efficiency of the sobel–wald test

Let X₁,X₂, … be iid random variables with the pdf f(x,θ)=exp(θx?b(θ)) relative to a σ-finite measure μ, and consider the problem of deciding among three simple hypotheses H_i:θ=θ_i (1?i?3) subject to P(acceptH_i|θ_i)=1?α (1?i?3). A procedure similar to Sobel–Wald procedure is discussed and its asymptotic efficiency as compared with the best nonsequential test is obtained by finding the limit lim_a→0(E_iN(a)/n(a)), where N (a) is the stopping time of the proposed procedure and n(a) is the sample size of the best non-sequential test. It is shown that the same asymptotic limit holds for the original Sobel–Wald procedure. Specializing to N(θ,1) distribution it is found that lim_a→0$\text{(E}{}_{\mathrm{i}}\text{N(α)/n(α))=}\text{1}\text{4}$ (i=1,2) and lim_a→0 (E₃N(α)n(α))=δ²₁/4δ, where δ_i=(θ_i+1?θ_i) with 0<δ₁?δ₂. Also, the asymptotic efficiency evaluated when the X's have an exponential distribution.     

Nonparametric statistical procedures for the changepoint problem

Let X₁,…,X_r?1,X_r,X_r+1,…,X_n be independent, continuous random variables such that X_i, i = 1,…,r, has distribution function F(x), and X_i, i = r+1,…,n, has distribution function F(x?Δ), with -∞ <Δ< ∞. When the integer r is unknown, this is refered to as a change point problem with at most one change. The unknown parameter Δ represents the magnitude of the change and r is called the changepoint. In this paper we present a general review discussion of several nonparametric approaches for making inferences about r and Δ.     

Exponential Family Techniques for the Lognormal Left Tail

Let X be lognormal(μ,σ²) with density f(x); let θ > 0 and define . We study properties of the exponentially tilted density (Esscher transform) f_θ(x) = e^?θxf(x)/L(θ), in particular its moments, its asymptotic form as θ→∞ and asymptotics for the saddlepoint θ(x) determined by . The asymptotic formulas involve the Lambert W function. The established relations are used to provide two different numerical methods for evaluating the left tail probability of the sum of lognormals S_n=X₁+?+X_n: a saddlepoint approximation and an exponential tilting importance sampling estimator. For the latter, we demonstrate logarithmic efficiency. Numerical examples for the cdf F_n(x) and the pdf f_n(x) of S_n are given in a range of values of σ²,n and x motivated by portfolio value‐at‐risk calculations.     

Prediction in moving average processes

For the stationary invertible moving average process of order one with unknown innovation distribution F, we construct root-n   consistent plug-in estimators of conditional expectations E(h(_Xn+1)|_X1,…,_Xn)$E(h(X_{n+1})|X_1,\dots ,X_n)$. More specifically, we give weak conditions under which such estimators admit Bahadur-type representations, assuming some smoothness of h or of F. For fixed h it suffices that h   is locally of bounded variation and locally Lipschitz in _L2(F)$L_2(F)$, and that the convolution of h and F   is continuously differentiable. A uniform representation for the plug-in estimator of the conditional distribution function P(_Xn+1?·|_X1,…,_Xn)$P(X_{n+1}?·|X_1,\dots ,X_n)$ holds if F has a uniformly continuous density. For a smoothed version of our estimator, the Bahadur representation holds uniformly over each class of functions h that have an appropriate envelope and whose shifts are F-Donsker, assuming some smoothness of F. The proofs use empirical process arguments.     

BAHADUR SLOPES FOR COMPARISONS OF TESTS BASED ON RESAMPLING

Let X₁,…, X_n be random variables symmetric about θ from a common unknown distribution F_θ(x) =F(x–θ). To test the null hypothesis H₀:θ= 0 against the alternative H₁:θ > 0, permutation tests can be used at the cost of computational difficulties. This paper investigates alternative tests that are computationally simpler, notably some bootstrap tests which are compared with permutation tests. Of these the symmetrical bootstrap-f test competes very favourably with the permutation test in terms of Bahadur asymptotic efficiency, so it is a very attractive alternative.     

Sequence-compound estimation in scale-exponential families and speed of convergence

This paper deals with a sequence-compound estimation. The component problem is the squared error loss estimation of θ?[a,b] based on an observation X whose p.d.f. is of the form $\text{u(x)c(θ)}\text{exp}\text{(?}\text{x}\text{θ}\text{)}$. For each $\text{0<t<}\text{1}\text{2}$ a class of sequence-compound estimators $\text{ψ}\text{?}\text{=}\text{ψ}\text{?}{}_1\text{,}\text{ψ}\text{?}{}_2\text{,…)}$ is exhibited whose compound risk (average of risks) up to stage n differs from the Bayes envelope (in the component problem) w.r.t. the empiric distribution G_n of the parameters involved up to stage n by a quantity of order O(n^?δt) for a δ>0. It is also shown that at any stage i the difference of the risk of ψ?_i and the risk of the Bayes response w.r.t. G_i?1 is O(i^?δt). Examples of the above type of families are given where δ is min{1,$\text{2a}\text{b}$} and t is arbitrarily close to $\text{1}\text{2}$. Here it may be worthwhile to mention that a rate $\text{O}\text{(n}{}^{\mathrm{<mtext>?</mtext><mtext>1</mtext><mtext>2</mtext>}}\text{)}$ or better has not yet been obtained even in a very special family of densities.     

Some aspects of the theory of estimating equations

An estimating equation for a parameter θ, based on an observation ?, is an equation g(x,θ)=0 which can be solved for θ in terms of x. An estimating equation is unbiased if the funaction g has 0 mean for every θ. For the case when the form of the frequency function p(x,θ) is completely specified up to the unknown real parameter θ, the optimality of the m.1 equation $\text{?}\text{log}\text{p}\text{?θ}\text{=0}$ in the class of all unbiased estimating equations was established by Godambe (1960). In this paper we allow the form of the frequency function p to vary assuming that $\text{x=(x}{}_1\text{,…,x}{}_{\mathrm{n}}\text{)?}\text{R}{}^{\mathrm{n}}$ and that under p, E(x_i)=θ. x₁,…, x_n are independent observations on a variate x, it is shown that among all the unbiased estimating equations for θ, $\text{x}\text{?}\text{?θ=0}$ is uniquely optimum up to a constant multiple.     

On the Markov property of order statistics

The order statistics from a sample of size n≥3 from a discrete distribution form a Markov chain if and only if the parent distribution is supported by one or two points. More generally, a necessary and sufficient condition for the order statistics to form a Markov chain for (n≥3) is that there does not exist any atom x₀ of the parent distribution F satisfying F(x₀-)>0 and F(x₀)<1. To derive this result a formula for the joint distribution of order statistics is proved, which is of an interest on its own. Many exponential characterizations implicitly assume the Markov property. The corresponding putative geometric characterizations cannot then be reasonably expected to obtain. Some illustrative geometric characterizations are discussed.     

Changepoint Problems Under Random Censorship

Let X ₁, …, X _[nθ], X _{[nθ] + 1}, …, X _n be a sequence of independent random variables (the “lifetimes”) such that X _j ? F ₁ for 1 ≤ j ≤ [nθ] and X _j ? F ₂ for [nθ] + 1 ≤ j ≤ n, with F ₁ ≠ F ₂ unknown. In this paper we investigate an estimator θ _n for the changepoint θ if the X's are subject to censoring. The rate of almost sure convergence of θ _n to θ is established and a test for the hypothesis θ = 0, i.e. “no change”, is proposed.     

Characterizations of generalized mixtures of geometric and exponential distributions based on upper record values

Let X _{U (1)} < X _{U (2)} < … < X _{U ( n )} < … be the sequence of the upper record values from a population with common distribution function F. In this paper, we first give a theorem to characterize the generalized mixtures of geometric distribution by the relation between E[(X _{U ( n +1)}–X _{U ( n )})²|X _{U ( n )} = x] and the function of the failure rate of the distribution, for any positive integer n. Secondly, we also use the same relation to characterize the generalized mixtures of exponential distribution. The characterizing relations were motivated by the work of Balakrishnan and Balasubramanian (1995). Received: March 31, 1999; revised version: November 22, 1999     

Empirical Bayes regression analysis with many regressors but fewer observations

In this paper, we consider the prediction problem in multiple linear regression model in which the number of predictor variables, p, is extremely large compared to the number of available observations, n  . The least-squares predictor based on a generalized inverse is not efficient. We propose six empirical Bayes estimators of the regression parameters. Three of them are shown to have uniformly lower prediction error than the least-squares predictors when the vector of regressor variables are assumed to be random with mean vector zero and the covariance matrix (1/n)X^tX$(1/n){\mathit{X}}^{\mathrm{t}}\mathit{X}$ where X^t=(_x1,…,_xn)${\mathit{X}}^{\mathrm{t}}=({\mathit{x}}_1,\dots ,{\mathit{x}}_n)$ is the p×n$p\times n$ matrix of observations on the regressor vector centered from their sample means. For other estimators, we use simulation to show its superiority over the least-squares predictor.     

Empirical bayes rules for selecting good populations

A problem of selecting populations better than a control is considered. When the populations are uniformly distributed, empirical Bayes rules are derived for a linear loss function for both the known control parameter and the unknown control parameter cases. When the priors are assumed to have bounded supports, empirical Bayes rules for selecting good populations are derived for distributions with truncation parameters (i.e. the form of the pdf is f(x|θ)= p_i(x)c_i(θ)I_{(0, θ)}(x)). Monte Carlo studies are carried out which determine the minimum sample sizes needed to make the relative errors less than ε for given ε-values.     

Characterizations of geometric distribution and discrete IFR (DFR) distributions using order statistics

Let X be a discrete random variable the set of possible values (finite or infinite) of which can be arranged as an increasing sequence of real numbers a₁<a₂<a₃<…. In particular, a_i could be equal to i for all i. Let X_1n≦X_2n≦?≦X_nn denote the order statistics in a random sample of size n drawn from the distribution of X, where n is a fixed integer ≧2. Then, we show that for some arbitrary fixed k(2≦k≦n), independence of the event {X_kn=X_1n} and X_1n is equivalent to X being either degenerate or geometric. We also show that the montonicity in i of P{X_kn = X_1n | X_1n = a_i} is equivalent to X having the IFR (DFR) property. Let a_i = i and $\text{G(i) = P(X≧i), i = 1, 2, …}$. We prove that the independence of {X_2n ? X_1n ∈B} and X_1n for all i is equivalent to X being geometric, where B = {m} (B = {m,m+1,…}), provided G(i) = q^i?1, 1≦i≦m+2 (1≦i≦m+1), where 0<q<1.     

Minimizing the expected sample range

Let X_i be i.i.d. random variables with finite expectations, and θ_i arbitrary constants, i=1,…,n. Y_i=X_i+θ_i. The expected range of the Y's is R_n(θ₁,…,θ_n)=E(maxY_i-minY_i. It is shown that the expected range is minimized if and only if θ₁=?=θ_n. In the case where the X_i are independently and symmetrically distributed around the same constant, but not identically distributed, it is shown that θ₁=?=θ_n are not necessarily the only (θ₁,...,θ_n) minimizing R_n. Some lemmas which are applicable to more general problems of minimizing R_n are also given.     

Limiting distributions of Kolmogorov-Lévy-type statistics under the alternative

Let X_i, 1 ≤ i ≤ n, be independent identically distributed random variables with a common distribution function F, and let G be a smooth distribution function. We derive the limit distribution of □{ρ_α(F_n, G) - _α(F, G)}, where F_n is the empirical distribution function based on X₁,…,X_n and _α is a Kolmogorov-Lévy-type metric between distribution functions. For α ≤ 0 and two distribution functions F and G the metric p_α is given by p_α(F, G) = inf {? ≤ 0: G(x - α?) - ? F(x) ≤ G(x + α?) + ? for all x ?}.     

Bounds for Expectations of Differences of Generalized Order Statistics Based on General and Life Distributions

Let X _? ^(r), r ≥ 1, denote generalized order statistics based on an arbitrary distribution function F with finite pth absolute moment for some 1 ≤ p ≤ ∞. We present sharp upper bounds on E(X _? ^(s) ? X _? ^(r)), 1 ≤ r < s, for F being either general or life distribution. The bounds are expressed in various scale units generated by pth central absolute or raw moments of F, respectively. The distributions achieving the bounds are specified.