A copula-based Markov chain model for the analysis of binary longitudinal data

A fully parametric first-order autoregressive (AR(1)) model is proposed to analyse binary longitudinal data. By using a discretized version of a copula, the modelling approach allows one to construct separate models for the marginal response and for the dependence between adjacent responses. In particular, the transition model that is focused on discretizes the Gaussian copula in such a way that the marginal is a Bernoulli distribution. A probit link is used to take into account concomitant information in the behaviour of the underlying marginal distribution. Fixed and time-varying covariates can be included in the model. The method is simple and is a natural extension of the AR(1) model for Gaussian series. Since the approach put forward is likelihood-based, it allows interpretations and inferences to be made that are not possible with semi-parametric approaches such as those based on generalized estimating equations. Data from a study designed to reduce the exposure of children to the sun are used to illustrate the methods.     

Nonparametric estimation of waiting time distributions in a Markov model based on current status data

We construct nonparametric estimators of state waiting time distribution functions in a Markov multistate model using current status data. This is a particularly difficult problem since neither the entry nor the exit times of a given state are directly observed. These estimators are obtained, using the Markov property, from estimators of counting processes of state entry and exit times, as well as, the size of “at risk” sets of state entry and transitions out of that state. Consistency of our estimators is established. Finite-sample behavior of our estimators is studied by simulation, in which we show that our estimators based on current status data compare well with those based on complete data. We also illustrate our method using a pubertal development data set obtained from the NHANES III [1997. NHANES III Reference Manuals and Reports (CD-ROM). Analytic and Reporting Guidelines: The Third National Health and Nutrition Examination Survey (1988–94). National Center for Health Statistics, Centers for Disease Control and Prevention, Hyattsville, MD] study.     

Model selection for Lévy measures in diffusion processes with jumps from discrete observations

We deal with parametric inference and selection problems for jump components in discretely observed diffusion processes with jumps. We prepare several competing parametric models for the Lévy measure that might be misspecified, and select the best model from the aspect of information criteria. We construct quasi-information criteria (QIC), which are approximations of the information criteria based on continuous observations.     

Two-dimensional generalisations of dynamic programming for image analysis

Dynamic programming (DP) is a fast, elegant method for solving many one-dimensional optimisation problems but, unfortunately, most problems in image analysis, such as restoration and warping, are two-dimensional. We consider three generalisations of DP. The first is iterated dynamic programming (IDP), where DP is used to recursively solve each of a sequence of one-dimensional problems in turn, to find a local optimum. A second algorithm is an empirical, stochastic optimiser, which is implemented by adding progressively less noise to IDP. The final approach replaces DP by a more computationally intensive Forward-Backward Gibbs Sampler, and uses a simulated annealing cooling schedule. Results are compared with existing pixel-by-pixel methods of iterated conditional modes (ICM) and simulated annealing in two applications: to restore a synthetic aperture radar (SAR) image, and to warp a pulsed-field electrophoresis gel into alignment with a reference image. We find that IDP and its stochastic variant outperform the remaining algorithms.     

Approximate Bayesian inference for latent Gaussian models by using integrated nested Laplace approximations

Summary.  Structured additive regression models are perhaps the most commonly used class of models in statistical applications. It includes, among others, (generalized) linear models, (generalized) additive models, smoothing spline models, state space models, semiparametric regression, spatial and spatiotemporal models, log-Gaussian Cox processes and geostatistical and geoadditive models. We consider approximate Bayesian inference in a popular subset of structured additive regression models, latent Gaussian models , where the latent field is Gaussian, controlled by a few hyperparameters and with non-Gaussian response variables. The posterior marginals are not available in closed form owing to the non-Gaussian response variables. For such models, Markov chain Monte Carlo methods can be implemented, but they are not without problems, in terms of both convergence and computational time. In some practical applications, the extent of these problems is such that Markov chain Monte Carlo sampling is simply not an appropriate tool for routine analysis. We show that, by using an integrated nested Laplace approximation and its simplified version, we can directly compute very accurate approximations to the posterior marginals. The main benefit of these approximations is computational: where Markov chain Monte Carlo algorithms need hours or days to run, our approximations provide more precise estimates in seconds or minutes. Another advantage with our approach is its generality, which makes it possible to perform Bayesian analysis in an automatic, streamlined way, and to compute model comparison criteria and various predictive measures so that models can be compared and the model under study can be challenged.     

SEMIPARAMETRIC REGRESSION AND GRAPHICAL MODELS

Semiparametric regression models that use spline basis functions with penalization have graphical model representations. This link is more powerful than previously established mixed model representations of semiparametric regression, as a larger class of models can be accommodated. Complications such as missingness and measurement error are more naturally handled within the graphical model architecture. Directed acyclic graphs, also known as Bayesian networks, play a prominent role. Graphical model-based Bayesian 'inference engines', such as bugs and vibes , facilitate fitting and inference. Underlying these are Markov chain Monte Carlo schemes and recent developments in variational approximation theory and methodology.     

VARIATIONAL BAYESIAN ANALYSIS FOR HIDDEN MARKOV MODELS

The variational approach to Bayesian inference enables simultaneous estimation of model parameters and model complexity. An interesting feature of this approach is that it also leads to an automatic choice of model complexity. Empirical results from the analysis of hidden Markov models with Gaussian observation densities illustrate this. If the variational algorithm is initialized with a large number of hidden states, redundant states are eliminated as the method converges to a solution, thereby leading to a selection of the number of hidden states. In addition, through the use of a variational approximation, the deviance information criterion for Bayesian model selection can be extended to the hidden Markov model framework. Calculation of the deviance information criterion provides a further tool for model selection, which can be used in conjunction with the variational approach.     

A backward construction and simulation of correlated Poisson processes

In this paper, we consider a generalisation of the backward simulation method of Duch et al. [New approaches to operational risk modeling. IBM J Res Develop. 2014;58:1–9] to build bivariate Poisson processes with flexible time correlation structures, and to simulate the arrival times of the processes. The proposed backward construction approach uses the Marshall–Olkin bivariate binomial distribution for the conditional law and some well-known families of bivariate copulas for the joint success probability in lieu of the typical conditional independence assumption. The resulting bivariate Poisson process can exhibit various time correlation structures which are commonly observed in real data.     

Adaptive multiple importance sampling for Gaussian processes

In applications of Gaussian processes (GPs) where quantification of uncertainty is a strict requirement, it is necessary to accurately characterize the posterior distribution over Gaussian process covariance parameters. This is normally done by means of standard Markov chain Monte Carlo (MCMC) algorithms, which require repeated expensive calculations involving the marginal likelihood. Motivated by the desire to avoid the inefficiencies of MCMC algorithms rejecting a considerable amount of expensive proposals, this paper develops an alternative inference framework based on adaptive multiple importance sampling (AMIS). In particular, this paper studies the application of AMIS for GPs in the case of a Gaussian likelihood, and proposes a novel pseudo-marginal-based AMIS algorithm for non-Gaussian likelihoods, where the marginal likelihood is unbiasedly estimated. The results suggest that the proposed framework outperforms MCMC-based inference of covariance parameters in a wide range of scenarios.     

On the asymptotic normality of the R-estimators of the slope parameters of simple linear regression models with associated errors

ABSTRACT

The purpose of this paper is to prove, under mild conditions, the asymptotic normality of the rank estimator of the slope parameter of a simple linear regression model with stationary associated errors. This result follows from a uniform linearity property for linear rank statistics that we establish under general conditions on the dependence of the errors. We prove also a tightness criterion for weighted empirical process constructed from associated triangular arrays. This criterion is needed for the proofs which are based on that of Koul [Behavior of robust estimators in the regression model with dependent errors. Ann Stat. 1977;5(4):681–699] and of Louhichi [Louhichi S. Weak convergence for empirical processes of associated sequences. Ann Inst Henri Poincaré Probabilités Statist. 2000;36(5):547–567].