arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2310.04620stat.CO
收藏

用于隐马尔可夫模型高效推断的方差缩减随机优化

Variance-Reduced Stochastic Optimization for Efficient Inference of Hidden Markov Models

Evan Sidrow, Nancy Heckman, Alexandre Bouchard-Côté, Sarah M. E. Fortune, Andrew W. Trites, Marie Auger-Méthé

AI总结:

本文提出一种结合部分E步与方差缩减随机优化的HMM参数更新算法,无需遍历整个数据集,并通过理论证明与虎鲸运动数据实验验证其收敛更快、似然更高。

摘要:

隐马尔可夫模型(HMMs)是从序列数据中识别有限数量潜在状态的常用模型。然而,将 HMM 拟合到大规模数据集可能计算成本很高,因为大多数似然最大化技术需要在每次参数更新时遍历整个底层数据集。我们提出一种新的优化算法,无需遍历整个数据集即可更新 HMM 的参数。具体来说,我们在 M 步中将部分 E 步与方差缩减随机优化相结合。我们证明该算法在一定的正则性条件下收敛。我们通过一项模拟研究以及一项案例研究对算法进行了实证测试,该案例研究使用吸附式生物记录仪从加拿大西海岸外八头北方居留型虎鲸(Orcinus orca)收集的运动学数据。在这两项测试中,与标准数值优化技术相比,我们的算法在更少的训练轮数内收敛,并达到更高似然区域。我们的算法使实践者能够比现有基线更高效地将复杂 HMM 拟合到大规模时间序列数据集。

英文摘要:

Hidden Markov models (HMMs) are popular models to identify a finite number of latent states from sequential data. However, fitting them to large data sets can be computationally demanding because most likelihood maximization techniques require iterating through the entire underlying data set for every parameter update. We propose a novel optimization algorithm that updates the parameters of an HMM without iterating through the entire data set. Namely, we combine a partial E step with variance-reduced stochastic optimization within the M step. We prove the algorithm converges under certain regularity conditions. We test our algorithm empirically using a simulation study as well as a case study of kinematic data collected using suction-cup attached biologgers from eight northern resident killer whales (Orcinus orca) off the western coast of Canada. In both, our algorithm converges in fewer epochs and to regions of higher likelihood compared to standard numerical optimization techniques. Our algorithm allows practitioners to fit complicated HMMs to large time-series data sets more efficiently than existing baselines.

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

↑