Searcharxiv⌕ Search

arXiv · 2611.04212

Deterministic Uniformization for Estimation and Latent Trajectory Inference in Interval-Censored Multistate Triansition Models

Abstract

Interval-censored multistate data arise when subjects are observed at irregular visit times, leaving transition times and intermediate states unobserved. Likelihood-based inference for continuous-time Markov models often requires computationally intensive matrix exponential evaluations. We propose a deterministic uniformization expectation-maximization (EM) algorithm for parameter estimation and latent trajectory inference. By representing the continuous-time process through an embedded Markov chain indexed by latent Poisson event counts, the method enables deterministic E-step calculations without repeated matrix exponential evaluations. The M-step reduces to transition-specific Poisson regressions with exposure offsets, accommodating covariate-dependent transition intensities. We establish uniform truncation error bounds and show that the procedure is an asymptotically monotone generalized EM algorithm. Under standard regularity conditions, the estimator is consistent and asymptotically normal. Simulations demonstrate accurate estimation and computational advantages over direct likelihood optimization, particularly for complex transition structures. We also develop an exact dynamic programming method to calculate posterior probabilities of candidate latent pathways and identify the most probable pathway between observations. Posterior expected transition counts and state occupancy times provide additional subject-specific summaries, while expected-count ratios offer a computational shortcut for classification in simple mutually exclusive pathway structures. The framework supports both population-level inference and individualized characterization of disease progression.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yuxi Zhu. 2026-11-03. Deterministic Uniformization for Estimation and Latent Trajectory Inference in Interval-Censored Multistate Triansition Models. https://arxiv.org/abs/2611.04212

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

KEEP EXPLORING

Related papers

Debiased Estimating Equation Method for Robust and Efficient Mendelian Randomization Using a Large Number of Correlated Weak and Invalid Instruments

Mendelian randomization (MR) is a widely used tool for causal inference in the presence of unmeasured confounders, which uses single nucleotide polymorphisms (SNPs) as instrumental variables to estimate causal effects. However, SNPs often have weak effects on complex traits, leading to bias in existing MR analyses when weak instruments are included. In addition, existing MR methods often restrict analysis to independent SNPs via linkage disequilibrium clumping and result in a loss of efficiency in estimating the causal effect due to discarding correlated SNPs. To address these issues, we propose the Debiased Estimating Equation Method (DEEM), a summary statistics-based MR approach that can incorporate a large number of correlated, weak-effect, and invalid SNPs. DEEM effectively eliminates the weak instrument bias and improves the statistical efficiency of the causal effect estimation by leveraging information from a large number of correlated SNPs. DEEM also allows for pleiotropic effects, adjusts for the winner's curse, and applies to both two-sample and one-sample MR analyses. Asymptotic analyses of the DEEM estimator demonstrate its attractive theoretical properties. Through extensive simulations and two real data examples, we demonstrate that DEEM significantly improves the efficiency and robustness of MR analysis compared with existing methods.

stat.ME↗

Latent Space Graph-fused LASSO for Clustering in Attributed Graphs

This manuscript studies latent space graph-fused LASSO methods for clustering graphs with multivariate nodal attributes. The framework includes node-specific priors of low-dimensional representations coupled with a neural decoder that bridges the observed attributes with the latent variables. Both structural and attribute information are incorporated for the clustering through a graph-fused LASSO regularization on prior nodal means. The optimization problem is solved via the alternating direction method of multipliers with Langevin dynamics for posterior inference. Simulations on grid and block graphs, together with applications to California county temperatures and Los Angeles traffic data, demonstrate the effectiveness of the proposed method.

stat.ME↗

Missing data and cluster graphs: cluster-level missingness vs variable-level missingness

Missing data is pervasive in many scientific domains such as public health, environmental science, and the social sciences. Recoverability from missing data is typically studied using fully specified variable-level missingness models despite that, in many applications, only coarse structural information is available, for instance when variables are grouped into clusters due to limited knowledge or interpretability reasons. In this paper, we investigate recoverability from such abstract representations. We introduce two classes of cluster-based missingness graphs: the m-C-DMG, which retains variable-specific missingness indicators, and the cm-C-DMG, which aggregates missingness mechanisms at the cluster level. We formalize the notion of compatibility between these abstract graphs and underlying variable-level missingness models, and study how this abstraction affects the recoverability of probabilistic and causal queries. In particular, we give graphical conditions of recovering the joint distribution as well as graphical conditions of recovering a macro causal effect.

stat.ME↗