Dimension Agnostic Testing of Survey Data Credibility through the Lens of Regression
Not on the map. Why?
Abstract (arXiv)
Assessing whether a sample survey credibly represents the population is a critical question for ensuring the validity of downstream research. Generally, this problem reduces to estimating the distance between two high-dimensional distributions, which typically requires a number of samples that grows exponentially with the dimension. However, depending on the model used for data analysis, the conclusions drawn from the data may remain consistent across different underlying distributions. In this context, we propose a task-based approach to assess the credibility of sampled surveys. Specifically, we introduce a model-specific distance metric to quantify this notion of credibility. We also design an algorithm to verify the credibility of survey data in the context of regression models. Notably, the sample complexity of our algorithm is independent of the data dimension. This efficiency stems from the fact that the algorithm focuses on verifying the credibility of the survey data rather than reconstructing the underlying regression model. Furthermore, we show that if one attempts to verify credibility by reconstructing the regression model, the sample complexity scales linearly with the dimensionality of the data. We prove the theoretical correctness of our algorithm and numerically demonstrate our algorithm's performance.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 16 of its 48 references that are in the map. First posted on arXiv 28 Aug 2025.
Builds on
16 of 48 references.
References · 16
- 2021Retiring Adult: New Datasets for Fair Machine Learningcited by 449
- 2020Geometric Dataset Distances via Optimal Transportcited by 158
- 2018Convergence and Concentration of Empirical Measures under Wasserstein Distance in Unbounded Functional Spacescited by 41
- 2016Testing Ising Modelscited by 23
- 2016Testing Bayesian Networkscited by 23
- 2023Training Neural Networks is NP-Hard in Fixed Dimensioncited by 23
- 2017Optimal Identity Testing with High Probabilitycited by 19
- 2021The Impact of the U.S. Census Disclosure Avoidance System on Redistricting and Voting Rights Analysiscited by 19
- 2020On the Rademacher Complexity of Linear Hypothesis Setscited by 17
- 2020Efficient Distance Approximation for Structured High-Dimensional Distributions via Learningcited by 14
- 2021The Price of Tolerance in Distribution Testingcited by 14
- 2016Square Hellinger Subadditivity for Bayesian Networks and its Applications to Identity Testingcited by 11
4 more
- 2020Minimax Optimal Estimation of KL Divergence for Continuous Distributionscited by 11
- 2019Lower bounds for testing graphical models: colorings and antiferromagnetic Ising modelscited by 6
- 2020Testing Product Distributions: A Closer Lookcited by 4
- 2020Hardness of Identity Testing for Restricted Boltzmann Machines and Potts modelscited by 3
Built on by
Not cited yet.