mlsanityData to 14 Oct 2026

Martingale Posterior Neural Networks for Fast Sequential Decision Making

arXiv 2506.11898 ↗First posted 13 Jun 2025cs.LG stat.MLcited by 4

Not on the map. Why?

Abstract (arXiv)

We introduce scalable algorithms for online learning of neural network parameters and Bayesian sequential decision making. Unlike classical Bayesian neural networks, which induce predictive uncertainty through a posterior over model parameters, our methods adopt a predictive-first perspective based on martingale posteriors. In particular, we work directly with the one-step-ahead posterior predictive, which we parameterize with a neural network and update sequentially with incoming observations. This decouples Bayesian decision-making from parameter-space inference: we sample from the posterior predictive for decision making, and update the parameters of the posterior predictive via fast, frequentist Kalman-filter-like recursions. Our algorithms operate in a fully online, replay-free setting, providing principled uncertainty quantification without costly posterior sampling. Empirically, they achieve competitive performance-speed trade-offs in non-stationary contextual bandits and Bayesian optimization, offering 10-100 times faster inference than classical Thompson sampling while maintaining comparable or superior decision performance.

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

Builds on

44 of 65 references.

References · 44

  1. 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
  2. 2017A Tutorial on Thompson Samplingcited by 433
  3. 2018Shampoo: Preconditioned Stochastic Tensor Optimizationcited by 426
  4. 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 370
  5. 2021Laplace Redux -- Effortless Bayesian Deep Learningcited by 365
  6. 2021Efficient and Modular Implicit Differentiationcited by 203
  7. 2018Deep Bayesian Bandits Showdown: An Empirical Comparison of Bayesian Deep Networks for Thompson Samplingcited by 169
  8. 2019Behaviour Suite for Reinforcement Learningcited by 132
  9. 2021The Bayesian Learning Rulecited by 99
  10. 2022KuaiRec: A Fully-observed Dataset and Insights for Evaluating Recommender Systemscited by 96
  11. 2024Vanilla Bayesian Optimization Performs Great in High Dimensionscited by 92
  12. 2021On Feature Collapse and Deep Kernel Learning for Single Forward Pass Uncertaintycited by 87
32 more
  1. 2019'In-Between' Uncertainty in Bayesian Neural Networkscited by 80
  2. 2024Variational Bayesian Last Layerscited by 69
  3. 2024The Benefits of Reusing Batches for Gradient Descent in Two-Layer Networks: Breaking the Curse of Information and Leap Exponentscited by 52
  4. 2024Neural network learns low-dimensional polynomials with SGD near the information-theoretic limitcited by 46
  5. 2021Martingale posterior distributionscited by 45
  6. 2024Repetita Iuvant: Data Repetition Allows SGD to Learn High-Dimensional Multi-Index Functionscited by 37
  7. 2018SLANG: Fast Structured Covariance Approximations for Bayesian Deep Learning with Natural Gradientcited by 34
  8. 2020Task Agnostic Continual Learning Using Online Variational Bayes with Fixed-Point Updatescited by 34
  9. 2024Standard Gaussian Process is All You Need for High-Dimensional Bayesian Optimizationcited by 34
  10. 2020Estimating Model Uncertainty of Neural Networks in Sparse Information Formcited by 31
  11. 2022Monolith: Real Time Recommendation System With Collisionless Embedding Tablecited by 30
  12. 2021How many degrees of freedom do we need to train deep networks: a loss landscape perspectivecited by 28
  13. 2017Online Natural Gradient as a Kalman Filtercited by 25
  14. 2024Streaming Deep Reinforcement Learning Finally Workscited by 25
  15. 2023Low-rank extended Kalman filtering for online learning of neural networks from streaming datacited by 23
  16. 2024Outlier-robust Kalman Filtering through Generalised Bayescited by 21
  17. 2023Impatient Bandits: Optimizing Recommendations for the Long-Term Without Delaycited by 17
  18. 2019Thompson Sampling with Approximate Inferencecited by 15
  19. 2021Efficient Online Bayesian Inference for Neural Banditscited by 15
  20. 2022Posterior Refinement Improves Sample Efficiency in Bayesian Neural Networkscited by 14
  21. 2024Bayesian Online Natural Gradient (BONG)cited by 14
  22. 2024Bayesian Optimization via Continual Variational Last Layer Trainingcited by 13
  23. 2025Robust and Conjugate Spatio-Temporal Gaussian Processescited by 9
  24. 2023The limited-memory recursive variational Gaussian approximation (L-RVGA)cited by 6
  25. 2023The Rank-Reduced Kalman Filter: Approximate Dynamical-Low-Rank Filtering In High Dimensionscited by 5
  26. 2024A unifying framework for generalised Bayesian online learning in non-stationary environmentscited by 5
  27. 2023Implicit Maximum a Posteriori Filtering via Adaptive Optimizationcited by 4
  28. 2022Towards Data-Algorithm Dependent Generalization: a Case Study on Overparameterized Linear Regressioncited by 3
  29. 2023Detecting Toxic Flowcited by 3
  30. 2022A Square-Root Kalman Filter Using Only QR Decompositionscited by 1
  31. 2023Non-Stationary Contextual Bandit Learning via Neural Predictive Ensemble Samplingcited by 1
  32. 2025Adaptive, Robust and Scalable Bayesian Filtering for Online Learningcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 3.

4 papers.