Optimally robust estimators in generalized Pareto models

In this paper, we study the robustness properties of several procedures for the joint estimation of shape and scale in a generalized Pareto model. The estimators that we primarily focus upon, most bias robust estimator (MBRE) and optimal MSE-robust estimator (OMSE), are one-step estimators distinguished as optimally robust in the shrinking neighbourhood setting; that is, they minimize the maximal bias, respectively, on such a specific neighbourhood, the maximal mean squared error (MSE). For their initialization, we propose a particular location–dispersion estimator, MedkMAD, which matches the population median and kMAD (an asymmetric variant of the median of absolute deviations) against the empirical counterparts. These optimally robust estimators are compared to the maximum-likelihood, skipped maximum-likelihood, Cramér–von-Mises minimum distance, method-of-medians, and Pickands estimators. To quantify their deviation from robust optimality, for each of these suboptimal estimators, we determine the finite-sample breakdown point and the influence function, as well as the statistical accuracy measured by asymptotic bias, variance, and MSE – all evaluated uniformly on shrinking neighbourhoods. These asymptotic findings are complemented by an extensive simulation study to assess the finite-sample behaviour of the considered procedures. The applicability of the procedures and their stability against outliers are illustrated for the Danish fire insurance data set from the package evir.     

Bootstrapping the Hausman Test in Panel Data Models

In the article, it is shown that in panel data models the Hausman test (HT) statistic can be considerably refined using the bootstrap technique. Edgeworth expansion shows that the coverage of the bootstrapped HT is second-order correct.

The asymptotic versus the bootstrapped HT are compared also by Monte Carlo simulations. At the null hypothesis and a nominal size of 0.05, the bootstrapped HT reduces the coverage error of the asymptotic HT by 10–40% of nominal size; for nominal sizes less than or equal to 0.025, the coverage error reduction is between 30% and 80% of nominal size. For the nonnull alternatives, the power of the asymptotic HT fictitiously increases by over 70% of the correct power for nominal sizes less than or equal to 0.025; the bootstrapped HT reduces overrejection to less than one fourth of its value. The advantages of the bootstrapped HT increase with the number of explanatory variables.

Heteroscedasticity or serial correlation in the idiosyncratic part of the error does not hamper advantages of the bootstrapped version of HT, if a heteroscedasticity robust version of the HT and the wild bootstrap are used. But, the power penalty is not negligible if a heteroscedasticity robust approach is used in the homoscedastic panel data model.     

A Recursive Formulation of the Old Problem of Obtaining Moments from Cumulants and Vice Versa

It seems difficult to find a formula in the literature that relates moments to cumulants (and vice versa) and is useful in computational work rather than in an algebraic approach. Hence I present four very simple recursive formulas that translate moments to cumulants and vice versa in the univariate and multivariate situations.     

How non-normality affects the quadratic discriminant function

The quadratic discriminant function is commonly used for the two group classification problem when the covariance matrices in the two populations are substantially unequal. This procedure is optimal when both populations are multivariate normal with known means and covariance matrices. This study examined the robustness of the QDF to non-normality. Sampling experiments were conducted to estimate expected actual error rates for the QDF when sampling from a variety of non-normal distributions. Results indicated that the QDF was robust to non-normality except when the distributions were highly skewed, in which case relatively large deviations from optimal were observed. In all cases studied the average probabilities of misclassification were relatively stable while the individual population error rates exhibited considerable variability.     

On a paper by kageyama and mohan

Kageyama Mohan (1984) have presented three methods of constructing new incomplete block designs from balanced incomplete block designs, They raise questions about the designs which come from each of their methods, These questions are answered, Another series of group divisible designs is derived as a special case of their second method.     

A simplified proof of a theorem on the difference of the moore–penrose inverses of two positive semi–difinte matrices

Simplified proofs are given of a standard result that establishes positive semi–definiteness of the difference of the inverses of two non–singular matrices, and of the extension of this result by Milliken and Akdeniz (1977) to the difference of the Moore–Penrose inverse of two singular matrices.     

Kernel estimation of a distribution function

A distribution function is estimated by a kernel method with

a poinrwise mean squared error criterion at a point x. Relation- ships between the mean squared error, the point x, the sample size and the required kernel smoothing parazeter are investigated for several distributions treated by Azzaiini (1981). In particular it is noted that at a centre of symmetry or near a mode of the distribution the kernei method breaks down. Point- wise estimation of a distribution function is motivated as a more useful technique than a reference range for preliminary medical diagnosis.     

Lag Length Selection for Unit Root Tests in the Presence of Nonstationary Volatility

A number of recent papers have focused on the problem of testing for a unit root in the case where the driving shocks may be unconditionally heteroskedastic. These papers have, however, taken the lag length in the unit root test regression to be a deterministic function of the sample size, rather than data-determined, the latter being standard empirical practice. We investigate the finite sample impact of unconditional heteroskedasticity on conventional data-dependent lag selection methods in augmented Dickey–Fuller type regressions and propose new lag selection criteria which allow for unconditional heteroskedasticity. Standard lag selection methods are shown to have a tendency to over-fit the lag order under heteroskedasticity, resulting in significant power losses in the (wild bootstrap implementation of the) augmented Dickey–Fuller tests under the alternative. The proposed new lag selection criteria are shown to avoid this problem yet deliver unit root tests with almost identical finite sample properties as the corresponding tests based on conventional lag selection when the shocks are homoskedastic.     

The asymptotic equivalence between the iterated improved 2sls estimator and the 3sls estimator

In this paper we show that the 3SLS estimator of a system of equations is asymptotically equivalent to an iterative 2SLS estimator applied to each equation, augmented with the residuals from the other equations. This result is a natural extension of Telser (1964).     

Bayesian analysis of a multiple-recapture model

In the Bayesian analysis of a multiple-recapture census, different diffuse prior distributions can lead to markedly different inferences about the population size N. Through consideration of the Fisher information matrix it is shown that the number of captures in each sample typically provides little information about N. This suggests that if there is no prior information about capture probabilities, then knowledge of just the sample sizes and not the number of recaptures should leave the distribution of Nunchanged. A prior model that has this property is identified and the posterior distribution is examined. In particular, asymptotic estimates of the posterior mean and variance are derived. Differences between Bayesian and classical point and interval estimators are illustrated through examples.