mlsanityData to 7 Oct 2026

Testing Credibility of Public and Private Surveys through the Lens of Regression

arXiv 2410.05458 ↗First posted 7 Oct 2024cs.LG cs.CR stat.MEcited by 0

Not on the map. Why?

Abstract (arXiv)

Testing whether a sample survey is a credible representation of the population is an important question to ensure the validity of any downstream research. While this problem, in general, does not have an efficient solution, one might take a task-based approach and aim to understand whether a certain data analysis tool, like linear regression, would yield similar answers both on the population and the sample survey. In this paper, we design an algorithm to test the credibility of a sample survey in terms of linear regression. In other words, we design an algorithm that can certify if a sample survey is good enough to guarantee the correctness of data analysis done using linear regression tools. Nowadays, one is naturally concerned about data privacy in surveys. Thus, we further test the credibility of surveys published in a differentially private manner. Specifically, we focus on Local Differential Privacy (LDP), which is a standard technique to ensure privacy in surveys where the survey participants might not trust the aggregator. We extend our algorithm to work even when the data analysis has been done using surveys with LDP. In the process, we also propose an algorithm that learns with high probability the guarantees a linear regression model on a survey published with LDP. Our algorithm also serves as a mechanism to learn linear regression models from data corrupted with noise coming from any subexponential distribution. We prove that it achieves the optimal estimation error bound for ℓ1 linear regression, which might be of broader interest. We prove the theoretical correctness of our algorithms while trying to reduce the sample complexity for both public and private surveys. We also numerically demonstrate the performance of our algorithms on real and synthetic datasets.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 17 of its 68 references that are in the map. First posted on arXiv 7 Oct 2024.

Builds on

17 of 68 references.

References · 17

  1. 2021Retiring Adult: New Datasets for Fair Machine Learningcited by 443
  2. 2014RAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Responsecited by 262
  3. 2017Collecting Telemetry Data Privatelycited by 147
  4. 2017Privacy Loss in Apple's Implementation of Differential Privacy on MacOS 10.12cited by 42
  5. 2020Local Differential Privacy and Its Applications: A Comprehensive Surveycited by 40
  6. 2013Optimal Algorithms for Testing Closeness of Discrete Distributionscited by 37
  7. 2020Differentially Private Simple Linear Regressioncited by 33
  8. 2023Score Attack: A Lower Bound Technique for Optimal Differentially Private Learningcited by 21
  9. 2022Easy Differentially Private Linear Regressioncited by 19
  10. 2021The Impact of the U.S. Census Disclosure Avoidance System on Redistricting and Voting Rights Analysiscited by 18
  11. 2020On the Rademacher Complexity of Linear Hypothesis Setscited by 17
  12. 2020Sharp Concentration Results for Heavy-Tailed Distributionscited by 15
5 more
  1. 2020Optimal Testing of Discrete Distributions with High Probabilitycited by 15
  2. 2017Which Distribution Distances are Sublinearly Testable?cited by 14
  3. 2019Random Restrictions of High-Dimensional Distributions and Uniformity Testing with Subcube Conditioningcited by 13
  4. 2023Marich: A Query-efficient Distributionally Equivalent Model Extraction Attack using Public Datacited by 11
  5. 2021Stochastic Online Linear Regression: the Forward Algorithm to Replace Ridgecited by 10

Built on by

Not cited yet.