Approximate Bayesian Fusion
Abstract
Distributed inference plays an important role in modern computational statistics and machine learning. In the frequentist setting, methods can often aggregate results by simply averaging estimators computed on data subsets. However, distributed Bayesian inference is more challenging, as it requires reconstructing the full posterior by combining subposterior distributions computed on different machines. Bayesian Fusion performs distributed Bayesian inference exactly, but at a sizeable computational cost. We propose a method that uses numerical approximations to reduce the cost of the most computationally expensive steps of Bayesian Fusion, and expands its domain of applicability. We bound the numerical error as a function of the step size of the approximation. Under regularity conditions, our approach can approximate the target posterior distribution to an arbitrary degree of accuracy, and is a practical and efficient alternative for large-scale distributed Bayesian inference. In numerical experiments on a logistic regression with more than 300,000 observations, our method reaches the accuracy reported for Divide-and-Conquer Bayesian Fusion about two orders of magnitude faster. On a proportional hazards model with non-Gaussian posteriors, which lacks the lower bounds that Bayesian Fusion requires, our method reproduces funnel features of the posterior that simpler methods like Consensus Monte Carlo miss.
Related
- Simulation-free approximate Bayesian computation for stochastic reaction networks
- Approximate Bayesian Computation
- On the minimax-rate optimality of approximate Bayesian computation in nonparametric problems
- DAIF: A Data-Driven Intermediate Fusion Framework for Multimodal Supervised Learning via Approximate Message Passing
- A hybrid approach combining a phylogenetic method and Approximate Bayesian Computation Random Forest for phylogenetic network inference: application to the rice domestication process in Asia
BibTeX
@misc{pagani2026approximate,
title = {{Approximate Bayesian Fusion}},
author = {Filippo Pagani and Adam M. Johansen and Gareth O. Roberts},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.41067},
eprint = {2610.41067},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.41067},
}
RIS
TY - UNPB
TI - Approximate Bayesian Fusion
AU - Filippo Pagani
AU - Adam M. Johansen
AU - Gareth O. Roberts
PY - 2026
DA - 2026/10/29
PB - arXiv
DO - 10.48550/arxiv.2610.41067
UR - https://arxiv.org/abs/2610.41067
AB - Distributed inference plays an important role in modern computational statistics and machine learning. In the frequentist setting, methods can often aggregate results by simply averaging estimators computed on data subsets. However, distributed Bayesian inference is more challenging, as it requires reconstructing the full posterior by combining subposterior distributions computed on different machines. Bayesian Fusion performs distributed Bayesian inference exactly, but at a sizeable computational cost. We propose a method that uses numerical approximations to reduce the cost of the most computationally expensive steps of Bayesian Fusion, and expands its domain of applicability. We bound the numerical error as a function of the step size of the approximation. Under regularity conditions, our approach can approximate the target posterior distribution to an arbitrary degree of accuracy, and is a practical and efficient alternative for large-scale distributed Bayesian inference. In numerical experiments on a logistic regression with more than 300,000 observations, our method reaches the accuracy reported for Divide-and-Conquer Bayesian Fusion about two orders of magnitude faster. On a proportional hazards model with non-Gaussian posteriors, which lacks the lower bounds that Bayesian Fusion requires, our method reproduces funnel features of the posterior that simpler methods like Consensus Monte Carlo miss.
ER -