Under clientwise sample-level zCDP, the Fisher information of any fully interactive public federated transcript contracts to a sum of per-client privacy-vs-sample terms, yielding matching minimax rates for mean, linear, and nonparametric regression.
Federated Transfer Learning with Differential Privacy
2 Pith papers cite this work. Polarity classification is still indexing.
abstract
Federated learning has emerged as a powerful framework for analysing distributed data, yet two challenges remain pivotal: heterogeneity across sites and privacy of local data. In this paper, we address both challenges within a federated transfer learning framework, aiming to enhance learning on a target data set by leveraging information from multiple heterogeneous source data sets while adhering to privacy constraints. We rigorously formulate the notion of federated differential privacy, which offers privacy guarantees for each data set without assuming a trusted central server. Under this privacy model, we study four statistical problems: univariate mean estimation, low-dimensional linear regression, high-dimensional linear regression, and M-estimation. By investigating the minimax rates and quantifying the cost of privacy, we show that federated differential privacy is an intermediate privacy model between the well-established local and central models of differential privacy. Our analyses account for data heterogeneity and privacy, highlighting the fundamental costs associated with each factor and the benefits of knowledge transfer in federated learning.
years
2026 2representative citing papers
Trans-GLMC recovers latent source clusters via coefficient distances and applies global fusion, within-cluster refinement, and target debiasing, with a non-asymptotic error bound that improves when clusters exist.
citing papers explorer
-
A Van Trees Lower Bound for Fully Interactive Differentially Private Federated Learning
Under clientwise sample-level zCDP, the Fisher information of any fully interactive public federated transcript contracts to a sum of per-client privacy-vs-sample terms, yielding matching minimax rates for mean, linear, and nonparametric regression.
-
Harnessing Source Heterogeneity for Cluster-Structured Transfer Learning
Trans-GLMC recovers latent source clusters via coefficient distances and applies global fusion, within-cluster refinement, and target debiasing, with a non-asymptotic error bound that improves when clusters exist.