On generalised estimating equations for vector regression

Generalised estimating equations (GEE) for regression problems with vector‐valued responses are examined. When the response vectors are of mixed type (e.g. continuous–binary response pairs), the GEE approach is a semiparametric alternative to full‐likelihood copula methods, and is closely related to Prentice & Zhao's mean‐covariance estimation equations approach. When the response vectors are of the same type (e.g. measurements on left and right eyes), the GEE approach can be viewed as a ‘plug‐in’ to existing methods, such as the vglm function from the state‐of‐the‐art VGAM package in R. In either scenario, the GEE approach offers asymptotically correct inferences on model parameters regardless of whether the working variance–covariance model is correctly or incorrectly specified. The finite‐sample performance of the method is assessed using simulation studies based on a burn injury dataset and a sorbinil eye trial dataset. The method is applied to data analysis examples using the same two datasets, as well as to a trivariate binary dataset on three plant species in the Hunua ranges of Auckland.     

A powerful and efficient algorithm for breaking the links between aliased effects in asymmetric designs

Fractional factorial (FF) designs are no doubt the most widely used designs in experimental investigations due to their efficient use of experimental runs. One price we pay for using FF designs is, clearly, our inability to obtain estimates of some important effects (main effects or second order interactions) that are separate from estimates of other effects (usually higher order interactions). When the estimate of an effect also includes the influence of one or more other effects the effects are said to be aliased. Folding over an FF design is a method for breaking the links between aliased effects in a design. The question is, how do we define the foldover structure for asymmetric FF designs, whether regular or nonregular? How do we choose the optimal foldover plan? How do we use optimal foldover plans to construct combined designs which have better capability of estimating lower order effects? The main objective of the present paper is to provide answers to these questions. Using the new results in this paper as benchmarks, we can implement a powerful and efficient algorithm for finding optimal foldover plans which can be used to break links between aliased effects.     

(Sub) Optimality and (non) optimal satisficing in risky decision experiments

We implement a risky choice experiment based on one-dimensional choice variables and risk neutrality induced via binary lottery incentives. Each participant confronts many parameter constellations with varying optimal payoffs. We assess (sub)optimality, as well as (non)optimal satisficing by eliciting aspirations in addition to choices. Treatments differ in the probability that a binary random event, which are payoff—but not optimal choice—relevant is experimentally induced and whether participants choose portfolios directly or via satisficing, i.e., by forming aspirations and checking for satisficing before making their choice. By incentivizing aspiration formation, we can test satisficing, and in cases of satisficing, determine whether it is optimal.     

Mixture inverse Gaussian for unobserved heterogeneity in the autoregressive conditional duration model

In this paper, we assume that the duration of a process has two different intrinsic components or phases which are independent. The first is the time it takes for a trade to be initiated in the market (for example, the time during which agents obtain knowledge about the market in which they are operating and accumulate information, which is coherent with Brownian motion) and the second is the subsequent time required for the trade to develop into a complete duration. Of course, if the first time is zero then the trade is initiated immediately and no initial knowledge is required. If we assume a specific compound Bernoulli distribution for the first time and an inverse Gaussian distribution for the second, the resulting convolution model has a mixture of an inverse Gaussian distribution with its reciprocal, which allows us to specify and test the unobserved heterogeneity in the autoregressive conditional duration (ACD) model.

Our proposals make it possible not only to capture various density shapes of the durations but also easily to accommodate the behaviour of the tail of the distribution and the non monotonic hazard function. The proposed model is easy to fit and characterizes the behaviour of the conditional durations reasonably well in terms of statistical criteria based on point and density forecasts.     

Bayesian quantile regression for skew-normal linear mixed models

Linear mixed models have been widely used to analyze repeated measures data which arise in many studies. In most applications, it is assumed that both the random effects and the within-subjects errors are normally distributed. This can be extremely restrictive, obscuring important features of within-and among-subject variations. Here, quantile regression in the Bayesian framework for the linear mixed models is described to carry out the robust inferences. We also relax the normality assumption for the random effects by using a multivariate skew-normal distribution, which includes the normal ones as a special case and provides robust estimation in the linear mixed models. For posterior inference, we propose a Gibbs sampling algorithm based on a mixture representation of the asymmetric Laplace distribution and multivariate skew-normal distribution. The procedures are demonstrated by both simulated and real data examples.     

The performance of model averaged tail area confidence intervals

We investigate the exact coverage and expected length properties of the model averaged tail area (MATA) confidence interval proposed by Turek and Fletcher, CSDA, 2012, in the context of two nested, normal linear regression models. The simpler model is obtained by applying a single linear constraint on the regression parameter vector of the full model. For given length of response vector and nominal coverage of the MATA confidence interval, we consider all possible models of this type and all possible true parameter values, together with a wide class of design matrices and parameters of interest. Our results show that, while not ideal, MATA confidence intervals perform surprisingly well in our regression scenario, provided that we use the minimum weight within the class of weights that we consider on the simpler model.     

Parallel and interacting stochastic approximation annealing algorithms for global optimisation

We present the parallel and interacting stochastic approximation annealing (PISAA) algorithm, a stochastic simulation procedure for global optimisation, that extends and improves the stochastic approximation annealing (SAA) by using population Monte Carlo ideas. The efficiency of standard SAA algorithm crucially depends on its self-adjusting mechanism which presents stability issues in high dimensional or rugged optimisation problems. The proposed algorithm involves simulating a population of SAA chains that interact each other in a manner that significantly improves the stability of the self-adjusting mechanism and the search for the global optimum in the sampling space, as well as it inherits SAA desired convergence properties when a square-root cooling schedule is used. It can be implemented in parallel computing environments in order to mitigate the computational overhead. As a result, PISAA can address complex optimisation problems that it would be difficult for SAA to satisfactory address. We demonstrate the good performance of the proposed algorithm on challenging applications including Bayesian network learning and protein folding. Our numerical comparisons suggest that PISAA outperforms the simulated annealing, stochastic approximation annealing, and annealing evolutionary stochastic approximation Monte Carlo.     

Control‐based imputation for sensitivity analyses in informative censoring for recurrent event data

In clinical trials, missing data commonly arise through nonadherence to the randomized treatment or to study procedure. For trials in which recurrent event endpoints are of interests, conventional analyses using the proportional intensity model or the count model assume that the data are missing at random, which cannot be tested using the observed data alone. Thus, sensitivity analyses are recommended. We implement the control‐based multiple imputation as sensitivity analyses for the recurrent event data. We model the recurrent event using a piecewise exponential proportional intensity model with frailty and sample the parameters from the posterior distribution. We impute the number of events after dropped out and correct the variance estimation using a bootstrap procedure. We apply the method to an application of sitagliptin study.