ROBUST METHODS FOR DEPENDENT CELL PEDIGREE DATA

This paper studies a robust approach to the analysis of cell pedigree data, building on the work of Huggins & Marschner (1991) which discussed M-estimation for the so-called bifurcating autoregressive process. The study allows for incomplete observation of the pedigree, and incorporates the possibility of additive effects outliers, as discussed in the time series literature. Some properties of the proposed estimation procedure are studied, including a Monte Carlo investigation of robustness in the presence of contamination.     

TESTING SPHERICITY UNDER A MIXTURE MODEL

The robustness of Mauchly's sphericity test criterion when sampling from a mixture of two multivariate normal distributions is studied. The distribution of the sphericity test criterion when the sample covariance matrix has a non-central Wishart density of rank one is derived in terms of Meijer's G-functions; its distribution under the mixture model is then deduced. The robustness is studied by computing actual significance levels of the test under the mixture model using the critical values under the usual normal model.     

Domains of convergence for the EM algorithm: a cautionary tale in a location estimation problem

The EM algorithm is a popular method for maximizing a likelihood in the presence of incomplete data. When the likelihood has multiple local maxima, the parameter space can be partitioned into domains of convergence, one for each local maximum. In this paper we investigate these domains for the location family generated by the t-distribution. We show that, perhaps somewhat surprisingly, these domains need not be connected sets. As an extreme case we give an example of a domain which consists of an infinite union of disjoint open intervals. Thus the convergence behaviour of the EM algorithm can be quite sensitive to the starting point.     

Basic aspects of evolution strategies

Evolution strategies (ESs) are a special class of probabilistic, direct, global optimization methods. They are similar to genetic algorithms but work in continuous spaces and have the additional capability of self-adapting their major strategy parameters. This paper presents the most important features of ESs, namely their self-adaptation, as well as their robustness and potential for parallelization which they share with other evolutionary algorithms.Besides the early (1 + 1)-ES and its underlying theoretical results, the modern ( + )-ES and (, )-ES are presented with special emphasis on the self-adaptation of strategy parameters, a mechanism which enables the algorithm to evolve not only the object variables but also the characteristics of the probability distributions of normally distributed mutations. The self-adaptation property of the algorithm is also illustrated by an experimental example.The robustness of ESs is demonstrated for noisy fitness evaluations and by its application to discrete optimization problems, namely the travelling salesman problem (TSP).Finally, the paper concludes by summarizing existing work and general possibilities regarding the parallelization of evolution strategies and evolutionary algorithms in general.     

A Hellinger distance approach to MCMC diagnostics

Bayesian analysis often requires the researcher to employ Markov Chain Monte Carlo (MCMC) techniques to draw samples from a posterior distribution which in turn is used to make inferences. Currently, several approaches to determine convergence of the chain as well as sensitivities of the resulting inferences have been developed. This work develops a Hellinger distance approach to MCMC diagnostics. An approximation to the Hellinger distance between two distributions f and g based on sampling is introduced. This approximation is studied via simulation to determine the accuracy. A criterion for using this Hellinger distance for determining chain convergence is proposed as well as a criterion for sensitivity studies. These criteria are illustrated using a dataset concerning the Anguilla australis, an eel native to New Zealand.     

C14. Moments of the kolmogorov-smirnov one-sample statistic

In adaptive estimation, it is often considered that an estimator has made a mistake if the component estimator chosen for use is not the most efficient for the distribution sampled. Theoretical and simulation results point to a fallacy in this line of thought. The Monte Carlo study involves extension of the Princeton Swindle to distributions conditional on a location and scale-free statistic, and to the uniform. The results give a partial explanation for the sometimes surprising robustness of adaptive L-estimators.     

Modal non‐linear regression in the presence of Laplace measurement error

In this paper, we propose a robust estimation procedure for a class of non‐linear regression models when the covariates are contaminated with Laplace measurement error, aiming at constructing an estimation procedure for the regression parameters which are less affected by the possible outliers, and heavy‐tailed underlying distribution, as well as reducing the bias introduced by the measurement error. Starting with the modal regression procedure developed for the measurement error‐free case, a non‐trivial modification is made so that the modified version can effectively correct the potential bias caused by measurement error. Large sample properties of the proposed estimate, such as the convergence rate and the asymptotic normality, are thoroughly investigated. A simulation study and real data application are conducted to illustrate the satisfying finite sample performance of the proposed estimation procedure.     

Stochastic analysis of covariance when the error distribution is long-tailed symmetric

In this study, we consider stochastic one-way analysis of covariance model when the distribution of the error terms is long-tailed symmetric. Estimators of the unknown model parameters are obtained by using the maximum likelihood (ML) methodology. Iteratively reweighting algorithm is used to compute the ML estimates of the parameters. We also propose new test statistic based on ML estimators for testing the linear contrasts of the treatment effects. In the simulation study, we compare the efficiencies of the traditional least-squares (LS) estimators of the model parameters with the corresponding ML estimators. We also compare the power of the test statistics based on LS and ML estimators, respectively. A real-life example is given at the end of the study.     

Combining Inverse Probability Weighting and Multiple Imputation to Improve Robustness of Estimation

Inverse probability weighting (IPW) and multiple imputation are two widely adopted approaches dealing with missing data. The former models the selection probability, and the latter models data distribution. Consistent estimation requires correct specification of corresponding models. Although the augmented IPW method provides an extra layer of protection on consistency, it is usually not sufficient in practice as the true data‐generating process is unknown. This paper proposes a method combining the two approaches in the same spirit of calibration in sampling survey literature. Multiple models for both the selection probability and data distribution can be simultaneously accounted for, and the resulting estimator is consistent if any model is correctly specified. The proposed method is within the framework of estimating equations and is general enough to cover regression analysis with missing outcomes and/or missing covariates. Results on both theoretical and numerical investigation are provided.