ABC: Numerical Data Collection under Local Differential Privacy without Prior Knowledge

• URL: http://arxiv.org/abs/2608.05737v1
• Date: Thu, 06 Aug 2026 08:19:12 GMT
• Title: ABC: Numerical Data Collection under Local Differential Privacy without Prior Knowledge
• Abstract summary: Local Differential Privacy (LDP) provides strong privacy guarantees for collecting numerical data.<n>Existing LDP mechanisms require a predefined data domain, which is often unknown in practice.<n>We propose an adaptive LDP framework that can dynamically estimate the data domain.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Local Differential Privacy (LDP) provides strong privacy guarantees for collecting numerical data. A fundamental challenge, however, is that existing LDP mechanisms require a predefined data domain, which is often unknown in practice. This lack of prior knowledge creates a critical dilemma for the data collector: if the chosen domain is too narrow, values outside the range are clipped, leading to information loss. Conversely, if the domain is too wide, excessive noise is added during the privatization process, which degrades the quality of collected data. This highlights the need for methods that can dynamically estimate the data domain. In this work, we propose an adaptive LDP framework that addresses this problem. In our method, each user sends two pieces of information: their perturbed numerical data, and a privatized signal indicating if their original value was clipped by the current domain. By aggregating these signals, our proposed method, Adaptive Bounding of Clipping regions (ABC) method, iteratively adjusts the domain to fit the underlying data distribution without prior knowledge. Our theoretical analysis shows that the estimated data domain converges to an appropriate range. In the empirical evaluation, the results demonstrate that our framework significantly improves the quality of numerical data collection across various datasets and underlying LDP mechanisms. We also show that the estimated range successfully converges in practice and our approach is robust to its hyperparameters through comprehensive ablation studies.

Related papers

• Classification Under Local Differential Privacy with Model Reversal and Model Averaging [5.178896452202825]
  Local differential privacy (LDP) has become a central topic in data privacy research.<n>We propose novel techniques specifically designed for LDP to improve classification performance without compromising privacy.<n> Empirical results on both simulated and real-world datasets show substantial improvements in classification accuracy.
  arXiv  Detail & Related papers  (2026-02-05T15:52:34Z)
• Dual Utilization of Perturbation for Stream Data Publication under Local Differential Privacy [10.07017446059039]
  Local differential privacy (LDP) has emerged as a promising standard.<n>Applying LDP to stream data presents significant challenges, as stream data often involves a large or even infinite number of values.<n>We introduce the Iterative Perturbation IPP method, which utilizes current perturbed results to calibrate the subsequent perturbation process.<n>We prove that these three algorithms satisfy $w$-event differential privacy while significantly improving utility.
  arXiv  Detail & Related papers  (2025-04-21T09:51:18Z)
• A Dataset for Semantic Segmentation in the Presence of Unknowns [49.795683850385956]
  Existing datasets allow evaluation of only knowns or unknowns - but not both.<n>We propose a novel anomaly segmentation dataset, ISSU, that features a diverse set of anomaly inputs from cluttered real-world environments.<n>The dataset is twice larger than existing anomaly segmentation datasets.
  arXiv  Detail & Related papers  (2025-03-28T10:31:01Z)
• Privacy-Preserving Federated Unsupervised Domain Adaptation for Regression on Small-Scale and High-Dimensional Biological Data [2.699900017799093]
  freda is a privacy-preserving federated method for unsupervised domain adaptation in regression tasks.<n>We evaluate freda on the challenging task of age prediction from DNA methylation data, demonstrating that it achieves performance comparable to the centralized state-of-the-art method.
  arXiv  Detail & Related papers  (2024-11-26T10:19:16Z)
• PeFAD: A Parameter-Efficient Federated Framework for Time Series Anomaly Detection [51.20479454379662]
  We propose a. Federated Anomaly Detection framework named PeFAD with the increasing privacy concerns. We conduct extensive evaluations on four real datasets, where PeFAD outperforms existing state-of-the-art baselines by up to 28.74%.
  arXiv  Detail & Related papers  (2024-06-04T13:51:08Z)
• Trust your Good Friends: Source-free Domain Adaptation by Reciprocal Neighborhood Clustering [50.46892302138662]
  We address the source-free domain adaptation problem, where the source pretrained model is adapted to the target domain in the absence of source data. Our method is based on the observation that target data, which might not align with the source domain classifier, still forms clear clusters. We demonstrate that this local structure can be efficiently captured by considering the local neighbors, the reciprocal neighbors, and the expanded neighborhood.
  arXiv  Detail & Related papers  (2023-09-01T15:31:18Z)
• Deep Unsupervised Domain Adaptation: A Review of Recent Advances and Perspectives [16.68091981866261]
  Unsupervised domain adaptation (UDA) is proposed to counter the performance drop on data in a target domain. UDA has yielded promising results on natural image processing, video analysis, natural language processing, time-series data analysis, medical image analysis, etc.
  arXiv  Detail & Related papers  (2022-08-15T20:05:07Z)
• Source-Free Domain Adaptation via Distribution Estimation [106.48277721860036]
  Domain Adaptation aims to transfer the knowledge learned from a labeled source domain to an unlabeled target domain whose data distributions are different. Recently, Source-Free Domain Adaptation (SFDA) has drawn much attention, which tries to tackle domain adaptation problem without using source data. In this work, we propose a novel framework called SFDA-DE to address SFDA task via source Distribution Estimation.
  arXiv  Detail & Related papers  (2022-04-24T12:22:19Z)
• Instance Level Affinity-Based Transfer for Unsupervised Domain Adaptation [74.71931918541748]
  We propose an instance affinity based criterion for source to target transfer during adaptation, called ILA-DA. We first propose a reliable and efficient method to extract similar and dissimilar samples across source and target, and utilize a multi-sample contrastive loss to drive the domain alignment process. We verify the effectiveness of ILA-DA by observing consistent improvements in accuracy over popular domain adaptation approaches on a variety of benchmark datasets.
  arXiv  Detail & Related papers  (2021-04-03T01:33:14Z)
• Open-Set Hypothesis Transfer with Semantic Consistency [99.83813484934177]
  We introduce a method that focuses on the semantic consistency under transformation of target data. Our model first discovers confident predictions and performs classification with pseudo-labels. As a result, unlabeled data can be classified into discriminative classes coincided with either source classes or unknown classes.
  arXiv  Detail & Related papers  (2020-10-01T10:44:31Z)
• Privacy-Preserving Distributed Learning in the Analog Domain [23.67685616088422]
  We consider the problem of distributed learning over data while keeping it private from the computational servers. We propose a novel algorithm to solve the problem when data is in the analog domain. We show how the proposed framework can be adopted to do computation tasks when data is represented using floating-point numbers.
  arXiv  Detail & Related papers  (2020-07-17T07:56:39Z)
• Continuous Release of Data Streams under both Centralized and Local Differential Privacy [30.998501044718548]
  We study the problem of publishing a stream of real-valued data satisfying differential privacy (DP) One major challenge is that the maximal possible value can be quite large. We develop a method that uses the Exponential Mechanism with a quality function that approximates well the utility goal.
  arXiv  Detail & Related papers  (2020-05-24T14:25:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.