On backward smoothing algorithms - Centre de Recherche en Économie et Statistique
Article Dans Une Revue Annals of Statistics Année : 2023

On backward smoothing algorithms

Hai-Dang Dau
  • Fonction : Auteur

Résumé

In the context of state-space models, skeleton-based smoothing algorithms rely on a backward sampling step, which by default, has a O(N2) complexity (where N is the number of particles). Existing improvements in the literature are unsatisfactory: a popular rejection sampling-based approach, as we shall show, might lead to badly behaved execution time; another rejection sampler with stopping lacks complexity analysis; yet another MCMC-inspired algorithm comes with no stability guarantee. We provide several results that close these gaps. In particular, we prove a novel nonasymptotic stability theorem, thus enabling smoothing with truly linear complexity and adequate theoretical justification. We propose a general framework, which unites most skeleton-based smoothing algorithms in the literature and allows to simultaneously prove their convergence and stability, both in online and offline contexts. Furthermore, we derive, as a special case of that framework, a new coupling-based smoothing algorithm applicable to models with intractable transition densities. We elaborate practical recommendations and confirm those with numerical experiments.
Fichier principal
Vignette du fichier
2207.00976v2.pdf (1.22 Mo) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-04417980 , version 1 (06-01-2025)

Identifiants

Citer

Hai-Dang Dau, Nicolas Chopin. On backward smoothing algorithms. Annals of Statistics, 2023, 51 (5), ⟨10.1214/23-AOS2324⟩. ⟨hal-04417980⟩
15 Consultations
0 Téléchargements

Altmetric

Partager

More