Utilising Gradient-Based Proposals within Sequential Monte Carlo Samplers for Training of Partial Bayesian Neural Networks
Partial Bayesian neural networks (pBNNs) have been shown to perform competitively with fully Bayesian neural networks while only having a subset of the parameters be stochastic. Using sequential Monte Carlo (SMC) samplers as the inference method for pBNNs gives a non-parametric probabilistic estimation of the stochastic parameters, and has shown improved performance over parametric methods. We introduce a new SMC-based training method for pBNNs by utilising a guided proposal and incorporating gradient-based Markov kernels, which gives us better scalability on high dimensional problems. We show that our new method outperforms the state-of-the-art (SOTA) in terms of optimal loss.
Authors
- Joshua Murphy (ORCID: https://orcid.org/0000-0001-9085-5755)
- Zheng Zhao (ORCID: https://orcid.org/0000-0002-7727-7097)
- Andrew R. Millard (ORCID: https://orcid.org/0000-0002-8290-7428)
- Simon Maskell (ORCID: https://orcid.org/0000-0003-1917-2913)
Institutions
- University of Liverpool (GB)
- Liverpool College (GB)
- Link Institut (Switzerland) (CH)
Publication Details
- Published
- 2026-04-21
- DOI
- https://doi.org/10.1109/icassp55912.2026.11462484
- Primary Topic
- Adversarial Robustness in Machine Learning
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Royal Academy of Engineering