Search arXivSearch

arXiv · 2408.02122

Graph-Enabled Efficient Federated Bayesian Modeling

Abstract

Federated Bayesian modeling requires combining evidence across distributed data holders while preserving posterior uncertainty and keeping local data decentralized. We propose Federated Latent Graph MCMC (FLaG-MCMC), a framework for sequential posterior transfer in which accumulated posterior information is represented by a reservoir of Monte Carlo samples. FLaG-MCMC constructs a graph that captures the geometry of the posterior reservoir and uses graph-enabled proposals whose per-iteration cost is independent of the reservoir size. Each data holder updates the inherited posterior using its local likelihood and returns an updated reservoir for subsequent inference. We apply FLaG-MCMC in two health science settings. Using mobile and wearable device data from GLOBEM, we investigate associations between depression status and behavioral patterns while sequentially accumulating posterior information across participants. FLaG-MCMC accurately reconstructs the corresponding pooled Bayesian posterior while closely tracking evolving posterior location and uncertainty in these associations. We also conduct a simulation study motivated by Bayesian evidence synthesis for opioid use disorder prevalence across studies, transferring posterior information from an Ohio study to a subsequent New York analysis under covariate shift. In this setting, FLaG-MCMC demonstrates reliable posterior transfer and favorable computational scaling. Theoretical results establish the validity and consistency of the framework.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chenyang Zhong, Shouxuan Ji, Tian Zheng. 2026-09-15. Graph-Enabled Efficient Federated Bayesian Modeling. https://arxiv.org/abs/2408.02122

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Delayed Acceptance Slice Sampling

Slice sampling is a well-established Markov chain Monte Carlo method for approximate sampling of target distributions which are only known up to a normalizing constant. The method is based on choosing a new state on a slice, i.e., a superlevel set of the given unnormalized target density (with respect to a reference measure). However, slice sampling algorithms usually require per step multiple evaluations of the target density, and thus can become computationally expensive. This is particularly the case for Bayesian inference with costly likelihoods. In this paper, we exploit deterministic approximations of the target density, which are relatively cheap to evaluate, and propose delayed acceptance versions of several common (hybrid) slice samplers. We show ergodicity of the resulting slice sampling methods, discuss the superiority of delayed acceptance (ideal) slice sampling over delayed acceptance Metropolis-Hastings algorithms, and illustrate the benefits of our novel approach in terms of improved computational efficiency in numerical experiments.

stat.CO

Repulsive normalizing flow mixtures for adaptive importance sampling: reliability analysis of complex systems

Accurate rare-event estimation can be computationally expensive. Classical adaptive importance sampling (IS) schemes often rely on restrictive proposal families and can struggle under multiple failure modes. We propose FAMIS, a flow-based multiple importance sampling (MIS) framework that learns a nonuniform mixture of normalizing flow proposals for rare event estimation. The method does not require presampled failure data or prior knowledge of the number, location, or geometry of the failure modes. Instead, it adaptively learns the mixture through sequential evaluations of the limit state function. To guide training toward the failure domain, FAMIS uses a smooth rare-event surrogate and a tempered target sequence. A defensive exploration mixture improves early-stage coverage, a Rao Blackwellized update adapts the mixture weights, and a Jensen-Shannon repulsion term promotes separation and diversity among the base components. The final failure probability is computed with a deterministic-mixture MIS estimator. Numerical experiments demonstrate that FAMIS accurately approximates quasi-optimal IS densities with fewer training samples and model evaluations, providing stable variance reduction across complex reliability problems.

stat.CO

Scentree: a framework for generating scenario trees for multistage stochastic programming

We present scentree, an open-source Python package for constructing a scenario fan and a scenario tree for multistage stochastic programming from historical data. It combines machine learning and multivariate time series models to obtain a scenario fan that captures inter-stage dependencies in the stochastic processes. This scenario fan is subsequently transformed into a scenario tree suitable for multistage stochastic optimization, providing a flexible and extensible framework for uncertainty modeling. A key contribution is the automation of the complete workflow, including model selection, parameter estimation, scenario fan generation, and scenario tree construction. Scentree does not rely on assumptions about the underlying data distribution, reducing the statistical expertise required to produce a scenario tree. Furthermore, it is agnostic to the specific multistage stochastic problem to be solved.

stat.CO