Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

97195292389 · Jun 202019922001200920172026
48 results for Bayesian Federated Inference

Paper improves Bayesian inference in federated learning with new algorithm VR-FALD*.

problem Bayesian inference in federated learning with communication bottlenecks and statistical heterogeneity.
method Federated Averaging Langevin Dynamics (FALD) and VR-FALD*.
result VR-FALD* corrects client drift due to statistical heterogeneity, improving convergence.

Federated learning for Bayesian clustering of large datasets.

problem Bayesian model-based clustering of large-scale binary and categorical data.
method Federated variational inference with local merge and delete moves in parallel batches, followed by global merge moves.
result Empirical validation shows superior performance compared to existing algorithms.

This paper develops efficient federated learning and unlearning methods in Bayesian models.

problem Managing epistemic uncertainty and legal right to be forgotten in decentralized networks.
method Develops federated variational inference solutions based on decentralized local free energy minimization.
result Demonstrates efficient unlearning mechanisms in federated learning and unlearning.

A new method for privacy-preserving Bayesian learning in federated learning.

problem Privacy-preserving learning of models from distributed sensitive data.
method Differentially private partitioned variational inference (DPVI) for federated learning.
result First general framework for federated Bayesian learning with differential privacy.

Bayesian Federated Inference improves statistical model estimation from multicenter data.

problem Combining data from different medical centers is challenging due to regulatory and logistic issues.
method Bayesian Federated Inference (BFI) framework for multicenter data.
result BFI framework infers additional features of the posterior parameter distribution, capturing more information than Federated Learning.

A new algorithm improves Bayesian federated learning by reducing communication overhead.

problem Bayesian federated learning constraints, including privacy, data ownership, and communication overhead.
method Proposes Quantised Langevin Stochastic Dynamics (QLSD) for Bayesian federated learning, using gradient compression and variance reduction techniques.
result Non-asymptotic and asymptotic convergence guarantees for QLSD and its improved versions.

DPMM-CFL clusters clients for federated learning without fixed K, improving performance.

problem Improving federated learning performance under non-IID client heterogeneity.
method DPMM-CFL uses a Dirichlet Process Mixture Model to infer both cluster number and client assignments.
result DPMM-CFL optimizes per-cluster federated objectives and jointly infers cluster number and assignments.

Paper tackles scalable VFL with data augmentation and amortized inference.

problem Collaborative model estimation across multiple clients with distinct covariates.
method Data augmentation, amortized variational approximation, factorized likelihoods.
result Scalable Bayesian VFL framework for various models.

DSVGD improves federated learning with fewer communication rounds.

problem Federated learning scalability and trustworthiness.
method Distributed Stein Variational Gradient Descent (DSVGD) for non-parametric Bayesian inference.
result DSVGD achieves comparable accuracy and scalability to other methods, with well-calibrated predictions.

Proposes a Bayesian federated learning method for diverse tasks.

problem Current federated learning approaches focus on homogeneous tasks, ignoring task diversity.
method Integrates multi-task learning with MOGP at the local level and federated learning at the global level.
result Demonstrates superior predictive performance and uncertainty calibration on diverse tasks.

In many real-world applications of machine learning, data are distributed across many clients and cannot leave the devices they are stored on. Furthermore, each client's data, computational resources and communication constraints may be very different. This setting is known as federated learning, in which privacy is a …

2019-11-24abs ↗pdf ↗

FedBE aggregates local models into a robust global model via Bayesian inference.

problem Challenges in aggregating non-i.i.d. local models into a global model in federated learning.
method FedBE uses Bayesian inference to sample and combine higher-quality global models from local models.
result FedBE leads to more robust aggregation of local models into a global model, especially when data is non-i.i.d.

Bayesian Federated Inference combines local data analyses to estimate regression models.

problem Estimating accurate parameters with limited data from different centers.
method Bayesian Federated Inference (BFI) for pooling local data analyses.
result Excellent performance of BFI methodology shown in real-life examples.

Bayesian Federated Inference improves survival model analysis without merging data.

problem Accurately estimating survival model parameters requires sufficient data and events, which is often lacking in practice.
method Bayesian Federated Inference (BFI) for survival models, where local centers perform analyses and combine results.
result Results from BFI are similar to those from merged data analyses, demonstrating excellent performance.

Bayesian method improves Federated Learning robustness against corrupted updates.

problem Adversarial attacks on Federated Learning models with unknown number of compromised clients.
method Adaptive Bayesian aggregation based on likelihood of clients being honest.
result Consistently achieves state-of-the-art performance across various attack types.

Bayesian approach reduces FL communication cost by one-shot.

problem High communication cost in optimization-based FL for high-dimensional models.
method Bayesian pseudocoresets and function-space inference for one-shot FL.
result Achieves prediction performance competitive to state-of-the-art with up to 2 orders of magnitude reduction in communication cost.

FedLog reduces communication in federated learning by sharing data summaries.

problem Significant communication overhead in federated learning with large model parameters.
method Shares minimal sufficient statistics via Bayesian inference and differential privacy.
result High learning accuracy with low communication overhead.

In federated learning problems, data is scattered across different servers and exchanging or pooling it is often impractical or prohibited. We develop a Bayesian nonparametric framework for federated learning with neural networks. Each data server is assumed to provide local neural network weights, which are modeled th…

2019-05-28abs ↗pdf ↗

Improved Bayesian FL method calibrates predictions for federated learning.

problem Overconfident predictions in Bayesian FL methods for federated learning.
method β-Predictive Bayes algorithm interpolates between mixture and product of local predictive posteriors, tuning parameter β for better calibration.
result Demonstrated superior calibration compared to other baselines, even with increased data heterogeneity.

FedGVI improves FL robustness to model misspecification.

problem Limited robustness in FL approaches to model misspecification.
method Probabilistic Federated Learning framework that generalizes previous methods.
result FedGVI provides robust and calibrated predictions under model misspecification.

This work analyzes aggregation strategies for Bayesian deep learning models in federated learning.

problem Improper aggregation of Bayesian deep learning models in federated learning leads to sub-optimal performance.
method Six aggregation strategies for Bayesian deep learning models are analyzed using CIFAR-10 dataset and a fully variational ResNet-20 architecture.
result Aggregation strategy is a key hyperparameter affecting accuracy, calibration, uncertainty quantification, training stability, and client compute requirements.

A novel hierarchical Bayesian approach to Federated Learning reduces data exposure and improves convergence rates.

problem Data privacy and convergence in Federated Learning.
method Hierarchical Bayesian modeling and block-coordinate descent optimization.
result The proposed algorithm converges to an optimal solution with a rate of O(1/t)O(1/\sqrt{t}) and guarantees vanishing generalization error.

In federated learning, a central server coordinates the training of a single model on a massively distributed network of devices. This setting can be naturally extended to a multi-task learning framework, to handle real-world federated datasets that typically show strong statistical heterogeneity among devices. Despite…

2019-06-14abs ↗pdf ↗

One-round FL method improves robustness and reduces communication rounds.

problem Making predictions robust and reducing FL communication rounds in heterogeneous data.
method Bayesian predictive space aggregation of client posteriors in one round.
result One-round FL method outperforms other techniques on heterogeneous settings.

New perspective on federated learning as posterior inference, improving optimization.

problem Optimizing global models in distributed learning settings.
method Formulated as posterior inference problem, using MCMC for approximate inference and federated averaging for refinement.
result Federated posterior averaging (FedPA) outperforms existing methods on benchmarks.

FA-HMC improves Bayesian federated learning with rigorous guarantees.

problem Parameter estimation and uncertainty quantification in non-iid distributed data.
method Federated Averaging stochastic Hamiltonian Monte Carlo (FA-HMC) with convergence guarantees.
result FA-HMC achieves better convergence and communication efficiency than existing methods.

Bayesian Federated Learning improves model reliability in dynamic environments.

problem Uncertainty quantification and robust adaptation in distributed learning.
method Proposes a continual BFL framework using SGLD for sequential updates and continual learning challenges.
result Continual Bayesian updates preserve knowledge and adapt to evolving data.

Proposes FedPop for personalised federated learning with uncertainty quantification.

problem Uncertainty quantification and client drift in personalised federated learning.
method FedPop recasts FL into population modeling with Markov chain Monte Carlo methods.
result Non-asymptotic convergence guarantees for uncertainty quantification.

We consider the problem of reinforcing federated learning with formal privacy guarantees. We propose to employ Bayesian differential privacy, a relaxation of differential privacy for similarly distributed data, to provide sharper privacy loss bounds. We adapt the Bayesian privacy accounting method to the federated sett…

2019-11-22abs ↗pdf ↗

Unified Bayesian framework for clustered federated learning improves model performance.

problem Handling non-IID client data in federated learning.
method A unified Bayesian framework for clustered federated learning that associates clients to clusters and proposes practical algorithms for data associations.
result The proposed framework increases model performance by circumventing the need for unique client-cluster associations.

Federated learning for Bayesian network structure learning across distributed data.

problem Learning Bayesian network structure from horizontally partitioned data across different parties.
method Distributed structure learning using continuous optimization (ADMM).
result Improved performance compared to other methods, especially with many clients and limited data.

FSL-BDP models time-to-default without centralizing data, improving privacy mechanisms in federated settings.

problem Traditional credit risk models ignore default timing and violate data-protection rules.
method Federated Survival Learning with Bayesian Differential Privacy (FSL-BDP).
result FSL-BDP improves privacy mechanisms in federated settings, outperforming classical DP in most clients.

We address challenges in collaborative black-box optimization through three frameworks.

problem Challenges in distributed experimentation, heterogeneity, and privacy in black-box optimization.
method Three unifying frameworks: global, local, and predictive.
result Shift from descriptive/predictive to prescriptive federated learning in black-box optimization.

A novel method for learning Bayesian network structures from decentralized data, balancing privacy and efficiency.

problem Privacy and communication costs in learning Bayesian network structures from decentralized data.
method Fed-Sparse-BNSL, combining differential privacy with greedy updates targeting only a few relevant edges per participant.
result Achieves utility close to non-private baselines while offering stronger privacy and communication efficiency.

Paper explores differential privacy in high-dimensional federated learning, tackling server trustworthiness and estimation.

problem Maintaining privacy in distributed environments with high-dimensional data.
method Investigates scenarios with untrusted and trusted central servers, introduces novel federated estimation algorithms for linear regression models.
result Tight minimax rates depend on high-dimensionality even with sparsity assumptions, and novel algorithms handle slight variations among distributed models.

PVI combines federated learning and variational inference for probabilistic model training.

problem Federated learning's lack of probabilistic model uncertainty estimation.
method Partitioned variational inference (PVI) framework for federated probabilistic model training.
result PVI unifies fragmented literature and demonstrates effectiveness in various federated settings.