DISTRIBUTION OF THE LEAST SQUARES ESTIMATOR IN A FIRST-ORDER AUTOREGRESSIVE MODEL

This paper investigates the finite sample distribution of the least squares estimator of the autoregressive parameter in a first-order autoregressive model. A uniform asymptotic expansion for the distribution applicable to both stationary and nonstationary cases is obtained. Accuracy of the approximation to the distribution by a first few terms of this expansion is then investigated. It is found that the leading term of this expansion approximates well the distribution. The approximation is, in almost all cases, accurate to the second decimal place throughout the distribution. In the literature, there exist a number of approximations to this distribution which are specifically designed to apply in some special cases of this model. The present approximation compares favorably with those approximations and in fact, its accuracy is, with almost no exception, as good as or better than these other approximations. Convenience of numerical computations seems also to favor the present approximations over the others. An application of the finding is illustrated with examples.     

Approximations to the distribution of weighted combination of independent probabilities

Two simple approximations are proposed for the distribution of the weighted combina-tion of n independent probabilities. The approximations are compared with other avail-able approximations. It is shown that one of the proposed approximations is better than the other approximations.     

Percentiles of sums of heavy-tailed random variables: beyond the single-loss approximation

A perturbative approach is used to derive approximations of arbitrary order to estimate high percentiles of sums of positive independent random variables that exhibit heavy tails. Closed-form expressions for the successive approximations are obtained both when the number of terms in the sum is deterministic and when it is random. The zeroth order approximation is the percentile of the maximum term in the sum. Higher orders in the perturbative series involve the right-truncated moments of the individual random variables that appear in the sum. These censored moments are always finite. As a result, and in contrast to previous approximations proposed in the literature, the perturbative series has the same form regardless of whether these random variables have a finite mean or not. For high percentiles, and specially for heavier tails, the quality of the estimate improves as more terms are included in the series, up to a certain order. Beyond that order the convergence of the series deteriorates. Nevertheless, the approximations obtained by truncating the perturbative series at intermediate orders are remarkably accurate for a variety of distributions in a wide range of parameters.     

Exact calculation of power and sample size in bioequivalence studies using two one‐sided tests

The number of subjects in a pharmacokinetic two‐period two‐treatment crossover bioequivalence study is typically small, most often less than 60. The most common approach to testing for bioequivalence is the two one‐sided tests procedure. No explicit mathematical formula for the power function in the context of the two one‐sided tests procedure exists in the statistical literature, although the exact power based on Owen's special case of bivariate noncentral t‐distribution has been tabulated and graphed. Several approximations have previously been published for the probability of rejection in the two one‐sided tests procedure for crossover bioequivalence studies. These approximations and associated sample size formulas are reviewed in this article and compared for various parameter combinations with exact power formulas derived here, which are computed analytically as univariate integrals and which have been validated by Monte Carlo simulations. The exact formulas for power and sample size are shown to improve markedly in realistic parameter settings over the previous approximations. Copyright © 2014 John Wiley & Sons, Ltd.     

Exact and asymptotic results for pattern waiting times

Waiting time problems for the occurrence of a pattern have attracted considerable research interest. Several results, including Poisson or Compound Poisson approximations as well as Normal approximations have appeared in the literature. In addition, a number of asymptotic results has been developed by making use of the finite Markov chain imbedding technique and the Perron–Frobenius eigenvalue. In the present paper we present a recursive scheme for the evaluation of the tail probabilities of the waiting time for the first and r-th occurrence of a pattern. A number of asymptotic results (along with their rates of convergence) that do not require the existence of the Perron–Frobenius eigenvalue are also offered. These results cover a quite wide class of pattern waiting time problems and, in most cases, perform better than the ones using the Perron–Frobenius eigenvalue.     

General Saddlepoint Approximation for Testing Separate Location-Scale Families of Hypotheses

For testing separate families of hypotheses, the likelihood ratio test does not have the usual asymptotic properties. This paper considers the asymptotic distribution of the ratio of maximized likelihoods (RML) statistic in the special case of testing separate scale or location-scale families of distributions. We derive saddlepoint approximations to the density and tail probabilities of the log of the RML statistic. These approximations are based on the expansion of the log of the RML statistic up to the second order, which is shown not to depend on the location and scale parameters. The resulting approximations are applied in several cases, including normal versus Laplace, normal versus Cauchy, and Weibull versus log-normal. Our results show that the saddlepoint approximations are satisfactory, even for fairly small sample sizes, and are more accurate than normal approximations and Edgeworth approximations, especially for tail probabilities that are the values of main interest in hypothesis testing problems.     

Two normal approximations to the binomial distribution

Two new normal approximations are proposed for the cumulative binomial distribution when the mean-is reasonably large. Their adequacy is compared with that of certain well-known approximations- The first is recommended for its simplicity and accuracy relative to the standard and Gram-Charlier approximations. The second Is shown to be more accurate than all known approximations for a certain range of the probability of success.     

Effect on probabilities and quantiles of adding a quantity with small variance

This paper gives simple approximations for the distribution function and quantiles of the sum X + Y when X is a continuous variable and Y is an independent variable with variance small compared to that of X . The approximations are based around the distribution function or quantiles of X and require only the first two or three moments of Y to be known. Example evaluations with X having a normal, Student's t or chi-squared distribution suggest that the approximations are good in unbounded tail regions when the ratio of variances is less than 0.2.     

Copulas checker-type approximations: Application to quantiles estimation of sums of dependent random variables

Abstract

Several approximations of copulas have been proposed in the literature. By using empirical versions of checker-type copulas approximations, we propose non parametric estimators of the copula. Under some conditions, the proposed estimators are copulas and their main advantage is that they can be sampled from easily. One possible application is the estimation of quantiles of sums of dependent random variables from a small sample of the multivariate law and a full knowledge of the marginal laws. We show that estimations may be improved by including in an easy way in the approximated copula some additional information on the law of a sub-vector for example. Our approach is illustrated by numerical examples.     

Bayesian Measures of the Minimum Detectable Concentration of an Immunoassay

The minimum detectable concentration (MDC) is one of the most important properties of an assay. It is a statement about the smallest physical quantity an assay can reliably measure, and is used in assay design and quality control assessments. A plethora of measures of the MDC have been reported in a widely scattered literature. Many of these were developed at a time when accuracy and relevance had to be sacrificed for computational feasibility. This paper identifies limitations of existing measures and demonstrates how Bayesian inference may be used to overcome these limitations. Several new measures of the MDC are developed. These are conceptually simpler than existing measures, and are free of analytical approximations. The recent advances in Bayesian computation make them efficient to evaluate. A procedure developed in this paper measures the difference in the quality of two assays and shows that the new Bayesian measures perform better than existing measures.     

An objective look at obtaining the plotting positions for QQ-plots

ABSTRACT

Choosing the plotting positions for the QQ-plot has been a subject of much debate in the statistical and engineering literature. This paper looks at this problem objectively by considering three frameworks: distribution-theoretic; decision-theoretic; game-theoretic. In each framework, we derive the plotting positions and show that there are more than one legitimate solution depending on the practitioner’s objective. This work clarifies the choice of the plotting positions by allowing one to easily find the mathematical equivalent of their view and choose the corresponding solution. This work also discusses approximations to the plotting positions when no closed form is available.     

Approximated distributions of the weighted sum of correlated chi-squared random variables

We study the asymptotic behavior of the weighted sum of correlated chi-squared random variables. Both chi-squared and normal distributions are proved to approximate the exact distribution. These two approximations are established by matching the first two cumulants. Simulation comparison is made to study the performance of two approximations numerically. We find that the chi-squared approximation performs better than the normal one in the study.     

A Saddlepoint Approximation to the Distribution of the Half-Life Estimator in a Stationary Autoregressive Model

We derive saddlepoint approximations for the distribution and density functions of the half-life estimated by OLS from autoregressive time-series models. Our results are used to prove that none of the integer-order moments of these half-life estimators exist. This provides an explanation for the very large estimates of persistency, and the extremely wide confidence intervals, that have been reported by various authors, i.e., in the empirical economics literature relating to purchasing power parity.     

Prediction Error of Small Area Predictors Shrinking Both Means and Variances

The article considers a new approach for small area estimation based on a joint modelling of mean and variances. Model parameters are estimated via expectation–maximization algorithm. The conditional mean squared error is used to evaluate the prediction error. Analytical expressions are obtained for the conditional mean squared error and its estimator. Our approximations are second‐order correct, an unwritten standardization in the small area literature. Simulation studies indicate that the proposed method outperforms the existing methods in terms of prediction errors and their estimated values.     

PREDICTION OF THE FINITE POPULATION DISTRIBUTION FUNCTION UNDER GAUSSIAN SUPERPOPULATION MODELS

This article considers optimal prediction of the finite population distribution function under Gaussian superpopulation models, which allows auxiliary prior information to be incorporated into the estimation process. Large sample approximations for the variance of the optimal predictors are derived in some special important cases. A small scale Monte Carlo study illustrates comparisons between the optimal predictor and some others which are proposed in the literature. The conclusion is that the optimal predictor can be considerably more efficient in situations where the normal superpopulation model is adequate.     

Heteroscedastic ANOVA: old p values, new views

The generalization of the Behrens–Fisher problem to comparing more than two means from nonhomogeneous populations has attracted the attention of statisticians for many decades. Several approaches offer different approximations to the distribution of the test statistic. The question of statistical properties of these approximations is still alive. Here, we present a brief overview of several approaches suggested in the literature and implemented in software with a focus on investigating the accuracy of p values as well as their dependence on nuisance parameters and on the underlying assumption of normality. We illustrate by simulation the behavior of p values. In addition to the Satterthwaite–Fai–Cornelius test, the Kenward–Roger test, the simple ANOVA F test, the parametric bootstrap test, and the generalized F test will be briefly discussed.     

On the problem of selecting good populations

The problem of selecting good populations out of k normal populations is considered in a Bayesian framework under exchangeable normal priors and additive loss functions. Some basic approximations to the Bayes rules are discussed. These approximations suggest that some well-known classical rules are "approximate" Bayes rules. Especially, it is shown that Gupta-type rules are extended Bayes with respect to a family of the exchangeable normal priors for any bounded and additive loss function. Furthermore, for a simple loss function, the results of a Monte Carlo comparison of Gupta-type rules and Seal-type rules are presented. They indicate that, in general, Gupta-type rules perform better than Seal-type rules     

Series Estimation in Partially Linear In‐Slide Regression Models

Abstract. The partially linear in‐slide model (PLIM) is a useful tool to make econometric analyses and to normalize microarray data. In this article, by using series approximations and a least squares procedure, we propose a semiparametric least squares estimator (SLSE) for the parametric component and a series estimator for the non‐parametric component. Under weaker conditions than those imposed in the literature, we show that the SLSE is asymptotically normal and that the series estimator attains the optimal convergence rate of non‐parametric regression. We also investigate the estimating problem of the error variance. In addition, we propose a wild block bootstrap‐based test for the form of the non‐parametric component. Some simulation studies are conducted to illustrate the finite sample performance of the proposed procedure. An example of application on a set of economical data is also illustrated.     

Patched approximations and their convergence

Abstract

Patched approximations of copulas unify ordinal sums, shuffles of Min, checkerboard, and checkmin approximations. We give a characterization of patched approximations and an error bound of the approximations in Sobolev norm. Patched approximations with uniform marginal conditional distributions are shown to arise naturally. We prove that these uniform patched approximations converge uniformly and in the Sobolev norm. The latter convergence is settled by showing the convergence almost everywhere of the first partial derivatives. We also show that the independence copula can be approximated by conditional mutual complete copulas in the Sobolev norm.     

On coupling particle filter trajectories

Particle filters are a powerful and flexible tool for performing inference on state-space models. They involve a collection of samples evolving over time through a combination of sampling and re-sampling steps. The re-sampling step is necessary to ensure that weight degeneracy is avoided. In several situations of statistical interest, it is important to be able to compare the estimates produced by two different particle filters; consequently, being able to efficiently couple two particle filter trajectories is often of paramount importance. In this text, we propose several ways to do so. In particular, we leverage ideas from the optimal transportation literature. In general, though computing the optimal transport map is extremely computationally expensive, to deal with this, we introduce computationally tractable approximations to optimal transport couplings. We demonstrate that our resulting algorithms for coupling two particle filter trajectories often perform orders of magnitude more efficiently than more standard approaches.