Improved Measures of the Spread of Data for Some Unknown Complex Distributions Using Saddlepoint Approximations

Measures of the spread of data for random sums arise frequently in many problems and have a wide range of applications in real life, such as in the insurance field (e.g., the total claim size in a portfolio). The exact distribution of random sums is extremely difficult to determine, and normal approximation usually performs very badly for this complex distributions. A better method of approximating a random-sum distribution involves the use of saddlepoint approximations.

Saddlepoint approximations are powerful tools for providing accurate expressions for distribution functions that are not known in closed form. This method not only yields an accurate approximation near the center of the distribution but also controls the relative error in the far tail of the distribution.

In this article, we discuss approximations to the unknown complex random-sum Poisson–Erlang random variable, which has a continuous distribution, and the random-sum Poisson-negative binomial random variable, which has a discrete distribution. We show that the saddlepoint approximation method is not only quick, dependable, stable, and accurate enough for general statistical inference but is also applicable without deep knowledge of probability theory. Numerical examples of application of the saddlepoint approximation method to continuous and discrete random-sum Poisson distributions are presented.     

Saddlepoint Approximations to the Density and the Distribution Functions of Linear Combinations of Ratios of Partial Sums

A class of ratios of partial sums, including Normal, Weibull, Gamma, and Exponential distributions, is considered. The distribution of a linear combination of ratios of partial sums from this class is characterized by the distribution of a linear combination of Dirichlet components. This article presents two saddlepoint approaches to calculate the density and the distribution function for such a class of linear combinations. A simulation study is conducted to assess the performance of the saddlepoint methods and shows the great accuracy of the approximations over the usual asymptotic approximation. Applications of the presented approximations in statistical inferences are discussed.     

Saddlepoint Approximations for a Product and Its Application

A technique of the saddlepoint approximation with double exponential base, SPA_D is developed to evaluate the probability of a product of two random variables, which may be independent or dependent, normal or contaminated normal random variables. The SPA_D shows a slightly better approximation as compared to the saddlepoint approximation with Lagannani–Rice formula. However, both methods get remarkable results when applied to evaluate the tail probabilities of the Reynolds stress for soil erosion prediction.     

Saddlepoint approximations to tail expectations under non-Gaussian base distributions: option pricing applications

The saddlepoint approximation formulas provide versatile tools for analytic approximation of the tail expectation of a random variable by approximating the complex Laplace integral of the tail expectation expressed in terms of the cumulant generating function of the random variable. We generalize the saddlepoint approximation formulas for calculating tail expectations from the usual Gaussian base distribution to an arbitrary base distribution. Specific discussion is presented on the criteria of choosing the base distribution that fits better the underlying distribution. Numerical performance and comparison of accuracy are made among different saddlepoint approximation formulas. Improved accuracy of the saddlepoint approximations to tail expectations is revealed when proper base distributions are chosen. We also demonstrate enhanced accuracy of the generalized saddlepoint approximation formulas under non-Gaussian base distributions in pricing European options on continuous integrated variance under the Heston stochastic volatility model.     

A hybrid approach based on saddlepoint and importance sampling methods for bootstrap tail probability estimation

We propose a simple hybrid method which makes use of both saddlepoint and importance sampling techniques to approximate the bootstrap tail probability of an M-estimator. The method does not rely on explicit formula of the Lugannani-Rice type, and is computationally more efficient than both uniform bootstrap sampling and importance resampling suggested in earlier literature. The method is also applied to construct confidence intervals for smooth functions of M-estimands.     

Lot acceptance and compliance testing based on the sample mean and minimum/maximum

A dual acceptance criterion in terms of the sample mean and an extremum (minimum or maximum) has been used in many inspection procedures in diverse industries. An approximation is given in Vangel (Technometrics, 2002, pp. 242-248) for the joint distribution of the sample mean and an extremum when the population is normally distributed. In this paper we obtain a simple expression that depends on the distribution of the sample mean and the truncated sample mean. This expression allows us to evaluate the joint distribution exactly, in two cases, or approximately, in more general cases, making the dual acceptance criterion easier to calculate in practice. We present a saddlepoint approximation for the joint tail probability, with the application to the dual acceptance criterion under the assumption of normality.     

The power of the modified Wilcoxon rank-sum test for the one-sided alternative

When testing hypotheses in two-sample problems, the Wilcoxon rank-sum test is often used to test the location parameter, and this test has been discussed by many authors over the years. One modification of the Wilcoxon rank-sum test was proposed by Tamura [On a modification of certain rank tests. Ann Math Stat. 1963;34:1101–1103]. Deriving the exact critical value of the statistic is difficult when the sample sizes are increased. The normal approximation, the Edgeworth expansion, the saddlepoint approximation, and the permutation test were used to evaluate the upper tail probability for the modified Wilcoxon rank-sum test given finite sample sizes. The accuracy of various approximations to the probability of the modified Wilcoxon statistic was investigated. Simulations were used to investigate the power of the modified Wilcoxon rank-sum test for the one-sided alternative with various population distributions for small sample sizes. The method was illustrated by the analysis of real data.     

Asymptotic Expansions for i.i.d. Sums Via Lower-order Convolutions

In this article, we introduce new asymptotic expansions for probability functions of sums of independent and identically distributed random variables. Results are obtained by efficiently employing information provided by lower-order convolutions. In comparison with Edgeworth-type theorems, advantages include improved asymptotic results in the case of symmetric random variables and ease of computation of main error terms and asymptotic crossing points. The first-order estimate can perform quite well against the corresponding renormalized saddlepoint approximation and, pointwise, requires evaluation of only a single convolution integral. While the new expansions are fairly straightforward, the implications are fortuitous and may spur further related work.     

Bivariate symmetry tests for complete and competing risks data: a saddlepoint approach

A class of bivariate symmetry tests for complete data and competing risks data is considered. Saddlepoint approximation for the exact p-values of the underlying permutation distribution of these tests is derived. Several simulation studies are conducted to evaluate the performance of the saddlepoint approximation and the asymptotic approximation. The saddlepoint approximation was found to be highly accurate and superior to the asymptotic approximations in replicating the exact permutation significance.     

A note on the most powerful invariant test of Rayleigh against exponential distribution

Abstract

The problem of testing Rayleigh distribution against exponentiality, based on a random sample of observations is considered. This problem arises in survival analysis, when testing a linearly increasing hazard function against a constant hazard function. It is shown that for this problem the most powerful invariant test is equivalent to the “ratio of maximized likelihoods” (RML) test. However, since the two families are separate, the RML test statistic does not have the usual asymptotic chi-square distribution. Normal and saddlepoint approximations to the distribution of the RML test statistic are derived. Simulations show that saddlepoint approximation is more accurate than the normal approximation, especially for tail probabilities that are the main values of interest in hypothesis testing.     

Symbolic computation for approximating distributions of some families of one and two-sample nonparametric test statistics

A conditional saddlepoint approximation was provided by Gatto and Jammalamadaka (1999) for computing the distribution function of many test statistics based on dependent quantities like multinomial frequencies, spacing frequencies, etc. The considerable complexity of the formulas involved can be bypassed by symbolic computation. This article illustrates the effectiveness of symbolic computation to evaluate the saddlepoint approximation for the likelihood ratio, the exponential score, and the Wald-Wolfowitz test statistics. The case of composite hypotheses is also discussed.     

Simulation-assisted saddlepoint approximation

A general saddlepoint/Monte Carlo method to approximate (conditional) multivariate probabilities is presented. This method requires a tractable joint moment generating function (m.g.f.), but does not require a tractable distribution or density. The method is easy to program and has a third-order accuracy with respect to increasing sample size in contrast to standard asymptotic approximations which are typically only accurate to the first order.

The method is most easily described in the context of a continuous regular exponential family. Here, inferences can be formulated as probabilities with respect to the joint density of the sufficient statistics or the conditional density of some sufficient statistics given the others. Analytical expressions for these densities are not generally available, and it is often not possible to simulate exactly from the conditional distributions to obtain a direct Monte Carlo approximation of the required integral. A solution to the first of these problems is to replace the intractable density by a highly accurate saddlepoint approximation. The second problem can be addressed via importance sampling, that is, an indirect Monte Carlo approximation involving simulation from a crude approximation to the true density. Asymptotic normality of the sufficient statistics suggests an obvious candidate for an importance distribution.

The more general problem considers the computation of a joint probability for a subvector of random T, given its complementary subvector, when its distribution is intractable, but its joint m.g.f. is computable. For such settings, the distribution may be tilted, maintaining T as the sufficient statistic. Within this tilted family, the computation of such multivariate probabilities proceeds as described for the exponential family setting.     

Approximate multivariate conditional inference using the adjusted profile likelihood

The author proposes saddlepoint approximation methods that are adapted to multivariate conditional inference in canonical exponential familles. Several approaches to approximating conditional discrete distributions involve dividing an approximation to the full joint mass function, summed over tail regions of interest, by an approximate marginal density. The author first approximates this conditional likelihood by the adjusted profile likelihood, and then applies a multivariate saddlepoint approximation. He also presents formulas to aid in performing simultaneously the profiling and maximizing steps.     

Saddlepoint approximations for nonlinear statistics

It is well known that saddlepoint expansions lead to accurate approximations to the cumulative distributions and densities of a sample mean and other simple linear statistics. The use of such expansions is explored in a broader situation. The saddlepoint formula for the tail probability of a certain type of nonlinear statistic is derived. The relative error of O(n^–1), as in the linear case, is retained. A simple example is considered, to illustrate the great accuracy of the approximation.     

Control variates and importance sampling for efficient bootstrap simulations

Importance sampling and control variates have been used as variance reduction techniques for estimating bootstrap tail quantiles and moments, respectively. We adapt each method to apply to both quantiles and moments, and combine the methods to obtain variance reductions by factors from 4 to 30 in simulation examples.We use two innovations in control variates—interpreting control variates as a re-weighting method, and the implementation of control variates using the saddlepoint; the combination requires only the linear saddlepoint but applies to general statistics, and produces estimates with accuracy of order n ^-1/2 B ^-1, where n is the sample size and B is the bootstrap sample size.We discuss two modifications to classical importance sampling—a weighted average estimate and a mixture design distribution. These modifications make importance sampling robust and allow moments to be estimated from the same bootstrap simulation used to estimate quantiles.     

Saddlepoint p-values for group of linear rank tests

Many nonparametric tests in one sample problem, matched pairs, and competingrisks under censoring have the same underlying permutation distribution. This article proposes a saddlepoint approximation to the exact p-values of these tests instead of the asymptotic approximations. The performance of the saddlepoint approximation is assessed by using simulation studies that show the superiority of the saddlepoint methods over the asymptotic approximations in several settings. The use of the saddlepoint to approximate the p-values of class of two sample tests under complete randomized design is also discussed.     

广义卡方型混合分布的鞍点逼近

广义卡方型混合分布在许多非参数检验问题中有着广泛运用。通常采用正态分布近似这类分布，但是在非大样本的情况下，正态近似的效果并不理想。运用鞍点逼近技术近似广义卡方型混合随机变量的密度函数和分布函数，并且与正态近似方法以及卡方近似方法进行了比较。模拟表明鞍点逼近效果要优于其余两种方法，特别是密度函数尾部区域。     

独立逆抽样下优势比的置信区间

本文对独立逆抽样设计下优势比的置信区间的构造进行了研究,包括三个已有的方法,以及本文引入的鞍点逼近方法。通过模拟比较了这四个方法给出的置信区间。模拟结果表明,基于鞍点逼近方法给出的置信区间不比另外三种方法差。并且在一些情况下表现还优于其它三个方法。     

Tail Exactness of Multivariate Saddlepoint Approximations

We consider a log-concave density f in R ^m satisfying certain weak conditions, particularly on the Hessian matrix of log f . For such a density, we prove tail exactness of the multivariate saddlepoint approximation. The proof is based on a local limit theorem for the exponential family generated by f . However, the result refers not to asymptotic behaviour under repeated sampling, but to a limiting property at the boundary of the domain of f . Our approach does not apply any complex analysis, but relies totally on convex analysis and exponential models arguments.     

Bayesian prediction of waiting times in stochastic models

The authors show how saddlepoint techniques lead to highly accurate approximations for Bayesian predictive densities and cumulative distribution functions in stochastic model settings where the prior is tractable, but not necessarily the likelihood or the predictand distribution. They consider more specifically models involving predictions associated with waiting times for semi‐Markov processes whose distributions are indexed by an unknown parameter θ. Bayesian prediction for such processes when they are not stationary is also addressed and the inverse‐Gaussian based saddlepoint approximation of Wood, Booth & Butler (1993) is shown to accurately deal with the nonstationarity whereas the normal‐based Lugannani & Rice (1980) approximation cannot, Their methods are illustrated by predicting various waiting times associated with M/M/q and M/G/1 queues. They also discuss modifications to the matrix renewal theory needed for computing the moment generating functions that are used in the saddlepoint methods.