Regression with Label Differential Privacy
About
We study the task of training regression models with the guarantee of label differential privacy (DP). Based on a global prior distribution on label values, which could be obtained privately, we derive a label DP randomization mechanism that is optimal under a given regression loss function. We prove that the optimal mechanism takes the form of a "randomized response on bins", and propose an efficient algorithm for finding the optimal bin values. We carry out a thorough experimental evaluation on several datasets demonstrating the efficacy of our algorithm.
Badih Ghazi, Pritish Kamath, Ravi Kumar, Ethan Leeman, Pasin Manurangsi, Avinash V Varadarajan, Chiyuan Zhang• 2022
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Sponsored Search Conversion | Criteo Sponsored Search Conversion (val) | Validation MSE4.77e+3 | 32 | |
| Linear regression | energy (val) | MSE7.335 | 22 | |
| Linear regression | Boston housing (val) | MSE1.3492 | 21 | |
| Linear regression | CA housing (val) | MSE0.65 | 20 | |
| Linear regression | wine (val) | MSE0.6324 | 19 | |
| Regression | supercond (val) | MSE0.0065 | 17 | |
| Regression | wave (val) | MSE0.0025 | 17 | |
| Regression | TomsHardware (val) | MSE0.3229 | 17 |
Showing 8 of 8 rows