2024/09/22 by Bågmark, Kasper, Andersson, Adam, Larsson, Stig +1 · 2 citations
#60G25 #60G35 #62F15 #62G07 #62M20 #65C30 #65M75 #68T07 #Computation (stat.CO) #FOS: Computer and information sciences #FOS: Mathematics #Machine Learning (stat.ML) #Numerical Analysis (math.NA) #Probability (math.PR)
paper · doi:10.48550/arxiv.2409.14585
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 two numerical examples. For the prediction step, between the noisy and partial measurements at discrete times, the scheme approximates the Fokker--Planck equation with a deep splitting scheme, combined with 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. The convergence proof relies on stochastic integration by parts from the Malliavin calculus. As a corollary we obtain the convergence rate for the approximation of the Fokker--Planck equation alone, disconnected from the filtering problem.