Metraipolis › archive › dc_d4fe1484eb2b
Learning to Bias: Machine Learning-Enhanced Particle Filters — arXiv:2609.30498
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.30498
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T02:10:26.304Z
- SHA-256 of the archived text
ce76b10962296e486209201e536fa909b31128254c1570859284ef1c658e20e1- Stable URL of this page
https://metraipolis.com/documento/dc_d4fe1484eb2b
How to cite
Learning to Bias: Machine Learning-Enhanced Particle Filters — arXiv:2609.30498 — arXiv (en), https://arxiv.org/abs/2609.30498 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d4fe1484eb2b (Metraipolis archive dc_d4fe1484eb2b, sha256 ce76b10962296e486209201e536fa909b31128254c1570859284ef1c658e20e1)
BibTeX
@misc{dcd4fe1484eb2b,
title = {Learning to Bias: Machine Learning-Enhanced Particle Filters — arXiv:2609.30498},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.30498},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d4fe1484eb2b; sha256 ce76b10962296e486209201e536fa909b31128254c1570859284ef1c658e20e1},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.30498. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Sequential inference estimates latent states from noisy and incomplete observations. Particle Filters (PFs), a class of Monte Carlo methods based on importance sampling, provide a flexible framework for this task, but often suffer from poor sample efficiency and unfavorable scaling with dimension, partly due to suboptimal proposal distributions. We address these challenges by integrating learned proposals into the PF framework. We introduce Neural Optimal Particle Filters (NOPFs), which learn an amortized approximation to the optimal proposal from offline simulated one-step conditioning tuples. The learned proposal is used as a drop-in replacement in standard PF updates, with samples corrected by standard importance weights so that the method asymptotically targets the same filtering distribution under standard support and density-evaluation assumptions. Across stochastic nonlinear benchmarks of varying inference complexity, NOPFs improve sample efficiency and distributional accuracy over standard PF baselines with modest computational overhead. The approach integrates data-driven proposal learning into classical inference without altering the underlying filtering objective. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-28 in cs.LG). Categorie arXiv: Machine Learning (cs.LG) ; Machine Learning (stat.ML). Pagina del lavoro: https://arxiv.org/abs/2609.30498 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-08T01:43:06.671Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).