Nonparametric estimation of conditional expectation

Denote the integer lattice points in the N  -dimensional Euclidean space by Z^N${\mathbb{Z}}^N$ and assume that (_Xi,_Yi)$(X_{\mathbf{i}},Y_{\mathbf{i}})$, i∈Z^N$\mathbf{i}\in {\mathbb{Z}}^N$ is a mixing random field. Estimators of the conditional expectation r(x)=E[_Yi|_Xi=x]$r(\mathbf{x})=\mathrm{E}[Y_{\mathbf{i}}|X_{\mathbf{i}}=\mathbf{x}]$ by nearest neighbor methods are established and investigated. The main analytical result of this study is that, under general mixing assumptions, the estimators considered are asymptotically normal. Many difficulties arise since points in higher dimensional space N?2$N?2$ cannot be linearly ordered. Our result applies to many situations where parametric methods cannot be adopted with confidence.     

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.     

Double shrink methodologies to determine the sample size via covariance structures

We consider fixed-size estimation for a linear function of mean vectors from _πi:_Np(_μi,_Σi)${\pi }_i:{\mathrm{N}}_p({\mathit{\mu }}_i,{\mathbf{\Sigma }}_i)$, i=1,…,k$i=1,\dots ,k$, when every _Σi${\mathbf{\Sigma }}_i$ has some structure. The goal of inference is to construct a fixed-span confidence region with required accuracy. We find a sample size for each _πi${\pi }_i$ with the help of the ‘double shrink methodology’, that is introduced by this paper, via covariance structures of _Σi${\mathbf{\Sigma }}_i$, i=1,…,k$i=1,\dots ,k$. We estimate the sample size in a two-stage sampling and give a fixed-span confidence region that has the coverage probability approximately second-order consistent with the required accuracy. Some simulations are carried out to see moderate sample size performances of the proposed methodologies.     

Distribution theory of quadratic forms for matrix multivariate elliptical distribution

This paper proposes the density and characteristic functions of a general matrix quadratic form X^(?)AX${\mathbf{X}}^{(?)}\mathbf{AX}$, when A=A^(?)$\mathbf{A}={\mathbf{A}}^{(?)}$ is a positive semidefinite matrix, X$\mathbf{X}$ has a matrix multivariate elliptical distribution and X^(?)${\mathbf{X}}^{(?)}$ denotes the usual conjugate transpose of X$\mathbf{X}$. These results are obtained for real normed division algebras. With particular cases we obtained the density and characteristic functions of matrix quadratic forms for matrix multivariate normal, Pearson type VII, t and Cauchy distributions.     

On the extremal behavior of a nonstationary normal random field

Let X={_Xn}n?1$\mathbf{X}=\{X_{\mathbf{n}}{\}}_{\mathbf{n}?\mathbf{1}}$ be a nonstationary random field satisfying a long range weak dependence for each coordinate at a time and a local dependence condition that avoids clustering of exceedances of high values. For these random fields, the probability of no exceedances of high values can be approximated by exp(−τ)$\exp (-\tau )$, where τ$\tau$ is the limiting mean number of exceedances. We present a class of nonstationary normal random fields for which this result can be applied.     

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.     

Linear sufficiency and completeness in the context of estimating the parametric function in the general Gauss–Markov model

In this paper we consider linear sufficiency and linear completeness in the context of estimating the estimable parametric function K^′β${\mathbf{K}}^{\prime }\mathit{\beta }$ under the general Gauss–Markov model {y,Xβ,σ²V}$\{\mathbf{y},\mathbf{X}\mathit{\beta },{\sigma }^2\mathbf{V}\}$. We give new characterizations for linear sufficiency, and define and characterize linear completeness in a case of estimation of K^′β${\mathbf{K}}^{\prime }\mathit{\beta }$. Also, we consider a predictive approach for obtaining the best linear unbiased estimator of K^′β${\mathbf{K}}^{\prime }\mathit{\beta }$, and subsequently, we give the linear analogues of the Rao–Blackwell and Lehmann–Scheffé Theorems in the context of estimating K^′β${\mathbf{K}}^{\prime }\mathit{\beta }$.     

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

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.     

Improving density estimators of discretely observed processes by interpolation

We consider density estimation for a smooth stationary process _Xt$X_t$, t∈R$t\in \mathbf{R}$, based on a discrete sample _Yi=_XΔi$Y_i=X_{\mathrm{\Delta }i}$, i=0,…,n=T/Δ$i=0,\dots ,n=T/\Delta$. By a suitable interpolation scheme of order p  , we augment data to form an approximation _Xp,t$X_{p,t}$, t∈[0,T]$t\in [0,T]$, of the continuous-time process and base our density estimate on the augmented sample path. Our results show that this can improve the rate of convergence (measured in terms of n) of the density estimate. Among other things, this implies that recording n   observations using a small Δ$\Delta$ can be more efficient than recording n independent observations.