The rank of the covariance matrix of an evanescent field

Evanescent random fields arise as a component of the 2D Wold decomposition of homogeneous random fields. Besides their theoretical importance, evanescent random fields have a number of practical applications, such as in modeling the observed signal in the space-time adaptive processing (STAP) of airborne radar data. In this paper we derive an expression for the rank of the low-rank covariance matrix of a finite dimension sample from an evanescent random field. It is shown that the rank of this covariance matrix is completely determined by the evanescent field spectral support parameters, alone. Thus, the problem of estimating the rank lends itself to a solution that avoids the need to estimate the rank from the sample covariance matrix. We show that this result can be immediately applied to considerably simplify the estimation of the rank of the interference covariance matrix in the STAP problem.     

On an asymptotically more efficient estimation of the single-index model

In this note, we revisit the single-index model with heteroscedastic error, and recommend an estimating equation method in terms of transferring restricted least squares to unrestricted least squares: the estimator of the index parameter is asymptotically more efficient than existing estimators in the literature in the sense that it is of a smaller limiting variance.     

Quantization and clustering with Bregman divergences

This paper deals with the problem of quantization of a random variable X taking values in a separable and reflexive Banach space, and with the related question of clustering independent random observations distributed as X. To this end, we use a quantization scheme with a class of distortion measures called Bregman divergences, and provide conditions ensuring the existence of an optimal quantizer and an empirically optimal quantizer. Rates of convergence are also discussed.     

Curve forecasting by functional autoregression

This paper deals with the prediction of curve-valued autoregression processes. It develops a novel technique, predictive factor decomposition, for the estimation of the autoregression operator. The technique is based on finding a reduced-rank approximation to the autoregression operator that minimizes the expected squared norm of the prediction error.Implementing this idea, we relate the operator approximation problem to the singular value decomposition of a combination of cross-covariance and covariance operators. We develop an estimation method based on regularization of the empirical counterpart of this singular value decomposition, prove its consistency and evaluate convergence rates.The method is illustrated by an example of the term structure of the Eurodollar futures rates. In the sample corresponding to the period of normal growth, the predictive factor technique outperforms the principal components method and performs on a par with custom-designed prediction methods.     

Admissibility and minimaxity of generalized Bayes estimators for spherically symmetric family

We give a sufficient condition for admissibility of generalized Bayes estimators of the location vector of spherically symmetric distribution under squared error loss. Compared to the known results for the multivariate normal case, our sufficient condition is very tight and is close to being a necessary condition. In particular, we establish the admissibility of generalized Bayes estimators with respect to the harmonic prior and priors with slightly heavier tail than the harmonic prior. We use the theory of regularly varying functions to construct a sequence of smooth proper priors approaching an improper prior fast enough for establishing the admissibility. We also discuss conditions of minimaxity of the generalized Bayes estimator with respect to the harmonic prior.     

Analysis of variance and linear contrasts in experimental design with generalized secant hyperbolic distribution

We consider one-way classification model in experimental design when the errors have generalized secant hyperbolic distribution. We obtain efficient and robust estimators for block effects by using the modified maximum likelihood estimation (MML) methodology. A test statistic analogous to the normal-theory F statistic is defined to test block effects. We also define a test statistic for testing linear contrasts. It is shown that test statistics based on MML estimators are efficient and robust. The methodology readily extends to unbalanced designs.     

Robustness of optimal designs for correlated random variables

Suppose that Y = (Y_i) is a normal random vector with mean Xb and covariance σ²I_n, where b is a p-dimensional vector (b_j), X = (X_ij) is an n × p matrix with X_ij ∈ {−1, 1}; this corresponds to a factorial design with −1, 1 representing low or high level respectively, or corresponds to a weighing design with −1, 1 representing an object j with weight b_j placed on the left and right of a chemical balance respectively. E-optimal designs Z are chosen that are robust in the sense that they remain E-optimal when the covariance of Y_i, Y_i′ is ρ > 0 for i ≠ i′. Within a smaller class of designs similar results are obtained with respect to a general class of optimality criteria which include the A- and D-criteria.     

An implicit function approach to constrained optimization with applications to asymptotic expansions

In this article, an unconstrained Taylor series expansion is constructed for scalar-valued functions of vector-valued arguments that are subject to nonlinear equality constraints. The expansion is made possible by first reparameterizing the constrained argument in terms of identified and implicit parameters and then expanding the function solely in terms of the identified parameters. Matrix expressions are given for the derivatives of the function with respect to the identified parameters. The expansion is employed to construct an unconstrained Newton algorithm for optimizing the function subject to constraints.Parameters in statistical models often are estimated by solving statistical estimating equations. It is shown how the unconstrained Newton algorithm can be employed to solve constrained estimating equations. Also, the unconstrained Taylor series is adapted to construct Edgeworth expansions of scalar functions of the constrained estimators. The Edgeworth expansion is illustrated on maximum likelihood estimators in an exploratory factor analysis model in which an oblique rotation is applied after Kaiser row-normalization of the factor loading matrix. A simulation study illustrates the superiority of the two-term Edgeworth approximation compared to the asymptotic normal approximation when sampling from multivariate normal or nonnormal distributions.     

Nonparametric inference under competing risks and selection-biased sampling

The aim of this paper is to carry out statistical inference in a competing risks setup when only selection-biased observation of the data of interest is available. We introduce estimators of the cumulative incidence functions and study their joint large sample behavior.     

Optimal adaptive generalized Pólya urn design for multi-arm clinical trials

A class of optimal adaptive multi-arm clinical trial designs is proposed based on an extended generalized Pólya urn (GPU) model. The design is applicable to both the qualitative and quantitative responses and achieves, asymptotically, some pre-specified optimality criterion. Such criterion is specified by a functional of the response distributions and is implemented through the relationship between the design matrix and its first eigenvector. The asymptotic properties of the design are studied using the existing methods on GPU. Some examples for commonly used clinical designs are given as illustration.