Scalable Vertical Federated Learning via Data Augmentation and Amortized Inference
Not on the map. Why?
Abstract (arXiv)
Vertical federated learning (VFL) has emerged as a paradigm for collaborative model estimation across multiple clients, each holding a distinct set of covariates. This paper introduces the first comprehensive framework for fitting Bayesian models in the VFL setting. We propose a novel approach that leverages data augmentation techniques to transform VFL problems into a form compatible with existing Bayesian federated learning algorithms. We present an innovative model formulation for specific VFL scenarios where the joint likelihood factorizes into a product of client-specific likelihoods. To mitigate the dimensionality challenge posed by data augmentation, which scales with the number of observations and clients, we develop a factorized amortized variational approximation that achieves scalability independent of the number of observations. We showcase the efficacy of our framework through extensive numerical experiments on logistic regression, multilevel regression, and a novel hierarchical Bayesian split neural net model. Our work paves the way for privacy-preserving, decentralized Bayesian inference in vertically partitioned data scenarios, opening up new avenues for research and applications in various domains.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 23 of its 47 references that are in the map. First posted on arXiv 7 May 2024.
Builds on
23 of 47 references.
References · 23
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
- 2019Advances and Open Problems in Federated Learningcited by 3,021
- 2016Variational Inference: A Review for Statisticianscited by 1,466
- 2020SplitFed: When Federated Learning Meets Split Learningcited by 308
- 2020Being Bayesian, Even Just a Bit, Fixes Overconfidence in ReLU Networkscited by 227
- 2019Composable Effects for Flexible and Accelerated Probabilistic Programming in NumPyrocited by 187
- 2017Private federated learning on vertically partitioned data via entity resolution and additively homomorphic encryptioncited by 174
- 2021Epistemic Neural Networkscited by 120
- 2017Sticking the Landing: Simple, Lower-Variance Gradient Estimators for Variational Inferencecited by 97
- 2015Hierarchical Variational Modelscited by 89
11 more
- 2019Split Learning for collaborative deep learning in healthcarecited by 72
- 2022Do Bayesian Neural Networks Need To Be Fully Stochastic?cited by 63
- 2020Differentially Private Secure Multi-Party Computation for Federated Learning in Financial Applicationscited by 58
- 2022Vertical Federated Learning: Challenges, Methodologies and Experimentscited by 55
- 2018Split-and-augmented Gibbs sampler - Application to large-scale inference problemscited by 47
- 2020SplitNN-driven Vertical Partitioningcited by 42
- 2022FedPop: A Bayesian Approach for Personalised Federated Learningcited by 35
- 2022Particle algorithms for maximum likelihood training of latent variable modelscited by 26
- 2019Efficient MCMC Sampling with Dimension-Free Convergence Rate using ADMM-type Splittingcited by 22
- 2019Asymptotically exact data augmentation: models, properties and algorithmscited by 8
- 2024Stochastic Approximation with Biased MCMC for Expectation Maximizationcited by 5
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.