Reduced-rank estimation of the difference between two covariance matrices

We consider m×m$m\times m$ covariance matrices, _Σ1${\Sigma }_1$ and _Σ2${\Sigma }_2$, which satisfy _Σ2-_Σ1=Δ${\Sigma }_2-{\Sigma }_1=\Delta$, where Δ$\Delta$ has a specified rank. Maximum likelihood estimators of _Σ1${\Sigma }_1$ and _Σ2${\Sigma }_2$ are obtained when sample covariance matrices having Wishart distributions are available and rank(Δ)$\text{rank}(\Delta )$ is known. The likelihood ratio statistic for a test about the value of rank(Δ)$\text{rank}(\Delta )$ is also given and some properties of its null distribution are obtained. The methods developed in this paper are illustrated through an example.     

Optimal global rates of convergence for nonparametric regression with unbounded data

Estimation of regression functions from independent and identically distributed data is considered. The _L2$L_2$ error with integration with respect to the design measure is used as an error criterion. Usually in the analysis of the rate of convergence of estimates a boundedness assumption on the explanatory variable X$X$ is made besides smoothness assumptions on the regression function and moment conditions on the response variable Y$Y$. In this article we consider the kernel estimate and show that by replacing the boundedness assumption on X$X$ by a proper moment condition the same (optimal) rate of convergence can be shown as for bounded data. This answers Question 1 in Stone [1982. Optimal global rates of convergence for nonparametric regression. Ann. Statist., 10, 1040–1053].     

Confidence intervals in regression utilizing prior information

We consider a linear regression model with regression parameter β=(_β1,…,_βp)$\beta =({\beta }_1,\dots ,{\beta }_p)$ and independent and identically N(0,σ²)$N(0,{\sigma }^2)$ distributed errors. Suppose that the parameter of interest is θ=a^Tβ$\theta =a^T\beta$ where a$a$ is a specified vector. Define the parameter τ=c^Tβ-t$\tau =c^T\beta -t$ where the vector c$c$ and the number t$t$ are specified and a$a$ and c$c$ are linearly independent. Also suppose that we have uncertain prior information that τ=0$\tau =0$. We present a new frequentist 1-α$1-\alpha$ confidence interval for θ$\theta$ that utilizes this prior information. We require this confidence interval to (a) have endpoints that are continuous functions of the data and (b) coincide with the standard 1-α$1-\alpha$ confidence interval when the data strongly contradict this prior information. This interval is optimal in the sense that it has minimum weighted average expected length where the largest weight is given to this expected length when τ=0$\tau =0$. This minimization leads to an interval that has the following desirable properties. This interval has expected length that (a) is relatively small when the prior information about τ$\tau$ is correct and (b) has a maximum value that is not too large. The following problem will be used to illustrate the application of this new confidence interval. Consider a 2×2$2\times 2$ factorial experiment with 20 replicates. Suppose that the parameter of interest θ$\theta$ is a specified simple   effect and that we have uncertain prior information that the two-factor interaction is zero. Our aim is to find a frequentist 0.95 confidence interval for θ$\theta$ that utilizes this prior information.     

The use of an identity in Anderson for multivariate multiple testing

Consider the model where there are I$I$ independent multivariate normal treatment populations with p×1$p\times 1$ mean vectors _μi${\mathit{\mu }}_i$, i=1,…,I$i=1,\dots ,I$, and covariance matrix Σ$\Sigma$. Independently the (I+1)$(I+1)$st population corresponds to a control and it too is multivariate normal with mean vector _μI+1${\mathit{\mu }}_{I+1}$ and covariance matrix Σ$\Sigma$. Now consider the following two multiple testing problems.     

Nonparametric Bayes estimation in repair models

Consider a sequence of dependent random variables _X1,_X2,…,_Xn$X_1,X_2,\dots ,X_n$, where _X1$X_1$ has distribution F (or probability measure P  ), and the distribution of _Xi+1$X_{i+1}$ given _X1,…,_Xi$X_1,\dots ,X_i$ and other covariates and environmental factors depends on F   and the previous data, i=1,…,n-1$i=1,\dots ,n-1$. General repair models give rise to such random variables as the failure times of an item subject to repair. There exist nonparametric non-Bayes methods of estimating F in the literature, for instance, Whitaker and Samaniego [1989. Estimating the reliability of systems subject to imperfect repair. J. Amer. Statist. Assoc. 84, 301–309], Hollander et al. [1992. Nonparametric methods for imperfect repair models. Ann. Statist. 20, 879–896] and Dorado et al. [1997. Nonparametric estimation for a general repair model. Ann. Statist. 25, 1140–1160], etc. Typically these methods apply only to special repair models and also require repair data on N independent items until exactly only one item is left awaiting a “perfect repair”.     

Generalizing Clatworthy group divisible designs

In this paper a neat construction is provided for three new families of group divisible designs that generalize some designs from Clatworthy's table of the only 11 designs with two associate classes that have block size four, three groups, and replication numbers at most 10. In each case (namely, _λ1=4${\lambda }_1=4$ and _λ2=5${\lambda }_2=5$, _λ1=4${\lambda }_1=4$ and _λ2=2${\lambda }_2=2$, and _λ1=8${\lambda }_1=8$ and _λ2=4${\lambda }_2=4$), we have proved that the necessary conditions found are also sufficient for the existence of such GDD's with block size four and three groups, with one possible exception.     

Optimally robust credible sets with a class of priors

We determine a credible set A   that is the “best” with respect to the variation of the prior distribution in a neighborhood Γ$\Gamma$ of the starting prior _π0(θ)${\pi }_0(\theta )$. Among the class of sets with credibility γ$\gamma$ under _π0${\pi }_0$, the “optimally robust” set will be the one which maximizes the minimum probability of including θ$\theta$ as the prior varies over Γ$\Gamma$. This procedure is also Γ-minimax$\Gamma \text{-minimax}$ with respect to the risk function, probability of non-inclusion. We find the optimally robust credible set for three neighborhood classes Γ$\Gamma$, the ε-contamination$\epsilon \text{-contamination}$ class, the density ratio class and the density bounded class. A consequence of this investigation is that the maximum likelihood set is seen to be an optimal credible set from a robustness perspective.     

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

Detecting linear sequences and subsequences

Greenwood [1946. The statistical study of infectious diseases (with discussion). J. Roy. Statist. Soc. 109, 85–110], using an _L2$L_2$ distance, and others have addressed the question of detecting a too-linear fit of the occurrence times _T0<_T1<?<_Tn$T_0<T_1<?<T_n$ of a sequence of random events. Two convenient distances are introduced here, then applied to the more challenging problem of detecting too-linear subsequences, where the multiple subsequence effect must be taken into account. Two interpretations of “linear subsequence” are considered.     

Lattice and Schröder paths with periodic boundaries

We consider paths in the plane with (1,0$1,0$), (0,1$0,1$), and (a,b$a,b$)-steps that start at the origin, end at height n$n$, and stay strictly to the left of a given non-decreasing right boundary. We show that if the boundary is periodic and has slope at most b/a$b/a$, then the ordinary generating function for the number of such paths ending at height n   is algebraic. Our argument is in two parts. We use a simple combinatorial decomposition to obtain an Appell relation or “umbral” generating function, in which the power zⁿ$z^n$ is replaced by a power series of the form zⁿ_φn(z),$z^n{\phi }_n(z),$ where _φn(0)=1.${\phi }_n(0)=1.$ Then we convert (in an explicit way) the umbral generating function to an ordinary generating function by solving a system of linear equations and a polynomial equation. This conversion implies that the ordinary generating function is algebraic. We give several concrete examples, including an alternative way to solve the tennis ball problem.     

Truncated linear estimation of a bounded multivariate normal mean

We consider the problem of estimating the mean θ$\theta$ of an _Np(θ,_Ip)${\mathrm{N}}_{\mathrm{p}}(\theta ,I_p)$ distribution with squared error loss ∥δ−θ∥²$\parallel \delta -\theta {\parallel }^2$ and under the constraint ∥θ∥≤m$\parallel \theta \parallel \le m$, for some constant m>0$m>0$. Using Stein's identity to obtain unbiased estimates of risk, Karlin's sign change arguments, and conditional risk analysis, we compare the risk performance of truncated linear estimators with that of the maximum likelihood estimator _δmle${\delta }_{\mathrm{mle}}$. We obtain for fixed (m,p)$(m,p)$ sufficient conditions for dominance. An asymptotic framework is developed, where we demonstrate that the truncated linear minimax estimator dominates _δmle${\delta }_{\mathrm{mle}}$, and where we obtain simple and accurate measures of relative improvement in risk. Numerical evaluations illustrate the effectiveness of the asymptotic framework for approximating the risks for moderate or large values of p.     

Alternatives to maximum likelihood estimation based on spacings and the Kullback–Leibler divergence

An alternative to the maximum likelihood (ML) method, the maximum spacing (MSP) method, is introduced in Cheng and Amin [1983. Estimating parameters in continuous univariate distributions with a shifted origin. J. Roy. Statist. Soc. Ser. B 45, 394–403], and independently in Ranneby [1984. The maximum spacing method. An estimation method related to the maximum likelihood method. Scand. J. Statist. 11, 93–112]. The method, as described by Ranneby [1984. The maximum spacing method. An estimation method related to the maximum likelihood method. Scand. J. Statist. 11, 93–112], is derived from an approximation of the Kullback–Leibler divergence. Since the introduction of the MSP method, several closely related methods have been suggested. This article is a survey of such methods based on spacings and the Kullback–Leibler divergence. These estimation methods possess good properties and they work in situations where the ML method does not. Important issues such as the handling of ties and incomplete data are discussed, and it is argued that by using Moran's [1951. The random division of an interval—Part II. J. Roy. Statist. Soc. Ser. B 13, 147–150] statistic, on which the MSP method is based, we can effectively combine: (a) a test on whether an assigned model of distribution functions is correct or not, (b) an asymptotically efficient estimation of an unknown parameter _θ0${\theta }_0$, and (c) a computation of a confidence region for _θ0${\theta }_0$.