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.     

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

Asymptotic properties of the EPMC for modified linear discriminant analysis when sample size and dimension are both large

We deal with the problem of classifying a new observation vector into one of two known multivariate normal distributions when the dimension p and training sample size N   are both large with p<N$p<N$. Modified linear discriminant analysis (MLDA) was suggested by Xu et al. [10]. Error rate of MLDA is smaller than the one of LDA. However, if p and N   are moderately large, error rate of MLDA is close to the one of LDA. These results are conditional ones, so we should investigate whether they hold unconditionally. In this paper, we give two types of asymptotic approximations of expected probability of misclassification (EPMC) for MLDA as n→∞$n\to \infty$ with p=O(n^δ)$p=O(n^{\delta })$, 0<δ<1$0<\delta <1$. The one of two is the same as the asymptotic approximation of LDA, and the other is corrected version of the approximation. Simulation reveals that the modified version of approximation has good accuracy for the case in which p and N are moderately large.     

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.     

Optimal block designs for three treatments when observations are correlated

E$E$-optimal designs for comparing three treatments in blocks of size three are identified, where intrablock observations are correlated according to a first order autoregressive error process with parameter ρ∈(0,1)$\rho \in (0,1)$. For number of blocks b   of the form b=3n+1$b=3n+1$, there are two distinct optimal designs depending on the value of ρ$\rho$, with the best design being unequally replicated for large ρ$\rho$. For other values of b$b$, binary, equireplicate designs with specified within-block assignment patterns are best. In many cases, the stronger majorization optimality is established.     

Representations of moments using lower-order conditional moments

Moments and central moments of a random variable X   are expressed as integrals of functions of lower-order conditional moments and the cumulative distribution of X$X$. In particular, sample central moments of order 2k$2k$ are expressed as the sum of between groups variations, providing an analogue to the analysis of variance. Similar expressions are obtained for the expectations of real-valued and measurable functions of X$X$.     

Optimality of the quasi-score estimator in a mean–variance model with applications to measurement error models

We consider a regression of y$y$ on x$x$ given by a pair of mean and variance functions with a parameter vector θ$\theta$ to be estimated that also appears in the distribution of the regressor variable x$x$. The estimation of θ$\theta$ is based on an extended quasi-score (QS) function. We show that the QS estimator is optimal within a wide class of estimators based on linear-in-y$y$ unbiased estimating functions. Of special interest is the case where the distribution of x$x$ depends only on a subvector α$\alpha$ of θ$\theta$, which may be considered a nuisance parameter. In general, α$\alpha$ must be estimated simultaneously together with the rest of θ$\theta$, but there are cases where α$\alpha$ can be pre-estimated. A major application of this model is the classical measurement error model, where the corrected score (CS) estimator is an alternative to the QS estimator. We derive conditions under which the QS estimator is strictly more efficient than the CS estimator.     

Tools for constructing optimal two-level factorial designs for a linear model containing main effects and one two-factor interaction

In Hedayat and Pesotan [1992, Two-level factorial designs for main effects and selected two-factor interactions. Statist. Sinica 2, 453–464.] the concepts of a g(n,e)$g(n,e)$-design and a g(n,e)$g(n,e)$-matrix are introduced to study designs of n$n$ factor two-level experiments which can unbiasedly estimate the mean, the n$n$ main effects and e$e$ specified two-factor interactions appearing in an orthogonal polynomial model and it is observed that the construction of a g-design is equivalent to the construction of a g  -matrix. This paper deals with the construction of D-optimal g(n,1)$g(n,1)$-matrices. A standard form for a g(n,1)$g(n,1)$-matrix is introduced and some lower and upper bounds on the absolute determinant value of a D-optimal g(n,1)$g(n,1)$-matrix in the class of all g(n,1)$g(n,1)$-matrices are obtained and an approach to construct D-optimal g(n,1)$g(n,1)$-matrices is given for 2?n?8$2?n?8$. For two specific subclasses, namely a certain class of g(n,1)$g(n,1)$-matrices within the class of g(n,1)$g(n,1)$-matrices of index one and the class C(H)$C(H)$ of g(8t+2,1)$g(8t+2,1)$-matrices constructed from a normalized Hadamard matrix H   of order 8t+4(t?1)$8t+4(t?1)$ two techniques for the construction of the restricted D-optimal matrices are given.     

On asymptotic properties of the parameter estimator for a type of SPDE

In this paper, we study a random field _U?(t,x)$U_{?}(t,x)$ governed by some type of stochastic partial differential equations with an unknown parameter θ$\theta$ and a small noise ?$?$. We construct an estimator of θ$\theta$ based on the continuous observation of N   Fourier coefficients of _U?(t,x)$U_{?}(t,x)$, and prove the strong convergence and asymptotic normality of the estimator when the noise ?$?$ tends to zero.     

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.     

Minimum Hellinger distance estimation in a nonparametric mixture model

In this paper, we investigate the estimation problem of the mixture proportion λ$\lambda$ in a nonparametric mixture model of the form λF(x)+(1-λ)G(x)$\lambda F(x)+(1-\lambda )G(x)$ using the minimum Hellinger distance approach, where F and G are two unknown distributions. We assume that data from the distributions F and G   as well as from the mixture distribution λF+(1-λ)G$\lambda F+(1-\lambda )G$ are available. We construct a minimum Hellinger distance estimator of λ$\lambda$ and study its asymptotic properties. The proposed estimator is chosen to minimize the Hellinger distance between a parametric mixture model and a nonparametric density estimator. We also develop a maximum likelihood estimator of λ$\lambda$. Theoretical properties such as the existence, strong consistency, asymptotic normality and asymptotic efficiency of the proposed estimators are investigated. Robustness properties of the proposed estimator are studied using a Monte Carlo study. Two real data examples are also analyzed.     

Asymptotic linearity and limit distributions,approximations

Linear and quadratic forms as well as other low degree polynomials play an important role in statistical inference. Asymptotic results and limit distributions are obtained for a class of statistics depending on μ+X$\mu +\mathbf{X}$, with X any random vector and μ$\mu$ non-random vector with ∥μ∥→+∞$\parallel \mu \parallel \to +\infty$. This class contain the polynomials in μ+X$\mu +\mathbf{X}$. An application to the case of normal X is presented. This application includes a new central limit theorem which is connected with the increase of non-centrality for samples of fixed size. Moreover upper bounds for the suprema of the differences between exact and approximate distributions and their quantiles are obtained.     

Posterior convergence rates for Dirichlet mixtures of beta densities

We consider Bayesian density estimation for compactly supported densities using Bernstein mixtures of beta-densities equipped with a Dirichlet prior on the distribution function. We derive the rate of convergence for α$\alpha$-smooth densities for 0<α?2$0<\alpha ?2$ and show that a faster rate of convergence can be obtained by using fewer terms in the mixtures than proposed before. The Bayesian procedure adapts to the unknown value of α$\alpha$. The modified Bayesian procedure is rate-optimal if α$\alpha$ is at most one. This result can be extended to two dimensions.     

A counterexample to Beder's conjectures about Hadamard matrices

In this note we provide a counterexample which resolves conjectures about Hadamard matrices made in this journal. Beder [1998. Conjectures about Hadamard matrices. Journal of Statistical Planning and Inference 72, 7–14] conjectured that if H$\mathit{H}$ is a maximal m×n$m\times n$ row-Hadamard matrix then m is a multiple of 4; and that if n   is a power of 2 then every row-Hadamard matrix can be extended to a Hadamard matrix. Using binary integer programming we obtain a maximal 13×32$13\times 32$ row-Hadamard matrix, which disproves both conjectures. Additionally for n being a multiple of 4 up to 64, we tabulate values of m   for which we have found a maximal row-Hadamard matrix. Based on the tabulated results we conjecture that a m×n$m\times n$ row-Hadamard matrix with m?n-7$m?n-7$ can be extended to a Hadamard matrix.     

On the stability of the risk hull method for projection estimators

We consider in this paper the regularization by projection of a linear inverse problem Y=Af+εξ$Y=\mathit{Af}+\epsilon \xi$ where ξ$\xi$ denotes a Gaussian white noise, A   a compact operator and ε>0$\epsilon >0$ a noise level. Compared to the standard unbiased risk estimation (URE) method, the risk hull minimization (RHM) procedure presents a very interesting numerical behavior. However, the regularization in the singular value decomposition setting requires the knowledge of the eigenvalues of A$A$. Here, we deal with noisy eigenvalues: only observations on this sequence are available. We study the efficiency of the RHM method in this situation. More generally, we shed light on some properties usually related to the regularization with a noisy operator.     

Optimal step-stress testing for progressively Type-I censored data from exponential distribution

In this paper, a k  -step-stress accelerated life-testing is considered with an equal step duration τ$\tau$. For small to moderate sample sizes, a practical modification is made to the model previously considered by Gouno et al. [2004. Optimal step-stress test under progressive Type-I censoring. IEEE Trans. Reliability 53, 383–393] in order to guarantee a feasible k  -step-stress test under progressive Type-I censoring, and the optimal τ$\tau$ is determined under this model. Next, we discuss the determination of optimal τ$\tau$ under the condition that the step-stress test proceeds to the k  -th stress level, and the efficiency of this conditional inference is compared to that of the previous case. In all cases considered, censoring is allowed at each point of stress change (viz., iτ$i\tau$, i=1,2,…,k$i=1,2,\dots ,k$). The determination of optimal τ$\tau$ is discussed under C-optimality, D-optimality, and A-optimality criteria. We investigate in detail the case of progressively Type-I right censored data from an exponential distribution with a single stress variable.