Numerical techniques for estimating probabilities

In this article we consider the pioblem of finding the maximum likelihood estimate for a certain class of discrete sampling models. Methods are adapted from parts of convex optimization theory, includiug aspects of equivalence theory, duality theorv and iterative procedures Their application is illustrated through example.     

Control Variates for Monte Carlo Analysis of Nonlinear Statistical Models,I: Overview

Parameter values of nonlinear statistical models are typically estimated from data using iterative numerical procedures. The resulting joint sampling distribution of the parameter estimators is often intractable, resulting in the use of approximators or Monte Carlo simulation to determine properties of the sampling distribution.

This paper develops methods, using linear and higher-order approximators as control variates that reduce the variance of the Monte Carlo estimator by orders of magnitude. Estimation of means, higher-order raw moments, variances, covariances, and percentiles is considered.     

General m-esttmators and applications to bounded influence estimation for non-linear regression

In this paper, we study the M-estimators in the case that λ_F:(β)=E_F:(φ(Z,β))=0 has more than one solution, We show that the numerical iterative procedures converge and that the resulting estimators are consistent and asymptotically normal. We apply them to the non-linear regression models, and then, we find an optimal M-estimate among those that have bounded gross error sensitivity.     

Parameter estimation of three-parameter Weibull distribution based on progressively Type-II censored samples

In this paper, the estimation of parameters for a three-parameter Weibull distribution based on progressively Type-II right censored sample is studied. Different estimation procedures for complete sample are generalized to the case with progressively censored data. These methods include the maximum likelihood estimators (MLEs), corrected MLEs, weighted MLEs, maximum product spacing estimators and least squares estimators. We also proposed the use of a censored estimation method with one-step bias-correction to obtain reliable initial estimates for iterative procedures. These methods are compared via a Monte Carlo simulation study in terms of their biases, root mean squared errors and their rates of obtaining reliable estimates. Recommendations are made from the simulation results and a numerical example is presented to illustrate all of the methods of inference developed here.     

AN EVALUATION OF NON-ITERATIVE METHODS FOR ESTIMATING THE LINEAR-BY-LINEAR PARAMETER OF ORDINAL LOG-LINEAR MODELS

Parameter estimation for association and log-linear models is an important aspect of the analysis of cross-classified categorical data. Classically, iterative procedures, including Newton's method and iterative scaling, have typically been used to calculate the maximum likelihood estimates of these parameters. An important special case occurs when the categorical variables are ordinal and this has received a considerable amount of attention for more than 20 years. This is because models for such cases involve the estimation of a parameter that quantifies the linear-by-linear association and is directly linked with the natural logarithm of the common odds ratio. The past five years has seen the development of non-iterative procedures for estimating the linear-by-linear parameter for ordinal log-linear models. Such procedures have been shown to lead to numerically equivalent estimates when compared with iterative, maximum likelihood estimates. Such procedures also enable the researcher to avoid some of the computational difficulties that commonly arise with iterative algorithms. This paper investigates and evaluates the performance of three non-iterative procedures for estimating this parameter by considering 14 contingency tables that have appeared in the statistical and allied literature. The estimation of the standard error of the association parameter is also considered.     

Checking adequacy of the semiparametric location shift model with censored data

The location shift model is commonly used to quantify the difference between groups in a two-arm study. Nonparametric inference procedures for the location shift parameter with censored observations have recently been extensively studied. However, the validity of these procedures depends heavily on the model assumption. In this article, a class of graphical and numerical methods are proposed for checking the adequacy of the location shift model. Our graphical procedures are much less subjective than the eye-ball method based on the standard Q-Q plot. The proposed methods are illustrated with real-life examples.     

Local likelihood density estimation for interval censored data

The authors propose a class of procedures for local likelihood estimation from data that are either interval‐censored or that have been aggregated into bins. One such procedure relies on an algorithm that generalizes existing self‐consistency algorithms by introducing kernel smoothing at each step of the iteration. The entire class of procedures yields estimates that are obtained as solutions of fixed point equations. By discretizing and applying numerical integration, the authors use fixed point theory to study convergence of algorithms for the class. Rapid convergence is effected by the implementation of a local EM algorithm as a global Newton iteration. The latter requires an explicit solution of the local likelihood equations which can be found by using the symbolic Newton‐Raphson algorithm, if necessary.     

The Box–Cox Transformation and Non‐Iterative Estimation Methods for Ordinal Log‐Linear Models

Recently Beh and Farver investigated and evaluated three non‐iterative procedures for estimating the linear‐by‐linear parameter of an ordinal log‐linear model. The study demonstrated that these non‐iterative techniques provide estimates that are, for most types of contingency tables, statistically indistinguishable from estimates from Newton's unidimensional algorithm. Here we show how two of these techniques are related using the Box–Cox transformation. We also show that by using this transformation, accurate non‐iterative estimates are achievable even when a contingency table contains sampling zeros.     

Some Analytical and Numerical Bounds on the Renewal Function

Renewal-type equations are frequently encountered in the study of reliability, warranty analysis, replacement and maintenance policies, and inventory control. Renewal equations usually do not have analytical solutions, and hence, bounds or approximations are very useful. In this article, analytical bounds are studied based on a simple iterative procedure which provides some analytical results and nice convergence properties when the number of iteration increases. Bounds and approximations are also investigated for a recursive algorithm for numerical computation. In addition, some interesting monotonicity properties are introduced and discussed. The approximation error, which is important for determining the stopping rule of the iterative procedure and the numerical algorithm, is also studied.     

An approximate maximum likelihood procedure for parameter estimation in multivariate discrete data regression models

This paper considers an alternative to iterative procedures used to calculate maximum likelihood estimates of regression coefficients in a general class of discrete data regression models. These models can include both marginal and conditional models and also local regression models. The classical estimation procedure is generally via a Fisher-scoring algorithm and can be computationally intensive for high-dimensional problems. The alternative method proposed here is non-iterative and is likely to be more efficient in high-dimensional problems. The method is demonstrated on two different classes of regression models.     

Sparse cluster analysis of large-scale discrete variables with application to single nucleotide polymorphism data

Currently, extreme large-scale genetic data present significant challenges for cluster analysis. Most of the existing clustering methods are typically built on the Euclidean distance and geared toward analyzing continuous response. They work well for clustering, e.g. microarray gene expression data, but often perform poorly for clustering, e.g. large-scale single nucleotide polymorphism (SNP) data. In this paper, we study the penalized latent class model for clustering extremely large-scale discrete data. The penalized latent class model takes into account the discrete nature of the response using appropriate generalized linear models and adopts the lasso penalized likelihood approach for simultaneous model estimation and selection of important covariates. We develop very efficient numerical algorithms for model estimation based on the iterative coordinate descent approach and further develop the expectation–maximization algorithm to incorporate and model missing values. We use simulation studies and applications to the international HapMap SNP data to illustrate the competitive performance of the penalized latent class model.     

Computationally simple estimation and improved efficiency for special cases of double truncation

Doubly truncated survival data arise when event times are observed only if they occur within subject specific intervals of times. Existing iterative estimation procedures for doubly truncated data are computationally intensive (Turnbull 38:290–295, 1976; Efron and Petrosian 94:824–825, 1999; Shen 62:835–853, 2010a). These procedures assume that the event time is independent of the truncation times, in the sample space that conforms to their requisite ordering. This type of independence is referred to as quasi-independence. In this paper we identify and consider two special cases of quasi-independence: complete quasi-independence and complete truncation dependence. For the case of complete quasi-independence, we derive the nonparametric maximum likelihood estimator in closed-form. For the case of complete truncation dependence, we derive a closed-form nonparametric estimator that requires some external information, and a semi-parametric maximum likelihood estimator that achieves improved efficiency relative to the standard nonparametric maximum likelihood estimator, in the absence of external information. We demonstrate the consistency and potentially improved efficiency of the estimators in simulation studies, and illustrate their use in application to studies of AIDS incubation and Parkinson’s disease age of onset.     

A class of accelerated means regression models for recurrent event data

In this article, we propose a general class of accelerated means regression models for recurrent event data. The class includes the proportional means model, the accelerated failure time model and the accelerated rates model as special cases. The new model offers great flexibility in formulating the effects of covariates on the mean functions of counting processes while leaving the stochastic structure completely unspecified. For the inference on the model parameters, estimating equation approaches are developed and both large and final sample properties of the proposed estimators are established. In addition, some graphical and numerical procedures are presented for model checking. An illustration with multiple-infection data from a clinic study on chronic granulomatous disease is also provided.     

I-robust and D-robust designs on a finite design space

We present and discuss the theory of minimax I- and D-robust designs on a finite design space, and detail three methods for their construction that are new in this context: (i) a numerical search for the optimal parameters in a provably minimax robust parametric class of designs, (ii) a first-order iterative algorithm similar to that of Wynn (Ann Math Stat 5:1655–1664, 1970), and (iii) response-adaptive designs. These designs minimize a loss function, based on the mean squared error of the predicted responses or the parameter estimates, when the regression response is possibly misspecified. The loss function being minimized has first been maximized over a neighbourhood of the approximate and possibly inadequate response being fitted by the experimenter. The methods presented are all vastly more economical, in terms of the computing time required, than previously available algorithms.     

A modified chi-square test of independence against a class of ordered alternatives in an r x c contingency table

A modified chi-square test statistic is constructed for testing the hypothesis of independence in a two-way contingency table against a class of ordered alternatives defined in terms of pooled cross-product ratios. The test procedure can also be used to test for positive quadrant dependence in a two-way contingency table. The asymptotic distribution of the test statistic under the null hypothesis is obtained. Some power comparisons with known test procedures are given. A numerical example is given to illustrate the use of this test.     

Estimation of the multi-criteria worths of the alternatives in a hierarchical structure of comparisons

The aggregated worths of the alternatives, when compared with respect to several criteria, are estimated in a hierarchical comparisons model introduced by Saaty (1980). A multiplicative model is used for the paired comparisons data which are collected in a ratio scale in this set-up in any level of this hierarchy. An iterative scheme is found for the maximum likelihood estimation of the worth parameters in this multiplicative model. The iterative values are shown to be convergent monotonically to the estimates. We also obtain the asymptotic dispersion matrix of the maximum likelihood estimates of the relative worths of the alternatives according to a single criterion as well as those according to the over-all suitability when compared under several criteria. A numerical example is presented to illustrate the method developed in this paper. Simulation techniques are employed to find the average number of iterations required for the convergence of the above iterative scheme.     

Semiparametric regression for the mean and rate functions of recurrent events

The counting process with the Cox-type intensity function has been commonly used to analyse recurrent event data. This model essentially assumes that the underlying counting process is a time-transformed Poisson process and that the covariates have multiplicative effects on the mean and rate function of the counting process. Recently, Pepe and Cai, and Lawless and co-workers have proposed semiparametric procedures for making inferences about the mean and rate function of the counting process without the Poisson-type assumption. In this paper, we provide a rigorous justification of such robust procedures through modern empirical process theory. Furthermore, we present an approach to constructing simultaneous confidence bands for the mean function and describe a class of graphical and numerical techniques for checking the adequacy of the fitted mean–rate model. The advantages of the robust procedures are demonstrated through simulation studies. An illustration with multiple-infection data taken from a clinical study on chronic granulomatous disease is also provided.     

Estimating the parameters of mixed linear models with modal estimators

This paper presents a procedure to estimate the variance components and fixed effects of mixed linear models. The mode of the joint posterior distribution of all the parameters is obtained by an iterative technique.

The proposed method is illustrated with one-way and two-fold nested random models. Two numerical examples demonstrate the iterative solution.     

Estimation for Location-Scale Models with Censored Data

This article considers a class of estimators for the location and scale parameters in the location-scale model based on ‘synthetic data’ when the observations are randomly censored on the right. The asymptotic normality of the estimators is established using counting process and martingale techniques when the censoring distribution is known and unknown, respectively. In the case when the censoring distribution is known, we show that the asymptotic variances of this class of estimators depend on the data transformation and have a lower bound which is not achievable by this class of estimators. However, in the case that the censoring distribution is unknown and estimated by the Kaplan–Meier estimator, this class of estimators has the same asymptotic variance and attains the lower bound for variance for the case of known censoring distribution. This is different from censored regression analysis, where asymptotic variances depend on the data transformation. Our method has three valuable advantages over the method of maximum likelihood estimation. First, our estimators are available in a closed form and do not require an iterative algorithm. Second, simulation studies show that our estimators being moment-based are comparable to maximum likelihood estimators and outperform them when sample size is small and censoring rate is high. Third, our estimators are more robust to model misspecification than maximum likelihood estimators. Therefore, our method can serve as a competitive alternative to the method of maximum likelihood in estimation for location-scale models with censored data. A numerical example is presented to illustrate the proposed method.