Search arXivSearch

arXiv · 2201.07796

The R package $\texttt{ebmstate}$ for disease progression analysis under empirical Bayes Cox models

Abstract

The software package $\texttt{mstate}$, in articulation with the package $\texttt{survival}$, provides not only a well-established multi-state survival analysis framework in R, but also one of the most complete, as it includes point and interval estimation of relative transition hazards, cumulative transition hazards and state occupation probabilities, both under clock-forward and clock-reset models; personalised estimates, i.e. estimates for an individual with specific covariate measurements, can also be obtained with $\texttt{mstate}$ by fitting a Cox regression model. The new R package $\texttt{ebmstate}$, which we present in the current paper, is an extension of $\texttt{mstate}$ and, to our knowledge, the first R package for multi-state model estimation that is suitable for higher-dimensional data and complete in the sense just mentioned. Its extension of $\texttt{mstate}$ is threefold: it transforms the Cox model into a regularised, empirical Bayes model that performs significantly better with higher-dimensional data; it replaces asymptotic confidence intervals meant for the low-dimensional setting by non-parametric bootstrap confidence intervals; and it introduces an analytical, Fourier transform-based estimator of state occupation probabilities for clock-reset models that is substantially faster than the corresponding, simulation-based estimator in $\texttt{mstate}$. The present paper includes a detailed tutorial on how to use our package to estimate transition hazards and state occupation probabilities, as well as a simulation study showing how it improves the performance of $\texttt{mstate}$.

Explore related subjects

Keep this discovery

BibTeXRIS

Rui J. Costa, Moritz Gerstung. 2022-01-19. The R package $\texttt{ebmstate}$ for disease progression analysis under empirical Bayes Cox models. https://arxiv.org/abs/2201.07796

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO