arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1202.3703eess.SYcs.AIcs.SY
收藏

连续时间系统的因子化滤波

Factored Filtering of Continuous-Time Systems

University of California, Riverside(加州大学河滨分校);University of California, Irvine(加州大学欧文分校)

E. Busra Celikkaya, Christian R. Shelton, William Lam

AI总结:

针对状态分布过大的连续时间随机系统,提出因子化近似方法,通过矩阵指数的ODE积分和均匀化展开两种计算方式,证明因子化均匀化的KL散度有界,实验表明优于现有方法。

摘要:

我们考虑连续时间或异步随机系统的滤波问题,其中状态的全分布过大而无法存储或计算。我们假设系统的速率矩阵可以紧凑表示,并且信念分布近似为边缘分布的乘积。关键计算是矩阵指数。我们研究了两种不同的计算方法:ODE积分和泰勒展开的均匀化。对于这两种方法,我们考虑了仅维护因子化信念状态的近似。对于因子化均匀化,我们证明了滤波的KL散度有界。我们的实验结果证实,因子化均匀化比先前提出的均匀化方法和平均场算法表现更好。

英文摘要:

We consider filtering for a continuous-time, or asynchronous, stochastic system where the full distribution over states is too large to be stored or calculated. We assume that the rate matrix of the system can be compactly represented and that the belief distribution is to be approximated as a product of marginals. The essential computation is the matrix exponential. We look at two different methods for its computation: ODE integration and uniformization of the Taylor expansion. For both we consider approximations in which only a factored belief state is maintained. For factored uniformization we demonstrate that the KL-divergence of the filtering is bounded. Our experimental results confirm our factored uniformization performs better than previously suggested uniformization methods and the mean field algorithm.

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

↑