TY - JOUR
T1 - Truthful High Dimensional Sparse Linear Regression
AU - Zhu, Liyang
AU - Manseur, Amina
AU - Ding, Meng
AU - Liu, Jinyan
AU - Xu, Jinhui
AU - Wang, Di
N1 - Publisher Copyright:
© 2024 Neural information processing systems foundation. All rights reserved.
PY - 2024
Y1 - 2024
N2 - We study the problem of fitting the high dimensional sparse linear regression model with sub-Gaussian covariates and responses, where the data are provided by strategic or self-interested agents (individuals) who prioritize their privacy of data disclosure. In contrast to the classical setting, our focus is on designing mechanisms that can effectively incentivize most agents to truthfully report their data while preserving the privacy of individual reports. Simultaneously, we seek an estimator which should be close to the underlying parameter. We attempt to solve the problem by deriving a novel private estimator that has a closed-form expression. Based on the estimator, we propose a mechanism which has the following properties via some appropriate design of the computation and payment scheme: (1) the mechanism is (o(1), O(n−Ω(1)))-jointly differentially private, where n is the number of agents; (2) it is an o(1/n)-approximate Bayes Nash equilibrium for a (1 − o(1))-fraction of agents to truthfully report their data; (3) the output could achieve an error of o(1) to the underlying parameter; (4) it is individually rational for a (1 − o(1)) fraction of agents in the mechanism; (5) the payment budget required from the analyst to run the mechanism is o(1). To the best of our knowledge, this is the first study on designing truthful (and privacy-preserving) mechanisms for high dimensional sparse linear regression.
AB - We study the problem of fitting the high dimensional sparse linear regression model with sub-Gaussian covariates and responses, where the data are provided by strategic or self-interested agents (individuals) who prioritize their privacy of data disclosure. In contrast to the classical setting, our focus is on designing mechanisms that can effectively incentivize most agents to truthfully report their data while preserving the privacy of individual reports. Simultaneously, we seek an estimator which should be close to the underlying parameter. We attempt to solve the problem by deriving a novel private estimator that has a closed-form expression. Based on the estimator, we propose a mechanism which has the following properties via some appropriate design of the computation and payment scheme: (1) the mechanism is (o(1), O(n−Ω(1)))-jointly differentially private, where n is the number of agents; (2) it is an o(1/n)-approximate Bayes Nash equilibrium for a (1 − o(1))-fraction of agents to truthfully report their data; (3) the output could achieve an error of o(1) to the underlying parameter; (4) it is individually rational for a (1 − o(1)) fraction of agents in the mechanism; (5) the payment budget required from the analyst to run the mechanism is o(1). To the best of our knowledge, this is the first study on designing truthful (and privacy-preserving) mechanisms for high dimensional sparse linear regression.
UR - http://www.scopus.com/inward/record.url?scp=105000501129&partnerID=8YFLogxK
M3 - Conference article
AN - SCOPUS:105000501129
SN - 1049-5258
VL - 37
JO - Advances in Neural Information Processing Systems
JF - Advances in Neural Information Processing Systems
T2 - 38th Conference on Neural Information Processing Systems, NeurIPS 2024
Y2 - 9 December 2024 through 15 December 2024
ER -