mlsanityData to 7 Oct 2026

Truthful Generalized Linear Models

arXiv 2209.07815 ↗First posted 16 Sep 2022cs.LG cs.CY cs.GTcited by 1

Not on the map. Why?

Abstract (arXiv)

In this paper we study estimating Generalized Linear Models (GLMs) in the case where the agents (individuals) are strategic or self-interested and they concern about their privacy when reporting data. Compared with the classical setting, here we aim to design mechanisms that can both incentivize most agents to truthfully report their data and preserve the privacy of individuals' reports, while their outputs should also close to the underlying parameter. In the first part of the paper, we consider the case where the covariates are sub-Gaussian and the responses are heavy-tailed where they only have the finite fourth moments. First, motivated by the stationary condition of the maximizer of the likelihood function, we derive a novel private and closed form estimator. Based on the estimator, we propose a mechanism which has the following properties via some appropriate design of the computation and payment scheme for several canonical models such as linear regression, logistic regression and Poisson regression: (1) the mechanism is o(1)-jointly differentially private (with probability at least 1-o(1)); (2) it is an o(frac1n)-approximate Bayes Nash equilibrium for a (1-o(1))-fraction of agents to truthfully report their data, where n is the number of agents; (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). In the second part, we consider the linear regression model under more general setting where both covariates and responses are heavy-tailed and only have finite fourth moments. By using an ℓ4-norm shrinkage operator, we propose a private estimator and payment scheme which have similar properties as in the sub-Gaussian case.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 16 of its 43 references that are in the map. First posted on arXiv 16 Sep 2022.

Builds on

16 of 43 references.

References · 16

  1. 2015Strategic Classificationcited by 256
  2. 2021Differentially Private Stochastic Optimization: New Results in Convex and Non-Convex Settingscited by 45
  3. 2021High Dimensional Differentially Private Stochastic Optimization with Heavy-tailed Datacited by 42
  4. 2013Crowdsourced Judgement Elicitation with Endogenous Proficiencycited by 30
  5. 2014Optimum Statistical Estimation with Strategic Data Sourcescited by 28
  6. 2016Informed Truthfulness in Multi-Task Peer Predictioncited by 24
  7. 2013Private Matchings and Allocationscited by 23
  8. 2016A Shrinkage Principle for Heavy-Tailed Data: High-Dimensional Robust Low-Rank Matrix Recoverycited by 23
  9. 2018Strategyproof Linear Regression in High Dimensionscited by 22
  10. 2022Optimal and Differentially Private Data Acquisition: Central and Local Mechanismscited by 22
  11. 2020The Cost of Privacy in Generalized Linear Models: Algorithms and Minimax Lower Boundscited by 15
  12. 2020Truthful Data Acquisition via Peer Predictioncited by 14
4 more
  1. 2015Truthful Linear Regressioncited by 12
  2. 2018Water from Two Rocks: Maximizing the Mutual Informationcited by 10
  3. 2014Buying Private Data without Verificationcited by 8
  4. 2017Pain-Free Random Differential Privacy with Sensitivity Samplingcited by 7

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.