A divide and conquer strategy for multinomial particle filter resampling
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866911562058432512 |
|---|---|
| author | Popov, Andrey A. |
| author_facet | Popov, Andrey A. |
| contents | This work provides a new multinomial resampling procedure for particle filter resampling, focused on the case where the number of samples required is less than or equal to the size of the underlying discrete distribution. This setting is common in ensemble mixture model filters such as the Gaussian mixture filter. We show superiority of our approach with respect two of the best known multinomial sampling procedures both through a computational complexity analysis and through a numerical experiment. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_01356 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A divide and conquer strategy for multinomial particle filter resampling Popov, Andrey A. Data Structures and Algorithms Computation This work provides a new multinomial resampling procedure for particle filter resampling, focused on the case where the number of samples required is less than or equal to the size of the underlying discrete distribution. This setting is common in ensemble mixture model filters such as the Gaussian mixture filter. We show superiority of our approach with respect two of the best known multinomial sampling procedures both through a computational complexity analysis and through a numerical experiment. |
| title | A divide and conquer strategy for multinomial particle filter resampling |
| topic | Data Structures and Algorithms Computation |
| url | https://arxiv.org/abs/2604.01356 |