Analysis of Competing Risks by Using Bayesian Smoothing

We consider the competing risks set-up. In many practical situations, the conditional probability of the cause of failure given the failure time is of direct interest. We propose to model the competing risks by the overall hazard rate and the conditional probabilities rather than the cause-specific hazards. We adopt a Bayesian smoothing approach for both quantities of interest. Illustrations are given at the end.     

On the Critical Value Behaviour of Multiple Decision Procedures

In this paper we investigate the asymptotic critical value behaviour of certain multiple decision procedures as e.g. simultaneous confidence intervals and simultaneous as well as stepwise multiple test procedures. Supposing that n hypotheses or parameters of interest are under consideration we investigate the critical value behaviour when n increases. More specifically, we answer e.g. the question by which amount the lengths of confidence intervals increase when an additional parameter is added to the statistical analysis. Furthermore, critical values of different multiple decision procedures as for instance step-down and step-up procedures will be compared. Some general theoretic results are derived and applied for various distributions.     

Asymptotic Bias in Parameter Estimation of AR-Processes Using Recursive Least Squares with Exponential Forgetting

The recursive least squares technique is often extended with exponential forgetting as a tool for parameter estimation in time-varying systems. The distribution of the resulting parameter estimates is, however, unknown when the forgetting factor is less than one. In this paper an approximative expression for bias of the recursively obtained parameter estimates in a time-invariant AR( n_a ) process with arbitrary noise is given, showing that the bias is non-zero and giving bounds on the approximation errors. Simulations confirm the approximation expressions.     

Testing for No Effect by Cosine Series Methods

The properties of three lack-of-fit tests that are related to non-parametric cosine regression analysis are examined in the context of testing for a constant mean function. Analytic power comparisons of these tests vs a most powerful test are made using intermediate asymptotic relative efficiency. In particular, a data-driven test is produced which is asymptotically as efficient as the most powerful test over a class of alternatives. A small scale simulation experiment is conducted to ascertain the extent that the large sample comparisons are applicable to finite samples.     

On predictive distributions and Bayesian networks

In this paper we are interested in discrete prediction problems for a decision-theoretic setting, where the task is to compute the predictive distribution for a finite set of possible alternatives. This question is first addressed in a general Bayesian framework, where we consider a set of probability distributions defined by some parametric model class. Given a prior distribution on the model parameters and a set of sample data, one possible approach for determining a predictive distribution is to fix the parameters to the instantiation with the maximum a posteriori probability. A more accurate predictive distribution can be obtained by computing the evidence (marginal likelihood), i.e., the integral over all the individual parameter instantiations. As an alternative to these two approaches, we demonstrate how to use Rissanen's new definition of stochastic complexity for determining predictive distributions, and show how the evidence predictive distribution with Jeffrey's prior approaches the new stochastic complexity predictive distribution in the limit with increasing amount of sample data. To compare the alternative approaches in practice, each of the predictive distributions discussed is instantiated in the Bayesian network model family case. In particular, to determine Jeffrey's prior for this model family, we show how to compute the (expected) Fisher information matrix for a fixed but arbitrary Bayesian network structure. In the empirical part of the paper the predictive distributions are compared by using the simple tree-structured Naive Bayes model, which is used in the experiments for computational reasons. The experimentation with several public domain classification datasets suggest that the evidence approach produces the most accurate predictions in the log-score sense. The evidence-based methods are also quite robust in the sense that they predict surprisingly well even when only a small fraction of the full training set is used.     

A class of weighted dependence measures for bivariate failure time data

This paper considers a class of summary measures of the dependence between a pair of failure time variables over a finite follow-up region. The class consists of measures that are weighted averages of local dependence measures, and includes the cross-ratio-measure and finite region version of Kendall's τ; recently proposed by the authors. Two new special cases are identified that can avoid the need to estimate the bivariate survivor function and that admit explicit variance estimators. Nonparametric estimators of such dependence measures are proposed and are shown to be consistent and asymptotically normal with variances that can be consistently estimated. Properties of selected estimators are evaluated in a simulation study, and the method is illustrated through an analysis of Australian Twin Study data.     

Standard errors for EM estimation

The EM algorithm is a popular method for computing maximum likelihood estimates. One of its drawbacks is that it does not produce standard errors as a by-product. We consider obtaining standard errors by numerical differentiation. Two approaches are considered. The first differentiates the Fisher score vector to yield the Hessian of the log-likelihood. The second differentiates the EM operator and uses an identity that relates its derivative to the Hessian of the log-likelihood. The well-known SEM algorithm uses the second approach. We consider three additional algorithms: one that uses the first approach and two that use the second. We evaluate the complexity and precision of these three and the SEM in algorithm seven examples. The first is a single-parameter example used to give insight. The others are three examples in each of two areas of EM application: Poisson mixture models and the estimation of covariance from incomplete data. The examples show that there are algorithms that are much simpler and more accurate than the SEM algorithm. Hopefully their simplicity will increase the availability of standard error estimates in EM applications. It is shown that, as previously conjectured, a symmetry diagnostic can accurately estimate errors arising from numerical differentiation. Some issues related to the speed of the EM algorithm and algorithms that differentiate the EM operator are identified.     

On Bartlett correction of empirical likelihood for regularly spaced spatial data

Bartlett correction constitutes one of the attractive features of empirical likelihood because it enables the construction of confidence regions for parameters with improved coverage probabilities. We study the Bartlett correction of spatial frequency domain empirical likelihood (SFDEL) based on general spectral estimating functions for regularly spaced spatial data. This general formulation can be applied to testing and estimation problems in spatial analysis, for example testing covariance isotropy, testing covariance separability as well as estimating the parameters of spatial covariance models. We show that the SFDEL is Bartlett correctable. In particular, the improvement in coverage accuracies of the Bartlett‐corrected confidence regions depends on the underlying spatial structures. The Canadian Journal of Statistics 47: 455–472; 2019 © 2019 Statistical Society of Canada