Constrained Bayes and empirical Bayes estimation under random effects normal ANOVA model with balanced loss function

The paper develops constrained Bayes and empirical Bayes estimators in the random effects ANOVA model under balanced loss functions. In the balanced normal–normal model, estimators of the Bayes risks of the constrained Bayes and constrained empirical Bayes estimators are provided which are correct asymptotically up to O(m^-1)$\mathrm{O}(m^{-1})$, that is the remainder term is o(m^-1)$\mathrm{o}(m^{-1})$, m$m$ denoting the number of strata.     

Quasi-minimax estimation in the general linear regression model

This paper is mainly concerned with minimax estimation in the general linear regression model y=Xβ+ε$y=X\beta +\epsilon$ under ellipsoidal restrictions on the parameter space and quadratic loss function. We confine ourselves to estimators that are linear in the response vector y  . The minimax estimators of the regression coefficient β$\beta$ are derived under homogeneous condition and heterogeneous condition, respectively. Furthermore, these obtained estimators are the ridge-type estimators and mean dispersion error (MDE) superior to the best linear unbiased estimator b=(X^′W^-1X)^-1X^′W^-1y$b=(X^{\prime }{W}^{-1}X{)}^{-1}{X}^{\prime }{W}^{-1}y$ under some conditions.     

On E(s)-optimal supersaturated designs

A popular measure to assess 2-level supersaturated designs is the E(s²)$E(s^2)$ criterion. In this paper, improved lower bounds on E(s²)$E(s^2)$ are obtained. The same improvement has recently been established by Ryan and Bulutoglu [2007. E(s²)$E(s^2)$-optimal supersaturated designs with good minimax properties. J. Statist. Plann. Inference 137, 2250–2262]. However, our analysis provides more details on precisely when an improvement is possible, which is lacking in Ryan and Bulutoglu [2007. E(s²)$E(s^2)$-optimal supersaturated designs with good minimax properties. J. Statist. Plann. Inference 137, 2250–2262]. The equivalence of the bounds obtained by Butler et al. [2001. A general method of constructing E(s²)$E(s^2)$-optimal supersaturated designs. J. Roy. Statist. Soc. B 63, 621–632] (in the cases where their result applies) and those obtained by Bulutoglu and Cheng [2004. Construction of E(s²)$E(s^2)$-optimal supersaturated designs. Ann. Statist. 32, 1662–1678] is established. We also give two simple methods of constructing E(s²)$E(s^2)$-optimal designs.     

Rates of convergence for the k-nearest neighbor estimators with smoother regression functions

Let (X, Y  ) be a R^d×R-valued${\mathbb{R}}^d\times \mathbb{R}\mathrm{-}\mathrm{valued}$ random vector. In regression analysis one wants to estimate the regression function m(x)?E(Y|X=x)$m(x)?\mathbf{E}(Y|X=x)$ from a data set. In this paper we consider the rate of convergence for the k-nearest neighbor estimators in case that X   is uniformly distributed on [0,1]^d$[\mathrm{0,1}{]}^d$, Var(Y|X=x)$\mathbf{Var}(Y|X=x)$ is bounded, and m is (p, C)-smooth. It is an open problem whether the optimal rate can be achieved by a k  -nearest neighbor estimator for 1<p≤1.5$1<p\le 1.5$. We solve the problem affirmatively. This is the main result of this paper. Throughout this paper, we assume that the data is independent and identically distributed and as an error criterion we use the expected L₂ error.     

Sharp upper bounds for the expected values of non-extreme order statistics from discrete distributions

We consider the problem of determining sharp upper bounds on the expected values of non-extreme order statistics based on i.i.d. random variables taking on N values at most. We show that the bound problem is equivalent to the problem of establishing the best approximation of the projection of the density function of the respective order statistic based on the standard uniform i.i.d. sample onto the family of non-decreasing functions by arbitrary N  -valued functions in the norm of L²(0,1)$L^2(0,1)$ space. We also present an algorithm converging to the local minima of the approximation problems.     

On batch queueing systems: A combinatorial approach

We consider batch queueing systems M/M^H/1$M/M^H/1$ and M^H/M/1$M^H/M/1$ with catastrophes. The transient probability functions of these queueing systems are obtained by a Lattice Path Combinatorics approach that utilizes randomization and dual processes. Steady state distributions are also determined. Generalization to systems having batches of different sizes are discussed.     

Addition of runs to an s-level supersaturated design

The purpose of the present work is to extend the work of Gupta et al. (2010) to s  -level column balanced supersaturated designs. Addition of runs to an existing E(χ²)-optimal$E({\chi }^2)\mathrm{-}\mathrm{optimal}$ supersaturated design and to study the optimality of the resulting design is an important issue. This paper considers the study of the optimality of the resulting design. A lower bound to E(χ²)$E({\chi }^2)$ has been obtained for the extended supersaturated designs. Some examples and a small catalogue of E(χ²)-optimal$E({\chi }^2)\mathrm{-}\mathrm{optimal}$ supersaturated designs are also presented.     

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.     

Local asymptotic minimax theory for block-decreasing densities

In this paper, we study Lebesgue densities on (0,∞)^d$(0,\infty {)}^d$ that are non-increasing in each coordinate, while keeping all other coordinates fixed, from the perspective of local asymptotic minimax lower bound theory. In particular, we establish a local optimal rate of convergence of the order n^−1/(d+2)$n^{-1/(d+2)}$.     

Testing of a sub-hypothesis in linear regression models with long memory errors and deterministic design

This paper considers the problem of testing a sub-hypothesis in homoscedastic linear regression models where errors form long memory moving average processes and designs are non-random. Unlike in the random design case, asymptotic null distribution of the likelihood ratio type test based on the Whittle quadratic form is shown to be non-standard and non-chi-square. Moreover, the rate of consistency of the minimum Whittle dispersion estimator of the slope parameter vector is shown to be n^-(1-α)/2$n^{-(1-\alpha )/2}$, different from the rate n^-1/2$n^{-1/2}$ obtained in the random design case, where α$\alpha$ is the rate at which the error spectral density explodes at the origin. The proposed test is shown to be consistent against fixed alternatives and has non-trivial asymptotic power against local alternatives that converge to null hypothesis at the rate n^-(1-α)/2$n^{-(1-\alpha )/2}$.     

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.     

Berry–Esseen type bounds for trimmed U-statistics

Trimmed U  -statistics can be constructed in two different ways: by basing the statistic on a trimmed sample or by averaging the trimmed set of kernel values. Mild conditions are given to ensure the rate of convergence to normality is O(n^-1/2)$\mathrm{O}(n^{-1/2})$ in both cases.     

Double-smoothing for bias reduction in local linear regression

Local linear regression involves fitting a straight line segment over a small region whose midpoint is the target point x, and the local linear estimate at x   is the estimated intercept of that straight line segment, with an asymptotic bias of order h²$h^2$ and variance of order (nh)^-1$(\mathit{nh}{)}^{-1}$ (h is the bandwidth). In this paper, we propose a new estimator, the double-smoothing local linear estimator, which is constructed by integrally combining all fitted values at x   of local lines in its neighborhood with another round of smoothing. The proposed estimator attempts to make use of all information obtained from fitting local lines. Without changing the order of variance, the new estimator can reduce the bias to an order of h⁴$h^4$. The proposed estimator has better performance than local linear regression in situations with considerable bias effects; it also has less variability and more easily overcomes the sparse data problem than local cubic regression. At boundary points, the proposed estimator is comparable to local linear regression. Simulation studies are conducted and an ethanol example is used to compare the new approach with other competitive methods.     

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.     

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.