PyDPF: A Python Package for Differentiable Particle Filtering

• URL: http://arxiv.org/abs/2510.25693v2
• Date: Tue, 04 Nov 2025 15:33:22 GMT
• Title: PyDPF: A Python Package for Differentiable Particle Filtering
• Authors: John-Joseph Brady, Benjamin Cox, Yunpeng Li, Víctor Elvira,
• Abstract summary: We present an implementation of several differentiable particle filters with a unified API built on the popular PyTorch framework.<n>We validate our framework by reproducing experiments from several existing studies and demonstrate how DPFs can be applied to address several common challenges with state space modelling.
• Score: 14.95594615415264
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: State-space models (SSMs) are a widely used tool in time series analysis. In the complex systems that arise from real-world data, it is common to employ particle filtering (PF), an efficient Monte Carlo method for estimating the hidden state corresponding to a sequence of observations. Applying particle filtering requires specifying both the parametric form and the parameters of the system, which are often unknown and must be estimated. Gradient-based optimisation techniques cannot be applied directly to standard particle filters, as the filters themselves are not differentiable. However, several recently proposed methods modify the resampling step to make particle filtering differentiable. In this paper, we present an implementation of several such differentiable particle filters (DPFs) with a unified API built on the popular PyTorch framework. Our implementation makes these algorithms easily accessible to a broader research community and facilitates straightforward comparison between them. We validate our framework by reproducing experiments from several existing studies and demonstrate how DPFs can be applied to address several common challenges with state space modelling.

Related papers

• Filtered Markovian Projection: Dimensionality Reduction in Filtering for Stochastic Reaction Networks [0.9599644507730105]
  A typical challenge in practical problems modeled by reaction networks (SRNs) is that only a few state variables can be dynamically observed.<n>We propose to use a dimensionality reduction technique based on the Markovian projection (MP), initially introduced for forward problems.<n>The novel method employs a reduced-variance particle filter for estimating the jump intensities of the projected model and solves the filtering equations in a low-dimensional space.
  arXiv  Detail & Related papers  (2025-02-11T19:45:40Z)
• Normalizing Flow-based Differentiable Particle Filters [16.164656853940464]
  We present a differentiable particle filtering framework that usesconditional normalizing flows to build its dynamic model, proposal distribution, and measurement model.<n>We derive the theoretical properties of the proposed filters and evaluate the proposed normalizing flow-based differentiable particle filters' performance through a series of numerical experiments.
  arXiv  Detail & Related papers  (2024-03-03T12:23:17Z)
• Closed-form Filtering for Non-linear Systems [83.91296397912218]
  We propose a new class of filters based on Gaussian PSD Models, which offer several advantages in terms of density approximation and computational efficiency. We show that filtering can be efficiently performed in closed form when transitions and observations are Gaussian PSD Models. Our proposed estimator enjoys strong theoretical guarantees, with estimation error that depends on the quality of the approximation and is adaptive to the regularity of the transition probabilities.
  arXiv  Detail & Related papers  (2024-02-15T08:51:49Z)
• Filter Pruning for Efficient CNNs via Knowledge-driven Differential Filter Sampler [103.97487121678276]
  Filter pruning simultaneously accelerates the computation and reduces the memory overhead of CNNs. We propose a novel Knowledge-driven Differential Filter Sampler(KDFS) with Masked Filter Modeling(MFM) framework for filter pruning.
  arXiv  Detail & Related papers  (2023-07-01T02:28:41Z)
• An overview of differentiable particle filters for data-adaptive sequential Bayesian inference [19.09640071505051]
  Particle filters (PFs) provide an efficient mechanism for solving non-linear sequential state estimation problems. An emerging trend involves constructing components of particle filters using neural networks and optimising them by gradient descent. Differentiable particle filters are a promising computational tool for performing inference on sequential data in complex, high-dimensional tasks.
  arXiv  Detail & Related papers  (2023-02-19T18:03:53Z)
• Computational Doob's h-transforms for Online Filtering of Discretely Observed Diffusions [65.74069050283998]
  We propose a computational framework to approximate Doob's $h$-transforms. The proposed approach can be orders of magnitude more efficient than state-of-the-art particle filters.
  arXiv  Detail & Related papers  (2022-06-07T15:03:05Z)
• Learning Versatile Convolution Filters for Efficient Visual Recognition [125.34595948003745]
  This paper introduces versatile filters to construct efficient convolutional neural networks. We conduct theoretical analysis on network complexity and an efficient convolution scheme is introduced. Experimental results on benchmark datasets and neural networks demonstrate that our versatile filters are able to achieve comparable accuracy as that of original filters.
  arXiv  Detail & Related papers  (2021-09-20T06:07:14Z)
• Fourier Series Expansion Based Filter Parametrization for Equivariant Convolutions [73.33133942934018]
  2D filter parametrization technique plays an important role when designing equivariant convolutions. New equivariant convolution method based on the proposed filter parametrization method, named F-Conv. F-Conv evidently outperforms previous filter parametrization based method in image super-resolution task.
  arXiv  Detail & Related papers  (2021-07-30T10:01:52Z)
• Differentiable Particle Filtering via Entropy-Regularized Optimal Transport [19.556744028461004]
  We introduce a principled differentiable particle filter and provide convergence results. By leveraging optimal transport ideas, we introduce a principled differentiable particle filter and provide convergence results.
  arXiv  Detail & Related papers  (2021-02-15T21:05:33Z)
• When is Particle Filtering Efficient for Planning in Partially Observed Linear Dynamical Systems? [60.703816720093016]
  This paper initiates a study on the efficiency of particle filtering for sequential planning. We are able to bound the number of particles needed so that the long-run reward of the policy based on particle filtering is close to that based on exact inference. We believe this technique can be useful in other sequential decision-making problems.
  arXiv  Detail & Related papers  (2020-06-10T17:43:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.