Neural Optimal Particle Filters are introduced, which learn an amortized approximation to the optimal proposal from offline simulated one-step conditioning tuples, and improve sample efficiency and distributional accuracy over standard PF baselines with modest computational overhead.
Abstract
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.
Inference-time steering adapts pretrained diffusion and flow-based models to new tasks, e.g., to generate samples from a conditional distribution or samples with desired properties, without retraining. This can be formalized as sampling from a reward-tilted generative prior. As exact sampling from this distribution is...
This work develops a framework for source-space generalized Bayesian inference that combines inexpensive few-step prior transports with posterior stability guarantees and establishes Wasserstein error bounds between the exact and learned posteriors in terms of the joint population iMF and auxiliary-velocity loss.
Hoang Phuc Hau Luu, Marcelo Hartmann, Zhong-Jian Wang· 0 citations
The p(parameter)-CSMC algorithm is proposed, which incorporates both parameter learning and ancestor sampling, leading to much better mixing properties compared to (particle) Gibbs sampling in settings where strong internal correlations may challenge effective exploration.
The ensemble generative filter (EnGF) is proposed, a simple yet effective method for non-Gaussian filtering that delivers clear and often substantial improvements over the EnKF, in some cases even approaching the filtering accuracy of a massive-ensemble particle filter at a small fraction of its cost.
Inference-time steering combines pretrained diffusion experts or rewards without retraining by changing the dynamics that transport noise to data. Feynman-Kac correction compensates for proposal mismatch through importance-weighted sequential Monte Carlo (SMC), whose finite-particle behavior depends on the proposal. Va...
Ziseok Lee, JaeHyeong Kim, Seungwon Kim et al.· 0 citations
This work introduces an algorithm for learning Boltzmann distributions that does not require any true samples for training and establishes a new method for sample-free learning of complex physical distributions.
V. Kanaujia, Vipul Arora· Trans. Mach. Learn. Res.· 1 citation
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduNov 6, 2026
A machine-learning approach called CheMeleon provides a practical way to develop new drugs or other molecules with much less detailed, expensive experimentation.
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.