A convergent scheme for the Bayesian filtering problem based on the Fokker–Planck equation and deep splitting
Preprint, 2024

A numerical scheme for approximating the nonlinear filtering density is introduced and its convergence rate is established, theoretically under a parabolic Hörmander condition, and empirically in numerical examples. In a prediction step, between the noisy and partial measurements at discrete times, the scheme approximates the Fokker--Planck equation with a deep splitting scheme, followed by an exact update through Bayes' formula. This results in a classical prediction-update filtering algorithm that operates online for new observation sequences post-training. The algorithm employs a sampling-based Feynman–Kac approach, designed to mitigate the curse of dimensionality. As a corollary we obtain the convergence rate for the approximation of the Fokker–Planck equation alone, disconnected from the filtering problem. The convergence analysis is complemented by a nonlinear 10-dimensional numerical example demonstrating the robustness of the method.

partial differential equation

Filtering problem

splitting scheme

numerical analysis

convergence order

Fokker–Planck equation

deep learning

Hörmander condition

Författare

Kasper Bågmark

Chalmers, Matematiska vetenskaper, Tillämpad matematik och statistik

Adam Andersson

Chalmers, Matematiska vetenskaper, Tillämpad matematik och statistik

Stig Larsson

Chalmers, Matematiska vetenskaper, Tillämpad matematik och statistik

Filip Rydin

Chalmers, Elektroteknik, System- och reglerteknik

Ämneskategorier (SSIF 2025)

Sannolikhetsteori och statistik

Beräkningsmatematik

Signalbehandling

Fundament

Grundläggande vetenskaper

Infrastruktur

Chalmers e-Commons (inkl. C3SE, 2020-)

DOI

10.48550/arXiv.2409.14585

Mer information

Senast uppdaterat

2026-04-22