English

JUMP-Means: Small-Variance Asymptotics for Markov Jump Processes

Machine Learning 2015-06-08 v3 Machine Learning

Abstract

Markov jump processes (MJPs) are used to model a wide range of phenomena from disease progression to RNA path folding. However, maximum likelihood estimation of parametric models leads to degenerate trajectories and inferential performance is poor in nonparametric models. We take a small-variance asymptotics (SVA) approach to overcome these limitations. We derive the small-variance asymptotics for parametric and nonparametric MJPs for both directly observed and hidden state models. In the parametric case we obtain a novel objective function which leads to non-degenerate trajectories. To derive the nonparametric version we introduce the gamma-gamma process, a novel extension to the gamma-exponential process. We propose algorithms for each of these formulations, which we call \emph{JUMP-means}. Our experiments demonstrate that JUMP-means is competitive with or outperforms widely used MJP inference approaches in terms of both speed and reconstruction accuracy.

Keywords

Cite

@article{arxiv.1503.00332,
  title  = {JUMP-Means: Small-Variance Asymptotics for Markov Jump Processes},
  author = {Jonathan H. Huggins and Karthik Narasimhan and Ardavan Saeedi and Vikash K. Mansinghka},
  journal= {arXiv preprint arXiv:1503.00332},
  year   = {2015}
}

Comments

In Proceedings of the 32nd International Conference on Machine Learning (ICML 2015)

R2 v1 2026-06-22T08:41:09.326Z