Differentiable Particle Filtering using Optimal Placement Resampling
Not on the map. Why?
Abstract (arXiv)
Particle filters are a frequent choice for inference tasks in nonlinear and non-Gaussian state-space models. They can either be used for state inference by approximating the filtering distribution or for parameter inference by approximating the marginal data (observation) likelihood. A good proposal distribution and a good resampling scheme are crucial to obtain low variance estimates. However, traditional methods like multinomial resampling introduce nondifferentiability in PF-based loss functions for parameter estimation, prohibiting gradient-based learning tasks. This work proposes a differentiable resampling scheme by deterministic sampling from an empirical cumulative distribution function. We evaluate our method on parameter inference tasks and proposal learning.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 13 of its 28 references that are in the map. First posted on arXiv 26 Feb 2024.
Builds on
13 of 28 references.
References · 13
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2015Importance Weighted Autoencoderscited by 454
- 2017Variational Sequential Monte Carlocited by 93
- 2017Filtering Variational Objectivescited by 91
- 2017Auto-Encoding Sequential Monte Carlocited by 64
- 2018Particle Filter Networks with Application to Visual Localizationcited by 64
- 2021Differentiable Particle Filtering via Entropy-Regularized Optimal Transportcited by 59
- 2018Differentiable Particle Filters: End-to-End Learning with Algorithmic Priorscited by 58
- 2020How to Train Your Differentiable Filtercited by 23
- 2023An overview of differentiable particle filters for data-adaptive sequential Bayesian inferencecited by 23
- 2021Differentiable Particle Filtering without Modifying the Forward Passcited by 18
- 2021Efficient Learning of the Parameters of Non-Linear Models using Differentiable Resampling in Particle Filterscited by 9
Built on by
Not cited yet.