English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Sequential Monte Carlo (SMC) methods have demonstrated a strong potential for inference on the state variables in Bayesian dynamic models. In this context, it is also often needed to calibrate model parameters. To do so, we consider block maximum likelihood estimation based either on EM (Expectation-Maximization) or gradient methods. In this approach, the key ingredient is the computation of smoothed sum functionals of the hidden states, for a given value of the model parameters. It has been observed by several authors that using standard SMC methods for this smoothing task requires a substantial number of particles and may be unreliable for larger observation sample sizes. We introduce a simple variant of the basic sequential smoothing approach based on forgetting ideas. This modification, which is transparent in terms of computation time, reduces the variability of the approximation of the sum functional. Under suitable regularity assumptions, it is shown that this modification indeed allows a tighter control of the Lp error of the approximation

On the use of sequential Monte Carlo methods for approximating smoothing functionals, with application to fixed parameter estimation