A stochastic Newton-Raphson method

A stochastic approximation procedure of the Robbins-Monro type is considered. The original idea behind the Newton-Raphson method is used as follows. Given n approximations X₁,…, X_n with observations Y₁,…, Y_n, a least squares line is fitted to the points (X_m, Y_m),…, (X_n, Y_n) where m<n may depend on n. The (n+1)st approximation is taken to be the intersection of the least squares line with y=0. A variation of the resulting process is studied. It is shown that this process yields a strongly consistent sequence of estimates which is asymptotically normal with minimal asymptotic variance.     

Die waldsche fundamentalidentität und ein sequentieller quotiententest für eine zufäallige irrfahrtüber einer homogenen irreduziblen markovschen kette mit endlichem zustandsraum

For a random walk {R _n ≥0} given on a homogeneous irreducible finite MARKOV chain {X _n ≥0} the identity (8) is obtained. Generalizations (14)-(16) of WALD's Fundamental Identity and WALD's first and second equations for the two-dimensional process {(R _n ,X _n ), n≥0} are proved. The Average Sample Number (21)-(22) and the Operating Characteristic Function (24)-(25) of a Sequential Probability Ratio Test follow. With this test a decision about two simple hypotheses on the unknown transition probability matrix of {X _n , n≥0} and the unknown parameters of the probability distributions for the increments of {X _n , n≥0} can be made. For a special case these results were proved by PHATARFOD [6] and KüCHLER [3] with other methods.     

Asymptotic distribution of data-driven smoothers in density and regression estimation under dependence

We consider automatic data-driven density, regression and autoregression estimates, based on any random bandwidth selector h/_T. We show that in a first-order asymptotic approximation they behave as well as the related estimates obtained with the “optimal” bandwidth h_T as long as h_T/h_T → 1 in probability. The results are obtained for dependent observations; some of them are also new for independent observations.     

ON THE NUMBER OF RECORDS NEAR THE MAXIMUM

Recent work has considered properties of the number of observations X_j, independently drawn from a discrete law, which equal the sample maximum X_(n) The natural analogue for continuous laws is the number K_n(a) of observations in the interval (X_(n)–a, X_(n)], where a > 0. This paper derives general expressions for the law, first moment, and probability generating function of K_n(a), mentioning examples where evaluations can be given. It seeks limit laws for n→ and finds a central limit result when a is fixed and the population law has a finite right extremity. Whenever the population law is attracted to an extremal law, a limit theorem can be found by letting a depend on n in an appropriate manner; thus the limit law is geometric when the extremal law is the Gumbel type. With these results, the paper obtains limit laws for ‘top end’ spacings X_(n) - X_(n-j) with j fixed.     

A sequential design for a clinical trial with a linear prognostic factor

We study a randomized adaptive design to assign one of the L$L$ treatments to patients who arrive sequentially by means of an urn model. At each stage n$n$, a reward is distributed between treatments. The treatment applied is rewarded according to its response, 0?_Yn?1$0?Y_n?1$, and 1-_Yn$1-Y_n$ is distributed among the other treatments according to their performance until stage n-1$n-1$. Patients can be classified in K+1$K+1$ levels and we assume that the effect of this level in the response to the treatments is linear. We study the asymptotic behavior of the design when the ordinary least square estimators are used as a measure of performance until stage n-1$n-1$.     

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 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.     

Three-stage and accelerated sequential point estimation of the normal mean using LINEX loss function

Consider a normal population with unknown mean μ and unknown variance σ². We estimate μ under an asymmetric LINEX loss function such that the associated risk is bounded from above by a known quantity w. This necessitates the use of a random number (N) of observations. Under a fairly broad set of assumptions on N, we derive the asymptotic second-order expansion of the associated risk function. Some examples have been included involving accelerated sequential and three-stage sampling techniques. Performance comparisons of these procedures are considered using a Monte-Carlo study.     

Sequential Fixed-Width Confidence Interval for a Function of the Parameters

Let X₁…, X_m and Y₁…, Y_n be two independent sequences of i.i.d. random variables with distribution functions F_x(.|θ) and F_y(. | φ) respectively. Let g(θ, φ) be a real-valued function of the unknown parameters θ and φ. The purpose of this paper is to suggest a sequential procedure which gives a fixed-width confidence interval for g(θ, φ) so that the coverage probability is approximately α (preas-signed). Certain asymptotic optimality properties of the sequential procedure are established. A Monte Carlo study is presented.     

A formula for P(bi≤Ri≤ai, 1≤i≤m) under a general class of alternatives

Let X_i≤?≤X_m and Y_i≤?≤Y_n be two sets of independent order statistics from continous distributions with distribution functions F and G respectively. Let R_i denote the rank of X_i in the combined order sample. Steck (1980) has found an expression for P(b_i≤R_i≤a_i, all i) when F = h(G), h being the incomplete beta function with parameters (α,β?α+1). An alternative expression for the same probability is obtained which is computationally a substantial improvement on Steck's result.     

Sequential Estimation of Expectations in the Presence of Trend2

A sequence of independent random variables {Z_n:n≥ 1} with unknown probability distributions is considered and the problem of estimating their expectations {M_n+1: n≥ 1} is examined. The estimation of M_n+1 is based on a finite set {z_k:1≤k≤n}, each z_k being an observed value of Z_k, 1 ≤k≤n, and also based on the assumption that {M_n:n≥ 1} follows an unknown trend of a specified form.     

The uniform convergence of the nadaraya-watson regression function estimate

If (X₁,Y₁), …, (X_n,Y_n) is a sequence of independent identically distributed R_d × R-valued random vectors then Nadaraya (1964) and Watson (1964) proposed to estimate the regression function m(x) = ? {Y₁|X₁ = x{ by where K is a known density and {h_n} is a sequence of positive numbers satisfying certain properties. In this paper a variety of conditions are given for the strong convergence to 0 of ess_Xsup|m_n (X)-m(X)| (here X is independent of the data and distributed as X₁). The theorems are valid for all distributions of X₁ and for all sequences {h_n} satisfying h_n → 0 and nh/log n→0.     

Improved Ordering Results for Fail-Safe Systems with Exponential Components

Let X_{2: n} and Y_{2: m} be the second order statistics from n independent exponential variables with hazards λ₁, …, λ_n, and an independent exponential sample of size m with hazard change to λ, respectively. When m ? n, we obtain necessary and sufficient conditions for comparing X_{2: n} and Y_{2: m} in mean residual life, dispersive, hazard rate, and likelihood ratio orderings based on some inequalities between λ_i’s and λ. The established results show how one can compare an (n ? 1)-out-of-n system consisting of heterogeneous components with exponential lifetimes with any (m ? 1)-out-of-m system consisting of homogeneous components with exponential lifetimes.     

The superharmonic condition for simultaneous estimation of means in exponential familles

The mean vector associated with several independent variates from the exponential subclass of Hudson (1978) is estimated under weighted squared error loss. In particular, the formal Bayes and “Stein-like” estimators of the mean vector are given. Conditions are also given under which these estimators dominate any of the “natural estimators”. Our conditions for dominance are motivated by a result of Stein (1981), who treated the N_p (θ, I) case with p ≥ 3. Stein showed that formal Bayes estimators dominate the usual estimator if the marginal density of the data is superharmonic. Our present exponential class generalization entails an elliptic differential inequality in some natural variables. Actually, we assume that each component of the data vector has a probability density function which satisfies a certain differential equation. While the densities of Hudson (1978) are particular solutions of this equation, other solutions are not of the exponential class if certain parameters are unknown. Our approach allows for the possibility of extending the parametric Stein-theory to useful nonexponential cases, but the problem of nuisance parameters is not treated here.     

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.     

Modified inference function for margins for the bivariate clayton copula-based SUN Tobit Model

This paper extends the analysis of the bivariate Seemingly Unrelated Regression (SUN) Tobit model by modeling its nonlinear dependence structure through the Clayton copula. The ability to capture/model the lower tail dependence of the SUN Tobit model where some data are censored (generally, left-censored at zero) is an useful feature of the Clayton copula. We propose a modified version of the (classical) Inference Function for Margins (IFS) method by Joe and XP [H. Joe and J.J. XP, The estimation method of inference functions for margins for multivariate models, Tech. Rep. 166, Department of Statistics, University of British Columbia, 1996], which we refer to as Modified Inference Function for Margins (MIFF) method, to obtain the (point) estimates of the marginal and Clayton copula parameters. More specifically, we employ the (frequenting) data augmentation technique at the second stage of the IFS method (the first stage of the MIFF method is equivalent to the first stage of the IFS method) to generate the censored observations and then estimate the Clayton copula parameter. This process (data augmentation and copula parameter estimation) is repeated until convergence. Such modification at the second stage of the usual estimation method is justified in order to obtain continuous marginal distributions, which ensures the uniqueness of the resulting Clayton copula, as stated by Solar's [A. Solar, Fonctions de répartition à n dimensions et leurs marges, Publ. de l'Institut de Statistique de l'Université de Paris 8 (1959), pp. 229–231] theorem; and also to provide an unbiased estimate of the association parameter (the IFS method provides a biased estimate of the Clayton copula parameter in the presence of censored observations in both margins). Since the usual asymptotic approach, that is the computation of the asymptotic covariance matrix of the parameter estimates, is troublesome in this case, we also propose the use of resampling procedures (bootstrap methods, such as standard normal and percentile, by Efron and Tibshirani [B. Efron and R.J. Tibshirani, An Introduction to the Bootstrap, Chapman & Hall, New York, 1993] to obtain confidence intervals for the model parameters.     

One-sided tolerance limits for unbalanced one-way anova andomc effects model

In this article, we investigate techniques for constructing tolerance limits such that the probability is γ that at least _p proportion of the population would exceed that limit. We consider the unbalanced case and study the behavior of the limit as a function of n_i 's (where n_i is the number of observations in the ith batch), as well as that of the variance ratio. To construct the tolerance limits we use the approximation given in Thomas and Hultquist (1978). We also discuss the procedure for constructing the tolerance limits when the variance ratio is unknown. An example is given to illustrate the results.     

Randomly weighted average with Dirichlet component proportions

This article introduces a new average of n independent continuous random variables X₁, …, X_n weighted by Dirichlet random components. A relation between the Cauchy–Stieltjes transforms of the distribution functions of this weighted average and X₁, …, X_n is established. Several examples illustrate usefulness and applicability of the result.     

A Restricted Subset Selection Rule for Selecting at Least One of the t Best Normal Populations in Terms of Their Means When Their Common Variance is Known,Case II

Consider k( ? 2) normal populations with unknown means μ₁, …, μ_k, and a common known variance σ². Let μ_[1] ? ??? ? μ_[k] denote the ordered μ_i.The populations associated with the t(1 ? t ? k ? 1) largest means are called the t best populations. Hsu and Panchapakesan (2004) proposed and investigated a procedure R_HPfor selecting a non empty subset of the k populations whose size is at most m(1 ? m ? k ? t) so that at least one of the t best populations is included in the selected subset with a minimum guaranteed probability P* whenever μ_{[k ? t + 1]} ? μ_{[k ? t]} ? δ*, where P*?and?δ* are specified in advance of the experiment. This probability requirement is known as the indifference-zone probability requirement. In the present article, we investigate the same procedure R_HP for the same goal as before but when k ? t < m ? k ? 1 so that at least one of the t best populations is included in the selected subset with a minimum guaranteed probability P* whatever be the configuration of the unknown μ_i. The probability requirement in this latter case is termed the subset selection probability requirement. Santner (1976) proposed and investigated a different procedure (R_S) based on samples of size n from each of the populations, considering both cases, 1 ? m ? k ? t and k ? t < m ? k. The special case of t = 1 was earlier studied by Gupta and Santner (1973) and Hsu and Panchapakesan (2002) for their respective procedures.     

Selecting the normal population with the smallest variance: A restricted subset selection rule

Consider k( ? 2) normal populations whose means are all known or unknown and whose variances are unknown. Let σ²_[1] ? ??? ? σ_[k]² denote the ordered variances. Our goal is to select a non empty subset of the k populations whose size is at most m(1 ? m ? k ? 1) so that the population associated with the smallest variance (called the best population) is included in the selected subset with a guaranteed minimum probability P* whenever σ²_[2]/σ_[1]² ? δ* > 1, where P* and δ* are specified in advance of the experiment. Based on samples of size n from each of the populations, we propose and investigate a procedure called R_BCP. We also derive some asymptotic results for our procedure. Some comparisons with an earlier available procedure are presented in terms of the average subset sizes for selected slippage configurations based on simulations. The results are illustrated by an example.