An algorithm for discrete chebychev curve fitting for the simple model using a dual linear programming approach

An algorithm, in t h e form of a Fortran subroutine TRIPLE,is given to compute statistics forthetriples test for symmetry, The 2 computational complexity of the algorithm is O(n² ) which is an 3 improvement over the straightforward method, which is O(n³).     

On the accuracy of the bootstrap approximation of the joint distribution of sample quantiles

It is proved that the accuracy of the bootstrap approximation of the joint distribution of sample quantiles lies between O(n^?1/4) and O(n^?1/4 a_n), where (log(n))1/2=O(a_n). As an application, we investigated confidence intervals based on the bootstrap.     

Generating generalized cyclic designs with factorial balance

An algorithm for generating paired comparison factorially balanced generalized cyclic designs is described. The algorithm is based upon the 2 ⁿ ? 1 class association scheme defined by Shah (1960) for n-factor experiments. The algorithm is highly successful in achieving its objective. Firstorder designs with block size greater than two can also be obtained using the algorithm.     

Weighted bootstraps for the variance

We consider the weighted bootstrap introduced by Mason and Newton [Ann. Statist. 20 (1992) 1611–1624] for estimators of the variance (in non-Studentized form). First, we give conditions on the moments of the weights to ensure that the weighted bootstrap leads to uniformly correct two-sided approximation up to the rate O(n^−3/2). Then, we discuss the practical choice of the random weights in order to construct one-sided confidence intervals accurate up to O(n^−3/2).     

Computing exact clustering posteriors with subset convolution

ABSTRACT

An exponential-time exact algorithm is provided for the task of clustering n items of data into k clusters. Instead of seeking one partition, posterior probabilities are computed for summary statistics: the number of clusters and pairwise co-occurrence. The method is based on subset convolution and yields the posterior distribution for the number of clusters in O(n3ⁿ) operations or O(n³2ⁿ) using fast subset convolution. Pairwise co-occurrence probabilities are then obtained in O(n³2ⁿ) operations. This is considerably faster than exhaustive enumeration of all partitions.     

The asymptotic behavior of monotone percentile regression estimates

The least-absolute-deviation estimate of a monotone regression function on an interval has been studied in the literature. If the observation points become dense in the interval, the almost sure rate of convergence has been shown to be O(n^1/4). Applying the techniques used by Brunk (1970, Nonparametric, Techniques in Statistical Inference. Cambridge Univ. Press), the asymptotic distribution of the l₁ estimator at a point is obtained. If the underlying regression function has positive slope at the point, the rate of convergence is seen to be O(n^1/3). Monotone percentile regression estimates are also considered.     

Penalized regression with model‐based penalties

Nonparametric regression techniques such as spline smoothing and local fitting depend implicitly on a parametric model. For instance, the cubic smoothing spline estimate of a regression function ∫ μ based on observations ti, Yi is the minimizer of Σ{Yi ‐ μ(ti)}² + λ∫(μ′′)². Since ∫(μ″)² is zero when μ is a line, the cubic smoothing spline estimate favors the parametric model μ(t) = α_o + α₁t. Here the authors consider replacing ∫(μ″)² with the more general expression ∫(Lμ)² where L is a linear differential operator with possibly nonconstant coefficients. The resulting estimate of μ performs well, particularly if Lμ is small. They present an O(n) algorithm for the computation of μ. This algorithm is applicable to a wide class of L's. They also suggest a method for the estimation of L. They study their estimates via simulation and apply them to several data sets.     

Efficient weighted bootstraps for the mean

The weighted bootstrap due to Mason and Newton (1992. Ann. Statist. 20, 1611–1624.) is applied to Studentized statistics in view of deriving efficient confidence intervals for the mean. First, we give conditions on the moments of the weights to ensure that the weighted bootstrap approximation leads to uniformly correct two-sided confidence intervals up to the rate O(n^−3/2). Then, we discuss the practical choice of the random weights in order to construct one-sided confidence intervals accurate up to O(n^−3/2) and two-sided confidence intervals up to higher orders. Simulations are given to illustrate the practical efficiency of our approach.     

EMPIRICAL BAYES ESTIMATION WITH NON-IDENTICAL COMPONENTS. CONTINUOUS CASE.

In this paper a variant of the standard empirical Bayes estimation problem is considered where the component problems in the sequence are not identical in that the conditional distribution of the observations may vary with the component problems. Let {(Θ_n, X_n)} be a sequence of independent random vectors where Θ_n? G and, given Θ_n=Θ_n, X_n -P_Θ,m(n) with {m(n)} a sequence of positive integers where m(n)≤m? < ∞ for all n. With P_Θ,m in a continuous exponential family of distributions, asymptotically optimal empirical Bayes procedures are exhibited which depend on uniform approximations of certain functions on compact sets by polynomials in e^Θ. Such approximations have been explicitly calculated in the case of normal and gamma families. In the case of normal families, asymptotically optimal linear empirical Bayes estimators in the class of all linear estimators are derived and shown to have rate O(n^-1/2).     

On the convergence rate of model selection criteria

The goal of the current paper is to compare consistent and inconsistent model selection criteria by looking at their convergence rates (to be defined in the first section). The prototypes of the two types of criteria are the AIC and BIC criterion respectively. For linear regression models with normally distributed errors, we show that the convergence rates for AIC and BIC are 0(n^-1) and 0((n log n)^-1/2) respectively. When the error distributions are unknown, the two criteria become indistinguishable, all having convergence rate O(n^-1/2). We also argue that the BIC criterion has nearly optimal convergence rate. The results partially justified some of the controversial simulation results in which inconsistent criteria seem to outperform consistent ones.     

On the number of 2n-p fractional factorials of resolution III

An algorithm is specified and demonstrated which will compute the total number of ways a 2ⁿ factorial design may be partitioned into 2^p mutually exclusive 2^n-p fractional factorial designs, each having resolution III. The results of its application to all designs possessing resolution III fractions for n=5,…,20 are also given.     

Empirical bayes tests in a positive exponential family with partial information on priors

We investigate an empirical Bayes testing problem in a positive exponential family having pdf f{x/θ)=c(θ)u(x) exp(?x/θ), x>0, θ>0. It is assumed that θ is in some known compact interval [C₁, C₂]. The value C₁ is used in the construction of the proposed empirical Bayes test δ^* _n. The asymptotic optimality and rate of convergence of its associated Bayes risk is studied. It is shown that under the assumption that θ is in [C₁, C₂] δ^* _n is asymptotically optimal at a rate of convergence of order O(n^?1/n n). Also, δ^* _n is robust in the sense that δ^* _n still possesses the asymptotic optimality even the assumption that "C₁≦θ≦C₂ may not hold.     

Efficient computation of location depth contours by methods of computational geometry

The concept of location depth was introduced as a way to extend the univariate notion of ranking to a bivariate configuration of data points. It has been used successfully for robust estimation, hypothesis testing, and graphical display. The depth contours form a collection of nested polygons, and the center of the deepest contour is called the Tukey median. The only available implemented algorithms for the depth contours and the Tukey median are slow, which limits their usefulness. In this paper we describe an optimal algorithm which computes all bivariate depth contours in O(n ²) time and space, using topological sweep of the dual arrangement of lines. Once these contours are known, the location depth of any point can be computed in O(log² n) time with no additional preprocessing or in O(log n) time after O(n ²) preprocessing. We provide fast implementations of these algorithms to allow their use in everyday statistical practice.     

Jackknifing two-sample statistics

In this paper, a new simple method for jackknifing two-sample statistics is proposed. The method is based on a two-step procedure. In the first step, the point estimator is calculated by leaving one X (or Y) out at a time. At the second step, the point estimator obtained in the first step is further jackknifed, leaving one Y (or X) out at a time, resulting in a simple formula for the proposed point estimator. It is shown that by using the two-step procedure, the bias of the point estimator is reduced in terms of asymptotic order, from O(n⁻¹) up to O(n⁻²), under certain regularity conditions. This conclusion is also confirmed empirically in terms of finite sample numerical examples via a small-scale simulation study. We also discuss the idea of asymptotic bias to obtain parallel results without imposing some conditions that may be difficult to check or too restrictive in practice.     

Confidence intervals for the length of a vector mean

Suppose we have a random sample of size n from a multivariate distribution with finite moments, for which a parametric form is not available. We wish to obtain a confidence interval (CI) for the length of its mean. The usual method is to Studentize. The resulting CIs are not exact. The error in their nominal levels is ～n ^?1/2 and ～n ^?1 in the one-sided and two-sided cases. We show how to reduce these errors to ～n ^?3/2 and ～n ^?2.     

Sensitivity of Rao's score test,the Wald test and the likelihood ratio test to nuisance parameters

The purpose of this paper is to compare the sensitivity of the likelihood ratio test, Rao's score test, and the Wald test to the change of the nuisance parameters. The main result is that, with an error of magnitude O(n⁻¹), the null distributions and the local alternative distributions of these tests are equally sensitive to nuisance parameter. We will also give accurate factorizations of these test statistics as quadratic forms, which are themselves useful for asymptotic analyses.     

SOME LAW OF THE ITERATED LOGARITHM TYPE RESULTS FOR THE EMPIRICAL PROCESS

We consider Z^±_n= sup_{0< t ≤ 1/2}2 U^±_n (t)/(t(1- t))^1/2, where + and -denote the positive and negative parts respectively of the sample paths of the empirical process U_n. U^±_n and U_n are seen to behave rather differently, which is tied to the asymmetry of the binomial distribution, or to the asymmetry of the distribution of small order statistics. Csáki (1975) showed that log Z^±_n/log₂n is the appropriate normalization for a law of the iterated logarithm (LIL) for Z^±_n we show that Z^-_n/(2 log₂n)^1/2 is the appropriate normalization for Z^-_n. Csörgö & Révész (1975) posed the question: if we replace the sup over (0,1/2) above, by -the sup over [a_n, 1-a_n] where a_n→0, how fast can a_n→0 and still have |Z_n|/(2 log₂n)^1/2 maintain a finite lim sup a.s.? This question is answered herein. The techniques developed are then used in Section 4 to give an interesting new proof of the upper class half of a result of Chung (1949) for |U_n(t)|. The proofs draw heavily on James (1975); two basic inequalities of that paper are strengthened to their potential, and are felt to be of independent interest.     

On a Berry-Esséen theorem for a Studentized jackknife L-estimate

Consider a linear function of order statistics (“L-estimate”) which can be expressed as a statistical function T(F_n) based on the sample cumulative distribution function F_n. Let T*(F_n) be the corresponding jackknifed version of T(F_n), and let V²_n be the jackknife estimate of the asymptotic variance of n ^1/2T(F_n) or n ^1/2T*(F_n). In this paper, we provide a Berry-Esséen rate of the normal approximation for a Studentized jackknife L-estimate n^1/2[T*(F_n) - T(F)]/V_n, where T(F) is the basic functional associated with the L-estimate.     

A tutorial on rank-based coefficient estimation for censored data in small- and large-scale problems

The analysis of survival endpoints subject to right-censoring is an important research area in statistics, particularly among econometricians and biostatisticians. The two most popular semiparametric models are the proportional hazards model and the accelerated failure time (AFT) model. Rank-based estimation in the AFT model is computationally challenging due to optimization of a non-smooth loss function. Previous work has shown that rank-based estimators may be written as solutions to linear programming (LP) problems. However, the size of the LP problem is O(n ²+p) subject to n ² linear constraints, where n denotes sample size and p denotes the dimension of parameters. As n and/or p increases, the feasibility of such solution in practice becomes questionable. Among data mining and statistical learning enthusiasts, there is interest in extending ordinary regression coefficient estimators for low-dimensions into high-dimensional data mining tools through regularization. Applying this recipe to rank-based coefficient estimators leads to formidable optimization problems which may be avoided through smooth approximations to non-smooth functions. We review smooth approximations and quasi-Newton methods for rank-based estimation in AFT models. The computational cost of our method is substantially smaller than the corresponding LP problem and can be applied to small- or large-scale problems similarly. The algorithm described here allows one to couple rank-based estimation for censored data with virtually any regularization and is exemplified through four case studies.     

Generalized bartlett correction

This paper provides a general method of modifying a statistic of interest in such a way that the distribution of the modified statistic can be approximated by an arbitrary reference distribution to an order of accuracy of O(n ^-1/2) or even O(n ^-1). The reference distribution is usually the asymptotic distribution of the original statistic. We prove that the multiplication of the statistic by a suitable stochastic correction improves the asymptotic approximation to its distribution. This paper extends the results of the closely related paper by Cordeiro and Ferrari (1991) to cope with several other statistical tests. The resulting expression for the adjustment factor requires knowledge of the Edgeworth-type expansion to order O(n^-1) for the distribution of the unmodified statistic. In practice its functional form involves some derivatives of the reference distribution. Certain difference between the cumulants of appropriate order in n of the unmodified statistic and those of its first-order approximation, and the unmodified statistic itself. Some applications are discussed.