Truthful High Dimensional Sparse Linear Regression
Liyang Zhu, Amina Manseur, Meng Ding, Jinyan Liu, Jinhui Xu, Di Wang
Abstract
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 -jointly differentially private, where is the number of agents; (2) it is an -approximate Bayes Nash equilibrium for a -fraction of agents to truthfully report their data; (3) the output could achieve an error of to the underlying parameter; (4) it is individually rational for a fraction of agents in the mechanism; (5) the payment budget required from the analyst to run the mechanism is . To the best of our knowledge, this is the first study on designing truthful (and privacy-preserving) mechanisms for high dimensional sparse linear regression.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 7f93f3f8-d437-4489-bc53-d308678cc92aCited by top-tier papers1
Ask how each one uses itBuilds on6
- Is Interaction Necessary for Distributed Private Learning?Adam D. Smith, Abhradeep Thakurta, Jalaj UpadhyayS&P 2017 · 159 citations
- Differentially Private Stochastic Optimization: New Results in Convex and Non-Convex SettingsRaef Bassily, Cristóbal Guzmán, Michael MenartNeurIPS 2021 · 68 citations
- Truthful Data Acquisition via Peer PredictionYiling Chen, Yiheng Shen, Shuran ZhengNeurIPS 2020 · 35 citations
- Bridging Central and Local Differential Privacy in Data Acquisition MechanismsAlireza Fallah, Ali Makhdoumi, Azarakhsh Malekian, Asuman E. OzdaglarNeurIPS 2022 · 13 citations
- Improved Analysis of Sparse Linear Regression in Local Differential Privacy ModelLiyang Zhu, Meng Ding, Vaneet Aggarwal, Jinhui Xu et al.ICLR 2024 · 5 citations
Related papers
- Mechanism Design for Collaborative Normal Mean EstimationYiding Chen, Jerry Zhu, Kirthevasan KandasamyNeurIPS 2023 · 15 citations
- Information Elicitation Mechanisms for Statistical EstimationYuqing Kong, Grant Schoenebeck, Biaoshuai Tao, Fang-Yi YuAAAI 2020 · 22 citations
- Better Locally Private Sparse Estimation Given Multiple Samples Per UserYuheng Ma, Ke Jia, Hanfang YangICML 2024 · 2 citations
- A Knowledge Transfer Framework for Differentially Private Sparse LearningLingxiao Wang, Quanquan GuAAAI 2020 · 15 citations
- Easy Differentially Private Linear RegressionKareem Amin, Matthew Joseph, Mónica Ribero, Sergei VassilvitskiiICLR 2023 · 3 citations
