The Iterated Auxiliary Particle Filter
迭代辅助粒子滤波器AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要明确面向状态空间隐马尔可夫模型及观测序列的似然推断。
迭代辅助粒子滤波器AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
We present an offline, iterated particle filter to facilitate statistical inference in general state space hidden Markov models. Given a model and a sequence of observations, the associated marginal likelihood L is central to likelihood-based inference for unknown statistical parameters. We define a class of “twisted” models: each member is specified by a sequence of positive functions ψ and has an associated ψ-auxiliary particle filter that provides unbiased estimates of L. We identify a sequence ψ* that is optimal in the sense that the ψ*-auxiliary particle filter’s estimate of L has zero variance. In practical applications, ψ* is unknown so the ψ*-auxiliary particle filter cannot straightforwardly be implemented. We use an iterative scheme to approximate ψ* and demonstrate empirically that the resulting iterated auxiliary particle filter significantly outperforms the bootstrap particle filter in challenging settings. Applications include parameter estimation using a particle Markov chain Monte Carlo algorithm.