On the uth geometric conditional quantile

Motivated by Chaudhuri's work [1996. On a geometric notion of quantiles for multivariate data. J. Amer. Statist. Assoc. 91, 862–872] on unconditional geometric quantiles, we explore the asymptotic properties of sample geometric conditional quantiles, defined through kernel functions, in high-dimensional spaces. We establish a Bahadur-type linear representation for the geometric conditional quantile estimator and obtain the convergence rate for the corresponding remainder term. From this, asymptotic normality including bias on the estimated geometric conditional quantile is derived. Based on these results, we propose confidence ellipsoids for multivariate conditional quantiles. The methodology is illustrated via data analysis and a Monte Carlo study.     

Convergence rates for smoothing spline estimators in varying coefficient models

We consider the estimation of a multiple regression model in which the coefficients change slowly in “time”, with “time” being an additional covariate. Under reasonable smoothness conditions, we prove the usual expected mean square error bounds for the smoothing spline estimators of the coefficient functions.     

Redescending M-estimators

In finite sample studies redescending M-estimators outperform bounded M-estimators (see for example, Andrews et al. [1972. Robust Estimates of Location. Princeton University Press, Princeton]). Even though redescenders arise naturally out of the maximum likelihood approach if one uses very heavy-tailed models, the commonly used redescenders have been derived from purely heuristic considerations. Using a recent approach proposed by Shurygin, we study the optimality of redescending M-estimators. We show that redescending M-estimator can be designed by applying a global minimax criterion to locally robust estimators, namely maximizing over a class of densities the minimum variance sensitivity over a class of estimators. As a particular result, we prove that Smith's estimator, which is a compromise between Huber's skipped mean and Tukey's biweight, provides a guaranteed level of an estimator's variance sensitivity over the class of densities with a bounded variance.     

Kernel regression estimation in a Banach space

In this paper, we study a nonparametric regression estimator when the response variable is in a separable Banach space and the explanatory variable takes values in a separable semi-metric space. Under general conditions, we establish some asymptotic results and give upper bounds for the p$p$-mean and almost sure (pointwise and integrated) estimation errors. Finally, we present the case where the explanatory variable is the Wiener process.     

Shrinkage and Orthogonal Decomposition

ABSTRACT. The problem of estimating the mean of a multivariate normal distribution when the parameter space allows an orthogonal decomposition is discussed. Risk functions and lower bounds for a class of shrinkage estimators that includes Stein's estimator are derived, and an improvement on Stein's estimator that takes advantage of the orthogonal decomposition is introduced. Uniform asymptotics related to Pinsker's minimax risk is derived and we give conditions for attaining the lower risk bound. Special cases including regression and analysis of variance are discussed.     

Oracle Inequalities for Convex Loss Functions with Nonlinear Targets

This article considers penalized empirical loss minimization of convex loss functions with unknown target functions. Using the elastic net penalty, of which the Least Absolute Shrinkage and Selection Operator (Lasso) is a special case, we establish a finite sample oracle inequality which bounds the loss of our estimator from above with high probability. If the unknown target is linear, this inequality also provides an upper bound of the estimation error of the estimated parameter vector. Next, we use the non-asymptotic results to show that the excess loss of our estimator is asymptotically of the same order as that of the oracle. If the target is linear, we give sufficient conditions for consistency of the estimated parameter vector. We briefly discuss how a thresholded version of our estimator can be used to perform consistent variable selection. We give two examples of loss functions covered by our framework.     

An asymptotically distribution-free test of symmetry

A procedure, based on sample spacings, is proposed for testing whether a univariate distribution is symmetric about some unknown value. The proposed test is a modification of a sign test suggested by Antille and Kersting [1977. Tests for symmetry. Z. Wahrscheinlichkeitstheorie verw. Gebiete 39, 235–255], but unlike Antille and Kersting's test, our modified test is asymptotically distribution-free and is usable in practice. A simulation study indicates that the proposed test maintains the nominal level of significance, α$\alpha$ fairly accurately even for samples of size as small as 20, and a comparison with the classical test based on sample coefficient of skewness, shows that our test has good power for detecting different asymmetric distributions.     

Limit theory of generalized order statistics

Generalized order statistics (gos) were introduced by Kamps [1995. A Concept of Generalized Order Statistics. Teubner, Stuttgart] to unify several models of ordered random variables (rv's), e.g., (ordinary) order statistics (oos), records, sequential order statistics (sos). In a wide subclass of gos that includes oos and sos, the possible limit distribution functions (df's) of the maximum gos are obtained in Nasri-Roudsari [1996. Extreme value theory of generalized order statistics. J. Statist. Plann. Inference 55, 281–297]. In this paper, for this subclass, necessary and sufficient conditions of weak convergence, as well as the form of the possible limit df's of extreme, intermediate and central gos are derived. These results are extended to a wider subclass.     

Parametric and semiparametric hypotheses in the linear model

The independent additive errors linear model consists of a structure for the mean and a separate structure for the error distribution. The error structure may be parametric or it may be semiparametric. Under alternative values of the mean structure, the best fitting additive errors model has an error distribution which can be represented as the convolution of the actual error distribution and the marginal distribution of a misspecification term. The model misspecification term results from the covariates' distribution. Conditions are developed to distinguish when the semiparametric model yields sharper inference than the parametric model and vice versa. The main conditions concern the actual error distribution and the covariates' distribution. The theoretical results explain a paradoxical finding in semiparametric Bayesian modelling, where the posterior distribution under a semiparametric model is found to be more concentrated than is the posterior distribution under a corresponding parametric model. The paradox is illustrated on a set of allometric data. The Canadian Journal of Statistics 39: 165–180; 2011 ©2011 Statistical Society of Canada     

A bias correction and acceleration approach for the problem of regions

For testing the problem of regions in the space of distribution functions, this paper considers approaches to modify the bootstrap probability to be a second-order accurate p$p$-value based on the familiar bias correction and acceleration method. It is shown that Shimodaira's [2004a. Approximately unbiased tests of regions using multistep-multiscale bootstrap resampling. Ann. Statist. 32, 2616–2641] twostep-multiscale bootstrap method works even in the problem of regions in functional space. In this paper the bias correction quantity is estimated by his onestep-multiscale bootstrap method. Instead of using the twostep-multiscale bootstrap method, the acceleration constant is estimated by a newly proposed jackknife method which requires first-level bootstrap resamplings only. Some numerical examples are illustrated, in which an application to testing significance in model selection is included.     

Some properties of tests for parameters that can be arbitrarily close to being unidentified

Confidence intervals for parameters that can be arbitrarily close to being unidentified are unbounded with positive probability [e.g. Dufour, J.-M., 1997. Some impossibility theorems in econometrics with applications to instrumental variables and dynamic models. Econometrica 65, 1365–1388; Pfanzagl, J. 1998. The nonexistence of confidence sets for discontinuous functionals. Journal of Statistical Planning and Inference 75, 9–20], and the asymptotic risks of their estimators are unbounded [Pötscher, B.M., 2002. Lower risk bounds and properties of confidence sets for ill-posed estimation problems with applications to spectral density and persistence estimation, unit roots, and estimation of long memory parameters. Econometrica 70, 1035–1065]. We extend these “impossibility results” and show that all tests of size α concerning parameters that can be arbitrarily close to being unidentified have power that can be as small as α for any sample size even if the null and the alternative hypotheses are not adjacent. The results are proved for a very general framework that contains commonly used models.     

Wilcoxon–Mann–Whitney test for stratified samples and Efron's paradox dice

Two-treatment multi-center clinical trials are the most common type of clinical trials in practice. The aim of this paper is to discuss a curious property of certain standard nonparametric procedures used in the analysis of such clinical trials. Different analyses of a simulated data example are presented, which lead to contrasting and surprising results. The source of the potentially misleading outcome is then explored while relating the simulated data with the concept of Efron's paradox dice and the notion of nontransitivity. With the root of the problem established, an alternate nonparametric method from the literature is shown to address the problem. Finally, pointing out an interpretational concern of using the alternate procedure, a modification to this procedure is also suggested and corresponding theoretical results are presented.     

Characterization of certain incomplete block designs

It is shown that certain inequalities known for partially balanced incomplete block (PBIB) designs remain valid for general incomplete block designs. Some conditions for attaining their bounds are also given. Furthermore, the various types of PBIB designs are characterized by relating blocks of designs with association schemes. The approach here is based on the spectral expansion of NN' for the incidence matrix N of an incomplete block design.     

Adaptation over parametric families of symmetric linear estimators

This paper treats an abstract parametric family of symmetric linear estimators for the mean vector of a standard linear model. The estimator in this family that has smallest estimated quadratic risk is shown to attain, asymptotically, the smallest risk achievable over all candidate estimators in the family. The asymptotic analysis is carried out under a strong Gauss–Markov form of the linear model in which the dimension of the regression space tends to infinity. Leading examples to which the results apply include: (a) penalized least squares fits constrained by multiple, weighted, quadratic penalties; and (b) running, symmetrically weighted, means. In both instances, the weights define a parameter vector whose natural domain is a continuum.     

Adaptive wavelet estimation of a density from mixtures under multiplicative censoring

In this paper, a mixture model under multiplicative censoring is considered. We investigate the estimation of a component of the mixture (a density) from the observations. A new adaptive estimator based on wavelets and a hard thresholding rule is constructed for this problem. Under mild assumptions on the model, we study its asymptotic properties by determining an upper bound of the mean integrated squared error over a wide range of Besov balls. We prove that the obtained upper bound is sharp.     

Confidence intervals on intraclass correlation coefficients in a balanced two-factor random design

A modified large-sample (MLS) approach and a generalized confidence interval (GCI) approach are proposed for constructing confidence intervals for intraclass correlation coefficients. Two particular intraclass correlation coefficients are considered in a reliability study. Both subjects and raters are assumed to be random effects in a balanced two-factor design, which includes subject-by-rater interaction. Computer simulation is used to compare the coverage probabilities of the proposed MLS approach (GiTTCH) and GCI approaches with the Leiva and Graybill [1986. Confidence intervals for variance components in the balanced two-way model with interaction. Comm. Statist. Simulation Comput. 15, 301–322] method. The competing approaches are illustrated with data from a gauge repeatability and reproducibility study. The GiTTCH method maintains at least the stated confidence level for interrater reliability. For intrarater reliability, the coverage is accurate in several circumstances but can be liberal in some circumstances. The GCI approach provides reasonable coverage for lower confidence bounds on interrater reliability, but its corresponding upper bounds are too liberal. Regarding intrarater reliability, the GCI approach is not recommended because the lower bound coverage is liberal. Comparing the overall performance of the three methods across a wide array of scenarios, the proposed modified large-sample approach (GiTTCH) provides the most accurate coverage for both interrater and intrarater reliability.     

Lower Bounds for the Efficiency of Designs with Respect to the D-Criterion when the Observations are Correlated

In the general linear model consider the experimental design problem for the Gauß-Markov estimator or least squares estimator when the observations are correlated. We prove new formulas for the efficiency of an exact design with respect to the D-criterion. For models with intercept term, for example, these formulas are useful to derive better lower bounds for the efficiency than the bounds recently given for an arbitrary linear model. These bounds are applied in examples to symmetrical regular circulants as covariance matrices. A byproduct of the investigations is some insight as to what kinds of designs might retain their optimality or high efficiency (for the uncorrelated homoscedastic case) under correlated observations.     

Bias bound for the minimax estimator

The bias bound function of an estimator is an important quantity in order to perform globally robust inference. We show how to evaluate the exact bias bound for the minimax estimator of the location parameter for a wide class of unimodal symmetric location and scale family. We show, by an example, how to obtain an upper bound of the bias bound for a unimodal asymmetric location and scale family. We provide the exact bias bound of the minimum distance/disparity estimators under a contamination neighborhood generated from the same distance.     

Optimal discrimination designs for exponential regression models

We investigate optimal designs for discriminating between exponential regression models of different complexity, which are widely used in the biological sciences; see, e.g., Landaw [1995. Robust sampling designs for compartmental models under large prior eigenvalue uncertainties. Math. Comput. Biomed. Appl. 181–187] or Gibaldi and Perrier [1982. Pharmacokinetics. Marcel Dekker, New York]. We discuss different approaches for the construction of appropriate optimality criteria, and find sharper upper bounds on the number of support points of locally optimal discrimination designs than those given by Caratheodory's Theorem. These results greatly facilitate the numerical construction of optimal designs. Various examples of optimal designs are then presented and compared to different other designs. Moreover, to protect the experiment against misspecifications of the nonlinear model parameters, we adapt the design criteria such that the resulting designs are robust with respect to such misspecifications and, again, provide several examples, which demonstrate the advantages of our approach.     

Lower bounds on expectations of positive L-statistics from without-replacement models

We consider samples drawn without replacement from finite populations. We establish optimal lower non-negative and upper non-positive bounds on the expectations of linear combinations of order statistics centered about the population mean in units generated by the population central absolute moments of various orders. We also specify the general results for important examples of sample extremes, Gini mean differences and sample range. The paper completes the results of Papadatos and Rychlik [2004. Bounds on expectations of L-statistics from without replacement samples. J. Statist. Plann. Inference 124, 317–336], where sharp negative lower and positive upper bounds on the expectations of the combinations were presented for the without-replacement samples.