Kalman Bayesian Neural Networks for Closed-form Online Learning
Not on the map. Why?
Abstract (arXiv)
Compared to point estimates calculated by standard neural networks, Bayesian neural networks (BNN) provide probability distributions over the output predictions and model parameters, i.e., the weights. Training the weight distribution of a BNN, however, is more involved due to the intractability of the underlying Bayesian inference problem and thus, requires efficient approximations. In this paper, we propose a novel approach for BNN learning via closed-form Bayesian inference. For this purpose, the calculation of the predictive distribution of the output and the update of the weight distribution are treated as Bayesian filtering and smoothing problems, where the weights are modeled as Gaussian random variables. This allows closed-form expressions for training the network's parameters in a sequential/online fashion without gradient descent. We demonstrate our method on several UCI datasets and compare it to the state of the art.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 14 of its 46 references that are in the map. First posted on arXiv 3 Oct 2021.
Builds on
14 of 46 references.
References · 14
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
- 2018Continual Lifelong Learning with Neural Networks: A Reviewcited by 1,313
- 2018Pyro: Deep Universal Probabilistic Programmingcited by 379
- 2017Variational Continual Learningcited by 335
- 2015Probabilistic Backpropagation for Scalable Learning of Bayesian Neural Networkscited by 295
- 2015Scalable Bayesian Optimization Using Deep Neural Networkscited by 284
- 2017Advances in Variational Inferencecited by 236
- 2020Being Bayesian, Even Just a Bit, Fixes Overconfidence in ReLU Networkscited by 227
- 2017Emergence of Invariance and Disentanglement in Deep Representationscited by 213
- 2018Online Structured Laplace Approximations For Overcoming Catastrophic Forgettingcited by 197
- 2019TossingBot: Learning to Throw Arbitrary Objects with Residual Physicscited by 131
Built on by
Citing papers per year: 2022: 1; 2023: 3; 2024: 0; 2025: 4; 2026: 1.
9 papers.
- 2022A Comprehensive Review of Digital Twin -- Part 1: Modeling and Twinning Enabling Technologiescited by 28
- 2023Low-rank extended Kalman filtering for online learning of neural networks from streaming datacited by 23
- 2023Particle-based Online Bayesian Samplingcited by 7
- 2023Uncertainty-driven Exploration Strategies for Online Grasp Learningcited by 6
- 2025Assumed Density Filtering and Smoothing with Neural Network Surrogate Modelscited by 1
- 2025Staying Alive: Online Neural Network Maintenance and Systemic Driftcited by 0
- 2025Kalman Bayesian Transformercited by 0
- 2025From Overfitting to Reliability: Introducing the Hierarchical Approximate Bayesian Neural Networkcited by 0
- 2026Full-Covariance Smoothing of Bayesian Neural Networks for Online Adaptationcited by 0
- 2026Full-Covariance Smoothing of Bayesian Neural Networks for Online Adaptation23 Sep 2026
- 2025From Overfitting to Reliability: Introducing the Hierarchical Approximate Bayesian Neural Network15 Dec 2025
- 2025Assumed Density Filtering and Smoothing with Neural Network Surrogate Models12 Nov 2025
- 2025Kalman Bayesian Transformer12 Sep 2025
- 2025Staying Alive: Online Neural Network Maintenance and Systemic Drift22 Mar 2025
- 2023Uncertainty-driven Exploration Strategies for Online Grasp Learning21 Sep 2023
- 2023Low-rank extended Kalman filtering for online learning of neural networks from streaming data31 May 2023
- 2023Particle-based Online Bayesian Sampling28 Feb 2023
- 2022A Comprehensive Review of Digital Twin -- Part 1: Modeling and Twinning Enabling Technologies26 Aug 2022