2009
DOI: 10.1007/s10463-009-0236-2
|View full text |Cite
|
Sign up to set email alerts
|

Smoothing algorithms for state–space models

Abstract: A prevalent problem in statistical signal processing, applied statistics, and time series analysis is the calculation of the smoothed posterior distribution, which describes the uncertainty associated with a state, or a sequence of states, conditional on data from the past, the present, and the future. The aim of this paper is to provide a rigorous foundation for the calculation, or approximation, of such smoothed distributions, to facilitate a robust and efficient implementation. Through a cohesive and generi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

2
277
0
7

Year Published

2009
2009
2022
2022

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 235 publications
(288 citation statements)
references
References 39 publications
2
277
0
7
Order By: Relevance
“…The estimation of the latent state distribution conditioned on the observations is a computationally intractable problem. There are in principle two types of approaches to approximate this computation: one can use one of many variations of particle filtering-smoothing methods, see [6,10,24]. The advantage of these methods is that they can in principle represent the latent state distribution with arbitrary accuracy, given sufficient computational resources.…”
Section: Bayesian System Identification: Potential For Neuroscience Dmentioning
confidence: 99%
“…The estimation of the latent state distribution conditioned on the observations is a computationally intractable problem. There are in principle two types of approaches to approximate this computation: one can use one of many variations of particle filtering-smoothing methods, see [6,10,24]. The advantage of these methods is that they can in principle represent the latent state distribution with arbitrary accuracy, given sufficient computational resources.…”
Section: Bayesian System Identification: Potential For Neuroscience Dmentioning
confidence: 99%
“…It is demonstrated experimentally in [7] that this procedure outperforms significantly the forward filtering-backward smoothing approach.…”
Section: Smc Smoothingmentioning
confidence: 96%
“…Although this is not an issue when p θ ( y n:T | x n ) can be computed exactly, it does preclude the direct use of SMC methods to estimate this integral. To address this problem, a generalized version of the two-filter formula was proposed in [7]. It relies on the introduction of a set of artificial probability densities { p θ,n (x n )} T n=1 and the joint densities (27) which are constructed such that their marginal densities,…”
Section: Smc Smoothingmentioning
confidence: 99%
“…For this reason, various alternative particle smoothers have been proposed. One possible approach is to approximate the two-filter formula using particle methods [Kitagawa, 1996, Briers et al, 2010, Fearnhead et al, 2010. The disadvantage of such two-filter type smoothers is that the construction of the backward filter can be quite troublesome.…”
Section: Particle Filters and Smoothersmentioning
confidence: 99%
“…Another possible approach for the RBPS is to use the two-filter formula, and form the smoothing solution by combining two RBPFs, one running forward and one backwards in time [Briers et al, 2010, Fearnhead et al, 2010.…”
Section: Rao-blackwellized Particle Filters and Smoothersmentioning
confidence: 99%