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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Utilising Gradient-Based Proposals within Sequential Monte Carlo Samplers for Training of Partial Bayesian Neural Networks

Joshua Murphy, Zheng Zhao, Andrew R. Millard, Simon Maskell
Adversarial Robustness in Machine Learning
article

Utilising Gradient-Based Proposals within Sequential Monte Carlo Samplers for Training of Partial Bayesian Neural Networks

Joshua Murphy, Zheng Zhao, Andrew R. Millard, Simon Maskell
article en

Abstract

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.

University of Liverpool (GB), Liverpool College (GB), Link Institut (Switzerland) (CH)
Royal Academy of Engineering
Openalex Percentile: Top 99%
Adversarial Robustness in Machine Learning
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.