提出在线学习状态空间模型的新方法,支持实时数据处理。
Recursive Learning of Asymptotic Variational Objectives
- 用渐近对比函数替代标准变分下界,实现递归优化
- 通过粒子蒙特卡洛逼近后验分布,支持参数与隐状态联合更新
- 理论更严谨,适合需要持续学习的时序建模任务
状态空间模型(SSMs)是序列时间数据的经典生成模型。传统变分推断(VI)方法如重要性加权自编码器(IWAE)无法处理流式数据。为实现在线变分推断,本文提出最大化一种基于渐近对比函数的IWAE型下界,采用随机逼近实现递归学习。不同于直接最大化渐近对比的递归最大似然法,所提方法(OSIWAE)可同时在线学习模型参数和马尔可夫识别模型以推断隐状态。通过顺序蒙特卡洛(SMC)方法近似滤波后验及其导数,构建了基于粒子的在线变分推断框架。该方法在理论上比近期提出的在线变分SMC方法更坚实。提供了关于学习目标的严格理论分析,并通过数值实验验证了其在学习模型参数和粒子提议核方面的高效性。
原文摘要 · Abstract (English)
General state-space models (SSMs) are widely used in statistical machine learning and are among the most classical generative models for sequential time-series data. SSMs, comprising latent Markovian states, can be subjected to variational inference (VI), but standard VI methods like the importance-weighted autoencoder (IWAE) lack functionality for streaming data. To enable online VI in SSMs when the observations are received in real time, we propose maximising an IWAE-type variational lower bound on the asymptotic contrast function, rather than the standard IWAE ELBO, using stochastic approximation. Unlike the recursive maximum likelihood method, which directly maximises the asymptotic contrast, our approach, called online sequential IWAE (OSIWAE), allows for online learning of both model parameters and a Markovian recognition model for inferring latent states. By approximating filter state posteriors and their derivatives using sequential Monte Carlo (SMC) methods, we create a particle-based framework for online VI in SSMs. This approach is more theoretically well-founded than recently proposed online variational SMC methods. We provide rigorous theoretical results on the learning objective and a numerical study demonstrating the method's efficiency in learning model parameters and particle proposal kernels.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。