mlsanityData to 14 Oct 2026

Neural Bayesian Filtering

arXiv 2510.03614 ↗First posted 4 Oct 2025cs.LG cs.AI stat.MLcited by 2

Not on the map. Why?

Abstract (arXiv)

Sequential estimation under partial observability requires tracking beliefs that may be high-dimensional, multimodal, and non-Gaussian. Classical Bayesian filters generalize zero-shot to any system whose dynamics can be evaluated, but their representations scale poorly: parametric filters struggle to capture multimodality, and particle filters require exponentially many particles in the state dimension. Generative Distribution Embeddings (GDEs) learn compact representations of complex distributions but have no sequential update. We present Neural Bayesian Filtering (NBF), which represents beliefs as embeddings and approximates their Bayesian update. At each step, NBF samples particles from a learned conditional generator, propagates them through the dynamics, and embeds the propagated set, weighted by the likelihood of the new observation. Regenerating the set from the embedding at each step, rather than resampling a surviving pool, mitigates the risk of impoverishment that degrades particle filters. The system dynamics and likelihood enter only through propagation and weighting, so NBF retains zero-shot adaptability to new dynamics as long as the beliefs they produce fall within the family the embedding was trained on. Training the GDE to represent that family requires only the states realized at training time. We validate NBF on Lorenz-96 and a pursuit--evasion domain, showing graceful scaling with state dimension, accurate tracking of multimodal posteriors, and zero-shot generalization to dynamics and likelihoods held out from training.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 21 of its 67 references that are in the map. First posted on arXiv 4 Oct 2025.

Builds on

21 of 67 references.

References · 21

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2022Flow Matching for Generative Modelingcited by 5,702
  3. 2016Density estimation using Real NVPcited by 2,042
  4. 2019Mastering Atari, Go, Chess and Shogi by Planning with a Learned Modelcited by 1,353
  5. 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,323
  6. 2015A Recurrent Latent Variable Model for Sequential Datacited by 362
  7. 2019Flow++: Improving Flow-Based Generative Models with Variational Dequantization and Architecture Designcited by 262
  8. 2017DeepStack: Expert-Level Artificial Intelligence in No-Limit Pokercited by 233
  9. 2015Deep Kalman Filterscited by 166
  10. 2016Deep Variational Bayes Filters: Unsupervised Learning of State Space Models from Raw Datacited by 156
  11. 2021KalmanNet: Neural Network Aided Kalman Filtering for Partially Known Dynamicscited by 132
  12. 2018Particle Filter Networks with Application to Visual Localizationcited by 65
9 more
  1. 2018Differentiable Particle Filters: End-to-End Learning with Algorithmic Priorscited by 59
  2. 2013Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networkscited by 47
  3. 2019Rethinking Formal Models of Partially Observable Multiagent Decision Makingcited by 36
  4. 2021Student of Games: A unified learning algorithm for both perfect and imperfect information gamescited by 23
  5. 2021Scalable Online Planning via Reinforcement Learning Fine-Tuningcited by 18
  6. 2019Recurrent Neural Filters: Learning Independent Bayesian Filtering Steps for Time Series Predictioncited by 14
  7. 2024Normalizing Flow-based Differentiable Particle Filterscited by 10
  8. 2025Generative Distribution Embeddings: Lifting autoencoders to the space of distributions for multiscale representation learningcited by 4
  9. 2023History Filtering in Imperfect Information Games: Algorithms and Complexitycited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.