LGCRMLSep 23, 2022

Differentially private partitioned variational inference

arXiv:2209.11595v22 citationsh-index: 53
Originality Incremental advance
AI Analysis

This work addresses the need for privacy-preserving Bayesian modeling in federated learning, offering a novel solution with differential privacy, though it builds incrementally on existing partitioned variational inference methods.

The paper tackles the problem of learning a privacy-preserving Bayesian model from sensitive data distributed across multiple devices in federated learning, by introducing a framework for differentially private partitioned variational inference that minimizes communication rounds and provides strong privacy guarantees, with empirical results showing competitive performance.

Learning a privacy-preserving model from sensitive data which are distributed across multiple devices is an increasingly important problem. The problem is often formulated in the federated learning context, with the aim of learning a single global model while keeping the data distributed. Moreover, Bayesian learning is a popular approach for modelling, since it naturally supports reliable uncertainty estimates. However, Bayesian learning is generally intractable even with centralised non-private data and so approximation techniques such as variational inference are a necessity. Variational inference has recently been extended to the non-private federated learning setting via the partitioned variational inference algorithm. For privacy protection, the current gold standard is called differential privacy. Differential privacy guarantees privacy in a strong, mathematically clearly defined sense. In this paper, we present differentially private partitioned variational inference, the first general framework for learning a variational approximation to a Bayesian posterior distribution in the federated learning setting while minimising the number of communication rounds and providing differential privacy guarantees for data subjects. We propose three alternative implementations in the general framework, one based on perturbing local optimisation runs done by individual parties, and two based on perturbing updates to the global model (one using a version of federated averaging, the second one adding virtual parties to the protocol), and compare their properties both theoretically and empirically.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes