arXiv AI

When Has a Bayesian Neural Network Sampled Enough? Adaptive Inference Time with Statistical Guarantees

The paper introduces a method that uses confidence sequences to adaptively determine the number of Monte Carlo samples needed for Bayesian neural network predictions, ensuring statistical guarantees. It applies to tasks such as class identification, full predictive distribution approximation, and probability-threshold decisions, stopping sampling once the desired confidence is achieved. Experiments demonstrate efficient computational budgeting, allocating more samples to ambiguous inputs, preserving decision reliability, and reducing overall latency compared to a fixed sample budget.

Hugging Face Trending Papers
Jul 7

Efficient Bayesian Deep Ensembles via Analytic Predictive Inference

We introduce an efficient Bayesian deep ensemble method for predictive regression designed to enhance interpretability while maintaining competitive predictive performance and computational efficiency. Our method combines the statistical rigor of Bayesian inference with the scalability of deep ensembles, providing calibrated uncertainty estimates that enable its use not only for standalone prediction but also as a component within broader learning systems.

arXiv Statistics ML
1d ago

Sparse Bayesian Neural Networks via Sticky Piecewise Deterministic Markov Processes

The paper introduces a method for training sparse Bayesian neural networks by integrating spike-and-slab priors into sticky piecewise deterministic Markov processes (PDMPs). It demonstrates that these modern Monte Carlo techniques can sample posterior distributions of Bayesian neural networks exactly, provided numerical rate bounds are satisfied. Experiments show that the resulting sparse models not only converge well but also exhibit greater robustness to input noise compared to their dense counterparts.

By August Arnstad, Geir Olve Storvik, Filippo Pagani, Leiv R{\o}nneberg
arXiv Statistics ML
Sep 28

Federated Martingale Posterior Samping

The paper introduces Federated Martingale Posterior (FMP) sampling, a one‑shot, embarrassingly parallel method for federated Bayesian neural networks. FMP replaces the traditional prior–likelihood framework with a predictive distribution, allowing each client to upload only a small set of trainable data embeddings while the server performs predictive sampling centrally. Experiments demonstrate that FMP closely matches the performance of a centralized approach and achieves the lowest mean expected calibration error among evaluated one‑shot federated methods.

By Boning Zhang, Matteo Zecchin, Mingzhao Guo, Dongzhu Liu, Osvaldo Simeone
arXiv Machine Learning
Oct 19

Accelerated Execution of Bayesian Neural Networks using a Single Probabilistic Forward Pass and Code Generation

The paper presents a pipeline for training, compiling, and deploying Bayesian neural networks (BNNs) that use a single probabilistic forward pass (PFP) instead of multiple stochastic samples. By assuming Gaussian-distributed weights and activations, PFP enables fully analytic uncertainty propagation, allowing a single deterministic forward pass to replace sampling. Using the TVM compiler and a library of Gaussian-propagating operators, the authors achieve up to 4200× speedups on small mini-batches while maintaining accuracy, uncertainty estimation, and out-of-domain detection comparable to traditional stochastic variational inference (SVI).

By Bernhard Klein, Falk Selker, Hendrik Borras, Sophie Steger, Franz Pernkopf, Holger Fr\"oning
arXiv Machine Learning
Aug 4

Constrained Co-Design for Photonic Bayesian Neural Networks

arXiv:2608. 02229v1 Announce Type: new Abstract: Classical neural networks frequently produce overconfident predictions on ambiguous or out-of-distribution (OOD) data, a liability that grows with each AI system deployed in safety-critical real-world scenarios.

By Hendrik Borras, Xiao Wang, Bernhard Klein, Robin Janssen, Frank Br\"uckerhoff-Pl\"uckelmann, Wolfram Pernice, Holger Fr\"oning