arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2301.00843eess.SPcs.ITmath.ITq-bio.QM
收藏

部分可观测马氏过程的显式可解连续时间推断

Explicitly Solvable Continuous-time Inference for Partially Observed Markov Processes

Daniel Chen, Alexander G. Strang, Andrew W. Eckford, Peter J. Thomas

摘要:

许多自然和工程系统可以建模为离散状态马尔可夫过程。通常,只有状态的子集是直接可观察的。在给定部分观测值的情况下,推断系统占据特定隐藏状态的条件概率是一个有着广泛应用的问题。在本文中,我们介绍了一个连续时间公式的和积算法,这是一个著名的离散时间方法,找到隐藏状态的条件概率,给定一组有限的,离散时间的观察。从我们的新公式中,我们可以明确地求解占据任何状态的条件概率,给定有限时间窗口内的跃迁率和观测。我们将我们的算法应用到囊性纤维化跨膜传导调节因子(CFTR)蛋白质的一个现实模型中,以精确推断条件占用概率,给出一个有限的时间序列的部分观测。

英文摘要:

Many natural and engineered systems can be modeled as discrete state Markov processes. Often, only a subset of states are directly observable. Inferring the conditional probability that a system occupies a particular hidden state, given the partial observation, is a problem with broad application. In this paper, we introduce a continuous-time formulation of the sum-product algorithm, which is a well-known discrete-time method for finding the hidden states' conditional probabilities, given a set of finite, discrete-time observations. From our new formulation, we can explicitly solve for the conditional probability of occupying any state, given the transition rates and observations within a finite time window. We apply our algorithm to a realistic model of the cystic fibrosis transmembrane conductance regulator (CFTR) protein for exact inference of the conditional occupancy probability, given a finite time series of partial observations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑