USING TRAJECTORIES FROM A BIVARIATEGROWTH CURVE OF COVARIATES IN A COXMODEL ANALYSIS

In many maintenance treatment trials, patients are first enrolled into an open treatmentbefore they are randomized into treatment groups. During this period, patients are followedover time with their responses measured longitudinally. This design is very common intoday's public health studies of the prevention of many diseases. Using mixed model theory, onecan characterize these data using a wide array of across subject models. A state-spacerepresentation of the mixed model and use of the Kalman filter allow more fexibility inchoosing the within error correlation structure even in the presence of missing and unequallyspaced observations. Furthermore, using the state-space approach, one can avoid invertinglarge matrices resulting in eficient computations. Estimated trajectories from these models can be used as predictors in a survival analysis in judging the efacacy of the maintenance treatments. The statistical problem lies in accounting for the estimation error in these predictors. We considered a bivariate growth curve where the longitudinal responses were unequally spaced and assumed that the within subject errors followed a continuous firstorder autoregressive (CAR (1)) structure. A simulation study was conducted to validatethe model. We developed a method where estimated random effects for each subject froma bivariate growth curve were used as predictors in the Cox proportional hazards model,using the full likelihood based on the conditional expectation of covariates to adjust for the estimation errors in the predictor variables. Simulation studies indicated that error corrected estimators for model parameters are mostly less biased when compared with thenave regression without accounting for estimation errors. These results hold true in Coxmodels with one or two predictors. An illustrative example is provided with data from a maintenance treatment trial for major depression in an elderly population. A Visual Fortran 90 and a SAS IML program are developed

On dimension reduction in Gaussian filters

A priori dimension reduction is a widely adopted technique for reducing the computational complexity of stationary inverse problems. In this setting, the solution of an inverse problem is parameterized by a low-dimensional basis that is often obtained from the truncated Karhunen-Loeve expansion of the prior distribution. For high-dimensional inverse problems equipped with smoothing priors, this technique can lead to drastic reductions in parameter dimension and significant computational savings. In this paper, we extend the concept of a priori dimension reduction to non-stationary inverse problems, in which the goal is to sequentially infer the state of a dynamical system. Our approach proceeds in an offline-online fashion. We first identify a low-dimensional subspace in the state space before solving the inverse problem (the offline phase), using either the method of "snapshots" or regularized covariance estimation. Then this subspace is used to reduce the computational complexity of various filtering algorithms - including the Kalman filter, extended Kalman filter, and ensemble Kalman filter - within a novel subspace-constrained Bayesian prediction-and-update procedure (the online phase). We demonstrate the performance of our new dimension reduction approach on various numerical examples. In some test cases, our approach reduces the dimensionality of the original problem by orders of magnitude and yields up to two orders of magnitude in computational savings