Differentially Private Domain Adaptation with Theoretical Guarantees

Raef Bassily, Corinna Cortes, Anqi Mao, Mehryar Mohri

TL;DR

This paper introduces the first differentially private algorithms for supervised domain adaptation with formal theoretical guarantees. By using a clever reparameterization trick, the authors transform a complex reweighting problem into a form that allows for high-accuracy learning while strictly protecting the privacy of sensitive target-domain data.

What Problem Does This Paper Address?

Machine learning models often struggle when the data they were trained on (the source domain) differs from the data they encounter in the real world (the target domain). Domain Adaptation (DA) aims to fix this by leveraging source data to improve performance on the target.

However, in many high-stakes fields like healthcare or finance, the target-domain data is highly sensitive. While you might have a massive public dataset (the source), the small amount of labeled data you have from your specific "target" population must remain private.

The challenge is: How do you use public data to help learn from private data without "leaking" the private information? Previous work either ignored privacy, focused only on unsupervised settings (no target labels), or lacked the rigorous theoretical "proof" that the algorithm would actually converge to an optimal solution under privacy constraints.

Methods

The authors build on a recent optimization framework that uses sample reweighting. Essentially, the algorithm decides which source examples are most "relevant" to the target and gives them more weight.

To make this work with Differential Privacy (DP), they tackle two major hurdles:

  1. Non-Convexity: The original optimization problem wasn't "jointly convex," making it hard to solve reliably.
  2. Sensitivity: DP requires adding noise to gradients. If a single data point can wildly change the gradient (high sensitivity), you have to add so much noise that the model becomes useless.

The "Secret Sauce": Reparameterization The authors introduced a novel change of variables. Instead of optimizing the weights ($q$) directly, they optimize the inverse ($u = 1/q$). This mathematical "flip" does two things:

  • It makes the regression version of the problem jointly convex, ensuring we can find the global optimum.
  • It significantly lowers the sensitivity of the gradients, allowing the algorithm to add much less noise while maintaining the same privacy level.

They present two algorithms:

  • CnvxAdap: For linear regression (convex).
  • NCnvxAdap: For more general, non-convex losses (like neural networks), using a "smooth" approximation of the objective function to keep gradients stable.

Datasets

The researchers evaluated their approach across a wide variety of tasks:

  • Regression: Five UCI datasets including Wind (speed prediction), Airline (flight delays), Gas (sensor concentrations), News (article popularity), and Slice (CT scan locations).
  • Classification: Standard benchmarks like Adult (census income), German (credit status), and Accent (speech recognition).
  • Computer Vision: They adapted CIFAR-10, CIFAR-100, SVHN, and ImageNet into domain adaptation tasks by creating distinct sampling distributions for source and target sets.

Key Insights and Ideas

  • Public Data as a "Prior": The public source data acts as a stabilizer. Even when privacy noise is added to the target data gradients, the clean signal from the public data helps guide the model in the right direction.
  • Theoretical Optimality: The authors proved that their convex algorithm achieves an error rate of $O(\frac{\sqrt{d \log(1/\delta)}}{n\epsilon})$. In plain English: this is theoretically the best you can do for private convex optimization. They didn't just make a private algorithm; they made an optimal one.
  • Private Discrepancy Estimation: Before training, the model needs to know how "different" the domains are. The authors show you can estimate this "discrepancy" privately using a Laplace mechanism before the main training loop even starts.

Key Results

  • Matching the State-of-the-Art: In non-private tests, their algorithms matched or beat "SBest," the current gold standard for supervised domain adaptation.
  • The Privacy "Price": As the privacy budget ($\epsilon$) or the target sample size ($n$) increases, the private model's performance rapidly approaches the non-private version.
  • Practical Utility: For a target sample size of $n=10,000$ and a reasonable privacy budget ($\epsilon=10$), the performance gap between the private and non-private models becomes negligible.
Performance of private adaptation algorithms across different datasets and privacy budgets.
  • Better than "Target-Only": The algorithms consistently outperformed models trained only on private target data, proving that the public source data provides a significant boost even through the "fog" of DP noise.

Limitations and Future Work

  • Shared Feature Space: Currently, the math assumes the source and target data share the same features (e.g., both are the same set of sensor readings).
  • Future Extension - Mapping: The authors suggest that if the features are different (e.g., translating between two different languages), a mapping function $\Psi$ could be learned simultaneously, though this adds complexity to the privacy proofs.
  • Hyperparameter Tuning: Like most DP research, tuning the "knobs" (learning rate, regularization) is tricky because the tuning process itself can consume the privacy budget. The authors suggest using "local sensitivity analysis" as a potential future fix for this.

Summary updated

Abstract

In many applications, the labeled data at the learner's disposal is subject to privacy constraints and is relatively limited. To derive a more accurate predictor for the target domain, it is often beneficial to leverage publicly available labeled data from an alternative domain, somewhat close to the target domain. This is the modern problem of supervised domain adaptation from a public source to a private target domain. We present two $(\epsilon, \delta)$-differentially private adaptation algorithms for supervised adaptation, for which we make use of a general optimization problem, recently shown to benefit from favorable theoretical learning guarantees. Our first algorithm is designed for regression with linear predictors and shown to solve a convex optimization problem. Our second algorithm is a more general solution for loss functions that may be non-convex but Lipschitz and smooth. While our main objective is a theoretical analysis, we also report the results of several experiments. We first show that the non-private versions of our algorithms match state-of-the-art performance in supervised adaptation and that for larger values of the target sample size or $\epsilon$, the performance of our private algorithms remains close to that of their non-private counterparts.
BibTeX
@inproceedings{bassily2024differentially,
  author = {Raef Bassily and Corinna Cortes and Anqi Mao and Mehryar Mohri},
  title = {{Differentially Private Domain Adaptation with Theoretical Guarantees}},
  booktitle = {International Conference on Machine Learning},
  year = {2024},
  url = {https://openreview.net/forum?id=kkqIEp2bRa},
}
Figure