Metraipolis › archive › dc_2964809449e5
Approximate Bayesian Fusion — arXiv:2610.41067
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41067
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-02T07:56:12.023Z
- SHA-256 of the archived text
03e0ab311efd68d9b60706654daeacc662486fb250cb7d8c15799b0584da2252- Stable URL of this page
https://metraipolis.com/documento/dc_2964809449e5
How to cite
Approximate Bayesian Fusion — arXiv:2610.41067 — arXiv (en), https://arxiv.org/abs/2610.41067 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2964809449e5 (Metraipolis archive dc_2964809449e5, sha256 03e0ab311efd68d9b60706654daeacc662486fb250cb7d8c15799b0584da2252)
BibTeX
@misc{dc2964809449e5,
title = {Approximate Bayesian Fusion — arXiv:2610.41067},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41067},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2964809449e5; sha256 03e0ab311efd68d9b60706654daeacc662486fb250cb7d8c15799b0584da2252},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41067. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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.
Tema degli esploratori: statistica e scienza dei dati (elenco arXiv stat.CO, nuovi lavori del giorno).
Categorie arXiv: Computation (stat.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.41067 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-02T07:41:30.726Z dalla pagina https://arxiv.org/list/stat.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).