TY - GEN
T1 - Online Mechanism Design for Differentially Private Data Acquisition
AU - Anjarlekar, Ameya
AU - Etesami, Rasoul
AU - Srikant, R.
N1 - The work done in this paper was supported by NSF Grants CCF 22-07547, CCF 1934986, CNS 21-06801, CAREER Award EPCN-1944403, AFOSR Grant FA9550-23-1-0107 and ONR Grant N00014-19-12566.
PY - 2024
Y1 - 2024
N2 - We address a problem involving a buyer seeking to train a logistic regression model by acquiring data from privacy-sensitive sellers. Along with compensating the sellers for their data, the buyer provides differential privacy guarantees to them where the payments depend on the privacy guarantees. In addition, each seller has a different privacy sensitivity associated with their data, which is the cost per unit of loss of privacy. The buyer transacts sequentially with the sellers, wherein the seller will disclose their privacy sensitivity, and the buyer immediately provides a payment and guarantees differential privacy. After receiving the payment, the seller provides their data to the buyer. The buyer's goal is to optimize a weighted combination of test loss and payments, i.e., achieve a tradeoff between getting a good ML model and limiting its payments. Additionally, the buyer must design the payments and differential privacy guarantees in an online fashion. Further, the online problem is historydependent, which adds to the challenge. Consequently, we design a payment mechanism that ensures incentive compatibility and individual rationality and is asymptotically optimal. Additionally, we also provide experimental results to validate our findings.
AB - We address a problem involving a buyer seeking to train a logistic regression model by acquiring data from privacy-sensitive sellers. Along with compensating the sellers for their data, the buyer provides differential privacy guarantees to them where the payments depend on the privacy guarantees. In addition, each seller has a different privacy sensitivity associated with their data, which is the cost per unit of loss of privacy. The buyer transacts sequentially with the sellers, wherein the seller will disclose their privacy sensitivity, and the buyer immediately provides a payment and guarantees differential privacy. After receiving the payment, the seller provides their data to the buyer. The buyer's goal is to optimize a weighted combination of test loss and payments, i.e., achieve a tradeoff between getting a good ML model and limiting its payments. Additionally, the buyer must design the payments and differential privacy guarantees in an online fashion. Further, the online problem is historydependent, which adds to the challenge. Consequently, we design a payment mechanism that ensures incentive compatibility and individual rationality and is asymptotically optimal. Additionally, we also provide experimental results to validate our findings.
KW - Game theory
KW - data market
KW - differential privacy
KW - logistic regression
KW - mechanism design
KW - online learning
UR - https://www.scopus.com/pages/publications/86000626683
UR - https://www.scopus.com/pages/publications/86000626683#tab=citedBy
U2 - 10.1109/CDC56724.2024.10886292
DO - 10.1109/CDC56724.2024.10886292
M3 - Conference contribution
AN - SCOPUS:86000626683
T3 - Proceedings of the IEEE Conference on Decision and Control
SP - 4500
EP - 4505
BT - 2024 IEEE 63rd Conference on Decision and Control, CDC 2024
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 63rd IEEE Conference on Decision and Control, CDC 2024
Y2 - 16 December 2024 through 19 December 2024
ER -