[edit]
Revisiting differentially private linear regression: optimal and adaptive prediction & estimation in unbounded domain
Proceedings of the 34th Conference on Uncertainty in Artificial Intelligence, PMLR R16:92-102, 2018.
Abstract
We revisit the problem of linear regression un- der a differential privacy constraint. By con- solidating existing pieces in the literature, we clarify the correct dependence of the feature, la- bel and coefficient domains in the optimization error and estimation error, hence revealing the delicate price of differential privacy in statis- tical estimation and statistical learning. More- over, we propose simple modifications of two existing DP algorithms: (a) posterior sampling, (b) sufficient statistics perturbation, and show that they can be upgraded into adaptive algo- rithms that are able to exploit data-dependent quantities and behave nearly optimally for every instance. Extensive experiments are conducted on both simulated data and real data, which conclude that both ADAOPS and ADASSP out- perform the existing techniques on nearly all 36 data sets that we test on.