Kernel Density Estimation for Joint Scrambling in Sensitive Surveys

Randomized response models aim to protect respondent privacy when sampling sensitive variables but consequently compromise estimator efficiency. We propose a new sampling method, titled joint scrambling, which preserves all true responses while protecting privacy by asking each respondent to jointly speak both their true response and multiple random responses in an arbitrary order. We give a kernel density estimator for the density function with asymptotically equivalent mean squared error for the optimal bandwidth yet greater generality than existing techniques for randomized response models. We also give consistent, unbiased estimators for a general class of estimands including the mean. For the cumulative distribution function, this estimator is more computationally efficient with asymptotically lower mean squared error than existing approaches. All results are verified via simulation and evaluated with respect to natural generalizations of existing privacy notions.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2025-06-30
DOI
https://doi.org/10.3390/math13132134
Primary Topic
Survey Sampling and Estimation Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Kernel Density Estimation for Joint Scrambling in Sensitive Surveys

Alvan Caleb Arulandu, Sat Gupta
Mathematics
Survey Sampling and Estimation Techniques
article

Kernel Density Estimation for Joint Scrambling in Sensitive Surveys

Alvan Caleb Arulandu, Sat Gupta
article en

Abstract

Randomized response models aim to protect respondent privacy when sampling sensitive variables but consequently compromise estimator efficiency. We propose a new sampling method, titled joint scrambling, which preserves all true responses while protecting privacy by asking each respondent to jointly speak both their true response and multiple random responses in an arbitrary order. We give a kernel density estimator for the density function with asymptotically equivalent mean squared error for the optimal bandwidth yet greater generality than existing techniques for randomized response models. We also give consistent, unbiased estimators for a general class of estimands including the mean. For the cumulative distribution function, this estimator is more computationally efficient with asymptotically lower mean squared error than existing approaches. All results are verified via simulation and evaluated with respect to natural generalizations of existing privacy notions.

MathematicsVol. 13(13)
Harvard University (US), University of North Carolina at Greensboro (US)
National Science Foundation
Openalex Percentile: Top 85%
Survey Sampling and Estimation Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.