Table of Contents
Fetching ...

Federated Gaussian Process: Convergence, Automatic Personalization and Multi-fidelity Modeling

Xubo Yue, Raed Al Kontar

TL;DR

FGPR introduces a federated Gaussian process regression framework that blends FedAvg model aggregation with local SGD updates to learn a shared GP prior across clients. The authors prove convergence to a stationary point of the full data log-likelihood under kernels with exponential or polynomial eigendecay, with explicit error terms that reflect per-client batch sizes and communication scheme. A central finding is automatic personalization: predictions on each client are conditioned on both the learned global GP prior and the client’s own data, enabling strong performance even with heterogeneous data. Empirically, FGPR demonstrates privacy-preserving advantages in multi-fidelity modeling and achieves superior or competitive results across simulated and real-world tasks involving multi-fidelity data, NASA turbine degradation, and robotic inverse dynamics. The work provides a theoretical foundation for federated inference with correlated Gaussian processes and opens avenues for privacy-aware Bayesian meta-learning and transfer across devices.

Abstract

In this paper, we propose \texttt{FGPR}: a Federated Gaussian process ($\mathcal{GP}$) regression framework that uses an averaging strategy for model aggregation and stochastic gradient descent for local client computations. Notably, the resulting global model excels in personalization as \texttt{FGPR} jointly learns a global $\mathcal{GP}$ prior across all clients. The predictive posterior then is obtained by exploiting this prior and conditioning on local data which encodes personalized features from a specific client. Theoretically, we show that \texttt{FGPR} converges to a critical point of the full log-likelihood function, subject to statistical error. Through extensive case studies we show that \texttt{FGPR} excels in a wide range of applications and is a promising approach for privacy-preserving multi-fidelity data modeling.

Federated Gaussian Process: Convergence, Automatic Personalization and Multi-fidelity Modeling

TL;DR

FGPR introduces a federated Gaussian process regression framework that blends FedAvg model aggregation with local SGD updates to learn a shared GP prior across clients. The authors prove convergence to a stationary point of the full data log-likelihood under kernels with exponential or polynomial eigendecay, with explicit error terms that reflect per-client batch sizes and communication scheme. A central finding is automatic personalization: predictions on each client are conditioned on both the learned global GP prior and the client’s own data, enabling strong performance even with heterogeneous data. Empirically, FGPR demonstrates privacy-preserving advantages in multi-fidelity modeling and achieves superior or competitive results across simulated and real-world tasks involving multi-fidelity data, NASA turbine degradation, and robotic inverse dynamics. The work provides a theoretical foundation for federated inference with correlated Gaussian processes and opens avenues for privacy-aware Bayesian meta-learning and transfer across devices.

Abstract

In this paper, we propose \texttt{FGPR}: a Federated Gaussian process () regression framework that uses an averaging strategy for model aggregation and stochastic gradient descent for local client computations. Notably, the resulting global model excels in personalization as \texttt{FGPR} jointly learns a global prior across all clients. The predictive posterior then is obtained by exploiting this prior and conditioning on local data which encodes personalized features from a specific client. Theoretically, we show that \texttt{FGPR} converges to a critical point of the full log-likelihood function, subject to statistical error. Through extensive case studies we show that \texttt{FGPR} excels in a wide range of applications and is a promising approach for privacy-preserving multi-fidelity data modeling.
Paper Structure (34 sections, 10 theorems, 122 equations, 9 figures, 3 tables, 2 algorithms)

This paper contains 34 sections, 10 theorems, 122 equations, 9 figures, 3 tables, 2 algorithms.

Key Result

Theorem 1

(RBF kernels, synchronous update) Suppose Assumptions assumption:parameter-assumption:smooth hold. At each communication round, assume $|\mathcal{S}_c|=K$. If $\eta^{(t)}=\mathcal{O}(\frac{1}{t})$ (i.e., a decay learning rate scheduler), then for some constants $\beta_1, C_{\mathop{\mathrm{\bm{\thet and with probability at least Here, constants $\beta_1, C_{\mathop{\mathrm{\bm{\theta}}}\nolimits}

Figures (9)

  • Figure 1: A simple example that is used to demonstrate the automatic personalization feature of FGPR. In the plot, the black dots are original data and the red lines are fitted curves.
  • Figure 2: (Matérn$-3/2$ kernel) Evolution of $\left\lVert\bar{\theta}_2-\theta^*_2\right\rVert_2^2$ over training epochs. The input dimension is 1. In the plot, each color represents an independent run.
  • Figure 3: (RBF kernel) Evolution of $\left\lVert\bar{\theta}-\theta^*\right\rVert_2^2$ over training epochs. In the plot, each color represents an independent run. The input dimension $d$ is different for each run and $d\in\{1,\ldots,10\}$.
  • Figure 4: Histogram of Sample Sizes.
  • Figure 5: (RBF kernel) Evolution of $\left\lVert\bar{\theta}-\theta^*\right\rVert_2^2$ over training epochs using imbalanced data. In the plot, each color represents an independent run. The input dimension $d$ is different for each run and $d\in\{1,\ldots,10\}$.
  • ...and 4 more figures

Theorems & Definitions (30)

  • Remark 1
  • Remark 2
  • Remark 3
  • Remark 4
  • Remark 5
  • Remark 6
  • Remark 7
  • Remark 8
  • Theorem 1
  • Remark 9
  • ...and 20 more