{"title":"真实和保护隐私的广义线性模型","authors":"Yuan Qiu , Jinyan Liu , Di Wang","doi":"10.1016/j.ic.2024.105225","DOIUrl":null,"url":null,"abstract":"<div><p>This paper explores estimating Generalized Linear Models (GLMs) when agents are strategic and privacy-conscious. We aim to design mechanisms that encourage truthful reporting, protect privacy, and ensure outputs are close to the true parameters. Initially, we address models with sub-Gaussian covariates and heavy-tailed responses with finite fourth moments, proposing a novel private, closed-form estimator. Our mechanism features: (1) <span><math><mi>o</mi><mo>(</mo><mn>1</mn><mo>)</mo></math></span>-joint differential privacy with high probability; (2) <span><math><mi>o</mi><mo>(</mo><mfrac><mrow><mn>1</mn></mrow><mrow><mi>n</mi></mrow></mfrac><mo>)</mo></math></span>-approximate Bayes Nash equilibrium for <span><math><mo>(</mo><mn>1</mn><mo>−</mo><mi>o</mi><mo>(</mo><mn>1</mn><mo>)</mo><mo>)</mo></math></span>-fraction of agents; (3) <span><math><mi>o</mi><mo>(</mo><mn>1</mn><mo>)</mo></math></span> error in parameter estimation; (4) individual rationality for <span><math><mo>(</mo><mn>1</mn><mo>−</mo><mi>o</mi><mo>(</mo><mn>1</mn><mo>)</mo><mo>)</mo></math></span> of agents; (5) <span><math><mi>o</mi><mo>(</mo><mn>1</mn><mo>)</mo></math></span> payment budget. We then extend our approach to linear regression with heavy-tailed data, using an <span><math><msub><mrow><mi>ℓ</mi></mrow><mrow><mn>4</mn></mrow></msub></math></span>-norm shrinkage operator to propose a similar estimator and payment scheme.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"301 ","pages":"Article 105225"},"PeriodicalIF":0.8000,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Truthful and privacy-preserving generalized linear models\",\"authors\":\"Yuan Qiu , Jinyan Liu , Di Wang\",\"doi\":\"10.1016/j.ic.2024.105225\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper explores estimating Generalized Linear Models (GLMs) when agents are strategic and privacy-conscious. We aim to design mechanisms that encourage truthful reporting, protect privacy, and ensure outputs are close to the true parameters. Initially, we address models with sub-Gaussian covariates and heavy-tailed responses with finite fourth moments, proposing a novel private, closed-form estimator. Our mechanism features: (1) <span><math><mi>o</mi><mo>(</mo><mn>1</mn><mo>)</mo></math></span>-joint differential privacy with high probability; (2) <span><math><mi>o</mi><mo>(</mo><mfrac><mrow><mn>1</mn></mrow><mrow><mi>n</mi></mrow></mfrac><mo>)</mo></math></span>-approximate Bayes Nash equilibrium for <span><math><mo>(</mo><mn>1</mn><mo>−</mo><mi>o</mi><mo>(</mo><mn>1</mn><mo>)</mo><mo>)</mo></math></span>-fraction of agents; (3) <span><math><mi>o</mi><mo>(</mo><mn>1</mn><mo>)</mo></math></span> error in parameter estimation; (4) individual rationality for <span><math><mo>(</mo><mn>1</mn><mo>−</mo><mi>o</mi><mo>(</mo><mn>1</mn><mo>)</mo><mo>)</mo></math></span> of agents; (5) <span><math><mi>o</mi><mo>(</mo><mn>1</mn><mo>)</mo></math></span> payment budget. We then extend our approach to linear regression with heavy-tailed data, using an <span><math><msub><mrow><mi>ℓ</mi></mrow><mrow><mn>4</mn></mrow></msub></math></span>-norm shrinkage operator to propose a similar estimator and payment scheme.</p></div>\",\"PeriodicalId\":54985,\"journal\":{\"name\":\"Information and Computation\",\"volume\":\"301 \",\"pages\":\"Article 105225\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2024-09-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information and Computation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0890540124000907\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information and Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0890540124000907","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
Truthful and privacy-preserving generalized linear models
This paper explores estimating Generalized Linear Models (GLMs) when agents are strategic and privacy-conscious. We aim to design mechanisms that encourage truthful reporting, protect privacy, and ensure outputs are close to the true parameters. Initially, we address models with sub-Gaussian covariates and heavy-tailed responses with finite fourth moments, proposing a novel private, closed-form estimator. Our mechanism features: (1) -joint differential privacy with high probability; (2) -approximate Bayes Nash equilibrium for -fraction of agents; (3) error in parameter estimation; (4) individual rationality for of agents; (5) payment budget. We then extend our approach to linear regression with heavy-tailed data, using an -norm shrinkage operator to propose a similar estimator and payment scheme.
期刊介绍:
Information and Computation welcomes original papers in all areas of theoretical computer science and computational applications of information theory. Survey articles of exceptional quality will also be considered. Particularly welcome are papers contributing new results in active theoretical areas such as
-Biological computation and computational biology-
Computational complexity-
Computer theorem-proving-
Concurrency and distributed process theory-
Cryptographic theory-
Data base theory-
Decision problems in logic-
Design and analysis of algorithms-
Discrete optimization and mathematical programming-
Inductive inference and learning theory-
Logic & constraint programming-
Program verification & model checking-
Probabilistic & Quantum computation-
Semantics of programming languages-
Symbolic computation, lambda calculus, and rewriting systems-
Types and typechecking